Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization

DOI10.1137/S0895479897319313MaRDI QIDQ4702236zbMATH OpenFDO

Authors Padma Raghavan, Esmond G. Ng

Publication date 24 November 1999

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895479897319313

zbMATH Keywords

Gaussian eliminationgreedy orderingminimum deficiencyminimum degreenumerical examplesperformancesparse Cholesky factorizationsparse matrix ordering

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

• Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
• On Optimal Reorderings of Sparse Matrices for Parallel Cholesky Factorizations
• scientific article; zbMATH DE number 554763
• A column approximate minimum degree ordering algorithm

Cited in

(4)

• The multiple minimum degree ordering with greedy graph compression for vector computers
• scientific article; zbMATH DE number 554763 (Why is no real title available?)
• Node Selection Strategies for Bottom-Up Sparse Matrix Ordering
• Flexible incomplete Cholesky factorization with multi-parameters to control the number of nonzero elements in preconditioners

This page was built for publication: Performance of Greedy Ordering Heuristics for Sparse Cholesky Factorization

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