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???

Printable View

- Apr 24th 2013, 09:31 AMmathmariBackward 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??? - Apr 24th 2013, 08:43 PMchiroRe: Backward Euler Method
Hey mathmari.

You should look at a standard solver like Newton-Rhapson. - Apr 26th 2013, 07:16 AMmathmariRe: 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)) ??? - Apr 26th 2013, 09:25 AMzzephodRe: Backward Euler Method
First try simple formula iteration as shown on the Wikipedia page.

. - Apr 26th 2013, 02:48 PMShakarriRe: Backward Euler Method
- Apr 26th 2013, 03:52 PMmathmariRe: Backward Euler Method