Code orderings for the solution of sparse positive definite linear systems

DOI10.1016/S0168-9274(98)00090-7MaRDI QIDQ1294571zbMATH OpenFDO

Authors Ricardo D. Arantes

Publication date 28 February 2000

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0168-9274(98)00090-7

zbMATH Keywords

direct methodshigh performance computingimplicit reordering schemesincomplete factorizationsloop-free codespreconditioningsparse matrix factorizations

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical computation of matrix norms, conditioning, scaling (65F35) Computational methods for sparse matrices (65F50)

Recommendations

• The use of profile reduction algorithms with a frontal code
• scientific article; zbMATH DE number 1069171
• The multiple minimum degree ordering with greedy graph compression for vector computers

Cited in

(2)

• Ordering algorithms for irreducible sparse linear systems
• On the ordering of sparse linear systems

This page was built for publication: Code orderings for the solution of sparse positive definite linear systems

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