DocumentCode :
1183776
Title :
Sparsity considerations in network solution by tearing
Author :
Hajj, Ibrahim N.
Volume :
27
Issue :
5
fYear :
1980
fDate :
5/1/1980 12:00:00 AM
Firstpage :
357
Lastpage :
366
Abstract :
Network solution by tearing consists of partitioning the network into subnetworks, solving each subnetwork separately, and then combining the subnetwork solutions to obtain the solution of the entire network. In this paper it is shown that all recently proposed sparse matrix algorithms for network solution by tearing belong to a set of algorithms which is derived by applying block matrix elimination to a partitioned system of network equations. The computational requirements of the algorithms are determined and compared. Equation sparsity is considered at all levels in the solution process. In particular, the structures of the equations at the subnetwork level as well as the interconnection level are analyzed in detail.
Keywords :
Computer-aided circuit analysis and design; Diakoptics; Sparse-matrix methods; Active filters; Band pass filters; Circuit synthesis; Circuit theory; Circuits and systems; Education; Feedback loop; Lakes; Network synthesis; Notice of Violation;
fLanguage :
English
Journal_Title :
Circuits and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-4094
Type :
jour
DOI :
10.1109/TCS.1980.1084825
Filename :
1084825
Link To Document :
بازگشت