algorithms for the solution of stiff systems of ordinary differential equations

Authors:
R. W. Klopfenstein and C. B. Davis

Journal:
Math. Comp. **25** (1971), 457-473

MSC:
Primary 65L99

DOI:
https://doi.org/10.1090/S0025-5718-1971-0298956-3

MathSciNet review:
0298956

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: This paper presents a study of a class of PECE algorithms consisting of an application of a predictor followed by application of one iteration of a pseudo Newton-Raphson method to a corrector. Such algorithms require precisely two evaluations of the derivative function for each forward step. Theorems 1 and 4 show that the stability properties of such algorithms compare favorably with those obtained with application of the Newton-Raphson method to the corrector iterated to convergence.

A subclass of these algorithms have local truncation error of second order and some have local truncation error of third order. Theorems 2 and 3 exhibit members of this subclass wherein an estimate of the local truncation error is explicit in the algorithm at each step.

Initially (in Theorem 1) these algorithms are characterized in terms of their stability properties in the limit as the interval of integration becomes indefinitely large. In Section 5, their properties for other intervals of integration are discussed through the study of some enclosure properties.

**[1]**F. H. Branin, Jr., ``Computer methods of network analysis,''*Proc. IEEE*, v. 55, 1967, pp. 1787-1801.**[2]**D. A. Callahan, ``A stable, accurate method of numerical integration for nonlinear systems,''*Proc. IEEE*, v. 56, 1968, p. 744.**[3]**Germund G. Dahlquist,*A special stability problem for linear multistep methods*, Nordisk Tidskr. Informations-Behandling**3**(1963), 27–43. MR**0170477****[4]**C. W. Gear,*The automatic integration of stiff ordinary differential equations.*, Information Processing 68 (Proc. IFIP Congress, Edinburgh, 1968) North-Holland, Amsterdam, 1969, pp. 187–193. MR**0260180****[5]**C. F. Haines,*Implicit integration processes with error estimate for the numerical solution of differential equations*, Comput. J.**12**(1969/1970), 183–187. MR**0246513**, https://doi.org/10.1093/comjnl/12.2.183**[6]**W. Liniger,*A criterion for 𝐴-stability of linear multistep integration formulae.*, Computing (Arch. Elektron. Rechnen)**3**(1968), 280–285 (English, with German summary). MR**0239763****[7]**Werner Liniger and Ralph A. Willoughby,*Efficient integration methods for stiff systems of ordinary differential equations*, SIAM J. Numer. Anal.**7**(1970), 47–66. MR**0260181**, https://doi.org/10.1137/0707002**[8]**Robert D. Richtmyer,*Difference methods for initial-value problems*, Interscience tracts in pure and applied mathematics. Iract 4, Interscience Publishers, Inc., New. York, 1957. MR**0093918****[9]**H. H. Rosenbrock,*Some general implicit processes for the numerical solution of differential equations*, Comput. J.**5**(1962/1963), 329–330. MR**0155434**, https://doi.org/10.1093/comjnl/5.4.329**[10]**I. W. Sandberg and H. Shichman,*Numerical integration of systems of stiff nonlinear differential equations*, Bell System Tech. J.**47**(1968), 511–527. MR**0233515**, https://doi.org/10.1002/j.1538-7305.1968.tb02483.x**[11]**S. R. Sedore,*SCEPTRE*:*A Second Generation Transient Analysis Program*, Proc. Computer-Aided Circuit Design Seminar, (NASA), Cambridge, Mass., 1967, pp. 55-61.**[12]**Olof B. Widlund,*A note on unconditionally stable linear multistep methods*, Nordisk Tidskr. Informations-Behandling**7**(1967), 65–70. MR**0215533****[13]**J. H. Wilkinson,*Rounding errors in algebraic processes*, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1963. MR**0161456**

Retrieve articles in *Mathematics of Computation*
with MSC:
65L99

Retrieve articles in all journals with MSC: 65L99

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1971-0298956-3

Keywords:
Ordinary differential equations,
numerical solution,
numerical stability,
predictor-corrector method,
Newton-Raphson approximation

Article copyright:
© Copyright 1971
American Mathematical Society