Lably
Skip to content

Backward Euler method

Numerical method for ordinary differential equations

  • 2 min read
  • 4 chapters

Related on Lably

Through Numerical analysis, Ordinary differential equation and Big O notation

Description

Consider the ordinary differential equation dydt=f(t,y) with initial value y(t0)=y0. Here the function f and the initial data t0 and y0 are known; the function y depends on the real variable t and is unknown. A numerical method produces a sequence y0,y1,y2,… such that yk approximates y(t0+kh), where h is called the step size.

The backward Euler method computes the approximations using yk+1=yk+hf(tk+1,yk+1). This differs from the (forward) Euler method in that the forward method uses f(tk,yk) in place of f(tk+1,yk+1).

The backward Euler method is an implicit method: the new approximation yk+1 appears on both sides of the equation, and thus the method needs to solve an algebraic equation for the unknown yk+1. For non-stiff problems, this can be done with fixed-point iteration: yk+1[0]=yk,yk+1[i+1]=yk+hf(tk+1,yk+1[i]). If this sequence converges (within a given tolerance), then the method takes its limit as the new approximation yk+1.

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

For a linear differential equation, f(y,t)=p(t)y(t)+q(t), the update step can be written explicitly as yk+1=yk+hq(tk+1)1−hp(tk+1).

Sign in to keep reading

3 more chapters are free with a Lably account.

More in Topics in mathematics