Convergence Characteristics and Computational Cost of Two Algebraic Kernels in Vortex Methods with a Tree-Code Algorithm

Convergence Characteristics and Computational Cost of Two Algebraic Kernels in Vortex Methods with a Tree-Code Algorithm

We study the convergence characteristics of two algebraic kernels used in vortex calculations: the Rosenhead-Moore kernel, which is a low-order kernel, and the Winckelmans-Leonard kernel, which is a high-order kernel. To facilitate the study, a method of evaluating particle-cluster interactions is i...

Full description

Bibliographic Details
Main Authors: Marzouk, Youssef M. (Contributor), Schlegel, Fabrice (Contributor), Ghoniem, Ahmed F. (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Department of Mechanical Engineering (Contributor)
Format: Article
Language:English
Published: Society for Industrial and Applied Mathematics, 2010-03-05T16:42:45Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items