• Aucun résultat trouvé

Geometric Numerical Integration

N/A
N/A
Protected

Academic year: 2021

Partager "Geometric Numerical Integration"

Copied!
8
0
0

Texte intégral

(1)

Geometric Numerical Integration

(Ernst Hairer, TU M¨unchen, winter 2009/10)

Development of numerical ordinary differential equations

• Nonstiff differential equations(since about 1850), see [4, 2, 1]

Adams (1855), multistep methods, problem of Bashforth (1883) Runge (1895) and Kutta (1901), one-step methods.

• Stiff differential equations(since about 1950), see [5, 2, 1]

Dahlquist (1963), A-stability of multistep methods Gear (1971), backward differentiation code.

• Geometric numerical integration(since 1986), see [3, 7, 6]

structure-preserving integration of differential equations, Hamiltonian, reversible, divergence-free, Poisson systems.

Provisional contents of the lectures

• Hamiltonian systems

– symplectic transformations, theorem of Poincar´e – generating functions

• Symplectic numerical integrators – St¨ormer–Verlet method

– symplectic Runge–Kutta methods – composition and splitting methods

• Backward error analysis

– long-time energy conservation

– perturbed integrable Hamiltonian systems

• Hamiltonian systems on manifolds

– constrained mechanical systems (DAE’s) – numerical integrator RATTLE

• Differential equations with highly oscillatory solutions – Fermi–Pasta–Ulam type problems

– modulated Fourier expansion

(2)

1 Hamiltonian system (double well potential)

Consider a differential equation

¨

q =−∇U(q) which can also be written as

˙ q = p

˙

p = −∇U(q) or q˙ = ∇pH(p, q)

˙

p = −∇qH(p, q) with H(p, q) = 1

2pTp+U(q).

We have energy conservation along exact solutions:

H p(t), q(t)

=Const

Numerical experiment with U(q) = (q2−1)2, taken from http://sma.epfl.ch/∼vilmart/

11/22/09 2:18 PM A quartic Hamiltonian system (double well)

Page 1 of 2 file:///Users/hairer/cours/geo_int/javaanim/martinet.html

init p(0)=0.0

H?

q(0)=0.01 stepsize h=0.05

Start x 1

speed=

30 ms sleep=

order 1: Symplectic Euler

Explicit Euler

qn+1 = qn+h pn

pn+1 = pn−h∇U(qn) Symplectic Euler

qn+1 = qn+h pn

pn+1 = pn−h∇U(qn+1) or qn+1 = qn+h pn+1

pn+1 = pn−h∇U(qn)

(3)

2 N-body problem (planetary motion)

Forpi, qi ∈R3we consider the Hamiltonian (kinetic plus potential energy) H(p, q) = 1

2

N

X

i=1

1

mi pTipi + X

1≤i<j≤N

Uij kqi−qjk

with the gravitational potential

Uij(r) =−Gmimj r

