On the storage requirement in the out-of-core multifrontal method for sparse factorization

DOI10.1145/7921.11325zbMath0623.65031OpenAlexW1982838361MaRDI QIDQ3761561

Joseph W. H. Liu

Publication date: 1986

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/1986-12/

zbMATH Keywords

computational experimentsCholesky factorizationsparse factorizationmultifrontal methodeliminationout-of-corechild reorderingtree pebble game

Mathematics Subject Classification ID

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

Related Items (9)

Logarithmic barriers for sparse matrix cones ⋮ Scheduling series-parallel task graphs to minimize peak memory ⋮ An Application of Generalized Tree Pebbling to Sparse Matrix Factorization ⋮ Minimizing I/Os in Out-of-Core Task Tree Scheduling ⋮ A survey of direct methods for sparse linear systems ⋮ Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations ⋮ A review of frontal methods for solving linear systems ⋮ The impact of high-performance computing in the solution of linear systems: Trends and problems ⋮ The red-blue pebble game on trees and DAGs with large input

This page was built for publication: On the storage requirement in the out-of-core multifrontal method for sparse factorization