A fast procedure for the analysis of linear time-invariant networks

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