Complexities of the design of the bandwidth and profile minimisation algorithms

Takeo Taniguchi

doi:10.1016/0141-1195(84)90155-4

Complexities of the design of the bandwidth and profile minimisation algorithms

Takeo Taniguchi

Center for Safe and Disaster-Resistant Society

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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	https://doi.org/10.1016/0141-1195(84)90155-4
Publication status	Published - Jan 1984

ASJC Scopus subject areas

Engineering(all)

Access to Document

10.1016/0141-1195(84)90155-4

Cite this

@article{16ca00050e504070905b1205edb65a7b,

title = "Complexities of the design of the bandwidth and profile minimisation algorithms",

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.",

author = "Takeo Taniguchi",

year = "1984",

month = jan,

doi = "10.1016/0141-1195(84)90155-4",

language = "English",

volume = "6",

pages = "22--29",

journal = "Advances in Engineering Software",

issn = "0965-9978",

publisher = "Elsevier Limited",

number = "1",

}

TY - JOUR

T1 - Complexities of the design of the bandwidth and profile minimisation algorithms

AU - Taniguchi, Takeo

PY - 1984/1

Y1 - 1984/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=48749141180&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=48749141180&partnerID=8YFLogxK

U2 - 10.1016/0141-1195(84)90155-4

DO - 10.1016/0141-1195(84)90155-4

M3 - Article

AN - SCOPUS:48749141180

VL - 6

SP - 22

EP - 29

JO - Advances in Engineering Software

JF - Advances in Engineering Software

SN - 0965-9978

IS - 1

ER -

Complexities of the design of the bandwidth and profile minimisation algorithms

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this