Sparsity considerations in network solution by tearing

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 s...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on circuits and systems Jg. 27; H. 5; S. 357 - 366
1. Verfasser: Hajj, I.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.05.1980
Schlagworte:
Active filters
Band pass filters
Circuit synthesis
Circuit theory
Circuits and systems
Education
Feedback loop
Lakes
Network synthesis
ISSN:0098-4094
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0098-4094
DOI:10.1109/TCS.1980.1084825