Avoiding the order reduction of Runge-Kutta methods for linear initial boundary value problems
Open Access
- 19 November 2001
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 71 (240) , 1529-1544
- https://doi.org/10.1090/s0025-5718-01-01362-x
Abstract
A new strategy to avoid the order reduction of Runge-Kutta methods when integrating linear, autonomous, nonhomogeneous initial boundary value problems is presented. The solution is decomposed into two parts. One of them can be computed directly in terms of the data and the other satisfies an initial value problem without any order reduction. A numerical illustration is given. This idea applies to practical problems, where spatial discretization is also required, leading to the full order both in space and time.Keywords
This publication has 25 references indexed in Scilit:
- The Trotter-Kato theorem and approximation of PDEsMathematics of Computation, 1998
- On the convolution operators arising in the study of abstract initial boundary value problemsProceedings of the Royal Society of Edinburgh: Section A Mathematics, 1996
- Interior estimates for time discretizations of parabolic equationsApplied Numerical Mathematics, 1995
- On the Stability of Variable Stepsize Rational Approximations of Holomorphic SemigroupsMathematics of Computation, 1994
- The stability of rational approximations of analytic semigroupsBIT Numerical Mathematics, 1993
- Linear stability analysis in the numerical solution of initial value problemsActa Numerica, 1993
- Runge-Kutta Methods for Partial Differential Equations and Fractional Orders of ConvergenceMathematics of Computation, 1992
- Galerkin/Runge-Kutta Discretizations for Parabolic Equations with Time- Dependent CoefficientsMathematics of Computation, 1989
- Convergence and order reduction of Runge-Kutta schemes applied to evolutionary problems in partial differential equationsNumerische Mathematik, 1986
- On the Quasi-Optimality in $L_\infty$ of the $\overset{\circ}{H}^1$-Projection into Finite Element Spaces*Mathematics of Computation, 1982