Skip to content
DraconiticResearch
Search Sources API
182,469 studies31 sourcesUpdated 58 min ago
PreprintCC BY-NC-ND 4.0arXiv

Kernelized Stable Fluids for simulating physically accurate solutions

Abstract

The Stable Fluids algorithm is a fractional step method for solving the incompressible Navier-Stokes (NS) equations in an unconditionally stable way. It was initially developed for visual effects and allows real-time simulations because of its low computational complexity. The method solves the advection step by using the method of characteristics which is implemented via linear interpolation. This results in excessive diffusion of vorticity and is one of the main reasons for the physical inaccuracy of the algorithm. We propose Kernelized Stable Fluids with Sparse Cholesky Preconditioning (KSF-Chol) in order to address this shortcoming and make the algorithm thereby suitable for engineering problems and scientific computing. The algorithm is modified by replacing the linear interpolation approach with kernel interpolation in the advection step. We accelerate the computationally expensive kernel interpolation by using sparse Cholesky preconditioning and a near-/far-field approach and optimize both methods for computations on a uniform Cartesian grid. KSF-Chol achieves per time step a near-linear computational complexity of 𝒪(Nlogd(N/εchol)) in space and time. We test KSF-Chol against reference solvers and numerical reference data on multiple 2D and 3D benchmarks and demonstrate a significantly reduced numerical diffusion as well as a competitive accuracy concerning the computation of relevant flow quantities.

Related

  1. Realized Tail-Risk Conditional Autoregressive Expectile Models: Accurate and Stable Forecasting Performance
    Keisuke Sasaki, Yasuhiro Omori
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. An arbitrarily high-order accurate and locally energy/entropy-stable space-time method for a class of nonlinear wave systems
    Michael Dumbser, Ilaria Perugia, Enrico Zampa
    arXivPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingarXiv
  3. Nonexistence of Stable Solutions to the Liouville Equation on Graphs with Polynomial Volume Growth
    Weiqi Guan
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  4. Stable solutions of the Allen--Cahn equation in dimension three are one-dimensional
    Hardy Chan, Xavier Fernández-Real, Alessio Figalli +2
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  5. Stable Solutions to Generalizations of Fibonacci Relations of Higher Order
    Timmy Ma, Patrick Vernon
    arXivPreprintCC BY-NC-ND 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{scholz2026kernelized,
  title = {{Kernelized Stable Fluids for simulating physically accurate solutions}},
  author = {L. Scholz and A. Bacho and H. Owhadi},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.03263},
  eprint = {2611.03263},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.03263},
  note = {CC BY-NC-ND 4.0},
}
RIS
TY  - UNPB
TI  - Kernelized Stable Fluids for simulating physically accurate solutions
AU  - L. Scholz
AU  - A. Bacho
AU  - H. Owhadi
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.03263
UR  - https://arxiv.org/abs/2611.03263
AB  - The Stable Fluids algorithm is a fractional step method for solving the incompressible Navier-Stokes (NS) equations in an unconditionally stable way. It was initially developed for visual effects and allows real-time simulations because of its low computational complexity. The method solves the advection step by using the method of characteristics which is implemented via linear interpolation. This results in excessive diffusion of vorticity and is one of the main reasons for the physical inaccuracy of the algorithm. We propose Kernelized Stable Fluids with Sparse Cholesky Preconditioning (KSF-Chol) in order to address this shortcoming and make the algorithm thereby suitable for engineering problems and scientific computing. The algorithm is modified by replacing the linear interpolation approach with kernel interpolation in the advection step. We accelerate the computationally expensive kernel interpolation by using sparse Cholesky preconditioning and a near-/far-field approach and optimize both methods for computations on a uniform Cartesian grid. KSF-Chol achieves per time step a near-linear computational complexity of 𝒪(Nlog^d(N/ε_chol)) in space and time. We test KSF-Chol against reference solvers and numerical reference data on multiple 2D and 3D benchmarks and demonstrate a significantly reduced numerical diffusion as well as a competitive accuracy concerning the computation of relevant flow quantities.
ER  -