Computing eigenspaces with specified eigenvalues of a regular matrix pair (A, B) and condition estimation: theory, algorithms and software
- 1 September 1996
- journal article
- research article
- Published by Springer Nature in Numerical Algorithms
- Vol. 12 (2) , 369-407
- https://doi.org/10.1007/bf02142813
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- LAPACK-style algorithms and software for solving the generalized Sylvester equation and estimating the separation between regular matrix pairsACM Transactions on Mathematical Software, 1996
- Backward perturbation analysis of certain characteristic subspacesNumerische Mathematik, 1993
- On computing condition numbers for the nonsymmetric eigenproblemACM Transactions on Mathematical Software, 1993
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part IIACM Transactions on Mathematical Software, 1993
- The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part IACM Transactions on Mathematical Software, 1993
- Perturbation theory and backward error forAX−XB=CBIT Numerical Mathematics, 1993
- Generalized Schur methods with condition estimators for solving the generalized Sylvester equationIEEE Transactions on Automatic Control, 1989
- Algorithm 674ACM Transactions on Mathematical Software, 1989
- Algorithm 590: DSUBSP and EXCHQZ : FORTRAN Subroutines for Computing Deflating Subspaces with Specified SpectrumACM Transactions on Mathematical Software, 1982
- A Schur method for solving algebraic Riccati equationsIEEE Transactions on Automatic Control, 1979