A fast procedure for the analysis of linear time-invariant networks
- 1 November 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 18 (6), 739-741
- https://doi.org/10.1109/tct.1971.1083361
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 theAmatrix 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
This publication has 4 references indexed in Scilit:
- $Ax = \lambda Bx$ and the Generalized EigenproblemSIAM Journal on Numerical Analysis, 1970
- On systems described by the companion matrixIEEE Transactions on Automatic Control, 1970
- Minimizing a function without calculating derivativesThe Computer Journal, 1967
- Evaluation of transient responseProceedings of the IEEE, 1966