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 - Jul 1984

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Profile minimisation algorithm for sparse matrix'. Together they form a unique fingerprint.

  • Cite this