Pii: S0168-9274(98)00129-9
نویسنده
چکیده
Three new Runge–Kutta methods are presented for numerical integration of systems of linear inhomogeneous ordinary differential equations (ODEs) with constant coefficients. Such ODEs arise in the numerical solution of partial differential equations governing linear wave phenomena. The restriction to linear ODEs with constant coefficients reduces the number of conditions which the coefficients of the Runge–Kutta method must satisfy. This freedom is used to develop methods which are more efficient than conventional Runge–Kutta methods. A fourthorder method is presented which uses only two memory locations per dependent variable, while the classical fourth-order Runge–Kutta method uses three. This method is an excellent choice for simulations of linear wave phenomena if memory is a primary concern. In addition, fifthand sixth-order methods are presented which require five and six stages, respectively, one fewer than their conventional counterparts, and are therefore more efficient. These methods are an excellent option for use with high-order spatial discretizations. 1999 Elsevier Science B.V. and IMACS. All rights reserved.
منابع مشابه
Pii: S0168-9274(98)00101-9
Primal-dual affine-scaling methods have recently been extended from linear programming to semidefinite programming. We show how to analyze these methods in the framework of potential reduction algorithms. The analysis suggests implementable variants of the methods as 'long step predictor-corrector' algorithms, where the step length is determined by the potential function. A numerical comparison...
متن کاملPii: S0168-9274(99)00129-4
Diagonally implicit multistage integration methods are employed for the numerical integration in time of first order hyperbolic systems arising from Chebyshev pseudospectral discretizations of the spatial derivatives in the wave equation. These methods have stage order q equal to the order p. The stage values can be utilized to recover approximations to the solution u of sufficiently high accur...
متن کاملPii: S0168-9274(98)00108-1
A new family of iterative block methods, the family of block EN-like methods, is introduced. Efficient versions are presented and computational complexity, memory requirements and convergence properties are investigated. Finally, leading evidence of the potential of the new family is demonstrated via a comparison of numerical results and performance to other block methods. 1999 Elsevier Scien...
متن کاملPii: S0168-9274(01)00134-9
A postprocessing technique to improve the accuracy of Galerkin methods, when applied to dissipative partial differential equations, is examined in the particular case of very smooth solutions. Pseudospectral methods are shown to perform poorly. This performance is studied and a refined postprocessing technique is proposed. 2002 IMACS. Published by Elsevier Science B.V. All rights reserved.
متن کاملPii: S0168-9274(98)00118-4
A number of recently proposed preconditioning techniques based on sparse approximate inverses are considered. A description of the preconditioners is given, and the results of an experimental comparison performed on one processor of a Cray C98 vector computer using sparse matrices from a variety of applications are presented. A comparison with more standard preconditioning techniques, such as i...
متن کامل