Algorithms for the reduction of matrix bandwidth and profile

DOI10.1016/0377-0427(85)90048-2zbMath0578.65033OpenAlexW2077510413MaRDI QIDQ1066617

W. F. Smyth

Publication date: 1985

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(85)90048-2

zbMATH Keywords

profilenumerical testsdirected graphnumberingLU decompositionGibbs-Poole-Stockmeyer algorithmpseudoperipheralreduction of matrix bandwidth

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (5)

A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph ⋮ Profile minimization on compositions of graphs ⋮ Profile minimization on products of graphs ⋮ Analysis of Probing Techniques for Sparse Approximation and Trace Estimation of Decaying Matrix Functions ⋮ On the profile of the corona of two graphs

Uses Software

• symrcm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Implementation of a Pseudoperipheral Node Finder
• An Automatic One-Way Dissection Algorithm for Irregular Finite Element Problems
• Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King Algorithms
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• Comparative Analysis of the Cuthill–McKee and the Reverse Cuthill–McKee Ordering Algorithms for Sparse Matrices

This page was built for publication: Algorithms for the reduction of matrix bandwidth and profile