Abstract
This paper treats theoretically the minimum bandwidth and profile problems which are required to be solved for the design of the efficient renumbering algorithms for minimising the bandwidth and profile of a sparse matrix, and it clarifies what decides the minimum values. From the relations between the theoretical results and the assumed input-data the possibility of the design of the renumbering algorithms is also investigated.
Original language | English |
---|---|
Pages (from-to) | 22-29 |
Number of pages | 8 |
Journal | Advances in Engineering Software (1978) |
Volume | 6 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 1984 |
ASJC Scopus subject areas
- Engineering(all)