Shadowing Lemma and chaotic orbit determination Federica Spoto 1 , - - PowerPoint PPT Presentation

shadowing lemma and chaotic orbit determination
SMART_READER_LITE
LIVE PREVIEW

Shadowing Lemma and chaotic orbit determination Federica Spoto 1 , - - PowerPoint PPT Presentation

Shadowing Lemma and chaotic orbit determination Federica Spoto 1 , A. Milani 2 fspoto@oca.eu ote dAzur, CNRS 1 , Nice Laboratoire Lagrange, Observatoire de la C University of Pisa 2 , Pisa Dynamics and chaos in astronomy and physics 2016


slide-1
SLIDE 1

Shadowing Lemma and chaotic orbit determination

Federica Spoto1, A. Milani2

fspoto@oca.eu Laboratoire Lagrange, Observatoire de la Cˆ

  • te d’Azur, CNRS1, Nice

University of Pisa2, Pisa

Dynamics and chaos in astronomy and physics

2016 September 17-24, Luchon

slide-2
SLIDE 2

Chaotic orbit determination What happens if we need to have an accurate quantitative knowledge of chaotic orbits? “In fact because of the exponential variety of trajectories which exists, the rotation state at the midpoint of the interval covered by the observations, and the principal moments of inertia, are determined with exponential accuracy. Thus the knowledge gained from measurements on a chaotic dynamical system grows exponentially with the time span covered by the observations.”

Wisdom, J. Urey Prize Lecture: Chaotic Dynamics in the Solar System Icarus 72, 241-275 (1987)

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-3
SLIDE 3

Standard Map: Definition The standard map of the pendulum is a conservative discrete dynamical system, defined on a 2-dimensional torus, which has both ordered and chaotic orbits. Sµ(x0, y0) =

  • xk+1

= xk + yk+1 yk+1 = yk − µ sin(xk).

2.7 2.8 2.9 3 3.1 3.2 3.3 3.4 3.5 3.6 −0.2 −0.15 −0.1 −0.05 0.05 0.1 0.15 0.2 Standard map (mu=0.5) x y

The system has more regular

  • rbits for small µ, and more

chaotic orbits for large µ. We choose an intermediate value µ = 0.5, in such a way that both ordered and chaotic

  • rbits are present.
  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-4
SLIDE 4

Standard map linearization The least square parameter estimation process can be performed by an explicit formula.

  • Linearized map:

DS = ∂xk+1

xk ∂xk+1 yk ∂yk+1 xk ∂yk+1 yk

  • =

1 − µ cos(xk) 1 −µ cos(xk) 1

  • Linearized state transition matrix:

Ak = ∂(xk, yk) ∂(x0, y0); Ak+1 = DS Ak; A0 = I

  • Variational equation:

∂(xk+1, yk+1) ∂µ = DS ∂(xk, yk) ∂µ + ∂S ∂µ = DS ∂(xk, yk) ∂µ + − sin(xk) − sin(xk)

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-5
SLIDE 5

Standard map orbit determination I Observations process

  • Both coordinates x and y are observed at each iteration,

and the observations are Gaussian random variables with mean xk (yk, respectively) and standard deviation σ. Residuals

  • The residuals contain two components: a random one for

the observation error, and a systematic one because the true value µ0 is not the same as the current guess.

  • ξk

= xk(µ0, σ) − xk(µ1) ¯ ξk = yk(µ0, σ) − yk(µ1), with k = −n, . . . , n.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-6
SLIDE 6

Standard map orbit determination II

  • The least squares fit is obtained from the normal

equations: C =

n

  • k=−n

BT

k Bk; D = − n

  • k=−n

BT

k

ξk ¯ ξk

  • Bk =

∂(ξk, ¯ ξk) ∂(x0, y0, µ) = −

  • Ak|∂(xk, yk)

∂µ

  • An iteration of differential corrections is a correction ΓD
  • btained from the covariance matrix Γ = C−1.
  • At convergence of the iterations to the least squares

solution (x∗, y∗, µ∗), weights should be assigned to the residuals consistently with the probabilistic model.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-7
SLIDE 7

