The design and implementation of a new out-of-core sparse cholesky factorization method

DOI10.1145/974781.974783zbMath1072.65040OpenAlexW2049226297WikidataQ113309734 ScholiaQ113309734MaRDI QIDQ5461183

Vladimir Rotkin, Sivan Toledo

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

zbMATH Keywords

right-looking and left-looking updates.sparse Cholesky factorization methodsubtree-scheduling algorithm

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Direct numerical methods for linear systems and matrix inversion (65F05) Packaged methods for numerical algorithms (65Y15)

Related Items (4)

Parallel direct solver for solving systems of linear equations resulting from finite element method on multi-core desktops and workstations ⋮ A survey of direct methods for sparse linear systems ⋮ Analysis of the solution phase of a parallel multifrontal approach ⋮ Tests with FALKSOL. A massively parallel multi-level domain decomposing direct solver

Uses Software

• ATLAS
• MUMPS
• TAUCS
• SOLAR

This page was built for publication: The design and implementation of a new out-of-core sparse cholesky factorization method