DocumentCode
874891
Title
A new matrix solution technique for general circuit simulation
Author
Burch, Richard ; Yang, Ping ; Cox, Paul ; Mayaram, Kartikeya
Author_Institution
Texas Instruments Inc., Dallas, TX, USA
Volume
12
Issue
2
fYear
1993
fDate
2/1/1993 12:00:00 AM
Firstpage
225
Lastpage
241
Abstract
An intelligent partial Gauss-Seidel scheme (PGS) for general circuit simulation is described. This approach is a novel combination of direct solution using incomplete LU factorization, and iterative solution using Gauss-Seidel relaxation. The method converges faster and more reliably than Gauss-Seidel, while taking a comparable amount of execution time per iteration. Reliable analytic rules are derived such that terms that would be relaxed in Gauss-Seidel are relaxed only if they are considered small by applying these rules. Solution speeds up to ten times faster than direct methods have been demonstrated and higher gains are anticipated for larger circuits. This scheme is robust and accurate for circuits with many different element types, including bipolar transistors, MOSFETs, diodes, inductors, and dependent sources
Keywords
circuit analysis computing; convergence of numerical methods; digital simulation; iterative methods; matrix algebra; relaxation theory; Gauss-Seidel relaxation; circuit simulation; incomplete LU factorization; intelligent partial Gauss-Seidel scheme; iterative solution; matrix solution technique; Circuit simulation; Convergence; Diodes; Gaussian processes; Inductors; Instruments; Iterative methods; Load modeling; Robustness; Very large scale integration;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/43.205003
Filename
205003
Link To Document