Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices

DOI10.1137/050627563MaRDI QIDQ5301192zbMATH OpenOpenAlexWikidataFDO

Authors Dario A. Bini, L. Gemignani, I. Gohberg, Y. Eidelman

Publication date 29 April 2008

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/050627563

zbMATH Keywords

numerical examplescomplexityeigenvaluequasiseparable matricesunitary matricescompanion matricesHessenberg matricesQR iterationrank-one modificationsfast adaptation

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• The QR algorithm for unitary Hessenberg matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
• Fast QR iterations for unitary plus low rank matrices
• Convergence of the shifted $QR$ algorithm for unitary Hessenberg matrices
• On the pseudounitary \(QR\) algorithm for pseudo-Hermitian matrices
• Efficient Implementation of the Multishift $QR$ Algorithm for the Unitary Eigenvalue Problem
• \(QR\)-like algorithms for eigenvalue problems
• A fast eigenvalue algorithm for Hankel matrices
• QR -like algorithms for the nonsymmetric eigenvalue problem

Cited in

(33)

• Fast QR iterations for unitary plus low rank matrices
• Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
• Eigenvalue computation for unitary rank structured matrices
• Fast QR factorization of Cauchy-like matrices
• Structured eigenvalue problems for rational Gauss quadrature
• Fast Hessenberg reduction of some rank structured matrices
• An algorithm for computing the eigenvalues of block companion matrices
• Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding
• Forward stable eigenvalue decomposition of rank-one modifications of diagonal matrices
• Efficient polynomial root-refiners: a survey and new record efficiency estimates
• A fast implicit QR eigenvalue algorithm for companion matrices
• The restarted QR-algorithm for eigenvalue computation of structured matrices
• Rational \(QR\)-iteration without inversion
• On the stability of computing polynomial roots via confederate linearizations
• A multiple shift \(QR\)-step for structured rank matrices
• New progress in real and complex polynomial root-finding
• A CMV-Based Eigensolver for Companion Matrices
• Fast and Backward Stable Computation of Roots of Polynomials
• On structure-oriented hybrid two-stage iteration methods for the large and sparse blocked system of linear equations
• On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
• On the description and stability of orthogonal transformations of rank structured matrices
• Eigenvector computation for almost unitary Hessenberg matrices and inversion of Szegö-Vandermonde matrices via discrete transmission lines
• Unitary rank structured matrices
• Factoring block Fiedler companion matrices
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• The rational approximations of the unitary groups
• Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
• A multishift QR iteration without computation of the shifts
• A condensed representation of almost normal matrices
• Implicit double shift \(QR\)-algorithm for companion matrices
• Fast computation of eigenvalues of companion, comrade, and related matrices
• Implicit QR with compression
• Neville elimination for rank-structured matrices

This page was built for publication: Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301192)