An out-of-core sparse symmetric-indefinite factorization method

DOI10.1145/1163641.1163645MaRDI QIDQ3549191zbMATH OpenOpenAlexWikidataFDO

Authors Omer Meshar, Dror Irony, Sivan Toledo

Publication date 21 December 2008

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1163641.1163645

Mathematics Subject Classification ID

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

Recommendations

• The design and implementation of a new out-of-core sparse cholesky factorization method
• An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
• An out-of-core sparse Cholesky solver
• Communication-avoiding symmetric-indefinite factorization
• New pivot selection for sparse symmetric indefinite factorization

Cites work

• mctoolbox

Cited in

(8)

• An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme
• A survey of direct methods for sparse linear systems
• Use of the ${\text{P}}^4 $ and ${\text{P}}^5 $ Algorithms for In-Core Factorization of Sparse Matrices
• The design and implementation of a new out-of-core sparse cholesky factorization method
• On the storage requirement in the out-of-core multifrontal method for sparse factorization
• On computing inverse entries of a sparse matrix in an out-of-core environment
• scientific article; zbMATH DE number 2152756 (Why is no real title available?)
• Combinatorial Aspects in Sparse Elimination Methods

Describes a project that uses

Uses Software

• HSL
• MUMPS
• TAUCS
• SPOOLES
• mctoolbox
• MA27

This page was built for publication: An out-of-core sparse symmetric-indefinite factorization method

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