Node recording algorithm for decreasing the matrix profile is newly proposed, and its efficiency is surveyed through a number of test examples by comparing with the results by well-known RCM and GPS algorithms. Proposed algorithm consists of three steps; Firstly any graph obtained from the objective matrix is dissected into gatherings of simple subgraphs, secondly all nodes in each subgraph are ordered independently so as to decrease the fill-ins, and finally all nodes are rearranged in order to decrease residual zero entries in the profile area. The results show that the proposed method not only requires less computation time compared to the GPS algorithm but also can give better reorderings, especially for systems with rather complex topological structures.
|Number of pages||9|
|Journal||Doboku Gakkai ronbun hokokushu|
|Issue number||344 /I-1|
|Publication status||Published - Jan 1 1984|
ASJC Scopus subject areas