A stopping criterion for the Newton-Raphson method in implicit multistep integration algorithms for nonlinear systems of ordinary differential equations
- 1 September 1971
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 14 (9), 600-601
- https://doi.org/10.1145/362663.362745
Abstract
In the numerical solution of ordinary differential equations, certain implicit linear multistep formulas, i.e. formulas of type ∑ k j =0 α j x n + j - h ∑ k j =0 β j x n + j = 0, (1) with β k > ≠ 0, have long been favored because they exhibit strong (fixed- h ) stability. Lately, it has been observed [1-3] that some special methods of this type are unconditionally fixed- h stable with respect to the step size. This property is of great importance for the efficient solution of stiff [4] systems of differential equations, i.e. systems with widely separated time constants. Such special methods make it possible to integrate stiff systems using a step size which is large relative to the rate of change of the fast-varying components of the solution.Keywords
This publication has 3 references indexed in Scilit:
- Efficient Integration Methods for Stiff Systems of Ordinary Differential EquationsSIAM Journal on Numerical Analysis, 1970
- A special stability problem for linear multistep methodsBIT Numerical Mathematics, 1963
- Integration of Stiff EquationsProceedings of the National Academy of Sciences, 1952