Improved Euler Method

Proof Technique

Consider the first order ODE:

$(1): \quad y' = \map f {x, y}$ subject to the initial condition $\map y {x_0} = y_0$

where $\map f {x, y}$ is continuous.

Let $\map y x$ be the particular solution of $(1)$.

For all $n \in \N_{>0}$, we define:

$x_n = x_{n - 1} + h$

where $h \in \R_{>0}$.

Then for all $n \in \N_{>0}$ such that $x_n$ is in the domain of $y$:

$y_{n + 1} = y_n + \dfrac h 2 \paren {\map f {x_n, y_n} + \map f {x_{n + 1}, z_{n + 1} } }$

where:

$z_{n + 1} = y_n + h \map f {x_n, y_n}$

is an approximation to $\map y {x_{n + 1} }$.

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.

Source of Name

This entry was named for Leonhard Paul Euler.

Sources

• 1972: George F. Simmons: Differential Equations ... (previous) ... (next): Miscellaneous Problems for Chapter $2$: Appendix $\text{A}$. Numerical Methods