A graph theoretical interpretation of nonsymmetric permutation on sparse matrices
- 1 April 1977
- journal article
- research article
- Published by Wiley in International Journal of Circuit Theory and Applications
- Vol. 5 (2) , 139-147
- https://doi.org/10.1002/cta.4490050206
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Toward Characterization of Perfect Elimination DigraphsSIAM Journal on Computing, 1973
- Sparse Matrices and their ApplicationsPublished by Springer Nature ,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
- An Optimal Ordering of Electronic Circuit Equations for a Sparse Matrix SolutionIEEE Transactions on Circuit Theory, 1971
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Sparsity-Directed Decomposition for Gaussian Elimination on MatricesIEEE Transactions on Power Apparatus and Systems, 1970
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969
- A sparse matrix scheme for the computer analysis of structuresInternational Journal of Computer Mathematics, 1968
- Direct solutions of sparse network equations by optimally ordered triangular factorizationProceedings of the IEEE, 1967