NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE.

T. Taniguchi

NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE.

T. Taniguchi

Center for Safe and Disaster-Resistant Society

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 language	English
Title of host publication	Unknown Host Publication Title
Publisher	A. A. Balkema
Pages	293-302
Number of pages	10
ISBN (Print)	9061915775
Publication status	Published - Jan 1 1985

ASJC Scopus subject areas

Engineering(all)

Access to Document

Fingerprint Dive into the research topics of 'NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE.'. Together they form a unique fingerprint.

Cite this

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

month = jan,

day = "1",

language = "English",

isbn = "9061915775",

publisher = "A. A. Balkema",

pages = "293--302",

booktitle = "Unknown Host Publication Title",

}

TY - GEN

T1 - NEW ALGORITHM FOR THE REDUCTION OF MATRIX PROFILE.

AU - Taniguchi, T.

PY - 1985/1/1

Y1 - 1985/1/1

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

AN - SCOPUS:0021841733

SN - 9061915775

SP - 293

EP - 302

BT - Unknown Host Publication Title

PB - A. A. Balkema

ER -