Search arXivSearch

arXiv · 2607.27432

Dynamical Low-Rank Filters for Data Assimilation

Abstract

We propose dynamical low-rank (DLR) type filters for data-assimilation problems based on stochastic differential equations (SDEs). In detail, first we derive a DLRA filter for minimizing jointly the mean and covariance error, as well as a strategy to efficiently include the relevant orthogonal directions. This last approach allows the main subspace to evolve also according to the observation operator. Those procedures naturally extend to a Kalman-Bucy type filter when dealing with linear drift, and to ensemble methods, too, resulting also suitable for problems described by nonlinear drift and possible non-Gaussian distribution. Moreover, we further propose a preliminary particle-type DLRA filter that shows potentiality in nonlinear settings. Numerical simulations show the efficacy of these procedures in relevant applications, opening up to further studies in these filtering directions.

Explore related subjects

Keep this discovery

BibTeXRIS

Yoshihito Kazashi, Youssef Marzouk, Fabio Nobile, Fabio Zoccolan. 2026-09-03. Dynamical Low-Rank Filters for Data Assimilation. https://arxiv.org/abs/2607.27432

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT