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.
|Title of host publication||Unknown Host Publication Title|
|Publisher||A. A. Balkema|
|Number of pages||10|
|Publication status||Published - Jan 1 1985|
ASJC Scopus subject areas