B-convergence results for linearly implicit one step methods (Q1090079): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claims |
||
Property / author | |||
Property / author: Karl Strehmel / rank | |||
Property / author | |||
Property / author: Rüdiger Weiner / rank | |||
Revision as of 06:15, 14 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | B-convergence results for linearly implicit one step methods |
scientific article |
Statements
B-convergence results for linearly implicit one step methods (English)
0 references
1987
0 references
Linearly implicit one-step methods (Rosenbrock-type methods, adaptive Runge-Kutta methods,...) are investigated with respect to their ''B- convergence''. Here B-convergence order q has not the original sense of \textit{R. Frank\textit{, \textit{J. Schneid}}} and \textit{C. W. Ueberhuber} [SIAM J. Numer. Anal. 18, 753-780 (1981; Zbl 0467.65032)]. It means that for semi- linear problems \(y'=Ty+g(t,y)\) the global error can be bounded by \(Ch^ q\), where C may depend only on the logarithmic norm of T, on the Lipschitz constant of g and on derivatives of y(t) and g(t,y(t)). The authors derive sufficient conditions for B-convergence order q and present some particular methods with \(q\leq 3\). Numerical experiments on an artificial test problem confirm the theoretical results.
0 references
stiff systems
0 references
Linearly implicit one-step methods
0 references
Rosenbrock-type methods
0 references
adaptive Runge-Kutta methods
0 references
B-convergence
0 references
B-convergence order
0 references
Numerical experiments
0 references