Blended Linear Multistep Methods

The accuracy of linear multistep formulas suitable for stiff differential systems is limited. Greater accuracy can be attained by including higher derivatives in the formula, but this is not practical for all problems. It is possible however, to duplicate the absolute stability region for any given m-derivative multistep formula by taking a combination of m multistep formulas. These blended formulas are similar to Lambert and Sigurdsson's linear multistep formulas with variable matrix coefficients, but the approach is different. Implementation details and numerical results are presented for a variable-order, variable-step blend of the Adams-Moulton and the backward differentiation formulas. 7 tables.

[1]  W. H. Enright.  Optimal Second Derivative Methods for Stiff Systems , 1974 .

[2]  L. Shampine,et al.  Computer solution of ordinary differential equations : the initial value problem , 1975 .

[3]  M. R. Osborne.  On Nordsieck's method for the numerical solution of ordinary differential equations , 1966 .

[4]  T. E. Hull,et al.  Comparing numerical methods for stiff systems of O.D.E:s , 1975 .

[5]  J. M. Watt.  Numerical Initial Value Problems in Ordinary Differential Equations , 1972 .

[6]  H. Stetter.  Analysis of Discretization Methods for Ordinary Differential Equations , 1973 .

[7]  W. H. Enright,et al.  Second Derivative Multistep Methods for Stiff Ordinary Differential Equations , 1974 .

[8]  Jr. Roy Leonard Brown,et al.  Multi-Derivative Numerical Methods for the Solution of Stiff Ordinary Differential Equations , 1975 .

[9]  J. Uhlig.  C. Forsythe and C. B. Moler, Computer Solution of Linear Algebraic Systems. (Series in Automatic Computation) XI + 148 S. Englewood Cliffs, N.J. 1967. Prentice-Hall, Inc. Preis geb. 54 s. net , 1972 .

[10]  J. D. Lambert.  Linear Multistep Methods with Mildly Varying Coefficients , 1970 .

[11]  Alan C. Hindmarsh,et al.  A Polyalgorithm for the Numerical Solution of Ordinary Differential Equations , 1975, TOMS.

[12]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[13]  Fred T. Krogh,et al.  On Testing a Subroutine for the Numerical Integration of Ordinary Differential Equations , 1973, JACM.

[14]  C. W. Gear,et al.  Numerical initial value problem~ in ordinary differential eqttations , 1971 .

[15]  Donald E. Knuth.  The art of computer programming: fundamental algorithms , 1969 .

[16]  Robert D. Skeel.  Equivalent Forms of Multistep Formulas , 1979 .

[17]  C. W. Gear,et al.  Algorithm 407: DIFSUB for solution of ordinary differential equations [D2] , 1971, Commun. ACM.

[18]  J. Lambert,et al.  Multistep Methods with Variable Matrix Coefficients , 1972 .

[19]  G. Forsythe,et al.  Computer solution of linear algebraic systems , 1969 .

[20]  M. K. Gordon,et al.  Typical problems for stiff differential equations , 1975, SGNM.

[21]  Ilkka Karasalo,et al.  On computing bounds for the least singular value of a triangular matrix , 1975 .

[22]  P. Henrici.  Discrete Variable Methods in Ordinary Differential Equations , 1962 .

[23]  R. Brayton,et al.  A new efficient algorithm for solving differential-algebraic systems using implicit backward differentiation formulas , 1972 .