Abstract
Popular codes for the numerical solution of nonstiff ordinary differential equations (ODEs) are based on a (fixed order) Runge-Kutta method, a variable order Adams method, or an extrapolation method. Extrapolation can be viewed as a variable order Runge-Kutta method. It is plausible that variation of order could lead to a much more efficient Runge-Kutta code, but numerical comparisons have been contradictory. We reconcile previous comparisons by exposing differences in testing methodology and incompatibilities of the implementations tested. An experimental Runge-Kutta code is compared to a state-of-the-art extrapolation code. With some qualifications, the extrapolation code shows no advantage. Extrapolation does not appear to be a particularly effective way to vary the order of Runge-Kutta methods. Although an acceptable way to solve nonstiff problems, our tests raise the question as to whether there is any point in pursuing it as a separate method. © 1986, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Shampine, L. F., & Baca, L. S. (1986). Fixed Versus Variable Order Runge-Kutta. ACM Transactions on Mathematical Software (TOMS), 12(1), 1–23. https://doi.org/10.1145/5960.5964
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.