Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.21920

High-Moment Stability and Error Analysis of a Fully Discrete LDG-IMEX Method for High Dimensional Nonlinear Stochastic Convection-Diffusion Equations

Yiming Chen·Yunzhang Li·Yulong Xing
View original source ↗Read source document ↗Export metadata ↓

Abstract

A fully discrete local discontinuous Galerkin (LDG) method coupled with an implicit-explicit (IMEX) Euler time discretization is presented and analyzed for a class of high dimensional nonlinear stochastic convection-diffusion equations driven by multiplicative $\mathcal Q$-Wiener noise. The model allows nonlinear leading coefficients, nonlinear convection terms, dissipative source terms, and gradient-dependent noise. The diffusion operator is treated implicitly through the LDG formulation, while the nonlinear convection, lower-order drift, and stochastic terms are evaluated explicitly. The main contribution is a high-moment stability and error analysis for the fully discrete scheme. A central difficulty is that the nonlinear terms lead to pathwise growth factors that cannot be controlled uniformly on the full sample space. To provide the stability and error estimate, we introduce recursively defined nested subsets adapted to the numerical solution. Under the stated stochastic parabolicity and refinement conditions, we prove that these subsets have probabilities converging to one. On these subsets, the numerical solution satisfies high-moment stability, and the fully discrete error converges with order arbitrarily close to $r+1$ in space and $1/2$ in time. We also derive a pathwise error estimate by combining the high-moment error bound with a discrete Kolmogorov argument. Numerical experiments for stochastic Burgers' and Allen-Cahn equations confirm the theoretical rates and demonstrate the robustness of the proposed method for nonlinear stochastic models.

Explore related subjects

math.NAcs.NAmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yiming Chen, Yunzhang Li, Yulong Xing. 2026-09-18. High-Moment Stability and Error Analysis of a Fully Discrete LDG-IMEX Method for High Dimensional Nonlinear Stochastic Convection-Diffusion Equations. https://arxiv.org/abs/2609.21920

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

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