Core-Chasing Algorithms for the Eigenvalue Problem
DOI10.1137/1.9781611975345zbMATH Open1434.65003OpenAlexW4252796821MaRDI QIDQ4556321FDOQ4556321
Authors: Jared Lee Aurentz, Leonardo Robol, David S. Watkins, Thomas Mach, Raf Vandebril 
Publication date: 15 November 2018
Full work available at URL: https://doi.org/10.1137/1.9781611975345
Recommendations
- Chasing Algorithms for the Eigenvalue Problem
- Bidirectional Chasing Algorithms for the Eigenvalue Problem
- Publication:4489544
- An algorithm for solution of large eigenvalue problems
- scientific article; zbMATH DE number 3982395
- Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
- scientific article; zbMATH DE number 37916
- \(QR\)-like algorithms for eigenvalue problems
- Effective algorithms for solving the eigenvalue problem
- scientific article; zbMATH DE number 1247167
Factorization of matrices (15A23) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Numerical solutions to inverse eigenvalue problems (65F18)
Cited In (23)
- Low-Rank Approximation in the Frobenius Norm by Column and Row Subset Selection
- Efficient reduction of compressed unitary plus low rank matrices to Hessenberg form
- Orthogonal iterations on companion-like pencils
- Convergence of the Eberlein diagonalization method under generalized serial pivot strategies
- Fast QR iterations for unitary plus low rank matrices
- Parameter estimation and signal reconstruction
- Title not available (Why is that?)
- Structured backward errors in linearizations
- Pole-swapping algorithms for alternating and palindromic eigenvalue problems
- A core-chasing symplectic QR algorithm
- Biorthogonal rational Krylov subspace methods
- Factoring block Fiedler companion matrices
- The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments
- Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method
- An algebraic quantum circuit compression algorithm for Hamiltonian simulation
- Deflating invariant subspaces for rank structured pencils
- An implicit filter for rational Krylov using core transformations
- On the stability radius for linear time-delay systems
- Bidirectional Chasing Algorithms for the Eigenvalue Problem
- Rank-Structured QR for Chebyshev Rootfinding
- On pole-swapping algorithms for the eigenvalue problem
- Tensor denoising via dual Schatten norms
- Sampling the eigenvalues of random orthogonal and unitary matrices
This page was built for publication: Core-Chasing Algorithms for the Eigenvalue Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556321)
