It is indispensable to seek approximations to ordinary differential equations that are more accurate than the Euler method to increase the speed of convergence of Euler's method. Euler's method is intuitively a linear Taylor polynomial approximation. It is reasonable to design higher-order Taylor approximations; as a result, a family of high-order methods emerges. It is required that higher regularity of the solution derive a Taylor method. Higher-order expressions are obtained by differentiating the differential equation from the solution itself. It is usually time-consuming to get higher-order derivative expressions. The idea behind Runge–Kutta's techniques is to approximate the derivative terms by combining compositions of the function of the differential equation. In this paper, we review the Taylor method and Runge-Kutta methods. We give a detailed proof of how the discrete Galerkin method is equivalent to some implicit Runge-Kutta method. These methods are stable and easy to implement.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.