Papers › Planar potential flow on Cartesian grids
Planar potential flow on Cartesian grids
Diederik Beckers, Jeff D. Eldredge
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.
Potential flow has many applications, including the modelling of unsteady flows in aerodynamics. For these models to work efficiently, it is best to avoid Biot-Savart interactions. This work presents a grid-based treatment of potential flows in two dimensions and its use in a vortex model for simulating unsteady aerodynamic flows. For flows consisting of vortex elements, the treatment follows the vortex-in-cell approach and solves the streamfunction-vorticity Poisson equation on a Cartesian grid after transferring the circulation from the vortices onto the grid. For sources and sinks, an analogous approach can be followed using the scalar potential. The combined velocity field due to vortices, sinks, and sources can then be obtained using the Helmholtz decomposition. In this work, we use several key tools that ensure the approach works on arbitrary geometries, with and without sharp edges. Firstly, the immersed boundary projection method is used to account for bodies in the flow and the resulting body-forcing Lagrange multiplier is identified as the bound vortex sheet strength. Secondly, sharp edges are treated by decomposing the vortex sheet strength into a singular and smooth part. To enforce the Kutta condition, the smooth part can then be constrained to remove the singularity introduced by the sharp edge. These constraints and the Poisson equation are formulated as a saddle-point system and solved using the Schur complement method. The lattice Green's function is used to efficiently solve the discrete Poisson equation with unbounded boundary conditions. The method and its accuracy are demonstrated for several problems.
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