On the ordering of sparse linear systems

DOI10.1016/0304-3975(95)00151-4zbMath0875.65048OpenAlexW2023930998MaRDI QIDQ5906733

Giovanni Manzini

Publication date: 27 February 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

algorithmorderingGaussian eliminationsparse linear systemseffectiveness

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Evolution of the Minimum Degree Ordering Algorithm
• Generalized Nested Dissection
• Computing the Minimum Fill-In is NP-Complete
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Some comments on the solution of linear equations
• Nested Dissection of a Regular Finite Element Mesh

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