betaFeedback

WorksMathematics

Robust BUG dynamical low-rank integrators based on the Euler-Maruyama method for stochastic differential equations. Part I: a closed-moment approach

Abstract

In this work, we introduce Euler-Maruyama-based Basis-Update & Galerkin (EM-BUG) dynamical low-rank integrators for stochastic differential equations (SDEs). These integrators extend the standard BUG integrator to the Euler-Maruyama scheme by incorporating diffusion directions into the augmented physical basis and exploiting the second moment to update the physical basis independently of the new Brownian increments. This construction avoids the inversion of the reduced second-moment matrix and allows us to derive convergence estimates that are robust with respect to small eigenvalues. We establish preservation of positive semidefiniteness, exactness with respect to Euler-Maruyama at full rank, and second-moment stability. Strong and weak convergence estimates show that the time-discretization accuracy of the underlying Euler-Maruyama scheme is preserved up to the low-rank approximation error. We also derive Monte Carlo error estimates recovering the standard sampling rate up to the time-discretization and low-rank approximation errors. Numerical experiments on linear SDEs with additive and multiplicative noise support these theoretical results and demonstrate accuracy comparable to the standard BUG integrator.

Introduction

Stochastic differential equations (SDEs) arise in many applications involving uncertainty. Their numerical simulation can be computationally expensive, since the estimation of statistical quantities often relies on Monte Carlo methods, which require computing a large number of trajectories driven by independent realizations of the noise. In addition, if each trajectory is also high-dimensional, the overall computational cost can become prohibitive.

Dynamical low-rank approximation (DLRA) has been successfully applied in various contexts to reduce the computational cost of high-dimensional problems. Examples include kinetic equations [1, 2, 3], random PDEs [4, 5, 6, 7, 8, 9], and data assimilation [10, 11, 12, 13]. The main idea is to approximate the solution by a low-rank representation. Consider an SDE of the form

dX(t)=a(t,X(t)) dt+b(t,X(t)) dW(t),(1)\mathrm{d}X(t) = a(t, X(t))\,\mathrm{d}t + b(t, X(t))\,\mathrm{d}W(t), \tag*{(1)}

where X(t)∈RdX(t) \in\mathbb{R}^{d}, W(t)W(t) is a Wiener process, and aa and bb denote the drift and diffusion coefficients, respectively. Denoting by X(t)∈Rd×N\mathbf{X}(t) \in\mathbb{R}^{d \times N} the matrix collecting NN Monte Carlo realizations {X(j)(t)}j=1N\{X^{(j)}(t)\}_{j=1}^{N}, we seek an approximation of the form

X(t)≈U(t)Y(t)T,(2)\mathbf{X}(t) \approx\mathbf{U}(t)\mathbf{Y}(t)^{\mathsf{T}}, \tag*{(2)}

where U(t)∈Rd×r\mathbf{U}(t) \in\mathbb{R}^{d \times r} has orthonormal columns, Y(t)∈RN×r\mathbf{Y}(t) \in\mathbb{R}^{N \times r}, and r≪min⁡{d,N}r \ll\min\{d,N\}. Originally introduced in [14] for matrix differential equations, the evolution of the low-rank approximation is obtained by projecting the dynamics onto the tangent space of the rank-rr manifold. DLRA methods have also been investigated for stochastic differential equations [15, 16]. In particular, the time discretization and Monte Carlo approximation of these methods have been analyzed in [17, 18], while alternative continuous-time formulations have been investigated in [19].

In the stochastic setting, the Dynamically Orthogonal (DO) formulation of [20] provides evolution equations for the deterministic basis and the stochastic coefficients. By imposing the dynamical orthogonality condition U(t)TU˙(t)=0\mathbf{U}(t)^{\mathsf{T}}\dot{\mathbf{U}}(t)=0, the evolution equations are given by

U˙(t)=(I−U(t)U(t)T)E[a(t,U(t)Y(t))Y(t)T]CY(t)−1,dY(t)=U(t)Ta(t,U(t)Y(t)) dt+U(t)Tb(t,U(t)Y(t)) dW(t),(3)\begin{aligned} \dot{\mathbf{U}}(t) &= \left(\mathbf{I}-\mathbf{U}(t)\mathbf{U}(t)^{\mathsf{T}}\right)\mathbb{E}\left[a(t,\mathbf{U}(t)Y(t))Y(t)^{\mathsf{T}}\right]C_Y(t)^{-1},\\ \mathrm{d}Y(t) &= \mathbf{U}(t)^{\mathsf{T}}a(t,\mathbf{U}(t)Y(t))\,\mathrm{d}t+\mathbf{U}(t)^{\mathsf{T}}b(t,\mathbf{U}(t)Y(t))\,\mathrm{d}W(t), \tag*{(3)} \end{aligned}

