Techniques for Exploiting the Sparsity or the Network Admittance Matrix
- 1 December 1963
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Apparatus and Systems
- Vol. 82 (69), 944-950
- https://doi.org/10.1109/tpas.1963.291477
Abstract
This paper describes some computer programing techniques for taking advantage of the sparsity of the admittance matrix. The techniques are based on two main ideas; (1) determination of a sequence of operations. which results in a near minimum of memory and computing, (2) preservation of these operations for repetition. Use of these techniques makes it possible to obtain significant reductions in memory and processing time for many network analysis programs. Claims are substantiated by actual results.Keywords
This publication has 5 references indexed in Scilit:
- Power Flow Solution by Impedance Matrix Iterative MethodIEEE Transactions on Power Apparatus and Systems, 1963
- Elimination Methods for Load-Flow StudiesTransactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems, 1961
- Digital Computation or Power Flow - Some New AspectsTransactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems, 1959
- A new direct matrix inversion methodTransactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics, 1959
- Digital Computer Solution of Power-Flow Problems [includes discussion]Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems, 1956