Effective computation of optimal stability polynomials

被引:3
作者
Bogatyrëv, A [1 ]
机构
[1] Russian Acad Sci, Moscow, Russia
关键词
D O I
10.1007/s10092-004-0091-8
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The construction of stable explicit multistage Runge-Kutta methods in 1950-1960 stumbled over a certain extremal problem for polynomials. The solution to this problem is known as the optimal stability polynomial and its computation is notoriously difficult. We propose a new method for the effective evaluation of optimal stability polynomials which is based on the explicit analytical representation of the solution. The main feature of the method is its independence of the computational complexity of the degree of the solution.
引用
收藏
页码:247 / 256
页数:10
相关论文
共 20 条
[1]  
[Anonymous], 1973, ANAL DISCRETIZATION, DOI DOI 10.1007/978-3-642-65471-8
[2]  
BOGATYREV A, 2004, ADV CONSTRUCTIVE APP, P109
[3]  
BOGATYREV A, SB MATH, V194, P1899
[4]  
BOGATYREV A, IN PRESS MAT SB
[5]   Combinatorial description of a moduli space of curves and of extremal polynomials [J].
Bogatyrëv, AB .
SBORNIK MATHEMATICS, 2003, 194 (9-10) :1451-1473
[6]   Effective approach to least deviation problems [J].
Bogatyrev, AB .
SBORNIK MATHEMATICS, 2002, 193 (11-12) :1749-1769
[7]   Representation of moduli spaces of curves and calculation of extremal polynomials [J].
Bogatyrëv, AB .
SBORNIK MATHEMATICS, 2003, 194 (3-4) :469-494
[8]  
Burnside W., 1891, P LOND MATH SOC, V23, P49, DOI DOI 10.1112/PLMS/S1-23.1.49
[9]  
FRANKLIN JN, 1959, J MATH PHYS, V37, P305
[10]  
Lebedev V. I., 1998, RUSSIAN MATH, V42, P52