A Semi‐Implicit SPH Method for Compressible and Incompressible Flows with Improved Convergence

Abstract In simulating fluids using position‐based dynamics, the accuracy and robustness depend on numerous numerical parameters, including the time step size, iteration count, and particle size, among others. This complexity can lead to unpredictable control of simulation behaviors. In this paper, we first reformulate the problem of enforcing fluid compressibility/incompressibility into an nonlinear optimization problem, and then introduce a semi‐implicit successive substitution method (SISSM) to solve the nonlinear optimization problem by adjusting particle positions in parallel. In contrast to calculating an intermediate variable, such as pressure, to enforce fluid incompressibility within the position‐based dynamics (PBD) framework, the proposed semi‐implicit approach eliminates the necessity of such calculations. Instead, it directly employs successive substitution of particle positions to correct density errors. This method exhibits reduced dependency to numerical parameters, such as particle size and time step variations, and improves consistency and stability in simulating fluids that range from highly compressible to nearly incompressible. We validates the effectiveness of applying a variety of different techniques in accelerating the convergence rate.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2025-04-18
DOI
https://doi.org/10.1111/cgf.70043
Citations
1
Primary Topic
Fluid Dynamics Simulations and Interactions
Type
article
Field-Weighted Citation Impact
1.33

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Semi‐Implicit SPH Method for Compressible and Incompressible Flows with Improved Convergence

Yuzhong Guo, Shusen Liu, Jian Shi, Ying Qiao et al.
1 citations
Computer Graphics Forum
Fluid Dynamics Simulations and Interactions
1.33
article

A Semi‐Implicit SPH Method for Compressible and Incompressible Flows with Improved Convergence

Yuzhong Guo, Shusen Liu, Jian Shi, Ying Qiao, Xiaowei He
article en
1 citations

Abstract

Abstract In simulating fluids using position‐based dynamics, the accuracy and robustness depend on numerous numerical parameters, including the time step size, iteration count, and particle size, among others. This complexity can lead to unpredictable control of simulation behaviors. In this paper, we first reformulate the problem of enforcing fluid compressibility/incompressibility into an nonlinear optimization problem, and then introduce a semi‐implicit successive substitution method (SISSM) to solve the nonlinear optimization problem by adjusting particle positions in parallel. In contrast to calculating an intermediate variable, such as pressure, to enforce fluid incompressibility within the position‐based dynamics (PBD) framework, the proposed semi‐implicit approach eliminates the necessity of such calculations. Instead, it directly employs successive substitution of particle positions to correct density errors. This method exhibits reduced dependency to numerical parameters, such as particle size and time step variations, and improves consistency and stability in simulating fluids that range from highly compressible to nearly incompressible. We validates the effectiveness of applying a variety of different techniques in accelerating the convergence rate.

Computer Graphics ForumVol. 44(2)
Chinese Academy of Sciences (CN), Institute of Automation (CN), Institute of Software (CN)
National Natural Science Foundation of China, National Science and Technology Major Project
Openalex Percentile: Top 23%
Fluid Dynamics Simulations and Interactions
1.33
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.