The condition number of equivalence transformations that block diagonalize matrix pencils

How ill-conditioned must a matrix S be if its columns are constrained to span certain subspaces? We answer this question in order to find nearly best conditioned matrices SR and SL that block diagonalize a given matrix pencil T=A+λB, i.e. SL−1TSR=Θ is bloc diagonal. We show that the best conditioned...

Full description

Saved in:
Bibliographic Details
Main Author: Demmel, James
Format: Book Chapter
Language:English
Subjects:
Condition Number
Diagonal Block
Invariant Subspace
Perturbation Bound
Positive Definite Matrix
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:How ill-conditioned must a matrix S be if its columns are constrained to span certain subspaces? We answer this question in order to find nearly best conditioned matrices SR and SL that block diagonalize a given matrix pencil T=A+λB, i.e. SL−1TSR=Θ is bloc diagonal. We show that the best conditioned SR has a condition number approximately equal to the cosecant of the smallest angle between right subspaces belonging to different diagonal blocks of Θ. Thus, the more nearly the right subspaces overlap the more ill-conditioned SR must be. The same is true of SL and the left subspaces. For the standard eigenproblem (T=A−λI), SL = SR and the cosecant of the angle between subspaces turns out equal to an earlier estimate of the smallest condition number, namely the norm of the projection matrix associated with one of the subspaces. We apply this result to bound the error in an algorithm to compute analytic functions of matrices, for instance exp(T).
ISSN:0075-8434
1617-9692
DOI:10.1007/BFb0062091