Burton S. Garbow
Supplemental Material
Available for Download
QZ: generalized eigenvalue problem for complex matrices Gams: D4b4
- 1 GARBOW, B.S, BOYLE, J.M., DONGARRA, J J, AND MOLER, C.B. MatrLx elgensystem routines-- EISPACK guide extension. Lecture Notes in Computer Scwnce, Vol. 51, Spr, nger-Verlag, Heidelberg, 1977Google Scholar
- 2 KAUFMAN, L C Algorithm 496 The LZ algorithm to solve the generalized elgenvalue problem for complex matrices ACM Trans. Math. Software 1, 3 (Sept. 1975), 271-281. Google Scholar
- 3 MOLER, C B, AND STEWART, G.W An algorithm for generalized matrix elgenvalue problems SIAM J Numer Anal. 10 (April 1973), 241-256.Google Scholar
- 4 WARD, R.C The combination shift QZ algorithm. SIAM J Numer Anal. 12 (Dec. 1975), 835-853Google Scholar
Index Terms
- Algorithm 535: The QZ algorithm to solve the generalized eigenvalue problem for complex matrices [F2]
Recommendations
A Quasi-Separable Approach to Solve the Symmetric Definite Tridiagonal Generalized Eigenvalue Problem
We present a new fast algorithm for solving the generalized eigenvalue problem $T\mathbf{x}=\lambda S\mathbf{x}$, in which both $T$ and $S$ are real symmetric tridiagonal matrices and $S$ is positive definite. A method for solving this problem is to ...
A QZ-method based on semiseparable matrices
This manuscript focusses on an alternative method for computing the eigenvalues of a pencil of two matrices, based on semiseparable matrices. An effective reduction of a matrix pair to lower semiseparable, upper triangular form will be presented as well ...
Eigenvalue condition numbers and pseudospectra of Fiedler matrices
The aim of the present paper is to analyze the behavior of Fiedler companion matrices in the polynomial root-finding problem from the point of view of conditioning of eigenvalues. More precisely, we compare: (a) the condition number of a given root $${\...
Comments