Vortex equilibria using least-squares methods

Numerical methods and results for computing rotating or stationary equilibria of vortex patches and sheets, some in the presence of point vortices, are presented. The methods are based on those recently developed by Trefethen and colleagues for solving Laplace's equation in the complex plane by series and rational approximation. They share the common feature of finding the coefficients of the approximation by the fitting of boundary conditions using least-squares. Application of these methods to vortex patches requires their extension to the solution of Poisson's and Laplace's equation in two domains with matching conditions across the patch boundary. In the case of vortex sheets, the streamlines of the solution are computed along with the circulation density of the sheet. The use and accuracy of the methods is demonstrated by reproducing known results for equilibrium patches and vortex sheets, some having point vortices present. Several new numerical equilibrium solutions are also computed: a single straight sheet with two and four satellite point vortices respectively, and a three-sheeted structure, with the sheets emanating from a common point of rotation. New numerical solutions are also found for steady, doubly-connected vortex layers of uniform vorticity surrounding solid objects and such that the fluid velocity vanishes on the outer free boundary.

Authors

Institutions

Publication Details

Journal
Theoretical and Computational Fluid Dynamics
Published
2025-06-28
DOI
https://doi.org/10.1007/s00162-025-00746-0
Citations
1
Primary Topic
Fluid Dynamics and Vibration Analysis
Type
article
Field-Weighted Citation Impact
1.33

Funders

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

Vortex equilibria using least-squares methods

N. Robb McDonald, Samuel J. Harris
1 citations
Theoretical and Computational Fluid Dynamics
Fluid Dynamics and Vibration Analysis
1.33
article

Vortex equilibria using least-squares methods

N. Robb McDonald, Samuel J. Harris
article en
1 citations

Abstract

Numerical methods and results for computing rotating or stationary equilibria of vortex patches and sheets, some in the presence of point vortices, are presented. The methods are based on those recently developed by Trefethen and colleagues for solving Laplace's equation in the complex plane by series and rational approximation. They share the common feature of finding the coefficients of the approximation by the fitting of boundary conditions using least-squares. Application of these methods to vortex patches requires their extension to the solution of Poisson's and Laplace's equation in two domains with matching conditions across the patch boundary. In the case of vortex sheets, the streamlines of the solution are computed along with the circulation density of the sheet. The use and accuracy of the methods is demonstrated by reproducing known results for equilibrium patches and vortex sheets, some having point vortices present. Several new numerical equilibrium solutions are also computed: a single straight sheet with two and four satellite point vortices respectively, and a three-sheeted structure, with the sheets emanating from a common point of rotation. New numerical solutions are also found for steady, doubly-connected vortex layers of uniform vorticity surrounding solid objects and such that the fluid velocity vanishes on the outer free boundary.

Theoretical and Computational Fluid DynamicsVol. 39(4)
University College London (GB)
Engineering and Physical Sciences Research Council
Openalex Percentile: Top 22%
Fluid Dynamics and Vibration Analysis
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.