Journal article
Algorithms for the reduction of matrix bandwidth and profile
Journal of Computational and Applied Mathematics, Vol.12-13, pp.551-561
1985
Abstract
Since 1969 a standard approach to the reduction of matrix bandwidth and profile has been to grow rooted level structures (RLSs) of the adjacency graph of the matrix, and then to use the ‘best’ RLS to generate a renumbering of the rows and columns. A generally effective, low-cost method for RLS growth is the Gibbs-Poole-Stockmeyer (GPS) algorithm, especially as modified by George and Liu. Recent work by Arany has suggested alternatives to the GPS algorithm. In this paper, algorithms proposed by Arany and several other new algorithms are described, and results of preliminary computer tests on ‘difficult’ renumbering problems are presented. In particular, RLSF width, bandwidth, profile, and CPU time are compared for four algorithms: Minimum Degree GPS, Minimum Degree Arany, Minimum Width Arany, and Maximum Swing.
Details
- Title
- Algorithms for the reduction of matrix bandwidth and profile
- Authors/Creators
- W.F. Smyth (Author/Creator)
- Publication Details
- Journal of Computational and Applied Mathematics, Vol.12-13, pp.551-561
- Publisher
- Elsevier BV
- Identifiers
- 991005541275607891
- Copyright
- © 1985 Published by Elsevier B.V.
- Murdoch Affiliation
- Murdoch University
- Language
- English
- Resource Type
- Journal article
Metrics
67 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Citation topics
- 7 Engineering & Materials Science
- 7.57 Modelling & Simulation
- 7.57.374 Advanced FEM
- Web Of Science research areas
- Mathematics, Applied
- ESI research areas
- Mathematics