Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (Q803714)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4201466
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers |
scientific article; zbMATH DE number 4201466 |
Statements
Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (English)
0 references
1991
0 references
The author shows that the benefits of using large amounts of memory in direct factorizations of sparse, symmetric, positive-definite matrices more modest than pointed out by \textit{W. Murray} [Methods for linear programming, talk presented at the NATO Advanced Workshop on Algorithms and Model Formulations in Mathematical Programming, Bergen, Norway, 15-19 June 1987]. He gives the results of computational experiments performed on a variety of problems using IBM 3081 K, VAX 8550 and Sun-3/160. Relevant details about sparse Cholesky and data structures are described.
0 references
incore sparse Cholesky factorizations
0 references
direct factorizations
0 references
sparse, symmetric, positive-definite matrices
0 references
computational experiments
0 references
0 references
0.90805954
0 references
0.9029015
0 references
0.8938339
0 references
0.8827503
0 references
0.8744442
0 references
0.87187314
0 references
