The multifrontal method and paging in sparse Cholesky factorization

DOI10.1145/76909.76911MaRDI QIDQ4371630zbMATH OpenOpenAlexFDO

Authors 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 factorizationelimination treemultifrontal methodpagingsparse matrix

Mathematics Subject Classification ID

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

Cited in

(4)

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

This page was built for publication: The multifrontal method and paging in sparse Cholesky factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371630)