Shadowing Lemma: δ-pseudotrajectory δ-pseudotrajectory A δ-pseudotrajectory is a sequence of points (xk, yk) connected by an approximation of the map Φ, with error < δ at each step: |Φ(xk, yk) − (xk+1, yk+1)| < δ

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-8
SLIDE 8

Shadowing Lemma: ε-shadowing ε-shadowing The orbit with initial conditions (x, y) (ε, Φ)-shadows a δ-pseudotrajectory (xk, yk) if: |Φk(x, y) − (xk, yk)| < ε for every k.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-9
SLIDE 9

Shadowing Lemma Shadowing Lemma If Λ is an hyperbolic set for a diffeomorphism Φ, then there exists a neighborhood W of Λ such that for every ε > 0 there exists δ > 0 such that for every δ-pseudotrajectory in W there exists a point in W that ε-shadows the δ-pseudotrajectory.

  • An hyperbolic set is (rougly) an invariant set with every
  • rbit having a positive and a negative Lyapounov exponent.
  • There is an L > 0, function of the Lyapounov exponents,

such that δ < ε/L.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-10
SLIDE 10

Shadowing Lemma and least squares solution I To connect orbit determination and the Shadowing Lemma, we need to show first that the observations xk(µ0, σ), yk(µ0, σ) are a δ-pseudotrajectory for the dynamical system Sµ∗:

  • µ∗ is the value of the dynamical parameter found from the

least squares solution

  • δ =

√ 2|µ0 − µ∗| + Kσ

1 2 3 4 5 6 −2 −1.5 −1 −0.5 0.5 1 1.5 2 Delta−pseudotrajectory for the standard map x y (xdelta,ydelta) (x,y)

Example of a δ-pseudotrajectory. Initial conditions: x0 = 3, y0 = 0, µ0 = 0.5. Options: δµ = 10−1, σ = 10−3.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-11
SLIDE 11

Shadowing Lemma and least squares solution II

  • We select ε > Kσ: K is a number such that, at

convergence, no larger norm |(ξk, ¯ ξk)| is found among the residuals for −n ≤ k ≤ n

  • The orbit with initial conditions (x∗, y∗) ε-shadows the

δ-pseudotrajectory formed by the observations (xk, yk). Summary

  • The observations are a pseudotrajectory because of

errors and systematics due to imperfect knowledge of the dynamics.

  • The least squares solution is the shadowing of the
  • bservations.
  • The Shadowing Lemma is a minimization of the infinite

dimensional space of all orbits, while the orbit determination is a minimization of the norm of a finite number of residuals.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-12
SLIDE 12

Computability Horizon

−300 −200 −100 100 200 300 −30 −20 −10 10 20 30 Determinant and eigenvalues of the state transition matrix # iterations log

  • Max. eigenvalue
  • Min. eigenvalue
  • Initial conditions: x0 = 3, y0 = 0, µ0 = 0.5
  • Positive Lyapounov exponent is χ ≃ 0.091, and the

Lyapounov time is tL = 1/χ ≃ 11.

  • The numerical instability at k ≃ 200 occurs because

exp(200/tL) ∼ 108.

  • The inversion of the normal matrix C fails.
  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-13
SLIDE 13

Meaning of the computability horizon

−800 −600 −400 −200 200 400 600 800 −60 −40 −20 20 40 60 80 Determinant and eigenvalues of the state transition matrix # iterations log

  • Max. eigenvalue
  • Min. eigenvalue
  • The computability horizon is ≃ 600 iterations of S.
  • The computability horizon is an absolute barrier to the

determination of a least squares orbit.

  • We need to admit that we can only solve for a

δ-pseudotrajectory.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-14
SLIDE 14

Results: with and without dynamical parameter

100 200 300 400 500 600 700 800 −80 −70 −60 −50 −40 −30 −20 Uncertainty 2 parameters # iterations log σ x σ y 100 200 300 400 500 600 −70 −65 −60 −55 −50 −45 −40 −35 −30 −25 −20 Uncertainty 3 parameters # iterations log σ µ σ x σ y

  • Least squares solution for up to 600/700 iterates in

