A modified Adams method for nonstiff and mildly stiff initial value problems

ABSTRACT

Adams predictor-corrector methods, and explicit Runge–Kutta formulas, have been widely used for the numerical solution of nonstiff initial value problems. Both of these classes of methods have certain drawbacks, however, and it has long been the aim of numerical analysts to derive a class of formulas that has the advantages of both Adams and Runge–Kutta methods and the disadvantages of neither! In this paper we derive a class of modified Adams formulas that attempts to achieve this aim. When used in a certain precisely defined predictor-corrector mode, these new formulas require three function evaluations per step, but have much better stability than Adams formulas. This improved stability makes the modified Adams formulas particularly effective for mildly stiff problems, and some numerical evidence of this is given. We also consider the performance of the new class of methods on the well-known DETEST test set to show their potential on general nonstiff initial value problems.

REFERENCES

• 1: J. C. Butcher, The numerical analysis of ordinary differential equations: Runge-Kutta and general linear methods, Wiley-Interscience, New York, NY, 1987
• 2: CASH, J.R. On the integration of stiff systems of ODE's using extended backward differentiation formulae. Numer Math. 37 (1980), 235 246.
• 3: CASH, J.R. The integration of stiff initial value problems in ODE's using modified extended backward differentiation formulae. Comput. Math. Appl. 9 (1983), 645 657.
• 4: J. R. Cash, A block 6(4) Runge-Kutta formula for nonstiff initial value problems, ACM Transactions on Mathematical Software (TOMS), v.15 n.1, p.15-28, March 1989 [doi>10.1145/62038.62042]
• 5: W. H. Enright , J. D. Pryce, Two FORTRAN packages for assessing initial value methods, ACM Transactions on Mathematical Software (TOMS), v.13 n.1, p.1-27, March 1987 [doi>10.1145/23002.27645]
• 6: HINDMARSH, A. C. LSODE and LSODI. Two initial value ordinary differential equation solvers. ACM SIGNUM Newsl. 15 (1980) 10 31.
• 7: LAMBERT, J. D. Computational Methods in Ordinary Differential Equatmns. Wiley, New York, 1973.
• 8: SHAMP~NE, L. F., AND GORDON, M. K. Solutmn of Ordinary DLfferent~al Equatwns The Initzal Value Problem. W. H. Freeman, San Francisco, 1975
• 9: SHAMP~NE, L.F. Interpolation for Runge Kutta methods. SlAM J. Numer. Anal. 22 (1985), 1014-1027.
• 10: Lawrence,F Shampine, Some practical Runge-Kutta formulas, Mathematics of Computation, v.46 n.173, p.135-150, Jan. 1986 [doi>10.2307/2008219]

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.4 MATHEMATICAL SOFTWARE
      Subjects: Certification and testing

Additional Classification:
  G. Mathematics of Computing
  G.1 NUMERICAL ANALYSIS
      G.1.7 Ordinary Differential Equations
          Subjects: Initial value problems

General Terms:
Algorithms, Design, Performance

Keywords:
initial value problem, modified Adams methods, nonstiff equations