Core-Chasing Algorithms for the Eigenvalue Problem

DOI10.1137/1.9781611975345zbMath1434.65003OpenAlexW4252796821MaRDI QIDQ4556321

Jared Lee Aurentz, David S. Watkins, Leonardo Robol, Raf Vandebril, Thomas Mach

Publication date: 15 November 2018

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

zbMATH Keywords

QR decompositionshifted QR algorithmcore-chasing algorithms

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Numerical solutions to inverse eigenvalue problems (65F18)

Related Items (17)

Structured backward errors in linearizations ⋮ An implicit filter for rational Krylov using core transformations ⋮ An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation ⋮ Deflating invariant subspaces for rank structured pencils ⋮ On the stability radius for linear time-delay systems ⋮ On pole-swapping algorithms for the eigenvalue problem ⋮ Factoring Block Fiedler Companion Matrices ⋮ Parameter estimation and signal reconstruction ⋮ Efficient Reduction of Compressed Unitary Plus Low Rank Matrices to Hessenberg Form ⋮ Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection ⋮ Sampling the eigenvalues of random orthogonal and unitary matrices ⋮ Pole-swapping algorithms for alternating and palindromic eigenvalue problems ⋮ Fast QR iterations for unitary plus low rank matrices ⋮ Biorthogonal rational Krylov subspace methods ⋮ A Core-Chasing Symplectic QR Algorithm ⋮ Rank-Structured QR for Chebyshev Rootfinding ⋮ Orthogonal iterations on companion-like pencils

This page was built for publication: Core-Chasing Algorithms for the Eigenvalue Problem