The design and implementation of a new out-of-core sparse cholesky factorization method
From MaRDI portal
Publication:5461183
DOI10.1145/974781.974783zbMath1072.65040WikidataQ113309734 ScholiaQ113309734MaRDI QIDQ5461183
Publication date: 22 July 2005
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/974781.974783
right-looking and left-looking updates.; sparse Cholesky factorization method; subtree-scheduling algorithm
65F50: Computational methods for sparse matrices
65F05: Direct numerical methods for linear systems and matrix inversion
65Y15: Packaged methods for numerical algorithms
Related Items
A survey of direct methods for sparse linear systems, Analysis of the solution phase of a parallel multifrontal approach, Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations, Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver
Uses Software