Presentation is loading. Please wait.

Presentation is loading. Please wait.

Nonlinear Data Assimilation using an extremely efficient Particle Filter Peter Jan van Leeuwen Data-Assimilation Research Centre University of Reading.

Similar presentations


Presentation on theme: "Nonlinear Data Assimilation using an extremely efficient Particle Filter Peter Jan van Leeuwen Data-Assimilation Research Centre University of Reading."— Presentation transcript:

1

2 Nonlinear Data Assimilation using an extremely efficient Particle Filter Peter Jan van Leeuwen Data-Assimilation Research Centre University of Reading

3 The Agulhas System

4 In-situ observations

5

6 In situ observations Transport through Mozambique Channel

7 Data assimilation Uncertainty points to use of probability density functions. P(u) u (m/s)

8 Data assimilation: general formulation Solution is pdf! NO INVERSION !!! Bayes theorem:

9 How is this used today? Present-day data-assimilation systems are based on linearizations and search for one optimal state: (Ensemble) Kalman filter: assumes Gaussian pdfs 4DVar: smoother assumes Gaussian pdf for initial state and observations (no model errors) Representer method: as 4DVar but with Gaussian model errors Combinations of these

10 Prediction: smoothers vs. filters The smoother solves for the mode of the conditional joint pdf p( 0:T | d 0:T ) (modal trajectory). The filter solves for the mode of the conditional marginal pdf p( T | d 0:T ). For linear dynamics these give the same prediction.

11 Filters maximize the marginal pdf These are not the same for nonlinear problems !!! Smoothers maximize the joint pdf

12 Example n+1 = 0.5 n + _________ + n 2 n 1 + e ( n - 7) 0 ~ N(-0.1, 10) Nonlinear model Initial pdf n ~ N(0, 10) Model noise

13 Example: marginal pdfs 0 n Note: mode is at x= - 0.1Note: mode is at x=8.5

14 0 n Example: joint pdf Mode joint pdf Modes marginal pdfs

15 And what about the linearizations? Kalman-like filters solve for the wrong state: gives rise to bias. Variational methods use gradient methods, which can end up in local minima. 4DVar assumes perfect model: gives rise to bias.

16 Where do we want to go? Represent pdf by an ensemble of model states Fully nonlinear Time

17 How do we get there? Particle filter? Use ensemble with the weights.

18 What are these weights? The weight w_i is the pdf of the observations given the model state i. For M independent Gaussian distributed observation errors:

19 Standard Particle filter

20 Particle Filter degeneracy: resampling With each new set of observations the old weights are multiplied with the new weights. Very soon only one particle has all the weight… Solution: Resampling: duplicate high-weight particles are abandon low-weight particles

21 Problems Probability space in large-dimensional systems is empty: the curse of dimensionality u(x1) u(x2) T(x3)

22 Standard Particle filter Not very efficient !

23 Specifics of Bayes Theorem I We know from Bayes Theorem: Now use : in which we introduced the transition density

24 Specifics of Bayes Theorem II q is the proposal transition density, which might be conditioned on the new observations! This can be rewritten as : This leads finally to:

25 Specifics of Bayes Theorem III How do we use this? A particle representation of Giving: Now we choose from the proposal transition density for each particle i.

26 Particle filter with proposal density Stochastic model Proposed stochastic model: Leads to particle filter with weights

27 Meaning of the transition densities = the probability of this specific value for the random model error. For Gaussian model errors we find: A similar expression is found for the proposal transition

28 Particle filter with proposal transition density

29 Experiment: Lorentz 1963 model (3 variables x,y,z, highly nonlinear) x-value y-value Measure only X-variable

30 Standard Particle filter with resampling 20 particles X-value Time Typically 500 particles needed !

31 Particle filter with proposal transition density 3 particles X-value Time

32 Particle filter with proposal transition density 3 particles Y-value (not observed) Time

33 However: degeneracy For large-scale problems with lots of observations this method is still degenerate: Only a few particles get high weights; the other weights are negligibly small. However, we can enforce almost equal weight for all particles:

34 Equal weights 1.Write down expression for each weight with q deterministic: 2. When H is linear this is a quadratic function in for each particle. 3. Determine the target weight: Prior transition density Likelihood

35 Almost Equal weights I Target weight 4. Determine corresponding model states, e.g. solving alpha in

36 Almost equal weights II But proposal density cannot be deterministic: Add small random term to model equations from a pdf with broad wings e.g. Gauchy Calculate the new weights, and resample if necessary

37 Application: Lorenz 1995 N=40F=8 dt = 0.005T = 1000 dt Observe every other grid point Typically 10,000 particles needed

38 Ensemble mean after 500 time steps 20 particles Position

39 Ensemble evolution at x=20 20 particles Time step

40 Ensemble evolution at x=35 (unobserved) 20 particles

41 Isnt nudging enough? Only nudgedNudged and weighted

42 Isnt nudging enough? Only nudgedNudged and weighted Unobserved variable

43 Conclusions The nonlinearity of our problem is growing Particle filters with proposal transition density: solve for fully nonlinear solution very flexible, much freedom application to large-scale problems straightforward

44 Future Fully nonlinear filtering (smoothing) forces us to concentrate on the transition densities, so on the errors in the model equations. What is the sensitivity to our choice of the proposal? What can we learn from studying the statistics of the nudging terms? How do we use the pdf???


Download ppt "Nonlinear Data Assimilation using an extremely efficient Particle Filter Peter Jan van Leeuwen Data-Assimilation Research Centre University of Reading."

Similar presentations


Ads by Google