Symbolic Cholesky factorization on a local-memory multiprocessor (Q1822452)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Symbolic Cholesky factorization on a local-memory multiprocessor |
scientific article; zbMATH DE number 4003358
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Symbolic Cholesky factorization on a local-memory multiprocessor |
scientific article; zbMATH DE number 4003358 |
Statements
Symbolic Cholesky factorization on a local-memory multiprocessor (English)
0 references
1987
0 references
One of the standard steps of the Cholesky factorization algorithm, namely the parallel symbolic factorization step for sparse symmetric matrices is presented. The algorithm is designed for a message-passing distributed- memory multiprocessor (no global memory is shared). Numerical experiments on Intel hypercube are given.
0 references
Intel iPSC hypercube
0 references
Cholesky factorization
0 references
parallel symbolic factorization
0 references
sparse symmetric matrices
0 references
message-passing distributed- memory multiprocessor
0 references
Numerical experiments
0 references
