Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
From MaRDI portal
Publication:5301192
DOI10.1137/050627563zbMath1147.65031OpenAlexW2069415575WikidataQ126265343 ScholiaQ126265343MaRDI QIDQ5301192
Luca Gemignani, Israel Gohberg, Dario Andrea Bini, Yu.S.Eidel'man
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
complexityeigenvaluenumerical examplesunitary matricesquasiseparable matricesQR iterationcompanion matricesHessenberg matricesrank-one modificationsfast adaptation
Related Items
A fast implicit QR eigenvalue algorithm for companion matrices, On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms, A condensed representation of almost normal matrices, An algorithm for computing the eigenvalues of block companion matrices, Efficient polynomial root-refiners: a survey and new record efficiency estimates, The rational approximations of the unitary groups, Fast computation of eigenvalues of companion, comrade, and related matrices, Compression of unitary rank-structured matrices to CMV-like shape with an application to polynomial rootfinding, Factoring Block Fiedler Companion Matrices, Structured eigenvalue problems for rational Gauss quadrature, Fast QR factorization of Cauchy-like matrices, Neville elimination for rank-structured matrices, Rational \(QR\)-iteration without inversion, Implicit QR with compression, Unitary rank structured matrices, New progress in real and complex polynomial root-finding, On structure-oriented hybrid two-stage iteration methods for the large and sparse blocked system of linear equations, Implicit double shift \(QR\)-algorithm for companion matrices, Fast QR iterations for unitary plus low rank matrices, On the stability of computing polynomial roots via confederate linearizations, On the Description and Stability of Orthogonal Transformations of Rank Structured Matrices, A multiple shift \(QR\)-step for structured rank matrices, A CMV-Based Eigensolver for Companion Matrices, Fast and Backward Stable Computation of Roots of Polynomials
