# Thread: Backward Euler Method

1. ## Backward Euler Method

Hi!!! I need some help...
I want to write a code in matlab for the backward euler method.
How can I solve the equation to determine y^(n+1)??? Are secant method, newton's method, fixed point iteration, fsolve, fzero equal???

2. ## Re: Backward Euler Method

Hey mathmari.

You should look at a standard solver like Newton-Rhapson.

3. ## Re: Backward Euler Method

so do I have to write:

for i = 1:n
y^(n+1) = y^n - (g(y^n)/dg(y^n));

where g=y^(n+1)-y^n-h*f(t^(n+1), y^(n+1)) ???

4. ## Re: Backward Euler Method

Originally Posted by mathmari
so do I have to write:

for i = 1:n
y^(n+1) = y^n - (g(y^n)/dg(y^n));

where g=y^(n+1)-y^n-h*f(t^(n+1), y^(n+1)) ???
First try simple formula iteration as shown on the Wikipedia page.

.

5. ## Re: Backward Euler Method

Originally Posted by mathmari
Are secant method,newton's method, fixed point iteration, fsolve, fzero equal???
Some methods converge in fewer steps, some diverge less often, some are simpler and some are better at finding multiple roots.

6. ## Re: Backward Euler Method

Originally Posted by Shakarri
Some methods converge in fewer steps, some diverge less often, some are simpler and some are better at finding multiple roots.
which of these methods is better for the backward euler method?