Limiting Communication in Parallel Sparse Cholesky Factorization (Q3359645): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0912063 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996471375 / rank | |||
Normal rank | |||
Latest revision as of 18:13, 19 March 2024
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
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
