Efficient sparse matrix factorization on high performance workstations—exploiting the memory hierarchy
- 1 September 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 17 (3) , 313-334
- https://doi.org/10.1145/114697.116809
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Sparse matrix test problemsACM Transactions on Mathematical Software, 1989
- A Note on Sparse Factorization in a Paging EnvironmentSIAM Journal on Scientific and Statistical Computing, 1987
- A compact row storage scheme for Cholesky factors using elimination treesACM Transactions on Mathematical Software, 1986
- Modification of the minimum-degree algorithm by multiple eliminationACM Transactions on Mathematical Software, 1985
- Squeezing the most out of an algorithm in CRAY FORTRANACM Transactions on Mathematical Software, 1984
- The Multifrontal Solution of Indefinite Sparse Symmetric LinearACM Transactions on Mathematical Software, 1983