On the ordering of sparse linear systems

DOI10.1016/0304-3975(95)00151-4zbMATH Open0876.65026OpenAlexW2023930998MaRDI QIDQ5967079

Giovanni Manzini

Publication date: 9 September 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00151-4

zbMATH Keywords

algorithmsorderingGaussian eliminationsparse linear systems

Mathematics Subject Classification ID

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

Related Items (2)

On sparse matrix orderings in interior point methods ⋮ Ordering algorithms for irreducible sparse linear systems

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• On sparse matrix orderings in interior point methods 👍 👎
• A note on sparse solutions of sparse linear systems 👍 👎
• Code orderings for the solution of sparse positive definite linear systems 👍 👎
• Ordering algorithms for irreducible sparse linear systems 👍 👎
• A Block Ordering Method for Sparse Matrices 👍 👎
• Evaluation of Orderings for Unsymmetric Sparse Matrices 👍 👎
• Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems 👍 👎
• On the ordering of sparse linear systems 👍 👎

This page was built for publication: On the ordering of sparse linear systems