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

From MaRDI portal
Revision as of 03:02, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Convergence Characteristics and Computational Cost of Two Algebraic Kernels in Vortex Methods with a Tree-Code Algorithm
scientific article

    Statements

    Convergence Characteristics and Computational Cost of Two Algebraic Kernels in Vortex Methods with a Tree-Code Algorithm (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2010
    0 references
    0 references
    numerical simulation
    0 references
    convergence
    0 references
    computational particle methods
    0 references
    vortex methods
    0 references
    tree-code
    0 references
    \(N\)-body problems
    0 references
    hierarchical methods
    0 references
    0 references