Search arXivSearch

arXiv · 2607.27438

Dynamical Low-Rank Smoothing

Abstract

Computational costs often make smoothing procedures prohibitive for high-dimensional data assimilation problems. To address this challenge, we propose a dynamical low-rank approximation (DLRA) methodology for smoothing concerning frameworks based on stochastic differential equations. We extend the previously developed joint mean-and-covariance optimization (JMCO) filtering setting to derive a reduced-order smoother via the Rauch--Tung--Striebel recursion and establish the corresponding Kalman--Bucy smoothing for affine drift dynamics. The resulting algorithms retain the adaptive nature of DLRA while significantly reducing the computational time and storage of the whole smoothing procedure.

Explore related subjects

Keep this discovery

BibTeXRIS

Youssef Marzouk, Fabio Nobile, Fabio Zoccolan. 2026-09-03. Dynamical Low-Rank Smoothing. https://arxiv.org/abs/2607.27438

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

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA