Академический Документы
Профессиональный Документы
Культура Документы
Grady Lemoine
AMATH 575
May 31, 2007
Motivation
• Most systems of ODEs are too complex to solve
analytically
– Must numerically integrate
• But they also have structure we would like to
preserve
– Symmetries
– Volume preservation
– First integrals or Lyapunov functions
• Problem: A generic numerical integrator doesn’t
preserve these
• Solution: Construct a special numerical
integrator that does!
Outline
• Introduction and Preliminaries
• Survey of Integrators that Preserve
Structure
– Volume preservation
– First integrals and Lyapunov functions
• Example of Geometric Integration
• Conclusion
• References
Geometric Integration
• Called “geometric” because it preserves
aspects of the geometry of phase space
• Has been used successfully in
– Orbital mechanics
– Molecular dynamics
– Quantum mechanics
• Applied primarily to autonomous systems
Advantages of Geometric
Integration
• Usable for larger time steps and longer
integration times than generic methods
• Guaranteed to be qualitatively correct
even for chaotic systems
– Can preserve invariant tori
• More accurate for some or all time scales
• Sometimes cheaper computationally
Disadvantages of Geometric
Integration
• Structure to be preserved must be known
in advance
• Not generic – integrator must be specially
constructed for each problem
• Can typically only preserve one aspect of
structure (volume preservation, one first
integral…)
• Sometimes more expensive
computationally
Digression: Order Doesn’t Matter*
Theorem (Yoshida, Qin, and Zhu):
Let ψ be an integrator with order of accuracy n > 0. Then the
integrator χ defined by
1
χτ = ψ γτ ψ (1− 2γ )τ ψ γτ , where γ = (2 − 2 n +1 −1
)
• Integrator ψτ is volume-preserving if
⎛ ∂ψ τ ,i ⎞
det⎜ ⎟ =1
⎜ ∂x ⎟
⎝ j ⎠
• Note that
∂f m m −1
∂f i m −1
∂f i
= −∑ ⇒ f m = −∑ ∫ dxm
∂xm i =1 ∂xi i =1 ∂xi
• We can use this to split the original system
into m-1 Hamiltonian systems
Splitting Method
• For each j from 1 to m-1, get a 2D Hamiltonian
system:
∂H j
xj '=
∂xm
where H j = ∫ f j ( x)dxm
∂H j
xm ' = −
∂x j
• Solve each of these in sequence by your method
of choice
– May be simple enough to solve exactly
– If not, any symplectic integrator will do (symplectic
integrator = integrator that is a symplectic map, e.g.
Verlet method)
Correction Method
• Directly adjusts integrator to maintain
constant phase space volume
• Simplest case (based on Euler method):
x1,n +1 = x1,n + τ f1 ( ~
x)
⎛ ∂xi ,n +1 ⎞
J = det⎜ ⎟, i, j = 1, … , m − 1
~ where ⎜ ∂x ⎟
xm −1,n +1 = xm −1,n + τ f m −1 ( x ) ⎝ j ,n ⎠
~
x = ( x1,n , … , xm −1,n , xm ,n +1 )
xm ,n+1
~
∫ J ( x ) dx m , n +1 = x m ,n
• Implicit method
• Can be based on another method – could
obtain higher order or other properties too
Preserving a First Integral
• Many systems have first integrals
– Hamiltonian systems are the obvious example
• Preserving a first integral can provide
guarantees about system behavior
– In general: Level surfaces of the integral are invariant
sets of the system; preserving an integral means the
numerical solution also has those invariant sets
– e.g. orbital mechanics: Preserving energy
guarantees the orbiting body won’t erroneously fall
into the Sun or leave the solar system
How to Preserve a First Integral
• Given: System x′ = f(x), first integral I(x)
• Construct equivalent “skew gradient” system:
x' = S ∇I ( x), S T = − S
• Define skew discrete gradient system:
~
xn+1 − xn =τ S ∇I (xn , xn+1)
• Show that I(xn+1) = I(xn)
Finding the Matrix S
• Sometimes a matrix S is already known
– Hamiltonian systems: S = J if we’re preserving H
• Otherwise it’s easy to construct:
f (∇I )T − (∇I ) f T
S=
| ∇I | 2
• S is not unique
• If the critical points of I are nondegenerate, there
exists an S that is as smooth as f and the
derivatives of I
Finding the Discrete Gradient
• The discrete gradient must satisfy two
properties:
I ( xn +1 ) − I ( xn ) = ( ∇ I ( xn , xn +1 )) ⋅ ( xn +1 − xn )
∇ I ( xn , xn +1 ) = ∇I ( xn ) + O( xn +1 − xn )