Abstract
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 large RLCM networks 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 the LU factorization makes it possible to solve very large problems in a reasonable amount of core storage and time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
