Share Email Print
cover

Proceedings Paper

A Jacobi-Like Algorithm For Computing The Generalized Schur Form Of A Regular Pencil
Author(s): J.-P. Charlier; P. Van Dooren
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 14 November 1989
PDF: 12 pages
Proc. SPIE 1152, Advanced Algorithms and Architectures for Signal Processing IV, (14 November 1989); doi: 10.1117/12.962271
Show Author Affiliations
J.-P. Charlier, Philips Research Laboratory (Belgium)
P. Van Dooren, Philips Research Laboratory (Belgium)


Published in SPIE Proceedings Vol. 1152:
Advanced Algorithms and Architectures for Signal Processing IV
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top