NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE.

T. Taniguchi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The minimum profile problem of a sparse matrix is theoretically treated, and by using the results a new profile reducer is proposed. Numerical experiments clarify that the new reducer is effective for the node-reordering of graphs with rather complex configuration. Further considerations on the proposed method and the numerical error of the profile method are also given.

Original languageEnglish
Title of host publicationUnknown Host Publication Title
PublisherA. A. Balkema
Pages293-302
Number of pages10
ISBN (Print)9061915775
Publication statusPublished - 1985

Fingerprint

Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Taniguchi, T. (1985). NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE. In Unknown Host Publication Title (pp. 293-302). A. A. Balkema.

NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE. / Taniguchi, T.

Unknown Host Publication Title. A. A. Balkema, 1985. p. 293-302.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Taniguchi, T 1985, NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE. in Unknown Host Publication Title. A. A. Balkema, pp. 293-302.
Taniguchi T. NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE. In Unknown Host Publication Title. A. A. Balkema. 1985. p. 293-302
Taniguchi, T. / NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE. Unknown Host Publication Title. A. A. Balkema, 1985. pp. 293-302
@inproceedings{f68484f84b0e433e9d35ea4efce120c7,
title = "NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE.",
abstract = "The minimum profile problem of a sparse matrix is theoretically treated, and by using the results a new profile reducer is proposed. Numerical experiments clarify that the new reducer is effective for the node-reordering of graphs with rather complex configuration. Further considerations on the proposed method and the numerical error of the profile method are also given.",
author = "T. Taniguchi",
year = "1985",
language = "English",
isbn = "9061915775",
pages = "293--302",
booktitle = "Unknown Host Publication Title",
publisher = "A. A. Balkema",

}

TY - GEN

T1 - NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE.

AU - Taniguchi, T.

PY - 1985

Y1 - 1985

N2 - The minimum profile problem of a sparse matrix is theoretically treated, and by using the results a new profile reducer is proposed. Numerical experiments clarify that the new reducer is effective for the node-reordering of graphs with rather complex configuration. Further considerations on the proposed method and the numerical error of the profile method are also given.

AB - The minimum profile problem of a sparse matrix is theoretically treated, and by using the results a new profile reducer is proposed. Numerical experiments clarify that the new reducer is effective for the node-reordering of graphs with rather complex configuration. Further considerations on the proposed method and the numerical error of the profile method are also given.

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

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

M3 - Conference contribution

SN - 9061915775

SP - 293

EP - 302

BT - Unknown Host Publication Title

PB - A. A. Balkema

ER -

Access to Document