Probing robustness of nonlinear filter stability numerically using Sinkhorn divergence
arXiv:2208.10810 · doi:10.1016/j.physd.2023.133765
Abstract
Using the recently developed Sinkhorn algorithm for approximating the Wasserstein distance between probability distributions represented by Monte Carlo samples, we demonstrate exponential filter stability of two commonly used nonlinear filtering algorithms, namely, the particle filter and the ensemble Kalman filter, for deterministic dynamical systems. We also establish numerically a relation between filter stability and filter convergence by showing that the Wasserstein distance between filters with two different initial conditions is proportional to the bias or the RMSE of the filter.
arXiv comment14 pages, 2 figures, 2 tables
References in corpus (6)
- Well-Posedness And Accuracy Of The Ensemble Kalman Filter In Discrete And Continuous Time
- Stability properties of some particle filters
- Controlling instabilities along a 3DVar analysis cycle by assimilating in the unstable subspace: a comparison with the EnKF
- Controlling Unpredictability with Observations in the Partially Observed Lorenz '96 Model
- Stability of Non-linear Filter for Deterministic Dynamics
- Exponential stability and asymptotic properties of the optimal filter for signals with deterministic hyperbolic dynamics