On the storage requirement in the out-of-core multifrontal method for sparse factorization
From MaRDI portal
Publication:3761561
DOI10.1145/7921.11325zbMath0623.65031MaRDI QIDQ3761561
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/
computational experiments; Cholesky factorization; sparse factorization; multifrontal method; elimination; out-of-core; child reordering; tree pebble game
65F50: Computational methods for sparse matrices
15A23: Factorization of matrices
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Logarithmic barriers for sparse matrix cones, A survey of direct methods for sparse linear systems, Minimizing I/Os in Out-of-Core Task Tree Scheduling, A review of frontal methods for solving linear systems, The impact of high-performance computing in the solution of linear systems: Trends and problems, Scheduling series-parallel task graphs to minimize peak memory, The red-blue pebble game on trees and DAGs with large input, Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations, An Application of Generalized Tree Pebbling to Sparse Matrix Factorization