An efficient ordering algorithm to improve sparse vector methods

The authors present a novel node-ordering algorithm to enhance sparse vector methods in power system analysis. The proposed technique locally minimizes the number of nonzero elements of the inverse of the table of factors. It uses the cardinality of the set of nodes which precede each node in the path graph as a tie-break criterion in the minimum degree elimination process. Test results are included showing that the method performs better than previously published methods.<
>