where Y(t)∈RrY(t) \in\mathbb{R}^{r} denotes the vector of stochastic coefficients, whose realizations are collected in Y(t)\mathbf{Y}(t), and CY(t)=E[Y(t)Y(t)T]C_Y(t)=\mathbb{E}[Y(t)Y(t)^{\mathsf{T}}] denotes its second-moment matrix.

The numerical integration of the DO equations can be challenging due to the presence of the inverse of the reduced second-moment matrix CY(t)C_Y(t). Indeed, when some eigenvalues of CY(t)C_Y(t) become small, the equations can be ill-conditioned, leading to severe restrictions on the time step, since the stability conditions of standard time-integration schemes may depend on the smallest eigenvalue of CY(t)C_Y(t).

To overcome this difficulty, several DLRA integrators that are robust with respect to small singular values have been developed in the deterministic setting, such as the projector-splitting integrator [21, 22] and the unconventional integrator [23]. These methods avoid the inversion of small singular values and provide robust error bounds independent of their magnitude. Among them, the Basis-Update & Galerkin (BUG) integrator [24, 25] is particularly attractive in practice, since it does not involve backward time-integration step, allows for rank adaptivity, and admits high-order extensions [24, 25, 26, 27].

However, extending the BUG integrator to SDEs while preserving its robustness and accuracy is not straightforward. First, unlike in the deterministic setting, the trajectories evolve through stochastic increments, which must be taken into account in the basis updates and the Galerkin step. Second, the direct application of the BUG integrator to a Monte Carlo ensemble would make the updated physical basis depend on the new Brownian increments. This dependence complicates the derivation of strong and weak error estimates, since the projections and rank truncations interact with the stochastic increments.

To address these difficulties, we propose BUG integrators for SDEs that extend the standard BUG formulation to the Euler–Maruyama method. The key idea of these Euler–Maruyama-based BUG (EM–BUG) integrators is to exploit the second moment. First, the physical basis is augmented with additional directions associated with the diffusion terms of the Euler–Maruyama prediction. Second, for linear SDEs, the second-moment equation is closed and deterministic, allowing us to perform the Galerkin projection and rank truncation independently of the new Brownian increments. The stochastic coefficients are then updated by projecting the Euler–Maruyama prediction onto the resulting physical basis. For nonlinear SDEs, where the second-moment equation is generally not closed, we also propose a natural extension based on the empirical conditional second moment.

This construction allows us to establish several theoretical properties for the closed-moment EM–BUG integrator, including preservation of positive semidefiniteness of the second moment, exactness with respect to the Euler–Maruyama scheme at full rank, and second-moment stability. We also derive strong and weak convergence estimates showing that the time-discretization accuracy of the underlying Euler–Maruyama scheme is preserved up to the low-rank approximation error. In particular, these estimates are robust with respect to small eigenvalues of the reduced second-moment matrix. Additionally, we establish Monte Carlo error estimates that recover the standard sampling rate of order N−1/2N^{-1/2}, up to the time-discretization and low-rank approximation errors.

In this paper, we focus on the closed-moment EM–BUG integrator for linear SDEs, for which we provide a detailed theoretical analysis. The empirical conditional-moment EM–BUG integrator for general nonlinear SDEs will be analyzed separately in a second part.

The remainder of the paper is organized as follows. § 2 introduces the problem setting and notation. Then, § 3 presents the closed-moment EM–BUG integrator. § 4 establishes its theoretical properties and convergence estimates. In § 5, these theoretical results, especially regarding the accuracy and robustness, are supported by several numerical experiments. Finally, § 6 draws some conclusions and perspectives.

Problem setting and notation

Stochastic differential equation and Monte Carlo ensemble

We first introduce the setting and notation used throughout the paper. Although the analysis focuses on linear stochastic differential equations, we present the general formulation, which will also be used to introduce the extension to nonlinear problems.

Let (Ω,F,(Ft)t≥0,P)(\Omega,\mathcal{F},(\mathcal{F}_t)_{t\geq0},\mathbb{P}) be a filtered probability space and let W(t)W(t) be an mm-dimensional standard (Ft)(\mathcal{F}_t)-Brownian motion. We consider the stochastic differential equation (SDE)

