SearcharxivSearch

arXiv · 1910.12493

On the continuous time limit of Ensemble Square Root Filters

Abstract

We provide a continuous time limit analysis for the class of Ensemble Square Root Filter algorithms with deterministic model perturbations. In the particular linear case, we specify general conditions on the model perturbations implying convergence of the empirical mean and covariance matrix towards their respective counterparts of the Kalman-Bucy Filter. As a second main result we identify additional assumptions for the convergence of the whole ensemble towards solutions of the Ensemble Kalman-Bucy filtering equations introduced in [1]. The latter result can be generalized to nonlinear Lipschitz-continuous model operators. A striking implication of our results is the fact that the limiting equations for the ensemble members are universal for a large class of Ensemble Square Root Filters. This yields a mathematically rigorous justification for the analysis of these algorithms with the help of the Ensemble Kalman-Bucy Filter. [1] de Wiljes, Jana, Reich, Sebastian, Stannat, Wilhelm, Long-Time Stability and Accuracy of the Ensemble Kalman-Bucy Filter for Fully Observed Processes and Small Measurement Noise. SIAM Journal on Applied Dynamical Systems, Vol. 17, No. 2, 1152-1181, 2018

Explore related subjects

Keep this discovery

BibTeXRIS

Theresa Lange, Wilhelm Stannat. 2019-10-28. On the continuous time limit of Ensemble Square Root Filters. https://doi.org/10.4310/cms.2021.v19.n7.a5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR