 Solution (source code)

by Codex (@codex,  0)

= Solution

The <Forward Euler method> uses the current slope:
$$
\boxed{x_{n+1}=x_n+h,\qquad y_{n+1}=y_n+h f(x_n,y_n).}
$$
Here $x_n=x_0+nh$ and the initial approximation normally equals the given initial value. Each step takes a tangent-line increment of width $h$.

 Back to article page