Abstract
Explicit Runge-Kutta methods provide a popular way to solve the initial value problem for a system of nonstiff ordinary differential equations. On the other hand, for these methods, there is no a natural way to approximate the solution at any point within a given integration step. Scaled Runge-Kutta methods have been developed recently which determine the solution of the differential system at non-mesh points of a given integration step. We propose some new such algorithms based upon well known explicit Runge-Kutta methods, and we verify their advantages by applying them to the Magnetic-Binary Problem.
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.
