Search arXivSearch

arXiv · 1203.5845

Accuracy and Stability of Filters for Dissipative PDEs

Abstract

Data assimilation methodologies are designed to incorporate noisy observations of a physical system into an underlying model in order to infer the properties of the state of the system. Filters refer to a class of data assimilation algorithms designed to update the estimation of the state as data is acquired sequentially. For linear problems subject to Gaussian noise filtering can be performed exactly using the Kalman filter. For nonlinear systems it can be approximated in a systematic way by particle filters. However in high dimensions these particle filtering methods can break down. Hence, for the large nonlinear systems arising in applications such as oceanography and weather forecasting, various ad hoc filters are used, based on Gaussian approximations. In this work, we study the accuracy and stability of these ad hoc filters in the context of the 2D incompressible Navier-Stokes equation. The ideas readily generalize to a range of dissipative partial differential equations (PDEs). By working in this infinite dimensional setting we provide an analysis which is useful for the understanding of high dimensional filtering, and is robust to mesh-refinement. We describe theoretical results showing that, in the small observational noise limit, the filters can be tuned to perform accurately in tracking the signal itself (filter accuracy), provided the system is observed in a sufficiently large low dimensional space; roughly speaking this space should be large enough to contain the unstable modes of the linearized dynamics. The tuning corresponds to what is known as variance inflation in the applied literature. Numerical results are given which illustrate the theory. The positive results herein concerning filter stability complement recent numerical studies which demonstrate that the ad hoc filters can perform poorly in reproducing statistical variation about the true signal.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

C. E. A. Brett, K. F. Lam, K. J. H. Law, D. S. McCormick, M. R. Scott, A. M. Stuart. 2013-08-05. Accuracy and Stability of Filters for Dissipative PDEs. https://doi.org/10.1016/j.physd.2012.11.005

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

KEEP EXPLORING

Related papers

Strategic Inference in Stackelberg Games: Optimal Control for Revealing Adversary Intent

We study a continuous-time stochastic Stackelberg game in which a leader seeks to accomplish a primary objective while inferring a hidden parameter of a rational follower. The follower solves an entropy-regularized linear-quadratic tracking problem and responds to the leader's trajectory with a randomized policy. Anticipating this response, the leader designs informative controls to maximize the estimation efficiency for the follower's latent intent, through maximum likelihood estimation. Unlike prior work on discrete-time or finite-candidate inverse learning, our framework enables continuous parameter inference without prior assumptions and endogenizes the information source through the follower's strategic feedback. We derive semi-explicit solutions, prove well-posedness, and develop recurrent neural network algorithms to approximate the leader's path-dependent control. Numerical experiments demonstrate how the leader balances task performance and information gain, highlighting the practical value of our approach for adversarial strategic inference.

math.OC

Stratification for Nonlinear Semidefinite Programming

This paper introduces a stratification framework for nonlinear semidefinite programming (NLSDP) that reveals and utilizes the geometry behind the nonsmooth KKT system. Based on the index stratification of $\mathbb{S}^n$ and its lift to the primal-dual space, a stratified variational analysis is developed. Specifically, we define the stratum-restricted regularity property, characterize it by the verifiable weak second order condition (W-SOC) and weak strict Robinson constraint qualification (W-SRCQ), and interpret the W-SRCQ geometrically via transversality, with stability along strata. The interactions of these properties across neighboring strata are further examined, leading to the conclusion that classical strong-form regularity conditions correspond to the local uniform validity of stratum-restricted counterparts. On the algorithmic side, a stratified Gauss--Newton method with normal steps and a correction mechanism is proposed for globally solving the KKT equation through a least-squares merit function. We demonstrate that the algorithm converges globally to directional stationary points. Moreover, under the second order sufficient condition (SOSC) and the strict Robinson constraint qualification (SRCQ) at an accumulation point, with a suitable correction threshold, the whole sequence converges superlinearly to this point, which is a KKT pair, and eventually identifies the active stratum. The rate is quadratic if the problem data are additionally of class $LC^2$ near the solution.

math.OC

Convergence Rate Analysis of SOAP with Arbitrary Orthogonal Projection Matrices

In this short note, we establish, for the first time, the convergence rate of SOAP, an efficient and popular matrix-based optimizer for training deep neural networks. Our analysis extends to a more general variant of SOAP that admits arbitrary orthogonal projection matrices and requires only that these matrices be conditionally independent of the current stochastic gradient at each iteration. For example, they may be constructed from information available up to the preceding step.

math.OC