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.
|ホスト出版物のタイトル||Unknown Host Publication Title|
|出版社||A. A. Balkema|
|出版ステータス||Published - 1月 1 1985|
ASJC Scopus subject areas