Locality of reference in sparse Cholesky factorization methods

zbMath1121.65310MaRDI QIDQ871154

Sivan Toledo, Elad Rozin

Publication date: 16 March 2007

Published in: ETNA. Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/128020

zbMATH Keywords

performanceCholesky factorizationlocality of referencetriangular factorizationmultifrontal methodscache efficiencyleft-looking algorithmmultifrontal algorithmsparse Cholesky

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison. ⋮ IPM based sparse LP solver on a heterogeneous processor ⋮ A Cholesky out-of-core factorization

Uses Software

• ATLAS
• MUMPS

This page was built for publication: Locality of reference in sparse Cholesky factorization methods