TY - JOUR
T1 - New renumbering algorithm for minimizing the bandwidth of sparse matrices
AU - Taniguchi, Takeo
AU - Shiraishi, Naruhito
PY - 1980
Y1 - 1980
N2 - The minimum bandwidth of a sparse matrix is proved to be a kind of the width of a graph which is obtained from the matrix in question, and by using this result we not only clarify the reasons of the complexity to obtain the minimum bandwidth by digital computer but also, on the contrary, that we can design effective renumbering algorithm only for systems having a kind of topological structure. Under this restriction new renumbering algorithm which can reduce the bandwidth to the minimum or near minimum value is presented.
AB - The minimum bandwidth of a sparse matrix is proved to be a kind of the width of a graph which is obtained from the matrix in question, and by using this result we not only clarify the reasons of the complexity to obtain the minimum bandwidth by digital computer but also, on the contrary, that we can design effective renumbering algorithm only for systems having a kind of topological structure. Under this restriction new renumbering algorithm which can reduce the bandwidth to the minimum or near minimum value is presented.
UR - http://www.scopus.com/inward/record.url?scp=49149141900&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=49149141900&partnerID=8YFLogxK
U2 - 10.1016/0141-1195(80)90051-0
DO - 10.1016/0141-1195(80)90051-0
M3 - Article
AN - SCOPUS:49149141900
SN - 0141-1195
VL - 2
SP - 173
EP - 179
JO - Advances in Engineering Software (1978)
JF - Advances in Engineering Software (1978)
IS - 4
ER -