Fast QR iterations for unitary plus low rank matrices

DOI10.1007/s00211-019-01080-4OpenAlexW2982105249MaRDI QIDQ2288368

Gianna M. Del Corso, Roberto Bevilacqua, Luca Gemignani

Publication date: 17 January 2020

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.02708

Mathematics Subject Classification ID

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

Related Items

Factoring Block Fiedler Companion Matrices ⋮ Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form ⋮ Orthogonal iterations on companion-like pencils

Uses Software

• NLEVP
• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Implicit QR with compression
• Completing a matrix when certain entries of its inverse are specified
• The QR algorithm for unitary Hessenberg matrices
• Schur parameter pencils for the solution of the unitary eigenproblem
• A note on companion matrices
• On the shifted QR iteration applied to companion matrices
• Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
• Positive definite Toeplitz matrices, the Arnoldi process for isometric operators, and Gaussian quadrature on the unit circle
• Orthogonal matrix polynomials and applications
• Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
• Structural properties of matrix unitary reduction to semiseparable form
• Continuation methods for the computation of zeros of Szegő polynomials
• A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
• Backward stability of polynomial root-finding using Fiedler companion matrices
• On Deflations in Extended QR Algorithms
• An Implicit Multishift $QR$-Algorithm for Hermitian Plus Low Rank Matrices
• On numerical methods for discrete least-squares approximation by trigonometric polynomials
• NLEVP
• Factoring Block Fiedler Companion Matrices
• A fast algorithm for computing the smallest eigenvalue of a symmetric positive-definite Toeplitz matrix
• Generalized Schwarz form and lattice - ladder realizations of digital filters
• Principles for Testing Polynomial Zerofinding Programs
• Random matrices close to Hermitian or unitary: overview of methods and results
• Core-Chasing Algorithms for the Eigenvalue Problem
• Fast and backward stable computation of eigenvalues and eigenvectors of matrix polynomials
• Accuracy and Stability of Numerical Algorithms
• Polynomial Roots from Companion Matrix Eigenvalues
• When is a matrix unitary or Hermitian plus low rank?
• Fast and Backward Stable Computation of Roots of Polynomials
• Fast Hessenberg Reduction of Some Rank Structured Matrices
• Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
• The Matrix Eigenvalue Problem

This page was built for publication: Fast QR iterations for unitary plus low rank matrices