On Optimal-Pivoting Algorithms in Sparse Matrices
- 1 January 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 19 (1), 93-96
- https://doi.org/10.1109/TCT.1972.1083385
Abstract
This correspondence presents an alternate method for finding the minimum fill-in during each step of elimination for both the GaussJordan elimination and the Gaussian elimination. The correspondence also describes an improvement in sparsity in computer-aided large-network analysis by obtaining the optimal pivot at each step of elimination on sparse matrices. This proposed optimal-pivot ordering appears to lead to an overall minimum for computer storage and arithmetic operation count.Keywords
This publication has 12 references indexed in Scilit:
- On the gaussian elimination method for inverting sparse matricesComputing, 1972
- On Optimal-Pivoting Algorithms in Sparse MatricesIEEE Transactions on Circuit Theory, 1972
- The Sparse Tableau Approach to Network Analysis and DesignIEEE Transactions on Circuit Theory, 1971
- Effective Ordering of Sparse Matrices Arising from Nonlinear Electrical NetworksIEEE Transactions on Circuit Theory, 1971
- Sparsity-Directed Decomposition for Gaussian Elimination on MatricesIEEE Transactions on Power Apparatus and Systems, 1970
- The Product Form of Inverses of Sparse Matrices and Graph TheorySIAM Review, 1967
- Direct solutions of sparse network equations by optimally ordered triangular factorizationProceedings of the IEEE, 1967
- A Compact Storage Scheme for the Solution of Symmetric Linear Simultaneous EquationsThe Computer Journal, 1966
- On the Product Form of Inverses of Sparse MatricesSIAM Review, 1966
- Techniques for Exploiting the Sparsity or the Network Admittance MatrixIEEE Transactions on Power Apparatus and Systems, 1963