DocumentCode
1169326
Title
A fast procedure for the analysis of linear time-invariant networks
Author
Kaufman, K. ; Mann, Hari ; Vlach, J.
Volume
18
Issue
6
fYear
1971
fDate
11/1/1971 12:00:00 AM
Firstpage
739
Lastpage
741
Abstract
A computationally efficient algorithm for analysis of general linear time-invariant systems is described. The algorithm formulates state equations which are subsequently analyzed by transforming the system into an equivalent one having the
matrix in the Frobenius canonical form. This approach was found to be significantly more efficient than other methods currently in use. The program was used for optimization and an example is presented.
matrix in the Frobenius canonical form. This approach was found to be significantly more efficient than other methods currently in use. The program was used for optimization and an example is presented.Keywords
Active networks; Computer-aided circuit analysis; Linear networks, time-invariant; Network analysis; State-space methods; Algorithm design and analysis; Capacitors; Circuit synthesis; Equations; Equivalent circuits; Gyrators; Inspection; Network synthesis; Resistors; Voltage;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1971.1083361
Filename
1083361
Link To Document