The QR algorithm for unitary Hessenberg matrices
Journal of Computational and Applied Mathematics
The algebraic eigenvalue problem
The algebraic eigenvalue problem
Journal of Computational and Applied Mathematics - Special issue on computational complex analysis
The symmetric eigenvalue problem
The symmetric eigenvalue problem
Convergence of the qr algorithm with origin shifts for real symmetric tridiagonal and unitary hessenberg matrices
The restarted QR-algorithm for eigenvalue computation of structured matrices
Journal of Computational and Applied Mathematics
Convergence of the unitary QR algorithm with a unimodular Wilkinson shift
Mathematics of Computation
A unitary Hessenberg QR-based algorithm via semiseparable matrices
Journal of Computational and Applied Mathematics
Eigenvalue computation for unitary rank structured matrices
Journal of Computational and Applied Mathematics
Unitary rank structured matrices
Journal of Computational and Applied Mathematics
A unitary Hessenberg QR-based algorithm via semiseparable matrices
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
This paper shows that for unitary Hessenberg matrices the QR algorithm, with (an exceptional initial-value modification of) the Wilkinson shift, gives global convergence; moreover, the asymptotic rate of convergence is at least cubic, higher than that which can be shown to be quadratic only for Hermitian tridiagonal matrices, under no further assumption. A general mixed shift strategy with global convergence and cubic rates is also presented.