Ensemble Kalman Filters with Resampling

Abstract

Filtering is concerned with online estimation of the state of a dynamical system from partial and noisy observations. In applications where the state of the system is high dimensional, ensemble Kalman filters are often the method of choice. These algorithms rely on an ensemble of interacting particles to sequentially estimate the state as new observations become available. Despite the practical success of ensemble Kalman filters, theoretical understanding is hindered by the intricate dependence structure of the interacting particles. This paper investigates ensemble Kalman filters that incorporate an additional resampling step to break the dependency between particles. The new algorithm is amenable to a theoretical analysis that extends and improves upon those available for filters without resampling, while also performing well in numerical examples.

32 pages, 5 figures

References in corpus (6)

• The Ensemble Kalman Filter for Inverse Problems
• Evaluating Data Assimilation Algorithms
• On the Convergence of the Ensemble Kalman Filter
• Convergence of the Square Root Ensemble Kalman Filter in the Large Ensemble Limit
• Controlling Unpredictability with Observations in the Partially Observed Lorenz '96 Model
• Optimal filtering and the dual process

Cited by in corpus (2)

• Non-Asymptotic Analysis of Ensemble Kalman Updates: Effective Dimension and Localization
• Covariance Operator Estimation via Adaptive Thresholding