Code orderings for the solution of sparse positive definite linear systems

DOI10.1016/S0168-9274(98)00090-7zbMATH Open0931.65023MaRDI QIDQ1294571FDOQ1294571

Ricardo D. Arantes

Publication date: 28 February 2000

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

zbMATH Keywords

preconditioningdirect methodshigh performance computingincomplete factorizationsimplicit reordering schemesloop-free codessparse matrix factorizations

Mathematics Subject Classification ID

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

Cited In (2)

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

   Recommendations

• The use of profile reduction algorithms with a frontal code 👍 👎
• Title not available (Why is that?) 👍 👎
• The multiple minimum degree ordering with greedy graph compression for vector computers 👍 👎

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)