Math 2.0

Geophysics Definition

Ensemble Kalman filter

Builds on Covariance matrixMonte Carlo method

Definition

Let the state of a system at time tkt_k be a vector in ℝn\R^n. Let the model Mk ⁣:ℝn→ℝnM_k \colon \R^n \to \R^n map the state at tkt_k to the state at tk+1t_{k+1}. Let the observation at tkt_k be yk=Hxk+εky_k = H x_k + \varepsilon_k, where HH is an m×nm \times n matrix. The noise εk\varepsilon_k is Gaussian with mean 00 and positive definite covariance matrix RR of size m×mm \times m. Fix an ensemble size N≥2N \ge 2. The ensemble Kalman filter carries an ensemble x(1),…,x(N)x^{(1)}, \dots, x^{(N)} of states and repeats two steps.

  1. Forecast step: replace each member by xf,(i)=Mk(x(i))x^{f,(i)} = M_k(x^{(i)}), possibly plus a sample of model noise.
  2. Analysis step: compute the ensemble mean xˉf=1N∑ixf,(i)\bar x^f = \frac{1}{N} \sum_i x^{f,(i)} and the sample covariance Pf=1N−1∑i=1N(xf,(i)−xˉf)(xf,(i)−xˉf)T.P^f = \frac{1}{N - 1} \sum_{i=1}^{N} (x^{f,(i)} - \bar x^f)(x^{f,(i)} - \bar x^f)^T. Set the gain K=PfHT(HPfHT+R)−1K = P^f H^T (H P^f H^T + R)^{-1}. Draw independent perturbations ε(i)\varepsilon^{(i)} with mean 00 and covariance RR, and replace each member by xa,(i)=xf,(i)+K(yk+1+ε(i)−Hxf,(i)).x^{a,(i)} = x^{f,(i)} + K \big( y_{k+1} + \varepsilon^{(i)} - H x^{f,(i)} \big).

The ensemble mean after the analysis step is the estimate of the state, and the spread of the ensemble is the estimate of its uncertainty.

Remarks

Example: for a scalar state with H=1H = 1, forecast members with sample variance Pf=1P^f = 1 and R=1R = 1, the gain is K=1/2K = 1/2. Each member moves halfway toward its perturbed observation, as in the scalar Kalman filter with the same variances. For a linear model and Gaussian noise, the ensemble mean and covariance converge to those of the Kalman filter as N→∞N \to \infty; the sampling is a Monte Carlo method.

Non-example: with N=1N = 1 the sample covariance is not defined, and there is no gain to compute; the condition N≥2N \ge 2 fails.

The perturbed observations ε(i)\varepsilon^{(i)} keep the analysis spread consistent with the Kalman filter. Square-root variants update the ensemble deterministically without perturbing the observations. For small ensembles in large models, the sample covariance is usually damped at long distances (localisation) and inflated by a factor slightly above 11.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Covariance matrix concept
  2. Monte Carlo method concept
  3. Ensemble Kalman filter definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Ensemble_Kalman_filter
About this page
Tag90VRF3WE0Q
URIm2://90VRF3WE0Q
Kinddefinition
WritingW0 stub
MSC86A22, 93E11, 62M20
DefinesEnsemble Kalman filter
UsesCovariance matrix, Monte Carlo method
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.