Euler methond and the improved Euler method

[nkk2008]

I am confused by both of these. I get what it does, and how it does it, but when using it, somehow I ultimately screw up.

Could someone just post a quick description of what to do in conversational English, please? I am pretty sure that would solve this random mental block I have.

Thanks,
Nkk

 

[Lord Crc]

Googling for "euler method tutorial", this came up as the first hit. http://tutorial.math.lamar.edu/Classes/DE/EulersMethod.aspx

If it doesn't answer your question, you'll have to be more specific I think.

 

[HallsofIvy]

Euler method: The differential equation, dy/dx= f(x,y) tells you how to find the slope of the tangent line to y= y(x) at each point. Starting at, say, (x_0,y_0), calculate dy/dx and draw the tangent line, y= f'(x_0,y_0)(x- x_0)+ y_0.

That will approximate the graph of y= y(x) for a short distance. So follow that tangent from (x_0,y_0) a short distance to (x_0+ h, f'(x_0,y_0)h+ y_0). Now, using that point as "(x_0,y_0)" do it again.

Improved Euler's method: The Euler's method isn't exact because the tangent line is only approximate to the actual curve. And there is a "double" problem. Following the tangent line not only gives an point that is a little off, you will be calculating the next slope at the wrong place! Suppose [math]f'(x_0,y_0)[/math] is positive but decreasing. Following the tangent line not only gives an point that is a little too high (you didn't follow the downard curve of the graph), you will be calculating the next slope at the wrong place! One way to allow for that is to
1) Find f(x_0,y_0) to find the slope and follow the tangent line to (x_1,y_1)
2) Find f(x_1,y_1) to approximate the slope of the tangent line at the new point.
3) Use the average of those two slopes as the slope of your tangent line rather than the original.

 

[elibj123]

Euler method is a Taylor expansion of first order (linear approximation) of the solution at every point.
You can try using the chain rule to make a second order approximation to the function:

y^{'}=f(x,y)
<br /> y^{&#039;&#039;}=f_{x}(x,y)+f_{y}(x,y)y&#039;=f_{x}(x,y)+f_{y}(x,y)f(x,y)

So at point (x_{0},y_{0}) the next point (x_{0}+h,y) will satisfy
y=y_{0}+f(x_{0},y_{0})h +[f_{x}(x_{0},y_{0})+f_{y}(x_{0},y_{0})f(x_{0},y_{0})]\frac{h^{2}}{2}

 

[matematikawan]

Just saw in one textbook. Improved Euler method is also known as Heun method. It is a kind of predictor-corrector method.

Beware! There is another method called Modified Euler Method.