Algorithms for the reduction of matrix bandwidth and profile
From MaRDI portal
Publication:1066617
DOI10.1016/0377-0427(85)90048-2zbMath0578.65033OpenAlexW2077510413MaRDI QIDQ1066617
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
profilenumerical testsdirected graphnumberingLU decompositionGibbs-Poole-Stockmeyer algorithmpseudoperipheralreduction of matrix bandwidth
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
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
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithms for the reduction of matrix bandwidth and profile
