The QR algorithm for unitary Hessenberg matrices
From MaRDI portal
Publication:1091757
DOI10.1016/0377-0427(86)90169-XzbMath0623.65041MaRDI QIDQ1091757
Publication date: 1986
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
spectrumGauss-Szegö quadrature formulasSchur parametrizationshifted QR algorithmunitary right Hessenberg matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Approximate quadratures (41A55) Numerical quadrature and cubature formulas (65D32)
Related Items (60)
Rank structures preserved by the \(QR\)-algorithm: the singular case ⋮ Convergence of the unitary $QR$ algorithm with a unimodular Wilkinson shift ⋮ Markov's theorem for weight functions on the unit circle ⋮ Darboux transformations for CMV matrices ⋮ Sensitivity analysis for Szegő polynomials ⋮ A modification of the Dewilde-van der Veen method for inversion of finite structured matrices ⋮ On two generalized inverse eigenvalue problems for Hessenberg-upper triangular pencils and their application to the study of GMRES convergence ⋮ Formal orthogonal polynomials and Hankel/Toeplitz duality ⋮ Trigonometric orthogonal systems and quadrature formulae ⋮ Szegő-Lobatto quadrature rules ⋮ A Björck-Pereyra-type algorithm for Szegö-Vandermonde matrices based on properties of unitary Hessenberg matrices ⋮ Refined interlacing properties for zeros of paraorthogonal polynomials on the unit circle ⋮ Spectral transformations for Hermitian Toeplitz matrices ⋮ A new method for computing the stable invariant subspace of a real Hamiltonian matrix ⋮ Error bounds in the isometric Arnoldi process ⋮ Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines ⋮ A generalized isometric Arnoldi algorithm ⋮ Algorithms for the Geronimus transformation for orthogonal polynomials on the unit circle ⋮ The bisection eigenvalue method for unitary Hessenberg matrices via their quasiseparable structure ⋮ A generalized unitary Hessenberg matrix ⋮ A divide and conquer method for unitary and orthogonal eigenproblems ⋮ Para-orthogonal polynomials in frequency analysis ⋮ On investigating GMRES convergence using unitary matrices ⋮ Schur parameter pencils for the solution of the unitary eigenproblem ⋮ An inexact Krylov-Schur algorithm for the unitary eigenvalue problem ⋮ Short recurrences for computing extended Krylov bases for Hermitian and unitary matrices ⋮ Fast QR factorization of Cauchy-like matrices ⋮ On an Economic Arnoldi Method for $BML$-Matrices ⋮ Computing the eigenvalues of symmetric tridiagonal matrices via a Cayley transformation ⋮ Eigenvalue computation for unitary rank structured matrices ⋮ Downdating of Szegö polynomials and data-fitting applications ⋮ Rational \(QR\)-iteration without inversion ⋮ A matrix approach to the computation of quadrature formulas on the unit circle ⋮ Polynomial zerofinders based on Szegő polynomials ⋮ Unitary rank structured matrices ⋮ Eigenstructure of order-one-quasiseparable matrices. Three-term and two-term recurrence relations ⋮ The unitary completion and QR iterations for a class of structured matrices ⋮ Sampling the eigenvalues of random orthogonal and unitary matrices ⋮ On monotonicity of zeros of paraorthogonal polynomials on the unit circle ⋮ Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations ⋮ Another orthogonal matrix ⋮ Structured Eigenvalue Problems ⋮ Generalized averaged Szegő quadrature rules ⋮ Optimally Conditioned Vandermonde-Like Matrices ⋮ Fast QR iterations for unitary plus low rank matrices ⋮ On the construction of Szegő polynomials ⋮ Perturbation and interlace theorems for the unitary eigenvalue problem ⋮ Orthogonal Laurent polynomials on the unit circle and snake-shaped matrix factorizations ⋮ Continuation methods for the computation of zeros of Szegő polynomials ⋮ Orthogonal polynomials and measures on the unit circle. The geronimus transformations ⋮ An interior-point method for large constrained discrete ill-posed problems ⋮ A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices ⋮ A CMV-Based Eigensolver for Companion Matrices ⋮ Minimal representations of unitary operators and orthogonal polynomials on the unit circle ⋮ Anti-Szego quadrature rules ⋮ Structures preserved by the QR-algorithm ⋮ Convergence of the tridiagonal \(QR\) algorithm ⋮ A CS decomposition for orthogonal matrices with application to eigenvalue computation ⋮ The restarted QR-algorithm for eigenvalue computation of structured matrices ⋮ Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The economical storage of plane rotations
- Bestimmung der Eigenwerte orthogonaler Matrizen
- Discrete and continuous boundary problems
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
- Methods for Modifying Matrix Factorizations
- Calculation of Gauss Quadrature Rules
This page was built for publication: The QR algorithm for unitary Hessenberg matrices
