Second order Chebyshev methods based on orthogonal polynomials

被引:101
作者
Abdulle, A [1 ]
Medovikov, AA
机构
[1] Univ Geneva, Dept Math, CH-1211 Geneva 24, Switzerland
[2] Acad Sci, Inst Numer Math, Moscow, ID USA
关键词
D O I
10.1007/s002110100292
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Stabilized methods (also called Chebyshev methods) are explicit Runge-Kutta methods with extended stability domains along the negative real axis. These methods are intended for large mildly stiff problems, originating mainly from parabolic PDEs. The aim of this paper is to show that with the use of orthogonal polynomials, we can construct nearly optimal stability polynomials of second order with a three-term recurrence relation. These polynomials can be used to construct a new numerical method, which is implemented in a code called ROCK2. This new numerical method can be seen as a combination of van der Houwen-Sommeijer-type methods and Lebedev-type methods.
引用
收藏
页码:1 / 18
页数:18
相关论文
共 19 条
[1]   On roots and error constants of optimal stability polynomials [J].
Abdulle, A .
BIT NUMERICAL MATHEMATICS, 2000, 40 (01) :177-182
[2]  
[Anonymous], J MATH
[3]  
Christoffel E.B., 1858, J REINE ANGEW MATH, V55, P61
[4]   CONTROL-THEORETIC TECHNIQUES FOR STEPSIZE SELECTION IN IMPLICIT RUNGE-KUTTA METHODS [J].
GUSTAFSSON, K .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1994, 20 (04) :496-517
[5]  
Hairer E., 1996, Springer Series in Computational Mathematics, V14, DOI DOI 10.1007/978-3-642-05221-7
[6]  
Hairer E., 1993, SPRINGER SERIES COMP, V8, DOI 10.1007/978-3-540-78862-1
[7]  
Lebedev V.I., 1994, NUMER METHODS APPL, P45
[8]   ZOLOTAREV POLYNOMIALS AND EXTREMUM PROBLEMS [J].
LEBEDEV, VI .
RUSSIAN JOURNAL OF NUMERICAL ANALYSIS AND MATHEMATICAL MODELLING, 1994, 9 (03) :231-263
[9]  
LEBEDEV VI, 1993, RUSS J NUMER ANAL M, V8, P397
[10]  
LEBEDEV VI, 1993, RUSS J NUMER ANAL M, V8, P195