Improving the computational efficiency of the tree relaxation method for an iterative solution of linear circuit equations

Author

Acciani, G. ; Congedo, D. ; Dilecce, B.

Author_Institution

Dipartimento di Elettrotecnica ed Elettronica, Bari Univ., Italy

Volume

10

Issue

5

fYear

1991

fDate

5/1/1991 12:00:00 AM

Firstpage

668

Lastpage

670

Abstract

The problem of improving the computational efficiency of a method for an iterative solution of a linear circuit equation, known as the tree relaxation (TR) method, is investigated. It is shown that the adoption of the tree-branch voltages instead of the node voltages, resulting in a tree relaxation modified (TR) method, represents a more advantageous choice for the network variables. The extra processing needed for setting up the fundamental cut-set matrix allows a significant reduction of the computational burdens to be obtained. These savings are even more substantial if a transient analysis is to be performed. It is shown that the choice of the tree-branch voltages yields further advantages if a parallel version of the TRM is to be implemented

Keywords

circuit analysis computing; computational complexity; iterative methods; linear network analysis; relaxation theory; trees (mathematics); computational efficiency; fundamental cut-set matrix; iterative solution; linear circuit equations; transient analysis; tree relaxation method; tree-branch voltages; Circuit simulation; Computational efficiency; Computer simulation; Equations; Gaussian processes; Iterative methods; Linear circuits; Parallel processing; Relaxation methods; Voltage;

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.79503

Filename

79503