Bayesian Methods for the Navier-Stokes Equations
Nicholas Polson, Vadim Sokolov
TL;DR
This work reframes the numerical solution of the incompressible Navier-Stokes equations as Bayesian posterior inference on a discretized state-space, enabling quantified uncertainty due to discretization, forcing, and modeling error. In 2D, it leverages Feynman-Kac representations to motivate Monte Carlo solvers, while in 3D it relies on particle and ensemble methods, including mean-field and McKean-Vlasov concepts, with spectral discretization to scale to high resolution and optional data assimilation for filtering. The authors introduce robust, non-Gaussian error models via normal variance-mean mixtures, notably Normal Inverse Gaussian (NIG) augmentation, to maintain conditional Gaussian updates and online parameter learning through particle learning, reducing weight collapse. They provide detailed methodological recipes, practical comparisons to EnKF and 4DVar, and numerical demonstrations that emphasize calibrated uncertainty, online learning, and robustness to outliers, with guidance for turbulent flow control and numerical weather prediction contexts.
Abstract
We develop a Bayesian methodology for numerical solution of the incompressible Navier--Stokes equations with quantified uncertainty. The central idea is to treat discretized Navier--Stokes dynamics as a state-space model and to view numerical solution as posterior computation: priors encode physical structure and modeling error, and the solver outputs a distribution over states and quantities of interest rather than a single trajectory. In two dimensions, stochastic representations (Feynman--Kac and stochastic characteristics for linear advection--diffusion with prescribed drift) motivate Monte Carlo solvers and provide intuition for uncertainty propagation. In three dimensions, we formulate stochastic Navier--Stokes models and describe particle-based and ensemble-based Bayesian workflows for uncertainty propagation in spectral discretizations. A key computational advantage is that parameter learning can be performed stably via particle learning: marginalization and resample--propagate (one-step smoothing) constructions avoid the weight-collapse that plagues naive sequential importance sampling on static parameters. When partial observations are available, the same machinery supports sequential observational updating as an additional capability. We also discuss non-Gaussian (heavy-tailed) error models based on normal variance-mean mixtures, which yield conditionally Gaussian updates via latent scale augmentation.
