Interactive · 4 questions
When approximating the initial value problem using Euler's Method (of the first order), given that is Lipschitz continuous and satisfies for some , it is possible to establish a global error bound. In most cases, is Lipschitz continuous with Lipschitz constant if holds for all in the domain of the problem.
We'll begin by finding an expression for in terms of .
What does the Taylor expansion of with respect to centered around and evaluated at look like?
Right. The might seem a little strange, but we'll deal with it later. Let's clean things up a little, using (the step size) to get . Additionally, for convenience, let be our approximation to , and let (the real value).
By definition, we have . Subtract this from the previous result to obtain:
In an attempt to find a bound on the maximum absolute error, we take the absolute value of both sides and apply both the triangle inequality and our assumption about above:
Now since is Lipschitz continuous with constant , how can we write the right hand side?
We now arrive at the bound . Notice the recurrent geometric relationship. We'll establish some useful lemmas now to help simplify this down:
Lemma 1: for all and positive
Which of the following is the Taylor expansion of about ?
Great! What does that imply about ?
Now exponentiate by for the desired result. Onwards!
Lemma 2: For positive , , and , we have:
Proof: Compute the sum of the finite geometric series and apply the previous lemma.
Finally, then, we have our final conclusion. With , , and , we can simplify our previous recursive error bound to the following nicer result:
Note that this bound is linear in . Higher order Euler methods will yield similarly higher order error bounds. One should take care when attempting to drive too small, as computational floating point error may begin to dominate the previously derived approximation error.