论文信息 - Fourth-order 2N-storage Runge-Kutta schemes

Fourth-order 2N-storage Runge-Kutta schemes

A family of five-stage fourth-order Runge-Kutta schemes is derived; these schemes required only two storage locations. A particular scheme is identified that has desirable efficiency characteristics for hyperbolic and parabolic initial (boundary) value problems. This scheme is competitive with the classical fourth-order method (high-storage) and is considerably more efficient and accurate than existing third-order low-storage schemes.

M. Carpenter | C. Kennedy

[1] D. Fyfe,et al. Economical evaluation of Runge-Kutta formulae , 1966 .

[2] J. Verner. Explicit Runge–Kutta Methods with Estimates of the Local Truncation Error , 1978 .

[3] J. Williamson. Low-storage Runge-Kutta schemes , 1980 .

[4] J. Dormand,et al. A family of embedded Runge-Kutta formulae , 1980 .

[5] R. Skeel. Thirteen ways to estimate global error , 1986 .

[6] J. Butcher. The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods , 1987 .

[7] Philip W. Sharp,et al. Explicit Runge-Kutta Pairs with One More Derivative Evaluation than the Minimum , 1993, SIAM J. Sci. Comput..

[8] David I. Gottlieb,et al. The Theoretical Accuracy of Runge-Kutta Time Discretizations for the Initial Boundary Value Problem: A Study of the Boundary Error , 1995, SIAM J. Sci. Comput..