A Note on Sparse Factorization in a Paging Environment
- 1 November 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 8 (6) , 1085-1088
- https://doi.org/10.1137/0908087
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- 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
- A New Implementation of Sparse Gaussian EliminationACM Transactions on Mathematical Software, 1982
- Solving Large Full Sets of Linear Equations in a Paged Virtual StoreACM Transactions on Mathematical Software, 1981
- Matrix computations with Fortran and pagingCommunications of the ACM, 1972