dX(t)=a(t,X(t)) dt+b(t,X(t)) dW(t),X(t)∈L2(Ω;Rd),(4)\mathrm{d}X(t)=a(t,X(t))\,\mathrm{d}t+b(t,X(t))\,\mathrm{d}W(t), \qquad X(t)\in L^2(\Omega;\mathbb{R}^d), \tag*{(4)}

where

a:[0,T]×Rd→Rd,b:[0,T]×Rd→Rd×m.a:[0,T]\times\mathbb{R}^d\to\mathbb{R}^d,\qquad b:[0,T]\times\mathbb{R}^d\to\mathbb{R}^{d\times m}.

We assume that X(t)X(t), a(t,X(t))a(t,X(t)), and b(t,X(t))b(t,X(t)) are square integrable for t∈[0,T]t\in[0,T], so that the moments and expectations introduced below are well defined.

We consider NN Monte Carlo realizations of (4), driven by independent Brownian motions {W(j)(t)}j=1N\{W^{(j)}(t)\}_{j=1}^{N}, and collect them in the ensemble matrix

X(t)=[X(1)(t) ⋯ X(N)(t)]∈Rd×N.(5)X(t)=\left[X^{(1)}(t)\ \cdots\ X^{(N)}(t)\right]\in\mathbb{R}^{d\times N}. \tag*{(5)}

The non-centered second-moment matrix is defined by

C(t)=E[X(t)X(t)T].(6)C(t)=\mathbb{E}\left[X(t)X(t)^{\mathsf{T}}\right]. \tag*{(6)}

According to Itô’s formula, it satisfies

C˙(t)=E[a(t,X(t))X(t)T+X(t)a(t,X(t))T+b(t,X(t))b(t,X(t))T].(7)\dot{C}(t)=\mathbb{E}\left[a(t,X(t))X(t)^{\mathsf{T}}+X(t)a(t,X(t))^{\mathsf{T}}+b(t,X(t))b(t,X(t))^{\mathsf{T}}\right]. \tag*{(7)}

In general, the second-moment equation (7) is not closed, since its right-hand side cannot be expressed only in terms of C(t)C(t). However, for linear SDEs, the second moment satisfies a closed evolution equation. This property will be exploited in § 3.1 to construct the closed-moment EM–BUG integrator.

For the Monte Carlo ensemble X(t)X(t), we also define the empirical non-centered second moment by

CN(t)=1NX(t)X(t)T.(8)C_N(t)=\frac{1}{N}X(t)X(t)^{\mathsf{T}}. \tag*{(8)}

Euler–Maruyama scheme

Let 0=t0<t1<⋯<tNt=T0=t_0<t_1<\cdots<t_{N_t}=T be a uniform time grid with step size Δt=T/Nt\Delta t=T/N_t. For n∈{0,…,Nt−1}n\in\{0,\ldots,N_t-1\}, we denote the Brownian increments by

ΔWn(j)=W(j)(tn+1)−W(j)(tn),j=1,…,N.(9)\Delta W_n^{(j)}=W^{(j)}(t_{n+1})-W^{(j)}(t_n),\qquad j=1,\ldots,N. \tag*{(9)}

For each realization, the Euler–Maruyama discretization of (4) is given by

Xn+1EM,(j)=XnEM,(j)+Δt a(tn,XnEM,(j))+b(tn,XnEM,(j))ΔWn(j),j=1,…,N.(10)X_{n+1}^{\mathrm{EM},(j)} = X_n^{\mathrm{EM},(j)} + \Delta t\,a(t_n, X_n^{\mathrm{EM},(j)}) + b(t_n, X_n^{\mathrm{EM},(j)})\Delta W_n^{(j)}, \qquad j=1,\ldots,N. \tag*{(10)}

Collecting the NN realizations gives the Euler–Maruyama ensemble

XnEM=[XnEM,(1) ⋯ XnEM,(N)]∈Rd×N.(11)\mathbf{X}_n^{\mathrm{EM}} = \left[X_n^{\mathrm{EM},(1)}\ \cdots\ X_n^{\mathrm{EM},(N)}\right] \in\mathbb{R}^{d\times N}. \tag*{(11)}

This Euler–Maruyama update can be written in matrix form as

Xn+1EM=XnEM+Δt An(XnEM)+ΔBn(XnEM),(12)\mathbf{X}_{n+1}^{\mathrm{EM}} = \mathbf{X}_n^{\mathrm{EM}} + \Delta t\,\mathbf{A}_n(\mathbf{X}_n^{\mathrm{EM}}) + \Delta\mathbf{B}_n(\mathbf{X}_n^{\mathrm{EM}}), \tag*{(12)}

