Abstract
The computation of various ‘system zeros’ is investigated through application of QZ-type algorithms for the nonsymmetric generalized eigenvalue problem. Such algorithms use unitary similarities to efficiently reduce the problem to one where the zeros may be determined in a useful, accurate, and dependable manner. Recent reliable and sophisticated analysis and software (specifically, EISPACK) developed by numerical linear algebra specialists is used. EISPACK, moreover, is widely available and can be applied directly to the transmission zero problem. Examples and timing estimates are given and the associated generalized eigenvector problem is noted with its application to the computation of supremal ( A,B)-invariant and controllability subspaces.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
