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
相关论文
共 50 条
  • [41] The computation of the matching polynomials of fullerene graphs
    Liu, J
    Shan, BZ
    CROATICA CHEMICA ACTA, 1997, 70 (04) : 971 - 977
  • [42] Fast Recursive Computation of Krawtchouk Polynomials
    Sadiq H. Abdulhussain
    Abd Rahman Ramli
    Syed Abdul Rahman Al-Haddad
    Basheera M. Mahmmod
    Wissam A. Jassim
    Journal of Mathematical Imaging and Vision, 2018, 60 : 285 - 303
  • [43] Computation of dominant real roots of polynomials
    D. Ştefănescu
    Programming and Computer Software, 2008, 34 : 69 - 74
  • [44] Fast Recursive Computation of Krawtchouk Polynomials
    Abdulhussain, Sadiq H.
    Ramli, Abd Rahman
    Al-Haddad, Syed Abdul Rahman
    Mahmmod, Basheera M.
    Jassim, Wissam A.
    JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2018, 60 (03) : 285 - 303
  • [45] SCHEMES FOR THE COMPUTATION OF POLYNOMIALS WITH REAL COEFFICIENTS
    PAN, VJ
    DOKLADY AKADEMII NAUK SSSR, 1959, 127 (02): : 266 - 269
  • [46] Computation of Chebyshev Polynomials for Union of Intervals
    Simon Foucart
    Jean Bernard Lasserre
    Computational Methods and Function Theory, 2019, 19 : 625 - 641
  • [47] Efficient Computation of Squarefree Separator Polynomials
    Ceria, Michela
    Mora, Teo
    Visconti, Andrea
    MATHEMATICAL SOFTWARE - ICMS 2018, 2018, 10931 : 98 - 104
  • [48] Private computation of polynomials over networks
    Hosseinalizadeh, Teimour
    Turkmen, Fatih
    Monshizadeh, Nima
    SYSTEMS & CONTROL LETTERS, 2022, 166
  • [49] Private Computation of Polynomials over Networks
    Hossienalizadeh, Teimour
    Turkmen, Fatih
    Monshizadeh, Nima
    2021 60TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2021, : 4895 - 4900
  • [50] Computation of dominant real roots of polynomials
    Stefanescu, D.
    PROGRAMMING AND COMPUTER SOFTWARE, 2008, 34 (02) : 69 - 74