Profile minimisation algorithm for sparse matrix

Takeo Taniguchi, Naruhito Shiraishi, Kyohei Itoh

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper a new renumbering method for minimising the profile of sparse matrices is proposed and its efficiency is surveyed through a number of numerical experiments. The characteristics of the new method are (1) it is effective only for the purpose of the profile minimisation; (2) it does not order nodes in accordance with the level structure constructes from the starting node; and (3) it is applicable for any kind of two-dimensional system.

Original languageEnglish
Pages (from-to)156-163
Number of pages8
JournalAdvances in Engineering Software (1978)
Volume6
Issue number3
DOIs
Publication statusPublished - 1984

Fingerprint

Experiments

Keywords

  • minimisation
  • profile
  • sparse matrices
  • starting node
  • two-dimensional systems

ASJC Scopus subject areas

  • Software
  • Computational Mechanics

Cite this

Profile minimisation algorithm for sparse matrix. / Taniguchi, Takeo; Shiraishi, Naruhito; Itoh, Kyohei.

In: Advances in Engineering Software (1978), Vol. 6, No. 3, 1984, p. 156-163.

Research output: Contribution to journalArticle

Taniguchi, Takeo ; Shiraishi, Naruhito ; Itoh, Kyohei. / Profile minimisation algorithm for sparse matrix. In: Advances in Engineering Software (1978). 1984 ; Vol. 6, No. 3. pp. 156-163.
@article{b19bc2d8a3d64178b28179711904996d,
title = "Profile minimisation algorithm for sparse matrix",
abstract = "In this paper a new renumbering method for minimising the profile of sparse matrices is proposed and its efficiency is surveyed through a number of numerical experiments. The characteristics of the new method are (1) it is effective only for the purpose of the profile minimisation; (2) it does not order nodes in accordance with the level structure constructes from the starting node; and (3) it is applicable for any kind of two-dimensional system.",
keywords = "minimisation, profile, sparse matrices, starting node, two-dimensional systems",
author = "Takeo Taniguchi and Naruhito Shiraishi and Kyohei Itoh",
year = "1984",
doi = "10.1016/0141-1195(84)90027-5",
language = "English",
volume = "6",
pages = "156--163",
journal = "Advances in Engineering Software",
issn = "0965-9978",
publisher = "Elsevier Limited",
number = "3",

}

TY - JOUR

T1 - Profile minimisation algorithm for sparse matrix

AU - Taniguchi, Takeo

AU - Shiraishi, Naruhito

AU - Itoh, Kyohei

PY - 1984

Y1 - 1984

N2 - In this paper a new renumbering method for minimising the profile of sparse matrices is proposed and its efficiency is surveyed through a number of numerical experiments. The characteristics of the new method are (1) it is effective only for the purpose of the profile minimisation; (2) it does not order nodes in accordance with the level structure constructes from the starting node; and (3) it is applicable for any kind of two-dimensional system.

AB - In this paper a new renumbering method for minimising the profile of sparse matrices is proposed and its efficiency is surveyed through a number of numerical experiments. The characteristics of the new method are (1) it is effective only for the purpose of the profile minimisation; (2) it does not order nodes in accordance with the level structure constructes from the starting node; and (3) it is applicable for any kind of two-dimensional system.

KW - minimisation

KW - profile

KW - sparse matrices

KW - starting node

KW - two-dimensional systems

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

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

U2 - 10.1016/0141-1195(84)90027-5

DO - 10.1016/0141-1195(84)90027-5

M3 - Article

AN - SCOPUS:0021463358

VL - 6

SP - 156

EP - 163

JO - Advances in Engineering Software

JF - Advances in Engineering Software

SN - 0965-9978

IS - 3

ER -