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...
Main Authors: | Marzouk, Youssef M., Schlegel, Fabrice, Ghoniem, Ahmed F. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | en_US |
Published: |
Society for Industrial and Applied Mathematics
2010
|
Online Access: | http://hdl.handle.net/1721.1/52343 https://orcid.org/0000-0001-8242-3290 https://orcid.org/0000-0001-8730-272X |
Similar Items
-
Contributions of the wall boundary layer to the formation of the counter-rotating vortex pair in transverse jets
by: Schlegel, Fabrice, et al.
Published: (2012) -
Algebras for Tree Algorithms
by: Gibbons, J
Published: (1991) -
Algebras for tree algorithms
by: Gibbons, J
Published: (1991) -
Geometry-informed irreversible perturbations for accelerated convergence of Langevin dynamics
by: Zhang, Benjamin J., et al.
Published: (2022) -
Mercer Kernels and Integrated Variance Experimental Design: Connections Between Gaussian Process Regression and Polynomial Approximation
by: Gorodetsky, Alex Arkady, et al.
Published: (2018)