LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation Between Regular Matrix Pairs
1996 (English)In: ACM Transactions on Mathematical Software, Vol. 22, no 1, 78-103 p.Article in journal (Refereed) Published
Robust and fast software to solve the generalized Sylvester equation (AR - LB = C, DR - LE = F) for unknowns R and L is presented. This special linear system of equations, and its transpose, arises in computing error bounds for computed eigenvalues and eigenspaces of the generalized eigenvalue problem S - lambda T, in computing deflating subspaces of the same problem, and in computing certain decompositions of transfer matrices arising in control theory. Our contributions are twofold. First, we reorganize the standard algorithm for this problem to use Level 3 BLAS operations, like matrix multiplication, in its inner loop. This speeds up the algorithm by a factor of 9 on an IBM RS6000. Second, we develop and compare several condition estimation algorithms, which inexpensively but accurately estimate the sensitivity of the solution of this linear system.
Place, publisher, year, edition, pages
1996. Vol. 22, no 1, 78-103 p.
IdentifiersURN: urn:nbn:se:umu:diva-21957ISBN: 0098-3500OAI: oai:DiVA.org:umu-21957DiVA: diva2:212216