Convergence of the Square Root Ensemble Kalman Filter in the Large Ensemble Limit

Abstract

Ensemble filters implement sequential Bayesian estimation by representing the probability distribution by an ensemble mean and covariance. Unbiased square root ensemble filters use deterministic algorithms to produce an analysis (posterior) ensemble with prescribed mean and covariance, consistent with the Kalman update. This includes several filters used in practice, such as the Ensemble Transform Kalman Filter (ETKF), the Ensemble Adjustment Kalman Filter (EAKF), and a filter by Whitaker and Hamill. We show that at every time index, as the number of ensemble members increases to infinity, the mean and covariance of an unbiased ensemble square root filter converge to those of the Kalman filter, in the case a linear model and an initial distribution of which all moments exist. The convergence is in $L^p$ and the convergence rate does not depend on the model dimension. The result holds in the infinitely dimensional Hilbert space as well.

14 pages, final draft

Cited by in corpus (7)

• Non-Asymptotic Analysis of Ensemble Kalman Updates: Effective Dimension and Localization
• Mean field limit of Ensemble Square Root Filters -- discrete and continuous time
• Gradient flow structure and convergence analysis of the ensemble Kalman inversion for nonlinear forward models
• Ensemble Kalman Filters with Resampling
• Uniform error bounds of the ensemble transform Kalman filter for infinite-dimensional dynamics with multiplicative covariance inflation
• Adaptive regularisation for ensemble Kalman inversion
• EnKSGD: A Class Of Preconditioned Black Box Optimization And Inversion Algorithms