Papers › A Semi-Implicit Meshless Method for Incompressible Flows in Complex Geometries
A Semi-Implicit Meshless Method for Incompressible Flows in Complex Geometries
Shantanu Shahane, Surya Pratap Vanka
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present an exponentially convergent semi-implicit meshless algorithm for the solution of Navier-Stokes equations in complex domains. The algorithm discretizes partial derivatives at scattered points using radial basis functions as interpolants. Higher-order polynomials are appended to polyharmonic splines (PHS-RBF) and a collocation method is used to derive the interpolation coefficients. The interpolating kernels are then differentiated and the partial-differential equations are satisfied by collocation at the scattered points. The PHS-RBF interpolation is shown to be exponentially convergent with discretization errors decreasing as a high power of a representative distance between points. We present here a semi-implicit algorithm for time-dependent and steady state fluid flows in complex domains. At each time step, several iterations are performed to converge the momentum and continuity equations. A Poisson equation for pressure corrections is formulated by imposing divergence free condition on the iterated velocity field. At each time step, the momentum and pressure correction equations are repeatedly solved until the velocities and pressure converge to a pre-specified tolerance. We have demonstrated the convergence and discretization accuracy of the algorithm for two model problems and simulated three other complex problems. In all cases, the algorithm is stable for Courant numbers in excess of ten. The algorithm has the potential to accurately and efficiently solve many fluid flow and heat transfer problems in complex domains. An open source code Meshless Multi-Physics Software (MeMPhyS) is available for interested users of the algorithm.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections