Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2508.05564

Numerical analysis of the stochastic Navier-Stokes equations

Dominic Breit·Andreas Prohl·Jörn Wichmann
View original source ↗Read source document ↗Export metadata ↓

Abstract

The developments over the last five decades concerning numerical discretisations of the incompressible Navier--Stokes equations have lead to reliable tools for their approximation: those include stable methods to properly address the incompressibility constraint, stable discretisations to account for convection dominated problems, efficient time (splitting) methods, and methods to tackle their nonlinear character. While these tools may successfully be applied to reliably simulate even more complex fluid flow PDE models, their understanding requires a fundamental revision in the case of stochastic fluid models, which are gaining increased importance nowadays. This work motivates and surveys optimally convergent numerical methods for the stochastic Stokes and Navier--Stokes equations that were obtained in the last decades. Furtheremore, we computationally illustrate the failure of some of those methods from the deterministic setting, if they are straight-forwardly applied to the stochastic case. In fact, we explain why some of these deterministic methods perform sub-optimally by highlighting crucial analytical differences between the deterministic and stochastic equations -- and how modifications of the deterministic methods restore their optimal performance if they properly address the probabilistic nature of the stochastic problem. Next to the numerical analysis of schemes, we propose a general benchmark of prototypic fluid flow problems driven by different types of noise to also compare new algorithms by simulations in terms of complexities, efficiencies, and possible limitations. The driving motivation is to reach a better comparison of simulations for new schemes in terms of accuracy and complexities, and to also complement theoretical performance studies for restricted settings of data by more realistic ones.

Explore related subjects

math.NAcs.NAmath.APmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dominic Breit, Andreas Prohl, Jörn Wichmann. 2025-08-09. Numerical analysis of the stochastic Navier-Stokes equations. https://arxiv.org/abs/2508.05564

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↗