Ensemble redrawing in strongly nonlinear systems Pavel Sakov 1 Marc - - PowerPoint PPT Presentation

ensemble redrawing in strongly nonlinear systems
SMART_READER_LITE
LIVE PREVIEW

Ensemble redrawing in strongly nonlinear systems Pavel Sakov 1 Marc - - PowerPoint PPT Presentation

Ensemble redrawing in strongly nonlinear systems Pavel Sakov 1 Marc Bocquet 2 3 1 Bureau of Meteorology, Melbourne, Australia 2 Universit e Paris-Est, CEREA, Champs-sur-Marne, France 3 INRIA, Paris Rocquencourt research centre, France EnKF


slide-1
SLIDE 1

Ensemble redrawing in strongly nonlinear systems

Pavel Sakov 1 Marc Bocquet 2 3

1Bureau of Meteorology, Melbourne, Australia 2Universit´

e Paris-Est, CEREA, Champs-sur-Marne, France

3INRIA, Paris Rocquencourt research centre, France

EnKF workshop, Bergen 22-24 May 2013

slide-2
SLIDE 2

Outline

Motivation (strongly nonlinear systems) Example Some details IEnKF IEnKF with ensemble redrawing EnKF solution space and IEnKF solution Algorithm L40 Addendum On ensemble redrawing in large-scale systems Scaled rotations Conclusions

slide-3
SLIDE 3

Motivation: an example with 3-variable Lorenz model

slide-4
SLIDE 4

Motivation: an example with 3-variable Lorenz model

slide-5
SLIDE 5

Example 1: fast convergence

slide-6
SLIDE 6

Example 1: fast convergence

slide-7
SLIDE 7

Example 1: fast convergence

slide-8
SLIDE 8

Example 1: fast convergence

slide-9
SLIDE 9

Example 2: Slower convergence

slide-10
SLIDE 10

Example 2: Slower convergence

slide-11
SLIDE 11

Example 2: Slower convergence

slide-12
SLIDE 12

Example 2: Slower convergence

slide-13
SLIDE 13

Example 2: Slower convergence

slide-14
SLIDE 14

Example 2: Slower convergence

slide-15
SLIDE 15

Example 2: Slower convergence

slide-16
SLIDE 16

Example 3: Divergence

slide-17
SLIDE 17

Example 3: Divergence

slide-18
SLIDE 18

Example 3: Divergence

slide-19
SLIDE 19

Example 3: Divergence

slide-20
SLIDE 20

Example 3: Divergence

slide-21
SLIDE 21

Example 3: Divergence

slide-22
SLIDE 22

Example 3: Divergence

slide-23
SLIDE 23

IEnKS

Lag-L smoother

  • bs.
  • bservations

assimilated at previous cycles

  • bservations

assimilated at this cycle updated state model states cycle # L−1 L L+1 1 2 3

slide-24
SLIDE 24

IEnKS (Gauss-Newton, transform)

x(0) = E0 1/m, A(0) = E0 − x(0)

0 ,

w = 0, T = I repeat x0 = x(0) + A(0)

0 w

E0 = x01T + A(0)

0 T

EL = M0→L(E0) Hx = H(EL) 1/m HA = [H(EL) − Hx] T−1 ∇J = (HA)TR−1(y − Hx)/(m − 1) + [(A(0)

0 )TA(0) 0 ]†(A(0) 0 )T(x(0)

− x0) M = I + (HA)TR−1HA/(m − 1) ∆w = M−1∇J w = w + ∆w T = M−1/2 until ∆w < ε E1 = M0→1(E0) inflate E1

slide-25
SLIDE 25

IEnKS (Gauss-Newton, regression)

x(0) = E0 1/m, A(0) = E0 − x(0)

0 ,

w = 0, T = I repeat x0 = x(0) + A(0)

0 w

E0 = x01T + A(0)

0 T

EL = M0→L(E0) Hx = H(EL) 1/m HA = [H(EL) − Hx], HM = HA(A(0)

0 T)†,

HA = HM A(0) ∇J = (HA)TR−1[y − Hx + HM(x0 − x(0)

0 )]/(m − 1)

M = I + (HA)TR−1HA/(m − 1) ∆w = M−1∇J w = w + ∆w T = M−1/2 until ∆w < ε E1 = M0→1(E0) inflate E1

slide-26
SLIDE 26

IEnKS (Gauss-Newton, transform, revisited)

x(0) = E0 1/m, A(0) = E0 − x(0)

0 ,

w = 0, T = I repeat x0 = x(0) + A(0)

0 w

E0 = x01T + A(0)

0 T

EL = M0→L(E0) Hx = H(EL) 1/m HA = [H(EL) − Hx] T−1 ∇J = (HA)TR−1(y − Hx)/(m − 1) − w (Bocquet and Sakov, 2012) M = I + (HA)TR−1HA/(m − 1) ∆w = M−1∇J w = w + ∆w T = M−1/2 until ∆w < ε E1 = M0→1(E0) inflate E1

slide-27
SLIDE 27

IEnKS: two formulations

State space formulation:

xa

0 = arg min {x0}

  • (x0 − x(0)

0 )T(P(0) 0 )−1(x0 − x(0) 0 )

+ [yL − HL(xL)]T (RL)−1 [yL − HL(xL)]

  • ,

xL = M0→L(x0)

