A Note on Sparse Factorization in a Paging Environment

DOI10.1137/0908087zbMath0657.65038OpenAlexW2025857468MaRDI QIDQ3805748

Joseph W. H. Liu

Publication date: 1987

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0908087

zbMATH Keywords

Cholesky factorizationreorderingelimination treelarge sparse symmetric positive definite matricesvirtual memory paging system

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (2)

A survey of direct methods for sparse linear systems ⋮ Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers

This page was built for publication: A Note on Sparse Factorization in a Paging Environment