论文信息 - A fast procedure for the analysis of linear time-invariant networks

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.

[1] D. Brown. New Topological Formulas for Linear Networks , 1965 .

[2] M. Swamy,et al. Generalized Gyrator and Driving Point Function Synthesis , 1967 .

[3] D. I. Howe,et al. A NASAP-adaptable algorithm for finding higher order loops of a flowgraph , 1970 .

[4] G. Birkhoff,et al. A survey of modern algebra , 1942 .

[5] W. E. Thomson,et al. Evaluation of transient response , 1966 .

[6] Garrett Birkhoff,et al. A survey of modern algebra , 1942 .

[7] Sundaram Seshu,et al. Linear Graphs and Electrical Networks , 1961 .

[8] Lawrence P. Huelsman. Circuits, matrices, and linear vector spaces , 1963 .

[9] Willard I. Zangwill,et al. Minimizing a function without calculating derivatives , 1967, Comput. J..

[10] I. Kaufman,et al. On systems described by the companion matrix , 1970 .

[11] G. Peters,et al. $Ax = \lambda Bx$ and the Generalized Eigenproblem , 1970 .