Complexities of the design of the bandwidth and profile minimisation algorithms

Takeo Taniguchi

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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 languageEnglish
Pages (from-to)22-29
Number of pages8
JournalAdvances in Engineering Software (1978)
Issue number1
Publication statusPublished - Jan 1984
Externally publishedYes

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'Complexities of the design of the bandwidth and profile minimisation algorithms'. Together they form a unique fingerprint.

Cite this