An efficient ordering algorithm to improve sparse vector methods
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 3 (4) , 1538-1544
Abstract
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.>Keywords
This publication has 7 references indexed in Scilit:
- Efficient bounding method for linear contingency analysisIEEE Transactions on Power Systems, 1988
- An efficient heuristic ordering algorithm for partial matrix refactorizationIEEE Transactions on Power Systems, 1988
- Parallel Inversion of Sparse Matrices.IEEE Transactions on Power Systems, 1986
- Partial Matrix RefactorizationIEEE Transactions on Power Systems, 1986
- Generalized Method of Fault AnalysisIEEE Transactions on Power Apparatus and Systems, 1985
- Sparse Vector MethodsIEEE Transactions on Power Apparatus and Systems, 1985
- Direct solutions of sparse network equations by optimally ordered triangular factorizationProceedings of the IEEE, 1967