Long-time Asymptotics of the Filtering Distribution for Partially Observed Chaotic Dynamical Systems

Abstract

The filtering distribution is a time-evolving probability distribution on the state of a dynamical system, given noisy observations. We study the large-time asymptotics of this probability distribution for discrete-time, randomly initialized signals that evolve according to a deterministic map $\Psi$. The observations are assumed to comprise a low-dimensional projection of the signal, given by an operator $P$, subject to additive noise. We address the question of whether these observations contain sufficient information to accurately reconstruct the signal. In a general framework, we establish conditions on $\Psi$ and $P$ under which the filtering distributions concentrate around the signal in the small-noise, long-time asymptotic regime. Linear systems, the Lorenz '63 and '96 models, and the Navier Stokes equation on a two-dimensional torus are within the scope of the theory. Our main findings come as a by-product of computable bounds, of independent interest, for suboptimal filters based on new variants of the 3DVAR filtering algorithm.

References in corpus (6)

• Can local particle filters beat the curse of dimensionality?
• Evaluating Data Assimilation Algorithms
• Well-Posedness And Accuracy Of The Ensemble Kalman Filter In Discrete And Continuous Time
• Discrete Data Assimilation in the Lorenz and 2D Navier--Stokes Equations
• Accuracy and Stability of The Continuous-Time 3DVAR Filter for The Navier-Stokes Equation
• Controlling Unpredictability with Observations in the Partially Observed Lorenz '96 Model