SearcharxivSearch

arXiv · 2511.10814

Convergence of the extended Kalman filter with small and state-dependent noise

Abstract

Nonlinear filtering problems are encountered in many applications, and one solution approach is the extended Kalman filter, which is not always convergent. Therefore, it is crucial to identify conditions under which the extended Kalman filter provides accurate approximations. This paper generalizes two significant results of Picard (1991) on the efficiency of the continuous-time extended Kalman filter for a filtering system with small noise, to a more general setting where the observation noise may be state-dependent but does not allow signal reconstruction from the quadratic variation of the observation process as for example in epidemic models. First, we show that if the drift of the signal process and the observation process becomes nearly linear when the parameter $\epsilon$, which scales the diffusion coefficients, approaches zero, and the drift coefficient of the observation process is strongly injective, then the estimation error is of the order of $\sqrt{\epsilon}$. We then establish conditions under which the impact of the initial filtering error decays exponentially fast.

Explore related subjects

Keep this discovery

BibTeXRIS

Ibrahim Mbouandi Njiasse, Florent Ouabo Kamkumo, Ralf Wunderlich. 2025-11-13. Convergence of the extended Kalman filter with small and state-dependent noise. https://arxiv.org/abs/2511.10814

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