Simple heuristic algorithm for profile reduction of arbitrary sparse matrix

摘要

The simple universal algorithm for profile reduction of arbitrary sparse matrix is described. It is shown that even for intelligent strategy of generation and numbering of internal nodes suggested algorithm can reduce profile by factor 2–3. This method can be modified easily for general task of matrix transformation to arbitrary desirable form. To minimize the profile further the method can be embedded in depth-first search of artificial intelligence.