where

An(XnEM)=[a(tn,XnEM,(1)) ⋯ a(tn,XnEM,(N))],(13)\mathbf{A}_n(\mathbf{X}_n^{\mathrm{EM}}) = \left[a(t_n,X_n^{\mathrm{EM},(1)})\ \cdots\ a(t_n,X_n^{\mathrm{EM},(N)})\right], \tag*{(13)}

and

ΔBn(XnEM)=[b(tn,XnEM,(1))ΔWn(1) ⋯ b(tn,XnEM,(N))ΔWn(N)].(14)\Delta\mathbf{B}_n(\mathbf{X}_n^{\mathrm{EM}}) = \left[b(t_n,X_n^{\mathrm{EM},(1)})\Delta W_n^{(1)}\ \cdots\ b(t_n,X_n^{\mathrm{EM},(N)})\Delta W_n^{(N)}\right]. \tag*{(14)}

Let XnEMX_n^{\mathrm{EM}} denote a generic Euler–Maruyama particle at time tnt_n. Its non-centered second moment is defined by

CnEM=E[XnEM(XnEM)T].(15)C_n^{\mathrm{EM}} = \mathbb{E}\left[X_n^{\mathrm{EM}}(X_n^{\mathrm{EM}})^{\mathsf{T}}\right]. \tag*{(15)}

The Euler–Maruyama discretization then induces the second-moment update

