Backward Euler method: Difference between revisions

Revision as of 11:07, 25 March 2016

Latest revision as of 11:50, 17 June 2024

(23 intermediate revisions by 16 users not shown)

Line 1:

{{Short description|Numerical method for ordinary differential equations}}

In [[numerical analysis]] and [[scientific computing]], the '''backward Euler method''' (or '''implicit Euler method''') is one of the most basic [[numerical methods for ordinary differential equations|numerical methods for the solution of ordinary differential equations]]. It is similar to the (standard) [[Euler method]], but differs in that it is an [[explicit and implicit methods|implicit method]]. The backward Euler method has error of order one and isin [[A-stability|A-stable]]time.

== Description ==

Line 9 ⟶ 10:

The backward Euler method computes the approximations using

:<math> y_{k+1} = y_k + h f(t_{k+1}, y_{k+1}). </math> <ref>{{harvnb|Butcher|2003|p=57}}</ref>

This differs from the (forward) Euler method in that the latterforward method uses <math> f(t_k, y_k) </math> in place of <math>f(t_{k+1}, y_{k+1})</math>.

The backward Euler method is an implicit method: the new approximation <math> y_{k+1} </math> appears on both sides of the equation, and thus the method needs to solve an algebraic equation for the unknown <math> y_{k+1} </math>. SometimesFor non-[[Stiff equation|stiff]] problems, this can be done bywith [[fixed-point iteration]]:

:<math> y_{k+1}^{[0]} = y_k, \quad y_{k+1}^{[i+1]} = y_k + h f(t_{k+1}, y_{k+1}^{[i]}). </math>

If this sequence converges (within a given tolerance), then the method takes its limit as the new approximation

<math> y_{k+1} </math>. <ref>{{harvnb|Butcher|2003|p=57}}</ref>

Alternatively, one can use (some modification of) the [[Newton's method|Newton–Raphson method]] to solve the algebraic equation.

Line 31 ⟶ 32:

[[File:Stability region for BDF1.svg|thumb|The pink region outside the disk shows the stability region of the backward Euler method.]]

The backward Euler method has order one. This means that the [[local truncation error]] (defined as the error made in one step) of the backward Euler Method is <math> O(h^2) </math>, using the [[big O notation]]. The error at a specific time <math> t </math> is <math> O(h^2) </math>. It means that this method has '''order one'''. In general, a method with <math> O(h^{k+1}) </math> LTE (local truncation error) is said to be of ''k''th order.

The [[Stiff_equation#Runge%E2%80%93Kutta_methods|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, depicted in the figure.<ref>{{harvnb|Butcher|2003|p=70}}</ref> This includes the whole left half of the complex plane, so the backward Euler method is [[A-stability|A-stable]], making it suitable for the solution of [[stiff equation]]s.<ref>{{harvnb|Butcher|2003|p=71}}</ref> In fact, the backward Euler method is even [[L-stability|L-stable]].

The region for a discrete '''stable''' system by Backward Euler Method is a circle with radius 0.5 which is located at (0.5, 0) in the z-plane.<ref>Wai-Kai Chen, Ed., Analog and VLSI Circuits The Circuits and Filters Handbook, 3rd ed. Chicago, USA: CRC Press, 2009.</ref>

== Extensions and modifications ==

Line 48 ⟶ 51:

</math>

The backward Euler method can also be seen as a [[linear multistep method]] with one step. It is the first method of the family of [[Adams–Moulton method]]s, and also of the family of [[backward differentiation formula]]s.

==See also==