Limiting Communication in Parallel Sparse Cholesky Factorization (Q3359645)
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: Limiting Communication in Parallel Sparse Cholesky Factorization |
scientific article; zbMATH DE number 4213317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Limiting Communication in Parallel Sparse Cholesky Factorization |
scientific article; zbMATH DE number 4213317 |
Statements
Limiting Communication in Parallel Sparse Cholesky Factorization (English)
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
0.8496930003166199
0 references
0.8455798029899597
0 references
0.845295786857605
0 references
