𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Runge–Kutta methods for linear ordinary differential equations

✍ Scribed by D.W. Zingg; T.T. Chisholm

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
107 KB
Volume
31
Category
Article
ISSN
0168-9274

No coin nor oath required. For personal study only.

✦ Synopsis

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, fifth-and 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.

📜 SIMILAR VOLUMES

Regularity properties of Runge-Kutta met
Regularity properties of Runge-Kutta methods for ordinary differential equations
✍ Z. Jackiewicz; R. Vermiglio; M. Zennaro 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 518 KB

We investigate the conditions which guarantee that Runge-Kutta methods preserve asymptotic values of the systems of ordinary differential equations. A complete characterization of such methods is given and examples of methods with these properties are presented for s = p : 2, 3 and 4, where s is the

High strong order explicit Runge-Kutta m
High strong order explicit Runge-Kutta methods for stochastic ordinary differential equations
✍ K. Burrage; P.M. Burrage 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 915 KB

The pioneering work of Runge and Kutta a hundred years ago has ultimately led to suites of sophisticated numerical methods suitable for solving complex systems of deterministic ordinary differential equations. However, in many modelling situations, the appropriate representation is a stochastic diff

Exponential Runge–Kutta methods for dela
Exponential Runge–Kutta methods for delay differential equations
✍ Y. Xu; J.J. Zhao; Z.N. Sui 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 333 KB

This paper deals with convergence and stability of exponential Runge-Kutta methods of collocation type for delay differential equations. It is proved that these kinds of numerical methods converge at least with their stage order. Moreover, a sufficient condition of the numerical stability is provide

A partitioned parallel Runge-Kutta metho
A partitioned parallel Runge-Kutta method for weakly coupled ordinary differential equations
✍ R. P. Mattione; I. N. Katz; M. A. Franklin 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 642 KB

## Abstract In many systems it is known __a priori__, that some states are ony weakly coupled with others. If such systems are solved on parallel processor it is possible to partition the states in such a way that one set of states is assigned to one processor and the other set of weakly coupled st