Fast algorithms for vortex methods

L. Greengard, V. Rokhlin

Research output: Contribution to conferencePaperpeer-review

Abstract

In the random vortex method for viscous incompressible flow, the vorticity field is represented by a collection of vortex blobs which are alternately convected and diffused via a random walk. For a fluid modelled by n vortex blobs, the bulk of the computational burden at each time step is the evaluation of all pairwise interactions which, by direct summation, requires O(n2) work. In this paper, we discuss the incorporation of fast algorithms to reduce the cost of this calculation. By using the recently developed Fast Multipole Method (FMM), it is possible to compute all pairwise interactions in an amount of time proportional to n, making the overall scheme significantly more practical for large-scale problems.

Original languageEnglish (US)
StatePublished - 1988
Event1st National Fluid Dynamics Conference, 1988 - Cincinnati, United States
Duration: Jul 25 1988Jul 28 1988

Other

Other1st National Fluid Dynamics Conference, 1988
CountryUnited States
CityCincinnati
Period7/25/887/28/88

ASJC Scopus subject areas

  • Aerospace Engineering
  • Engineering (miscellaneous)

Fingerprint Dive into the research topics of 'Fast algorithms for vortex methods'. Together they form a unique fingerprint.

Cite this