Asymptotic convergence of the ensemble Kalman filter

This paper formally addresses the asymptotic convergence of the ensemble Kalman filter (EnKF), a state estimation procedure that, when combined with a technique called localization, provides computationally tractable solutions to large-dimensional state estimation problems. The proof presented in this paper shows that the estimates given by the EnKF converge to the optimal estimates given by the Kalman filter (KF) and provides a formal justification for the use of the EnKF in dynamic remote sensing image formation. The implications of the proof are twofold: it shows that the EnKF converges to a well-defined limit and provides a formal argument that the EnKF is in fact a Monte Carlo algorithm that converges to the KF.