Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

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.

Published in:

Circuit Theory, IEEE Transactions on  (Volume:18 ,  Issue: 6 )

Date of Publication:

Nov 1971

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.