Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
129 tokens/sec
GPT-4o
28 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A Semi-Implicit Meshless Method for Incompressible Flows in Complex Geometries (2106.07616v1)

Published 29 May 2021 in math.NA, cs.NA, and physics.comp-ph

Abstract: 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.

Citations (15)

Summary

We haven't generated a summary for this paper yet.