NEW ORDERING METHODS FOR SPARSE-MATRIX INVERSION VIA DIAGONALIZATION

Two new ordering methods that can he used to reduce the elements in th e inverse factors of a sparse matrix are proposed. Compared with all o ther commonly used ordering methods, the new methods will produce less fill-in elements. The proposed methods are based are the diagonalizat ion of A via the use of a transformation matrix, C. A new node sequenc e for the power network and all the elements of the C: matrix are gene rated in only a single stage instead of the conventional LDU decomposi tion followed by a series of multiplications for W-matrix. The methods may he used for the parallel solution of sparse matrix equations., Te st results show that the: proposed methods can reduce the computation burden effectively.