1980
DOI: 10.1002/zamm.19800601005
|View full text |Cite
|
Sign up to set email alerts
|

On the Internal Stability of Explicit, m‐Stage Runge‐Kutta Methods for Large m‐Values

Abstract: Ezplizite Runge -K u t t a -Verfahren m-ten Grades werden hergeleitet, f u r die der maximal stabile Zeitschritt pro d u swertung der rechten Seite mit m proportioniert ist, wenn diese Methoden auf semi-diskretisierte parabolisclie Anfangsrandwertprobleme angewandt werden. Dns interne Stabilitatsverhalten dieser Methoden wird mit gleichartigen, cn der Lrterntur aorgeschlagenen Runge-Kutta-Formeln verglichen. Wir zeigen sowohl mittels Analyse uiie durch numeridche ExperL-nt~nte, daJ der sn-Wert der in dieser Ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
180
0
1

Year Published

1993
1993
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 165 publications
(181 citation statements)
references
References 2 publications
0
180
0
1
Order By: Relevance
“…To overcome the internal instability problem, Van der Houwen and Sommeijer [ 13] developed a class of RK methods which is based on the three-term Chebyshev recursion (3.4). They derived first and second order methods for which all coefficients are given as analytical expressions and which can be used for any (practical) value of s. These methods are called Runge-Kutta-Chebyshev (RKC) methods.…”
Section: The Rkc Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…To overcome the internal instability problem, Van der Houwen and Sommeijer [ 13] developed a class of RK methods which is based on the three-term Chebyshev recursion (3.4). They derived first and second order methods for which all coefficients are given as analytical expressions and which can be used for any (practical) value of s. These methods are called Runge-Kutta-Chebyshev (RKC) methods.…”
Section: The Rkc Methodsmentioning
confidence: 99%
“…This is also very good, because by increasing s with only about I 0% the same step size as would be allowed by the optimal polynomial will yield stability, due to the quadratic behaviour. Following [13,28,39], in the remainder we will proceed with the Bakker-Chebyshev polynomial for the second order methods, since this polynomial has been extensively tested and also seems to perform even somewhat better due to smaller error constants [18]. For an even degree, /J(s) equals ~ (8 2 -1) exactly, while for an odd degree /3(s) is slightly larger.…”
Section: Second Order Polynomialsmentioning
confidence: 99%
“…Various strategies have been proposed to approximate such polynomials. We mention DUMKA methods of order two [11] and the Runge-Kutta-Chebyshev methods [9] based on a linear combination of Chebyshev polynomials. The stability domains of the DUMKA methods include the optimal interval ( [−0, 82 · s 2 , 0]) along the negative real axis, while the stability domains of RKC methods cover only 80% of these interval.…”
Section: Higher Order Methods Partitioned and Imex Methodsmentioning
confidence: 99%
“…Indeed, unlike traditional Runge-Kutta (RK) methods, Chebyshev methods can have a large number of internal stages (e.g., 100, 200). An efficient implementation of such methods (that controls also internal stability) for the ordinary differential equations dX dt = F(X), X(0) = X 0 , F : R d → R d (an autonomous form is considered here for simplicity), first given in [9], reads…”
Section: Early Developmentmentioning
confidence: 99%
“…The approach of van der Houwen and Sommeijer [15] takes advantage of the three-term recursion for the Chebyshev polynomials and generates the Runge-Kutta-Chebyshev (RKC) family of order p = 1 (see also [3,chapter IV.2] or [9, chapter V]).…”
Section: Runge-kutta Integratorsmentioning
confidence: 99%