Abstract
The question discussed in this paper is “When should a code switch between stiff and non-stiff options, when should it switch between one order and another and how should it adjust its stepsize from one step to the next.” Criteria are proposed for switching between the options that become available as the integration progresses and these are presented in algorithmic form.
Zusammenfassung
Wir diskutieren die Frage: “Wann soll ein Programm zwischen steifen und nicht-steifen Verfahren wählen, wann soll es die Ordnung ändern und in welcher Weise soll es die Größe des nächsten Schrittes bestimmen?” Kriterien für die Auswahl zwischen verschiedenen Möglichkeiten, die sich im Verlauf der Integration ergeben, werden vorgeschlagen und in algorithmischer Form dargestellt.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. C. Butcher, Optimal order and stepsize sequences. IMA J. Numer. Anal.6 (1986), 433–438.
J. C. Butcher, “The numerical analysis of ordinary differential equations: Runge-Kutte and general linear methods,” John Wiley & Sons, Chichester and New York, 1987.
W. B. Gragg and H. J. Stetter, Generalized multistep predictor-corrector methods, J. Assoc. Comput. Mach.11, (1964), 188–209.
H. J. Stetter, “Analysis of Discretization Methods for Ordinary Differential Equations”, Springer, Berlin (1973).
H. J. Stetter, Tolerance proportionality in ODE-codes, in Proc Second Conf. on Numerical Treatment of Ordinary Differential Equations, Berlin (1980), 109–123.
H. J. Stetter, Modular analysis of numerical software, in Numerical Analysis: Proc. Dundee, 1979, Lecture Notes in Mathematics No. 773 (1980), 133–145.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Butcher, J.C. Order, stepsize and stiffness switching. Computing 44, 209–220 (1990). https://doi.org/10.1007/BF02262217
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02262217