Papers
Topics
Authors
Recent
Search
2000 character limit reached

Stable fluid-rigid body interaction algorithm using the direct-forcing immersed boundary method (DF-IBM)

Published 27 Apr 2026 in physics.flu-dyn and physics.comp-ph | (2604.24439v1)

Abstract: The direct-forcing immersed boundary method (DF-IBM) algorithm previously developed by the authors is extended by coupling the Navier-Stokes equations with the Newton-Euler equations for rigid body dynamics within the DF-IBM framework. This coupling broadens the applicability of the previous development, from stationary or prescribed motion to flow-induced (free) motion cases. To address fluid-rigid body interactions under a partitioned approach, an implicit coupling algorithm is developed to handle strongly coupled interface conditions. Stability and convergence issues, particularly stemming from critical solid-fluid density ratios and from the rigid body approximation of internal mass effects in rotational dynamics, are mitigated using a fixed relaxation technique for the rigid body kinematics to ensure numerical robustness. Additionally, the proposed algorithm leverages the previously developed DF-IBM formulation and the predictor-corrector strategy of the pressure implicit with splitting of operators (PISO) algorithm by omitting the momentum predictor step and the costly corrector loops from the implicit iterations. The method is validated against several benchmark cases, demonstrating robustness, stability, and efficiency in capturing complex fluid-rigid body interactions across a range of challenging scenarios.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.