LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation Between Regular Matrix Pairs

@article{Kgstrm1996LAPACKStyleAA,
  title={LAPACK-Style Algorithms and Software for Solving the Generalized Sylvester Equation and Estimating the Separation Between Regular Matrix Pairs},
  author={Bo K{\aa}gstr{\"o}m and Peter Poromaa},
  journal={ACM Trans. Math. Softw.},
  year={1996},
  volume={22},
  pages={78-103}
}
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-λ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… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

A set of level 3 basic linear algebra subprograms

  • S.
  • ACM Tram, Math. Soflw. 16, 1, 1– 17. GABDINER,J…
  • 1990
Highly Influential
8 Excerpts

Error and perturbation bounds for subspaces associated with certain eigenvalue problems

  • G. W. STEWART
  • SIAM Rev .
  • 1973
Highly Influential
14 Excerpts

Generalized Schur methods with condition estimators for solving the generalized Sylvester equation

  • G. STEWART
  • IEEE Tmns . Automat . Contr .
  • 1973
Highly Influential
14 Excerpts

Similar Papers

Loading similar papers…