References

  1. [1]Finkemmer, L., Lubich, C.: A Low-Rank Projector-Splitting Integrator for the Vlasov–Poisson Equation. SIAM Journal on Scientific Computing 40(5), 1330–1360 (2018) https://doi.org/10.1137/18M116383X
  2. [2]Finkemmer, L., Joseph, I.: A mass, momentum, and energy conservative dynamical low-rank scheme for the Vlasov equation. Journal of Computational Physics 443, 110495 (2021) https://doi.org/10.1016/j.jcp.2021.110495
  3. [3]Finkemmer, L., Kormann, K., Kusch, J., McClarren, R.G., Qiu, J.-M.: A review of low-rank methods for time-dependent kinetic simulations. Journal of Computational Physics 538, 114191 (2025) https://doi.org/10.1016/j.jcp.2025.114191
  4. [4]Babaee, H., Choi, M., Sapsis, T.P., Karniadakis, G.E.: A robust bi-orthogonal/dynamically-orthogonal method using the covariance pseudo-inverse with application to stochastic flow problems. Journal of Computational Physics 344, 303–319 (2017) https://doi.org/10.1016/j.jcp.2017.04.057
  5. [5]Musharbash, E., Nobile, F.: Dual dynamically orthogonal approximation of incompressible Navier Stokes equations with random boundary conditions. Journal of Computational Physics 354, 135–162 (2018) https://doi.org/10.1016/j.jcp.2017.09.061
  6. [6]Feppon, F., Lermusiaux, P.F.: Dynamically orthogonal numerical schemes for efficient stochastic advection and Lagrangian transport. Siam Review 60(3), 595–625 (2018) https://doi.org/10.1137/16M1109394
  7. [7]Musharbash, E., Nobile, F., Vidličková, E.: Symplectic dynamical low rank approximation of wave equations with random parameters. BIT Numerical Mathematics 60(4), 1153–1201 (2020) https://doi.org/10.1007/s10543-020-00811-6
  8. [8]Patil, P., Babaee, H.: Real-time reduced-order modeling of stochastic partial differential equations via time-dependent subspaces. Journal of Computational Physics 415, 109511 (2020) https://doi.org/10.1016/j.jcp.2020.109511
  9. [9]Nobile, F., Trigo Trindade, T.: Petrov–Galerkin Dynamical Low Rank Approximation: SUPG stabilisation of advection-dominated problems. Computer Methods in Applied Mechanics and Engineering 433, 117495 (2025) https://doi.org/10.1016/j.cma.2024.117495
  10. [10]Nobile, F., Trigo Trindade, T.: Dynamical Low-Rank Approximations for Kalman Filtering. arXiv preprint arXiv:2509.11210 (2025). https://arxiv.org/abs/2509.11210
  11. [11]Trigo Trindade, T., Riffaud, S., Nobile, F.: Dynamical low-rank ensemble Kalman filter for state/parameter estimation. Journal of Computational Physics 569, 115433 (2027) https://doi.org/10.1016/j.jcp.2026.115433 . Available online in 2026
  12. [12]Kazashi, Y., Marzouk, Y., Nobile, F., Zoccolan, F.: Dynamical Low-Rank Filters for Data Assimilation. arXiv preprint arXiv:2607.27432 (2026). https://arxiv.org/abs/2607.27432
  13. [13]Marzouk, Y., Nobile, F., Zoccolan, F.: Dynamical Low-Rank Smoothing. arXiv preprint arXiv:2607.27438 (2026). https://arxiv.org/abs/2607.27438
  14. [14]Koch, O., Lubich, C.: Dynamical low-rank approximation. SIAM Journal on Matrix Analysis and Applications 29(2), 434–454 (2007) https://doi.org/10.1137/050639703
  15. [15]Cao, Y., Lu, J.: Stochastic dynamical low-rank approximation method. Journal of Computational Physics 372, 564–586 (2018) https://doi.org/10.1016/j.jcp.2018.06.058
  16. [16]Kazashi, Y., Nobile, F., Zoccolan, F.: Dynamical low-rank approximation for stochastic differential equations. Mathematics of Computation 94(353), 1335–1375 (2025) https://doi.org/10.1090/mcom/3999
  17. [17]Kazashi, Y., Nobile, F., Zoccolan, F.: Numerical Methods for Dynamical Low-Rank Approximations of Stochastic Differential Equations – Part I: Time discretization. arXiv preprint arXiv:2601.21428 (2026). https://arxiv.org/abs/2601.21428
  18. [18]Kazashi, Y., Nobile, F., Zoccolan, F.: Numerical Methods for Dynamical Low-Rank Approximations of Stochastic Differential Equations – Part II: Stochastic discretization. arXiv preprint arXiv:2609.20317 (2026). https://arxiv.org/abs/2609.20317
  19. [19]Kazashi, Y., Nobile, F., Zoccolan, F.: Further Approaches of Dynamical Low-Rank Approximation for SDEs. arXiv preprint arXiv:2609.20292 (2026). https://arxiv.org/abs/2609.20292
  20. [20]Sapsis, T.P., Lermusiaux, P.F.: Dynamically orthogonal field equations for continuous stochastic dynamical systems. Physica D: Nonlinear Phenomena 238(23–24), 2347–2360 (2009) https://doi.org/10.1016/j.physd.2009.09.017
  21. [21]Lubich, C., Oseledets, I.V.: A projector-splitting integrator for dynamical low-rank approximation. BIT Numerical Mathematics 54(1), 171–188 (2014) https://doi.org/10.1007/s10543-013-0454-0
  22. [22]Kieri, E., Lubich, C., Walach, H.: Discretized dynamical low-rank approximation in the presence of small singular values. SIAM Journal on Numerical Analysis 54(2), 1020–1038 (2016) https://doi.org/10.1137/15M1026791
  23. [23]Ceruti, G., Lubich, C.: An unconventional robust integrator for dynamical low-rank approximation. BIT Numerical Mathematics 62(1), 23–44 (2022) https://doi.org/10.1007/s10543-021-00873-0
  24. [24]Ceruti, G., Kusch, J., Lubich, C.: A rank-adaptive robust integrator for dynamical low-rank approximation. BIT Numerical Mathematics 62(4), 1149–1174 (2022) https://doi.org/10.1007/s10543-021-09007-7
  25. [25]Ceruti, G., Kusch, J., Lubich, C.: A parallel rank-adaptive integrator for dynamical low-rank approximation. SIAM Journal on Scientific Computing 46(3), 205–228 (2024) https://doi.org/10.1137/23M1565103
  26. [26]Ceruti, G., Einkemmer, L., Kusch, J., Lubich, C.: A robust second-order low-rank BUG integrator based on the midpoint rule. BIT Numerical Mathematics 64(3), 30 (2024) https://doi.org/10.1007/s10543-024-01032-x
  27. [27]Nobile, F., Riffaud, S.: High-Order BUG Dynamical Low-Rank Integrators Based on Explicit Runge–Kutta Methods. Journal of Scientific Computing 107(3), 102 (2026) https://doi.org/10.1007/s10915-026-03317-5
  28. [28]Kloeden, P.E., Platen, E.: Numerical Solution of Stochastic Differential Equations. Applications of Mathematics, vol. 23. Springer, Berlin (1992). https://doi.org/10.1007/978-3-662-12616-5

Paper details

vlnc:W_vqvpghwr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 10

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents