The question is to prove that error order of backward euler method is o(h) We know that in backward euler method f′_i=(f_i−f_(i−1))/h

Chloe Arnold

Chloe Arnold

Answered question

2022-10-19

The question is to prove that error order of backward euler method is o ( h ) We know that in backward euler method
f i = f i f i 1 h
By using taylor seris we can get
f ( x ) = f ( x i ) + ( x x i ) f ( x i ) + ( x x i ) 2 2 ! f ( x i ) + . . . .
By putting x = x i 1 i get :
f i f i 1 h + f i = h 2 ! f i + h 2 3 ! f i + . . .
Which is not what i want to get Cause the error is
f i f i 1 h f i
Any help ? I could prove that o ( h ) is the order of error of forward Euler method by using x = x i + 1 But for the backward method it seems it doesn’t work

Answer & Explanation

Teagan Zamora

Teagan Zamora

Beginner2022-10-20Added 18 answers

You also need to take into account that x x i at x = x i 1 has the value h.
Check also the other signs, the Taylor terms should be alternating.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?