스파스벡터법을 위한 서열산법의 최적화

An Optimization of Ordering Algorithm for Sparse Vector Method

The sparse vector method is more efficient than conventional sparse matrix method when solving sparse system. This paper considers the structural relation between factorized L and inverse of L and presents a new ordering algorithm for sparse vector method. The method is useful in enhancing the sparsity of the inverse of L while preserving the aparsity of matrix. The performance of algorithm is compared with conventional algorithms by means of several power system.