Abstract
We give an O( m 2 n) algorithm for computing the Kronecker structure of an arbitrary m× n pencil λE− A. The algorithm is shown to be numerically stable, because only unitary transformations are used. The improved speed over earlier unitary methods is due to the efficient use of condensed forms which are maintained throughout the recursions of the algorithm.
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.
