Locality of reference in sparse Cholesky factorization methods

MaRDI QIDQ871154zbMATH OpenFDO

Authors Elad Rozin, Sivan Toledo

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, http://etna.mcs.kent.edu/vol.21.2005/pp81-106.dir/pp81-106.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

performancemultifrontal methodsCholesky factorizationlocality of referencetriangular factorizationcache efficiencyleft-looking algorithmmultifrontal algorithmsparse Cholesky

Mathematics Subject Classification ID

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

Recommendations

• Sparse Cholesky Factorization on a Local-Memory Multiprocessor
• Locality of Reference in LU Decomposition with Partial Pivoting
• A Sparse Factorization for Fast Computation of Localizing Modes
• Localization of matrix factorizations
• Publication:4860191
• Publication:4860184
• Highly Parallel Sparse Cholesky Factorization
• Local inversion of matrices with sparse inverses
• Multiple-rank modifications of a sparse Cholesky factorization
• Modified Cholesky Factorizations for Sparse Preconditioners

Cited in

(4)

• Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.
• A Cholesky out-of-core factorization
• scientific article; zbMATH DE number 1729264 (Why is no real title available?)
• IPM based sparse LP solver on a heterogeneous processor

Describes a project that uses

Uses Software

• MUMPS
• ATLAS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q871154)