This module illustrates Euler's method for numerically solving initial
value problems for ordinary differential equations. A numerical method
for an ordinary differential equation (ODE) generates an approximate
solution step-by-step in discrete increments across the interval of
integration, in effect producing a discrete sample of approximate
values of the solution function. Euler's method is the simplest
example of this approach, in which the approximate solution is advanced
at each step by extrapolating along the tangent line whose slope is
given by the ODE. Specifically, from an approximate solution value
yk at time tk for an
ODE
The user begins by selecting a differential equation from the menu provided. A solution value y0 for the selected ODE at an initial time t0 is marked with a black dot, and the exact solution curve for the resulting initial value problem is drawn in black. Starting from this initial value, the user advances the solution through successive steps using Euler's method. Each step of Euler's method is presented as a three-stage process. Each stage is executed by clicking either Next or the currently highlighted stage:
Successive steps may be continued until the the interval has been fully traversed.
Reference: Michael T. Heath, Scientific Computing, An Introductory Survey, 2nd edition, McGraw-Hill, New York, 2002. See Section 9.3.1, especially Example 9.8 and Figures 9.4 and 9.5.
Developers: Evan VanderZee and Michael Heath