By Topic

Sparsity considerations in network solution by tearing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

IEEE Transactions on Circuits and Systems  (Volume:27 ,  Issue: 5 )