Numerically aware orderings for sparse symmetric indefinite linear systems

DOI10.1145/3104991MaRDI QIDQ4581369zbMATH OpenOpenAlexWikidataFDO

Authors J. D. Hogg, J. A. Scott, Sue Thorne

Publication date 17 August 2018

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

Full work available at URL http://centaur.reading.ac.uk/71797/1/num_aware_order_R2.pdf

zbMATH Keywords

nested dissectionnumerically aware orderingsparse direct methodssparse matrix orderingsparse symmetric matrices

Mathematics Subject Classification ID

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

Recommendations

• Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
• Unsymmetric Ordering Using A Constrained Markowitz Scheme
• On fast factorization pivoting methods for sparse symmetric indefinite systems
• Preordering saddle‐point systems for sparse LDL^T factorization without pivoting
• New pivot selection for sparse symmetric indefinite factorization

Cited in

(7)

• Ordering algorithms for irreducible sparse linear systems
• New pivot selection for sparse symmetric indefinite factorization
• scientific article; zbMATH DE number 1442000 (Why is no real title available?)
• Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems
• Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
• On the ordering of sparse linear systems
• Sparse linear least-squares problems

This page was built for publication: Numerically aware orderings for sparse symmetric indefinite linear systems

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