In numerical analysis and scientific computing, the backward Euler method (or implicit Euler method) is one of the most basic numerical methods for the solution of ordinary differential equations. It is similar to the (standard) Euler method, differs in that it is an implicit method. Backward Euler method has order one and is A-stable.
Consider ordinary differential equation
With initial value Here the function and the initial data and are known; the function depends on the real variable and is unknown. Numerical method produces a sequence such that approximates, where is called the step size.
Backward Euler method computes approximations using
This differs from the (forward) Euler method in that the latter uses in place of .
The backward Euler method is an implicit method: the new approximation appears on both sides of the equation, thus the method needs to solve an algebraic equation for the unknown . Sometimes, this can be done by fixed-point iteration:
If this sequence converges (within a given tolerance), the method takes its limit as the new approximation .
Alternatively, one can use (some modification of) the Newton–Raphson method to solve the algebraic equation.
Integrating the differential equation from to yields
Now approximate the integral on the right by the right-hand rectangle method (with one rectangle):
Finally, use that is supposed to approximate and the formula for the backward Euler method follows.
The same reasoning leads to the (standard) Euler method if the left-hand rectangle rule is used instead of the right-hand one.
Pink region outside disk shows the stability region of the backward Euler method.
The backward Euler method has order one. It means that the local truncation error (the error made in one step) is , using the big O notation. The error at a specific time is .
The region of absolute stability for the backward Euler method is the complement in the complex plane of the disk with radius 1 centered at 1, which depicted in the figure. This includes the whole left half of the complex plane, the backward Euler method is A-stable, which making it suitable for the solution of stiff equations. In fact, the backward Euler method is even L-stable,
Extensions and modifications
The backward Euler method is a variant of the (forward) Euler method. Other variants are the semi-implicit Euler method and the exponential Euler method.
The backward Euler method can be seen as a Runge–Kutta method with one stage, which can be described by the Butcher tableau:
The backward Euler method can also be seen as a linear multistep method with one step. This is the first method of the family of Adams–Moulton methods, also of the family of backward differentiation formulas.
Our experts are dedicated to your success, and here at Assignmenthelptutors.com we provide you with successful Implicit Methods answers that will keep you on track to completing your Implicit Methods projects and homework on time, accurately and using current knowledge up to date. We understand how complicated it can be to know who to turn to with newer programming questions, Implicit Methods assignments are newer and more complicated than many of your previous programming assignments. Assignmenthelptutors.com dedication is to assisting you in developing the best Implicit Methods homework every time, meeting the high demands you have of online Implicit Methods assistance. Experts at Assignmenthelptutors.com are dedicated and committed to your success, here at Assignmenthelptutors.com.
Assignmenthelptutors.com is dedicated to outstanding service with:
- They always available representatives live online support (chat and email) 24/7;
- discounts for repeat customers;
- secure payment methods and 100% confidentiality;
- Implicit Methods helps for students all over the world.
- No Plagiarism
- Referencing styles, Harvard, APA, IEEE