Premium
The methods of Gellert and of Brusa and Nigro are Padé approximant methods
Author(s) -
Thomas R. M.,
Gladwell I.
Publication year - 1984
Publication title -
international journal for numerical methods in engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.421
H-Index - 168
eISSN - 1097-0207
pISSN - 0029-5981
DOI - 10.1002/nme.1620200710
Subject(s) - equivalence (formal languages) , mathematics , ordinary differential equation , padé approximant , stability (learning theory) , mathematical analysis , differential equation , computer science , pure mathematics , machine learning
We discuss properties of methods proposed recently by Gellert 1 and by Brusa and Nigro 2 for solving systems of second‐order ordinary differential equations. In both cases, we extend the derivations to obtain whole families of methods with improved stability properties (roughly equivalent to L ‐stability for first‐order systems) and we show that obtaining improvement in stability properties results in a deterioration in accuracy and/or implementation properties. Also we bring out the relationship (and in some cases equivalence) of these methods to others proposed in the literature. In particular, we show that the methods proposed by the above authors are essentially equivalent to well‐known methods of long standing, namely Padé approximant methods for equivalent first‐order systems of ordinary differential equations.