Improving convergence performance of relaxation-based transient analysis by matrix splitting in circuit simulation

We study the convergence performance of relaxation-based algorithms for circuit simulation in the time domain. The circuits are modeled by linear integral-differential-algebraic equations. We show that in theory, convergence depends only on the spectral properties of certain matrices when splitting...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. 1, Fundamental theory and applications Vol. 48; no. 6; pp. 769 - 780
Main Authors Yao-Lin Jiang, Chen, R.M.M., Wing, O.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.06.2001
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:We study the convergence performance of relaxation-based algorithms for circuit simulation in the time domain. The circuits are modeled by linear integral-differential-algebraic equations. We show that in theory, convergence depends only on the spectral properties of certain matrices when splitting is applied to the circuit matrices to set up the waveform relaxation solution of a circuit. A new decoupling technique is derived, which speeds up the convergence of relaxation-based algorithms. In function spaces a Krylov's subspace method, namely the waveform generalized minimal residual algorithm, is also presented in the paper. Numerical examples are given to illustrate how judicious splitting and how Krylov's method can help improve convergence in some situations.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1057-7122
1558-1268
DOI:10.1109/81.928160