Math 2.0

Numerical analysis Ordinary differential equations Proposition

Verlet integration

Builds on Initial value problemLeapfrog integration

Statement

Let a ⁣:ℝd→ℝda \colon \R^d \to \R^d be twice continuously differentiable, and consider the equation x′′=a(x)x'' = a(x) with x(0)=x0x(0) = x_0 and x′(0)=v0x'(0) = v_0. Fix a step size h>0h > 0. The Störmer–Verlet method sets x1=x0+hv0+h22a(x0)x_1 = x_0 + h v_0 + \frac{h^2}{2} a(x_0) and xn+1=2xn−xn−1+h2a(xn),n≥1.x_{n+1} = 2 x_n - x_{n-1} + h^2 a(x_n), \qquad n \ge 1.

  1. The positions xnx_n are the same as the positions computed by the leapfrog method (velocity Verlet) from (x0,v0)(x_0, v_0) with step size hh.
  2. On a bounded interval [0,T][0, T], the error max⁡nh≤T∣xn−x(nh)∣\max_{nh \le T} \abs{x_n - x(nh)} is O(h2)O(h^2) as h→0h \to 0.

Remarks

The two-step formula comes from adding the Taylor expansions of x(t+h)x(t + h) and x(t−h)x(t - h): the odd powers cancel, and x(t+h)−2x(t)+x(t−h)=h2x′′(t)+O(h4)x(t+h) - 2x(t) + x(t-h) = h^2 x''(t) + O(h^4). So the local error is O(h4)O(h^4). In a two-step recurrence of this kind, a local error made at one step is carried forward with a factor of size at most O(n)O(n). Summing over n≤T/hn \le T/h steps gives a global error O(h2)O(h^2). For clause 1, the leapfrog positions satisfy xn+1−xn=hvn+1/2x_{n+1} - x_n = h v_{n+1/2} and vn+1/2=vn−1/2+ha(xn)v_{n+1/2} = v_{n-1/2} + h a(x_n), so xn+1−xn=xn−xn−1+h2a(xn)x_{n+1} - x_n = x_n - x_{n-1} + h^2 a(x_n), and both start from the same x1x_1. Velocities do not appear in the two-step form; they can be recovered by vn≈(xn+1−xn−1)/(2h)v_n \approx (x_{n+1} - x_{n-1}) / (2h), with error O(h2)O(h^2). Example: for x′′=0x'' = 0 the recurrence gives xn=x0+nhv0x_n = x_0 + n h v_0, the exact solution.

Going deeper

For a student

The two-step form needs only positions, which halves the storage. Its drawbacks are that velocities are only implicit and that round-off is larger, because a small term h2ah^2 a is added to large positions. The velocity Verlet form fixes both points and is the same method. Its good long-time behaviour comes from it being symmetric and symplectic.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Hamiltonian system concept
  2. Initial value problem concept
  3. Symplectic integrator concept
  4. Leapfrog integration statement
  5. Verlet integration statement

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Verlet_integration
About this page
TagESWE8Y3JD4
URIm2://ESWE8Y3JD4
Kindstatement, proposition
WritingW0 stub
MSC65L06, 65P10, 70-08
StatusThis copy of the site has no build data. Run m2 status ESWE8Y3JD4.
AboutLeapfrog integration
UsesInitial value problem, Leapfrog integration

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Results about this