Abstract
It has been shown by Dahlquist [3] that the trapezoidal formula has the smallest truncation error among all linear multistep methods with a certain stability property. It is the purpose of this note to show that a slightly different stability requirement permits methods of higher accuracy.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Dahlquist, G.,Convergence and stability in the numerical integration of ordinary differential equations, Math. Scand. 4 (1956), 33–53, MR 18 338.
Dahlquist, G.,Stability and error bounds in numerical integration of ordinary differential equations, Transactions of the Royal Institute of Technology, Stockholm, No. 130, 1959, MR 21 1706.
Dahlquist, G.,A special stability problem for linear multistep methods, BIT 3 (1963), 27–43, MR 30 715.
Henrici, P.,Discrete variable methods in ordinary differential equations, John Wiley & Sons, Inc., New York, London, 1962, MR 24 B 1772.
Henrici, P.,Error propagation for difference methods, John Wiley & Sons, Inc., New York, London, 1963, MR 27 4365.
Marden, M.,The geometry of the zeros of a polynomial in a complex variable, Mathematical Surveys No. 3, American Mathematical Society, New York, 1949, MR 11 101.
Author information
Authors and Affiliations
Additional information
The preparation of this paper was sponsored by the Swedish Technical Research Council.
Rights and permissions
About this article
Cite this article
Widlund, O.B. A note on unconditionally stable linear multistep methods. BIT 7, 65–70 (1967). https://doi.org/10.1007/BF01934126
Issue Date:
DOI: https://doi.org/10.1007/BF01934126