๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Regularity properties of Runge-Kutta methods for ordinary differential equations

โœ Scribed by Z. Jackiewicz; R. Vermiglio; M. Zennaro


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
518 KB
Volume
22
Category
Article
ISSN
0168-9274

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 number of stages and p is the order of the method.


๐Ÿ“œ SIMILAR VOLUMES


Rungeโ€“Kutta methods for linear ordinary
โœ D.W. Zingg; T.T. Chisholm ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 107 KB

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

High strong order explicit Runge-Kutta m
โœ 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
โœ 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
โœ 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