Locality of reference in sparse Cholesky factorization methods

zbMATH Open1121.65310MaRDI QIDQ871154FDOQ871154

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

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)

Cited In (4)

• A Cholesky out-of-core factorization
• Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.
• Title not available (Why is that?)
• IPM based sparse LP solver on a heterogeneous processor

Uses Software

• ATLAS
• MUMPS

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Localization of matrix factorizations 👍 👎
• Multiple-rank modifications of a sparse Cholesky factorization 👍 👎
• Locality of Reference in LU Decomposition with Partial Pivoting 👍 👎
• Sparse Cholesky Factorization on a Local-Memory Multiprocessor 👍 👎
• Highly Parallel Sparse Cholesky Factorization 👍 👎
• Local inversion of matrices with sparse inverses 👍 👎
• Modified Cholesky Factorizations for Sparse Preconditioners 👍 👎
• A Sparse Factorization for Fast Computation of Localizing Modes 👍 👎

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)