Jump to content

Euler approximation

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Charles Matthews (talk | contribs) at 13:00, 22 March 2005 (cat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Euler approximations use tangent lines beginning at an initial point and continuing at a given step size to approximate the numerical value of a differential equation at a given point. These approximations are found using Euler's recursive formula.

Euler's Recurssive Forumula: y=yo+h•F(xo,yo)

  1. The inital point is (xo,yo)
  2. The slope is F(xo,yo)
  3. The step size is h
  4. The approximated value is y

If the function is concave down, the approximation will be an overestimate, and if the function is concave up, the approximation will be an underestimate. (Concavity is found using the second derivative test.) These approximations are more accurate with smaller step sizes.