mlsanityData to 14 Oct 2026

Gaussian Process Hydrodynamics

arXiv 2209.10707 ↗First posted 21 Sep 2022physics.flu-dyn cs.NA math.NAcited by 4

Not on the map. Why?

Abstract (arXiv)

We present a Gaussian Process (GP) approach (Gaussian Process Hydrodynamics, GPH) for approximating the solution of the Euler and Navier-Stokes equations. As in Smoothed Particle Hydrodynamics (SPH), GPH is a Lagrangian particle-based approach involving the tracking of a finite number of particles transported by the flow. However, these particles do not represent mollified particles of matter but carry discrete/partial information about the continuous flow. Closure is achieved by placing a divergence-free GP prior xi on the velocity field and conditioning on vorticity at particle locations. Known physics (e.g., the Richardson cascade and velocity-increments power laws) is incorporated into the GP prior through physics-informed additive kernels. This approach allows us to coarse-grain turbulence in a statistical manner rather than a deterministic one. By enforcing incompressibility and fluid/structure boundary conditions through the selection of the kernel, GPH requires much fewer particles than SPH. Since GPH has a natural probabilistic interpretation, numerical results come with uncertainty estimates enabling their incorporation into a UQ pipeline and the adding/removing of particles (quantas of information) in an adapted manner. The proposed approach is amenable to analysis, it inherits the complexity of state-of-the-art solvers for dense kernel matrices, and it leads to a natural definition of turbulence as information loss. Numerical experiments support the importance of selecting physics-informed kernels and illustrate the major impact of such kernels on accuracy and stability. Since the proposed approach has a Bayesian interpretation, it naturally enables data assimilation and making predictions and estimations based on mixing simulation data with experimental data.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 13 of its 50 references that are in the map. First posted on arXiv 21 Sep 2022.

Builds on

13 of 50 references.

References · 13

  1. 2021Solving and Learning Nonlinear PDEs with Gaussian Processescited by 129
  2. 2018Kernel Flows: from learning kernels from data into the abysscited by 49
  3. 2020Sparse Cholesky factorization by Kullback-Leibler minimizationcited by 41
  4. 2021Computational Graph Completioncited by 28
  5. 2017Compression, inversion, and approximate PCA of dense kernel matrices at near-linear computational complexitycited by 24
  6. 2020Learning dynamical systems from data: a simple cross-validation perspectivecited by 23
  7. 2020Consistency of Empirical Bayes And Kernel Flow For Hierarchical Parameter Estimationcited by 18
  8. 2020Do ideas have shape? Idea registration as the continuous limit of artificial neural networkscited by 16
  9. 2015Multigrid with rough coefficients and Multiresolution operator decomposition from Hierarchical Information Gamescited by 15
  10. 2021Data-driven geophysical forecasting: Simple, low-cost, and accurate baselines with kernel methodscited by 15
  11. 2021Learning dynamical systems from data: A simple cross-validation perspective, part III: Irregularly-Sampled Time Seriescited by 14
  12. 2022Learning "best" kernels from data in Gaussian process regression. With application to aerodynamicscited by 9
1 more
  1. 2016Gamblets for opening the complexity-bottleneck of implicit schemes for hyperbolic and parabolic ODEs/PDEs with rough coefficientscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 2.

4 papers.