Implicit QR for rank-structured matrix pencils

DOI10.1007/s10543-014-0478-0zbMath1290.65031OpenAlexW2042893763MaRDI QIDQ2450897

Paola Boito, Yu.S.Eidel'man, Luca Gemignani

Publication date: 23 May 2014

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10543-014-0478-0

zbMATH Keywords

complexitystabilityHermitian matricesnumerical experimentsmatrix pencilseigenvalue computationChebyshev approximationquasiseparable matriximplicit QR algorithmlow rank correctionsrank-structured matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Hermitian, skew-Hermitian, and related matrices (15B57) Complexity and performance of numerical algorithms (65Y20) Matrix pencils (15A22)

Related Items

On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity ⋮ Exact computations with quasiseparable matrices ⋮ Matrix Structures in Queuing Models ⋮ Factoring Block Fiedler Companion Matrices ⋮ Structured generalized eigenvalue condition numbers for parameterized quasiseparable matrices ⋮ On the stability of computing polynomial roots via confederate linearizations ⋮ Rank-Structured QR for Chebyshev Rootfinding ⋮ Fast and Backward Stable Computation of Roots of Polynomials

Uses Software

• LAPACK
• Chebfun

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Implicit QR with compression
• A fast implicit QR eigenvalue algorithm for companion matrices
• Quasiseparable structures of companion pencils under the \(QZ\)-algorithm
• AQZ-method based on semiseparable matrices
• Implicit double shift \(QR\)-algorithm for companion matrices
• Completing a matrix when certain entries of its inverse are specified
• On a new class of structured matrices
• The Ehrlich-Aberth method for palindromic matrix polynomials represented in the Dickson basis
• Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms
• Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
• Backward error and condition of polynomial eigenvalue problems
• Computing real roots of a polynomial in Chebyshev series form through subdivision
• THE COLLEAGUE MATRIX, A CHEBYSHEV ANALOGUE OF THE COMPANION MATRIX
• Linearization of matrix polynomials expressed in polynomial bases
• LAPACK Users' Guide
• QR-Like Algorithms for Symmetric Arrow Matrices
• Barycentric Lagrange Interpolation
• An Extension of MATLAB to Continuous Functions and Operators
• Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
• Matrix shapes invariant under the symmetric QR algorithm
• The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments
• Roots of Polynomials Expressed in Terms of Orthogonal Polynomials
• Lagrangian Interpolation at the Chebyshev Points xn,     cos (  /n),   = 0(1)n; some Unnoted Advantages

This page was built for publication: Implicit QR for rank-structured matrix pencils