DocumentCode
2829945
Title
Linear graphs and modification methods for network matrices
Author
Wang, Paul K U
Author_Institution
CONTEC Microelectron. Inc., San Jose, CA, USA
fYear
1991
fDate
11-14 Jun 1991
Firstpage
1002
Abstract
The author presents a new method for building the inverse of a network matrix based on linear graph representation of the network topology. The sparse tableau approach to network equation formulation is used and the matrix inverses can be in the factorized LU form. When the inverse of a network matrix is already available, this method is efficient for finding the new inverse when the network is modified, e.g. a new network element is added or an element value is altered
Keywords
graph theory; matrix algebra; network topology; factorized LU form; linear graph representation; matrix inverses; network element; network equation formulation; network matrices; network topology; sparse tableau approach; Circuit simulation; Kirchhoff´s Law; Microelectronics; Network topology; Nonlinear equations; Programmable control; Sparse matrices; Transient analysis; Tree graphs; Voltage;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 1991., IEEE International Sympoisum on
Print_ISBN
0-7803-0050-5
Type
conf
DOI
10.1109/ISCAS.1991.176533
Filename
176533
Link To Document