Variable order and stepsize in general linear methods

2019 
This paper describes the implementation of a class of IRKS methods (Wright 2002). These GLM algorithms are practical with reliable error estimators (Butcher and Podhaisky, Appl. Numer. Math. 56, 345–357 2006). The current robust ODE solvers in variable stepsize as well as in variable-order mode are based upon heuristics. In this paper, we examine an optimisation approach, based on Euler-Lagrange theory (Butcher, IMA J. Numer. Anal. 6, 433–438 1986), (Butcher, Computing 44, 209–220 1990), to control the stepsize as well as the order and implement the GLMs in an efficient manner. A set of nonstiff to mildly stiff problems have been used to investigate this approach in fixed-order and variable-order modes.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    19
    References
    0
    Citations
    NaN
    KQI
    []