Ensemble space formulation:

w = arg min

{w}

  • wTw + [yL − HL(xL)]T (RL)−1 [yL − HL(xL)]
  • ,

xL = M0→L(x(0) + A(0)

0 w)

(Equivalence - see Hunt et al. 2007)

slide-28
SLIDE 28

EnKF solution space and IEnKF solution

◮ Let A be analysed ensemble anomalies in the EnKF ◮ Then ˜

A = A U, where U : UT = I, U 1 = 1 is also a KF solution

w = arg min

{w}

  • wTw + [yL − HL(xL)]T (RL)−1 [yL − HL(xL)]
  • ,

xL = M0→L(x(0) + A(0)

0 w)

A ← AU : ˜ w = arg min

{˜ w}

  • ˜

wT ˜ w + [yL − HL(xL)]T (RL)−1 [yL − HL(xL)]

  • ,

xL = M0→L(x(0) + A(0)

0 ˜

w), where ˜ w ≡ Uw

Hence the ensemble redrawing can result in:

◮ A slightly different solution due to estimating the sensitivities

from an ensemble of finite spread

◮ Convergence to another minimum due to the different initial

state of the system

slide-29
SLIDE 29
slide-30
SLIDE 30

Algorithm

IEnKF cycle with redrawing: repeat <iterate> if <diverged> <re-initialise the cycle> <redraw the forecast ensemble> continue end if until <success>

slide-31
SLIDE 31

Algorithm

Rolling back: repeat <IEnKF cycle with redrawing> if <failed> <go back > <redraw the analysed ensemble> end if until <success >

slide-32
SLIDE 32

Performance with L3

slide-33
SLIDE 33

IEnKF: performance log

slide-34
SLIDE 34

IEnKF vs. IEnKF-N: baseline peformance

slide-35
SLIDE 35

IEnKS-N

. . . repeat . . . ∇J = (HA)TR−1(y − Hx)/(m − 1) − w becomes ∇J = (HA)TR−1(y − Hx)/(m − 1) − m w/(εN + wTw)/(m − 1) . . . until ∆w < ε E1 = M0→1(E0) inflate E1 becomes c = εN + wTw M = m (c I − 2wwT)/c2/(m − 1) + (HA)TR−1HA/(m − 1) E0 = x01T + A(0)

0 M−1/2

E1 = M0→1(E0)

slide-36
SLIDE 36

Performance with L40 (global)

slide-37
SLIDE 37

Performance with L40 (local)

slide-38
SLIDE 38

How bad is going local?

EnKF IEnKF/R IEnKF IEnKF-N/R

slide-39
SLIDE 39

Inflation: prior or posterior?

slide-40
SLIDE 40

IEnKF vs. MDA

slide-41
SLIDE 41

Scaled rotations

Givens rotation: (col. i) (col. j) ˆ U(i, j, θ) =         1 . . . . . . . . . 1 . . . . . . . . . . . . cos(θ) . . . − sin(θ) . . . . . . . . . . . . . . . sin(θ) . . . cos(θ) . . . . . . . . . . . . 1         (row i) (row j) ˆ Uˆ UT = 1 General rotation: U =

m

  • i,j=1; i≥j

ˆ U(i, j, θij) Scaled rotation: U(ε) =

m

  • i,j=1; i≥j

U(i, j, εθij), ε ∈ [0, 1]

slide-42
SLIDE 42

Conclusions

◮ Ensemble redrawing is a useful option for iterative schemes ◮ Can be particularly useful in strongly nonlinear situations ◮ It can also be useful to handle occasional instabilities ◮ A system rollback is also often required to achieve positive

results

◮ The ensemble redrawing can be localised by using scaled

ensemble rotations Other results:

◮ IEnKF-N seems to have a better baseline performance in

strongly nonlinear situations

◮ Prior inflation seems to work better than the posterior

inflation in stronlgy nonlinear situations

◮ MDA can often perform almost equally with the IEnKF

Thank you!

slide-43
SLIDE 43

References

Bocquet, M., 2011: Ensemble Kalman filtering without the intrinsic need for inflation. Nonlinear Proc. Geoph., 18, 735–750. Bocquet, M. and P. Sakov, 2012: Combining inflation-free and iterative ensemble Kalman filters for strongly nonlinear systems. Nonlinear Proc. Geoph., 19, 383–399. Emerick, A. A. and A. C. Reynolds, 2013: History matching time-lapse seismic data using the ensemble kalman filter with multiple data assimilations. Computat. Geosci., 16, 639–659. Gu, Y. and D. S. Oliver, 2007: An iterative ensemble Kalman filter for multiphase fluid flow data assimilation. SPE Journal, 12, 438–446. Hunt, B. R., E. J. Kostelich, and I. Szunyogh, 2007: Efficient data assimilation for spatiotemporal chaos: A local ensemble transform Kalman filter. Physica D, 230, 112–126. Sakov, P., D. S. Oliver, and L. Bertino, 2012: An iterative EnKF for strongly nonlinear

  • systems. Mon. Wea. Rev., 140, 1988–2004.

Yang, S.-C., E. Kalnay, and B. Hunt, 2012: Handling nonlinearity and non-Gaussianity in the Ensemble Kalman Filter: Experiments with the three-variable Lorenz model.

  • Mon. Wea. Rev., 140, 2628–2646.