Reducing Complexity in Parallel Algebraic Multigrid Preconditioners (Q5470508)

From MaRDI portal
Revision as of 15:28, 19 March 2024 by Openalex240319020357 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5029280
Language Label Description Also known as
English
Reducing Complexity in Parallel Algebraic Multigrid Preconditioners
scientific article; zbMATH DE number 5029280

    Statements

    Reducing Complexity in Parallel Algebraic Multigrid Preconditioners (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 May 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    parallel coarsening algorithms
    0 references
    Poisson equation
    0 references
    finite difference method
    0 references
    numerical examples
    0 references
    large unstructured sparse linear systems
    0 references
    computational complexity
    0 references
    Krylov subspace methods
    0 references
    0 references
    0 references
    0 references