By Topic

Exploiting problem characteristics in the sparse matrix approach to frequency domain analysis

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
$31 $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

2 Author(s)

Most recent papers on sparse matrix methods in circuit analysis are written to describe large problem capability, but usually the illustrations given are for relatively small problems. In this paper a computer program for frequency domain analysis of largeRLCMnetworks is described. It is regularly used on 3000-4000 node networks with many large sets of mutually coupled inductors. Timing and storage figures are given for a 3300 node problem. In the first part, the generation of the admittance description for networks with mutual inductors is described. Then the sparse matrix techniques are discussed. Some are standard, but the unique use of storage utilized in the construction of theLUfactorization makes it possible to solve very large problems in a reasonable amount of core storage and time.

Published in:

Circuit Theory, IEEE Transactions on  (Volume:19 ,  Issue: 3 )