Abstract
The Runge-Kutta method for the numerical solution of Cauchy's problem for a system of ordinary differential equations has an obvious iterative character. As demonstrated In this paper, this phenomenon arises from the connection between the Runge-Kutta method and Picard's iterative method. The estimation of error for the Runge-Kutta method is based on this connection.
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.