quadruple precision, by using a progressive method.

  • If the solutions has a fixed µ = µ0, the improvement in

accuracy is exponential in k.

  • If we solve for 2 initial conditions and µ, the improvements

is not exponential in at least two variables (including µ).

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-15
SLIDE 15

Loss of accuracy when adding a dynamical parameter

−300 −200 −100 100 200 300 −4 −2 2 4 6 8 10 12 Standard map (mu=0.5)

  • No. iterations

log10 dcsi/dmu

  • The much lower accuracy in the determination of µ and at

least one initial condition is not due to lack of sensitivity.

  • Correlations grow.
  • Orbit determination is degraded by aliasing.
  • This is a finite-time analog of the shadowing lemma.
  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-16
SLIDE 16

Results: chaotic orbit, power law improvement

1 2 3 4 5 6 7 −70 −60 −50 −40 −30 −20 −10 Decrease uncertainty and fit (3 par: x, y) log(# iterations) log σ x σ µ σ y

  • Power law accuracy improvement with the number n of

iterations like na with a = −0.675 for µ, a = −0.833 for x, while for y a power law is not appropriate.

  • The slopes are sensitive to the initial conditions.
  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-17
SLIDE 17

Results: ordered case, power law improvement

  • Initial conditions: x0 = 2, y0 = 0, µ0 = 0.5
  • The computability horizon disappears.
  • The Lyapounov exponent could be zero.
  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-18
SLIDE 18

Results: ordered case, gaussian statistics

1 2 3 4 5 6 7 8 9 −29 −28 −27 −26 −25 −24 −23 Decrease uncertainty and fit (3 par: x, y) log(# iterations) log σ x σ y σ µ

  • The difference between the case with 2 parameters and

the one with 3 disappears.

  • In a log-log plot we find an accuracy improvement na with

a = −0.504, −0.504, −0.488 for µ, x, y respectively.

  • We conjectured that the exponent is actually −0.5.
  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-19
SLIDE 19

Conclusions Orbit determination is possible only within the computability horizon. If a parameter is estimated, the least squares solution is a finite time span shadowing of the observations Chaotic orbit: the precision of the solution can grow only as a power law na with −1 < a < 0. Ordered orbit: the computability horizon is not a problem and the precision improvement is na with a ≃ −1/2. How soon will we find practical problems of dynamical astronomy in which we need to use these concepts and preliminary results?

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-20
SLIDE 20

Example from impact monitoring

−8 −6 −4 −2 2 4 6 8 −8 −6 −4 −2 2 4 6 8 ξ (unit R⊕) ζ (unit R⊕) −4 −3 −2 −1 1 2 3 4 −2 −1 1 2 3 4 5 xi, Earth radii zeta, Earth radii

  • The twin Virtual Impactors (VI) (connected patches of

initial conditions colliding with Earth) for asteroid (101955) Bennu in year 2182.

  • Orbits compatible with the observations (up to 2011) and a

Yarkovsky model.

  • Vertical axis is along the projection of Earth’s velocity onto

the TP .

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-21
SLIDE 21

Example from impact monitoring

5 10 15 20 25 30 35 40 45 −8 −6 −4 −2 2 4 6 8 10 12 shower no log10(abs(eigenvalues)) Eigenvalues of the state transition matrix

  • State transition matrix for the integral flow of the equations
  • f motion for (101955) Bennu, after the ca of 2182.
  • The eigenvalues are 6, 2 real and 4 complex, always in

couples λ, 1/λ.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)

slide-22
SLIDE 22

Determination of Yarkovsky effect

−6 −5 −4 −3 −2 −1 1 2 x 10

6

1 2 3 4 5 6 x 10

−6

ζ2185 − km

  • Prob. Density − km−1

10

−1

10 10

1

10

2

10

3

Keyhole Width − km

  • Prediction on the Target Plane of an encounter in the 2185

with a Yarkovsky dynamical parameter estimated, and without it.

  • The keyholes for impact in the year 2185 to 2196 are all in

the possible range of values with Yarkovsky.

  • F. Spoto

Chaotic orbit determination Luchon (2016 Sept. 19)