Abstract
Using a stability result for variable time-step Runge–Kutta methods applied to nonautonomous real linear scalar test problem that decays exponentially fast, a step-size selection algorithm is devised. The step-size selection algorithm is based partly on stability information obtained by estimating the discrete Lyapunov exponent of a Runge–Kutta method applied to a nonautonomous linear scalar problem. The utility of the approach is illustrated in numerical experiments that demonstrate how the new algorithm performs against a standard accuracy based step-size selection strategy.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.