Illustration: sun – jupiter – saturn (http://sma.epfl.ch/∼vilmart/)

11/22/09 5:46 PM The three body problem Sun-Jupiter-Saturn

Page 1 of 2 file:///Users/hairer/cours/geo_int/javaanim/sunjupitersaturn.html

stepsize h= 3 order 1: Explicit Euler

Start restart speed= x 50

40 ms sleep=

Conserved quantities (first integrals):

• Hamiltonian (total energy) H(p, q)

• linear momentum P(p, q) =

N

X

i=1

pi

• angular momentum L(p, q) =

N

X

i=1

qi×pi

(4)

3 N-body problem (molecular dynamics)

N-body problem as before, but with Lennard–Jones potential Uij(r) = 4εij

σij r

12

−σij r

6

Numerical simulation with initial configuration (left picture) and solution after sufficiently long time (right picture), see http://sma.epfl.ch/∼vilmart/

11/22/09 6:20 PM Molecular dynamics simulation: Lennard-Jones potential

Page 1 of 2 file:///Users/hairer/cours/geo_int/javaanim/lennardjones.html

0.05 stepsize h=

order 2: Stormer-Verlet

Start restart speed= x 1

40 ms sleep=

11/22/09 5:47 PM Molecular dynamics simulation: Lennard-Jones potential

Page 1 of 2 file:///Users/hairer/cours/geo_int/javaanim/lennardjones.html

0.05 stepsize h=

order 2: Stormer-Verlet

Start restart speed= x 1

40 ms sleep=

4 Idea of backward error analysis

For a differential equation y˙ =f(y) consider a numerical solution obtained by a one-step method yn+1 = Φh(yn).

Find amodified differential equation y˙ =fh(y) of the form

˙

y=f(y) +hf2(y) +h2f3(y) +. . . ,

such that its solution ey(t) satisfies (formally) yn=y(nh)e .

(5)

Numerical experiment with double well potential.

The following pictures show the exact solution (in phase space(q, p)) and solu- tions of the modified equation for various numerical integrators.

exact solution explicit Euler

symplectic Euler symplectic Euler

explicit inp, implicit inq explicit inq, implicit inp Modified differential equation for explicit Euler:

˙ p

= p

−U0(q)

+ h 2

U0(q) U00(q)p

+ h2

4

−2U00(q)p 2U0U00−U000p2

+. . .

Modified differential equation for symplectic Euler (expl. inq, impl. inp):

˙ p

= p

−U0(q)

+ h 2

−U0(q) U00(q)p

+ h2

12

2U00(q)p

−2U0U00−U000p2

+. . .

this modified equation is Hamiltonian with H(p, q) =e 1

2p2+U(q)− h

2U0(q)p+h2 12

U0(q)2+U00(q)p2 +. . .

(6)

5 Constrained mechanical system

Graphics: J.-P. Eckmann & M. Hairer Position of corners

qi ∈R3, i= 0, . . . ,5 (6×3 = 18variables) Constraints

• motion of one piece (red) is prescribed, i.e., q0, q1, q2 are fixed (9 conditions),

• distances between neighbor corners is unity (4 conditions),

• orthogonality between neigh- bor edges (qn−1 − qn) ⊥ (qn+1−qn) (5 conditions).

Dynamics(red piece is fixed, corners have equal mass one, massless edges) H(p, q) = 1

2

5

X

i=3

pTipi+

5

X

i=3

qiz,

whereqiz is the vertical component ofqi.

We obtain a differential-algebraic equation (DAE)

˙

qi = ∇piH(p, q)

˙

pi = −∇qiH(p, q)−GT(q)λ 0 = g(q)

Here, q is the vector composed by q3, q4, q5 , p = ˙q is the velocity, g(q) = 0 represents the 9 constraints forq, andG(q) =g0(q)(matrix of dimension9×9).

(7)

6 Euler’s equations of motion for a free rigid body

The angular momentum vectory= (y1, y2, y3)Tsatisfies

˙

y1 = (I3−1−I2−1)y3y2

˙

y2 = (I1−1−I3−1)y1y3

˙

y3 = (I2−1−I3−1)y2y1

or

˙ y1

˙ y2

˙ y3

=

0 −y3 y2 y3 0 −y1

−y2 y1 0

 y1/I1 y2/I2 y3/I3

Hamiltonian: H(y) = 1 2

y12 I1+y22

I2+y32 I3

, Casimir: C(y) = 1 2

y21+y22+y23

1st picture: integration with explicit Euler

2nd picture: trapezoidal rule with projection onto the sphere 3rd picture: implicit midpoint rule

(8)

References

[1] J. C. BUTCHER, Numerical Methods for Ordinary Differential Equations, John Wiley & Sons Ltd., Chichester, 2nd ed., 2008.

[2] P. DEUFLHARD AND F. BORNEMANN, Numerische Mathematik 2, de Gruyter Lehrbuch. [de Gruyter Textbook], Walter de Gruyter & Co., Berlin, revised ed., 2008. Gew¨ohnliche Differentialgleichungen. [Ordinary differen- tial equations].

[3] E. HAIRER, C. LUBICH, AND G. WANNER, Geometric Numerical Integra- tion. Structure-Preserving Algorithms for Ordinary Differential Equations, Springer Series in Computational Mathematics 31, Springer-Verlag, Berlin, 2nd ed., 2006.

[4] E. HAIRER, S. P. NØRSETT, AND G. WANNER, Solving Ordinary Differen- tial Equations I. Nonstiff Problems, Springer Series in Computational Mathe- matics 8, Springer, Berlin, 2nd ed., 1993.

[5] E. HAIRER AND G. WANNER, Solving Ordinary Differential Equations II.

Stiff and Differential-Algebraic Problems, Springer Series in Computational Mathematics 14, Springer-Verlag, Berlin, 2nd ed., 1996.

[6] B. LEIMKUHLER AND S. REICH, Simulating Hamiltonian Dynamics, Cam- bridge Monographs on Applied and Computational Mathematics 14, Cam- bridge University Press, Cambridge, 2004.

[7] J. M. SANZ-SERNA AND M. P. CALVO, Numerical Hamiltonian problems, vol. 7 of Applied Mathematics and Mathematical Computation, Chapman &

Hall, London, 1994.

Références

Documents relatifs

In this appendix we give a brief discussion of the Regularity Estimate (2.1), and the existence of smooth solutions of the two-dimensional problem of least area for

It gives, in particular, a possibility to decide whether a reduced evolution operator corresponds to a total Hamiltonian with a spectrum bounded below.. In

Lelong, P.: Fonctionnelles analytiques et fonctions enti6res (n variables). Colloque sur les

Signalons que R. support dans S, sous des hypotheses assez generales sur S.. Courants positifs extr6maux et conjecture de Hodge 355 DtSmonstration.. On va encore

Let A( G) denote the size of vertex cover output by Algorithm 1.2. As in the case of normal Yes and No certificates, we do not require that this certifi- cate be polynomial

Recently, Deville and Till´ e (2004) proposed a general procedure, the cube method, that allows the selection of random balanced samples on several bal- ancing variables, with equal

Veloso (Eds.): Artificial Intelligence Today, LNAI 1600, pp... Veloso (Eds.): Artificial Intelligence Today, LNAI

This allows us to use Mathematica vectors to perform calculations with any finite-dimensional vector space, just as we have previously been doing with polynomial spaces.. This result