A new class of highly-stable methods: A\(_0\)-stable methods. (English) Zbl 0265.65036


65L05 Numerical methods for initial value problems involving ordinary differential equations
Full Text: DOI


[1] G. Bjurel, G. Dahlquist, B. Lindberg, S. Linde, and L. Oden,Survey of stiff ordinary differential equations, Report No. NA 70.11, Department of Information Processing, The Royal Institute of Technology Stockholm, 1970.
[2] C. W. Cryer,On the instability of high order backward-difference multistep methods, BIT 12 (1972), 17–25. · Zbl 0236.65051
[3] C. W. Cryer,Necessary and sufficient criteria for A-stability of linear multistep integration formulae, Technical Report No. 147, Computer Sciences Dept., University of Wisconsin, Madison, Wisconsin, 1972.
[4] G. G. Dahlquist,A special stability problem for linear multistep methods, BIT 3 (1963), 27–43. · Zbl 0123.11703
[5] C. Dill and C. W. Gear,A graphical search for stiffly stable methods for ordinary differential equations, J. Assoc. Comp. Mach. 18 (1971), 75–79. · Zbl 0224.65022
[6] C. W. Gear,Numerical Initial Value Problems in Ordinary Differential Equations, Englewood Cliffs: Prentice-Hall, 1971. · Zbl 1145.65316
[7] M. K. Jain and V. K. Srivastava,High order stiffly stable methods for ordinary differential equations, Report No. 394, Department of Computer Science, University of Illinois, Urbana, Illinois, 1970.
[8] L. Lapidus and J. H. Seinfeld,Numerical Solution of Ordinary Differential Equations, New York: Academic Press, 1971. · Zbl 0217.21601
[9] N. Obreschkoff,Verteilung und Berechnung der Nullstellen Reeller Polynome, Berlin: VEB Deutscher Verlag der Wissenschaften, 1963. · Zbl 0156.28202
[10] O. B. Widlund,A note on unconditionally stable linear multistep methods, BIT 7 (1967), 65–70. · Zbl 0178.18502
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.