The multifrontal method and paging in sparse Cholesky factorization

DOI10.1145/76909.76911zbMath0900.65062OpenAlexW2049945015MaRDI QIDQ4371630

Joseph W. H. Liu

Publication date: 18 March 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1989-15/

zbMATH Keywords

Cholesky factorizationsparse matrixmultifrontal methodpagingelimination tree

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A survey of direct methods for sparse linear systems ⋮ FPGA implementation of a Cholesky algorithm for a shared-memory multiprocessor architecture ⋮ A parallel solver for adaptive finite element discretizations ⋮ Feasibility issues in a primal-dual interior-point method for linear programming