Limiting Communication in Parallel Sparse Cholesky Factorization (Q3359645)

From MaRDI portal
Revision as of 15:31, 4 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Limiting Communication in Parallel Sparse Cholesky Factorization
scientific article

    Statements

    Limiting Communication in Parallel Sparse Cholesky Factorization (English)
    0 references
    0 references
    0 references
    1991
    0 references
    parallel algorithm
    0 references
    Cholesky factorization
    0 references
    large sparse symmetric positive definite matrix
    0 references
    message-passing multiprocessor
    0 references
    Test problems
    0 references
    hypercube
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references