DocumentCode
1167785
Title
LU Factorization in Network Sensitivity Computations
Author
Director, S.
Volume
18
Issue
1
fYear
1971
fDate
1/1/1971 12:00:00 AM
Firstpage
184
Lastpage
185
Abstract
The mutually reciprocal adjoint network associated with a given lumped linear time-invariant network has been shown to be an extremely useful aid for the computation of network sensitivities in automated network design algorithms. The fact that the nodal admittance matrix of the mutually reciprocal adjoint network is the transpose of the nodal admittance matrix of the given network can be employed, along with the
factorization of a matrix, to considerably reduce the computational effort necessary to calculate all the firstorder network sensitivities.
factorization of a matrix, to considerably reduce the computational effort necessary to calculate all the firstorder network sensitivities.Keywords
Adjoint networks; Computer-aided circuit design; Matrix methods; Sensitivity analysis; Admittance; Circuit theory; Computer networks; Control engineering; Control engineering computing; Eigenvalues and eigenfunctions; State feedback; State-space methods; Transfer functions; Voltage;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1971.1083206
Filename
1083206
Link To Document