New renumbering algorithm for minimizing the bandwidth of sparse matrices

Takeo Taniguchi, Naruhito Shiraishi

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)173-179
Number of pages7
JournalAdvances in Engineering Software (1978)
Issue number4
Publication statusPublished - 1980

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'New renumbering algorithm for minimizing the bandwidth of sparse matrices'. Together they form a unique fingerprint.

Cite this