Abstract
We describe a construction of continuous extensions to a new representation of two-step Runge–Kutta methods for ordinary differential equations. This representation makes possible the accurate and reliable estimation of local discretization error, facilitates the efficient implementation of these methods in variable stepsize environment, and adapts readily to the numerical solution of a class of delay differential equations. A number of numerical tests carried out on the obtained methods of order 3 with quadratic interpolants show their efficiency and robust performance which allow them to compete with the state-of-the-art dde23 code from Matlab.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
