SearcharxivSearch

arXiv · 2010.16401

Approximation of the Filter Equation for Multiple Timescale, Correlated, Nonlinear Systems

Abstract

This paper considers the approximation of the continuous time filtering equation for the case of a multiple timescale (slow-intermediate, and fast scales) that may have correlation between the slow-intermediate process and the observation process. The signal process is considered fully coupled, taking values in $\mathbb{R^{m}} \times \mathbb{R^{n}}$ and without periodicity assumptions on coefficients. It is proved that in the weak topology, the solution of the filtering equation converges in probability to a solution of a lower dimensional averaged filtering equation in the limit of large timescale separation. The method of proof uses the perturbed test function approach (method of corrector) to handle the intermediate timescale in showing tightness and characterization of limits. The correctors are solutions of Poisson equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Ryne Beeson, N. Sri Namachchivaya, Nicolas Perkowski. 2020-10-30. Approximation of the Filter Equation for Multiple Timescale, Correlated, Nonlinear Systems. https://arxiv.org/abs/2010.16401

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