Semi-implicit Euler method

Semi-implicit Euler method

In mathematics, the semi-implicit Euler method, also called symplectic Euler, semi-explicit Euler, Euler–Cromer, and Newton–Størmer–Verlet (NSV), is a modification of the Euler method for solving Hamilton's equations, a system of ordinary differential equations that arises in classical mechanics. It is a symplectic integrator and hence it yields better results than the standard Euler method.

Contents

Setting

The semi-implicit Euler method can be applied to a pair of differential equations of the form

 {dx \over dt} = f(t,v)
 {dv \over dt} = g(t,x),

where f and g are given functions. Here, x and v may be either scalars or vectors. The equations of motion in Hamiltonian mechanics take this form if the Hamiltonian is of the form

 H = T(t,v) + V(t,x). \,

The differential equations are to be solved with the initial condition

 x(t_0) = x_0, \qquad v(t_0) = v_0.

The method

The semi-implicit Euler method produces an approximate discrete solution by iterating

\begin{align}
  v_{n+1} &= v_n + g(t_n, x_n) \, \Delta t\\[0.3em]
  x_{n+1} &= x_n + f(t_n, v_{n+1}) \, \Delta t
\end{align}

where Δt is the time step and tn = t0 + nΔt is the time after n steps.

The difference with the standard Euler method is that the semi-implicit Euler method uses vn+1 in the equation for xn+1, while the Euler method uses vn.

Applying the method with negative time step to the computation of (xn,vn) from (xn + 1,vn + 1) and rearranging leads to the second variant of the semi-implicit Euler method

\begin{align}
  x_{n+1} &= x_n + f(t_n, v_n) \, \Delta t\\[0.3em]
  v_{n+1} &= v_n + g(t_n, x_{n+1}) \, \Delta t
\end{align}

which has similar properties.

The semi-implicit Euler is a first-order integrator, just as the standard Euler method. This means that it commits a global error of the order of Δt. However, the semi-implicit Euler method is a symplectic integrator, unlike the standard method. As a consequence, the semi-implicit Euler method almost conserves the energy (when the Hamiltonian is time-independent). Often, the energy increases steadily when the standard Euler method is applied, making it far less accurate.

Alternating between the two variants of the semi-implicit Euler method leads in one simplification to the Störmer-Verlet integration and in a slightly different simplification to the leapfrog integration, increasing both the order of the error and the order of preservation of energy.[1]

Example

The motion of a spring satisfying Hooke's law is given by

\begin{align}
  \frac{dx}{dt} &= v(t)\\[0.2em]
  \frac{dv}{dt} &= -\frac{k}{m}\,x=-\omega^2\,x.
\end{align}

The semi-implicit Euler for this equation is

\begin{align}
  v_{n+1} &= v_n - \omega^2\,x_n\,\Delta t \\[0.2em]
  x_{n+1} &= x_n + v_{n+1} \,\Delta t.
\end{align}

The iteration preserves the modified energy functional E_h(x,v)=\tfrac12\left(v^2+\omega^2\,x^2-\omega^2\Delta t\,vx\right) exactly, leading to stable periodic orbits that deviate by Ot) from the exact orbits. The exact circular frequency ω increases in the numerical approximation by a factor of 1+\tfrac1{24}\omega^2\Delta t^2+O(\Delta t^4).

References

  1. ^ Hairer, Ernst; Lubich, Christian; Wanner, Gerhard (2003). "Geometric numerical integration illustrated by the Störmer/Verlet method". Acta Numerica 12: 399–450. doi:10.1017/S0962492902000144. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.7106. 



Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Méthode d'Euler — En mathématiques, la méthode d Euler, nommée ainsi en l honneur du mathématicien Leonhard Euler, est une procédure numérique pour résoudre par approximation des équations différentielles du premier ordre avec une condition initiale. C est la plus …   Wikipédia en Français

  • Linear multistep method — Adams method redirects here. For the electoral apportionment method, see Method of smallest divisors. Linear multistep methods are used for the numerical solution of ordinary differential equations. Conceptually, a numerical method starts from an …   Wikipedia

  • Crank–Nicolson method — In numerical analysis, the Crank–Nicolson method is a finite difference method used for numerically solving the heat equation and similar partial differential equations.[1] It is a second order method in time, implicit in time, and is numerically …   Wikipedia

  • Heun's method — In mathematics and computational science, Heun s method may refer to the improved or modified Euler s method (that is, the explicit trapezoidal rule[1]), or a similar two stage Runge–Kutta method. It is named after Karl L. W. M. Heun and is a… …   Wikipedia

  • Midpoint method — For the midpoint rule in numerical quadrature, see rectangle method. Illustration of the midpoint method assuming that yn equals the exact value y(tn). The midpoint method computes yn + 1 …   Wikipedia

  • Newmark-beta method — The Newmark beta method is a method of numerical integration used to solve differential equations. It is widely used in numerical evaluation of the dynamic response of structures and solids such as in finite element analysis to model dynamic… …   Wikipedia

  • List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Scientific method — …   Wikipedia

  • Numerical ordinary differential equations — Illustration of numerical integration for the differential equation y = y,y(0) = 1. Blue: the Euler method, green: the midpoint method, red: the exact solution, y = et. The step size is h = 1.0 …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”