Construction of variable-stepsize multistep formulas

Author:
Robert D. Skeel

Journal:
Math. Comp. **47** (1986), 503-510, S45

MSC:
Primary 65L05

DOI:
https://doi.org/10.1090/S0025-5718-1986-0856699-X

MathSciNet review:
856699

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A systematic way of extending a general fixed-stepsize multistep formula to a minimum storage variable-stepsize formula has been discovered that encompasses fixed-coefficient (interpolatory), variable-coefficient (variable step), and fixed leading coefficient as special cases. In particular, it is shown that the "interpolatory" stepsize changing technique of Nordsieck leads to a truly variable-stepsize multistep formula (which has implications for local error estimation and formula changing), and it is shown that the "variable-step" stepsize changing technique applicable to the Adams and backward-differentiation formulas has a reasonable generalization to the general multistep formula. In fact, it is shown how to construct a variable-order family of variable-coefficient formulas. Finally, it is observed that the first Dahlquist barrier does not apply to adaptable multistep methods if storage rather than stepnumber is the key consideration.

**[1]**G. D. Byrne and A. C. Hindmarsh,*A polyalgorithm for the numerical solution of ordinary differential equations*, ACM Trans. Math. Software**1**(1975), no. 1, 71–96. MR**0378432**, https://doi.org/10.1145/355626.355636**[2]**Germund Dahlquist,*Convergence and stability in the numerical integration of ordinary differential equations*, Math. Scand.**4**(1956), 33–53. MR**0080998**, https://doi.org/10.7146/math.scand.a-10454**[3]**G. G. Dahlquist,*On Stability and Error Analysis for Stiff Non-linear Problems, Part*1, Report TRITA-NA-7508, Dept. of Computer Sci., Royal Inst. of Technology, Stockholm, 1975.**[4]**È¦ke Björck and Germund Dahlquist,*Numerical methods*, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1974. Translated from the Swedish by Ned Anderson; Prentice-Hall Series in Automatic Computation. MR**0368379****[5]**Germund G. Dahlquist, Werner Liniger, and Olavi Nevanlinna,*Stability of two-step methods for variable integration steps*, SIAM J. Numer. Anal.**20**(1983), no. 5, 1071–1085. MR**714701**, https://doi.org/10.1137/0720076**[6]**J. Descloux,*A Note on a Paper by A. Nordsieck*, Report #131, Dept. of Computer Sci., Univ. of Illinois, Urbana-Champaign, 1963.**[7]**C. Dill & C. W. Gear, "A graphical search for stiffly stable methods for ordinary differential equations,"*J. Assoc. Comput. Mach.*, v. 18, 1971, pp. 75-79.**[8]**C. William Gear,*Numerical initial value problems in ordinary differential equations*, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1971. MR**0315898****[9]**C. W. Gear and D. S. Watanabe,*Stability and convergence of variable order multistep methods*, SIAM J. Numer. Anal.**11**(1974), 1044–1058. MR**0368437**, https://doi.org/10.1137/0711080**[10]**A. Hindmarsh,*Documentation for LSODE*, Math. & Stats. Section L-300, Lawrence Livermore Laboratory, Livermore, Calif., 1980.**[11]**K. R. Jackson and R. Sacks-Davis,*An alternative implementation of variable step-size multistep formulas for stiff ODEs*, ACM Trans. Math. Software**6**(1980), no. 3, 295–318. MR**585340**, https://doi.org/10.1145/355900.355903**[12]**M. D. Kregel & J. M. Heimerl,*Comments on the Solution of Coupled Stiff Differential Equations*, Proc. of the 1977 Army Numerical Analysis and Computers Conference, Report No. 77-3, U. S. Army Research Office, Research Triangle Park, N. C., 1977, pp. 553-563.**[13]**Fred T. Krogh,*Algorithms for changing the step size*, SIAM J. Numer. Anal.**10**(1973), 949–965. MR**0356515**, https://doi.org/10.1137/0710081**[14]**Arnold Nordsieck,*On numerical integration of ordinary differential equations*, Math. Comp.**16**(1962), 22–49. MR**0136519**, https://doi.org/10.1090/S0025-5718-1962-0136519-5**[15]**J. Sand,*Stability and Boundedness Results for Variable-Step Variable-Formula Methods*, Report TRITA-NA-8219, Dept. of Numer. Anal. and Computer Sci., Royal Inst. of Technology, Stockholm, 1982.**[16]**L. F. Shampine,*How to Live with a Reasonable ODE Code*(*DIFSUB*)*until a Good One Arrives*, manuscript, ca. 1974.**[17]**L. F. Shampine and M. K. Gordon,*Computer solution of ordinary differential equations*, W. H. Freeman and Co., San Francisco, Calif., 1975. The initial value problem. MR**0478627****[18]**R. D. Skeel,*Convergence of Multivalue Methods for Solving Ordinary Differential Equations*, Report TR73-16, Dept. of Computing Sci., Univ. of Alberta, Edmonton, 1973.**[19]**Robert D. Skeel,*Equivalent forms of multistep formulas*, Math. Comp.**33**(1979), no. 148, 1229–1250. MR**537967**, https://doi.org/10.1090/S0025-5718-1979-0537967-4**[20]**R. D. Skeel & T. V. Vu, "Note on blended linear multistep methods." (submitted.)**[21]**C. S. Wallace and G. K. Gupta,*General linear multistep methods to solve ordinary differential equations*, Austral. Comput. J.**5**(1973), 62–69. MR**0362919**

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

Retrieve articles in all journals with MSC: 65L05

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1986-0856699-X

Keywords:
Multistep formula,
multistep method,
multivalue method,
variable stepsize,
variable order

Article copyright:
© Copyright 1986
American Mathematical Society