A Jacobi-Like Algorithm For Computing The Generalized Schur Form Of A Regular Pencil

J.-P. Charlier; P. Van Dooren

doi:10.1117/12.962271

14 November 1989 A Jacobi-Like Algorithm For Computing The Generalized Schur Form Of A Regular Pencil

J.-P. Charlier, P. Van Dooren

Proceedings Volume 1152, Advanced Algorithms and Architectures for Signal Processing IV; (1989) https://doi.org/10.1117/12.962271
Event: 33rd Annual Technical Symposium, 1989, San Diego, United States

Abstract

We develop a Jacobi-like scheme for computing the generalized Schur form of a regular pencil of matrices λB - A. The method starts with a preliminary triangularization of the matrix B and iteratively reduces A to triangular form, while maintaining B triangular. The scheme heavily relies on the technique of Stewart for computing the Schur form of an arbitrary matrix A. Just as Stewart's algorithm, this one can efficiently be implemented in parallel on a square array of processors. A quantitative analysis of the convergence of the method is also presented. This explains some of its peculiarities, and at the same time yields further insight in Stewart's algorithm.

Citation Download Citation

J.-P. Charlier and P. Van Dooren "A Jacobi-Like Algorithm For Computing The Generalized Schur Form Of A Regular Pencil", Proc. SPIE 1152, Advanced Algorithms and Architectures for Signal Processing IV, (14 November 1989); https://doi.org/10.1117/12.962271

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available