An efficient heuristic ordering algorithm for partial matrix refactorization
- 1 January 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 3 (3), 1181-1187
- https://doi.org/10.1109/59.14579
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient parallel processing technique for inverting matrices with random sparsityIEE Proceedings E Computers and Digital Techniques, 1986
- Parallel Inversion of Sparse Matrices.IEEE Transactions on Power Systems, 1986
- Partial Matrix RefactorizationIEEE Transactions on Power Systems, 1986
- Sparse Vector MethodsIEEE Transactions on Power Apparatus and Systems, 1985
- The Use of Multiple Factoring in the Parallel Solution of Algebraic EquationsIEEE Transactions on Power Apparatus and Systems, 1983
- Sparsity-Oriented Compensation Methods for Modified Network SolutionsIEEE Transactions on Power Apparatus and Systems, 1983
- Algorithmic Aspects of Vertex Elimination on Directed GraphsSIAM Journal on Applied Mathematics, 1978
- Parallel Tridiagonal Equation SolversACM Transactions on Mathematical Software, 1975
- A Comparison of Sparsity Orderings for Obtaining a Pivotal Sequence in Gaussian EliminationIMA Journal of Applied Mathematics, 1974
- Techniques for Exploiting the Sparsity or the Network Admittance MatrixIEEE Transactions on Power Apparatus and Systems, 1963