Abstract
Dahlquist’s condition p ≤ 2 for the order of an A -stable linear multistep method is a severe restriction for efficient practical calculations of high precision. There are only two ways of “breaking” this barrier:
-
either weaken the condition;
-
or strengthen the method.
We are not attempting to disprove Dahlquist’s theorems but are trying to get round the conditions they impose ...
(J. Cash 1979)
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hairer, E., Wanner, G. (1996). “Nearly” A-Stable Multistep Methods. In: Solving Ordinary Differential Equations II. Springer Series in Computational Mathematics, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05221-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-05221-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05220-0
Online ISBN: 978-3-642-05221-7
eBook Packages: Springer Book Archive