Abstract
AbstractFor the solution of the Cauchy problem for the first order ODE, the most popular, simplest and widely used method are the Euler methods. The two basic variants of the Euler methods are the explicit Euler methods (EEM) and the implicit Euler method (IEM). These methods are well-known and they are introduced almost in any arbitrary textbook of the numerical analysis, and their consistency is given. However, in the investigation of these methods there is a difference in concerning the convergence: for the EEM it is done almost everywhere but for the IEM usually it is missed. (E.g., [1, 2, 6-9].)The stability (and hence, the convergence) property of the IEM is usually shown as a consequence of some more general theory. Typically, from the theory for the implicit Runge-Kutta methods, which requires knowledge of several basic notions in numerical analysis of ODE theory, and the proofs are rather complicated. In this communication we will present an easy and elementary prove for the convergence of the IEM for the scalar ODE problem. This proof is direct and it is available for the non-specialists, too.KeywordsNumerical solution of ODEimplicit and explicit Euler methodRunge-Kutta methodsfinite difference method
Published Version
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.
