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

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