Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
DOI10.1007/S11075-008-9172-0zbMATH Open1139.65026OpenAlexW2165797890MaRDI QIDQ2483050FDOQ2483050
Authors: Y. Eidelman, L. Gemignani, I. Gohberg 
Publication date: 5 May 2008
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-008-9172-0
Recommendations
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
complexitynumerical experimentsHermitian matrixquasiseparable matricesHessenberg reductionQR eigenvalue algorithm
Complexity and performance of numerical algorithms (65Y20) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)
Cites Work
- LAPACK Users' Guide
- Nonsymmetric Algebraic Riccati Equations and Hamiltonian-like Matrices
- Accuracy and Stability of Numerical Algorithms
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- An implicit QR algorithm for symmetric semiseparable matrices
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- Title not available (Why is that?)
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Chasing Algorithms for the Eigenvalue Problem
- Title not available (Why is that?)
- Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices
- Effects of a parameter on a nonsymmetric algebraic Riccati equation
Cited In (20)
- On reduction of \(k\)-almost normal and \(k\)-almost conjugate normal matrices to a block tridiagonal form
- Implicit QR for companion-like pencils
- Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
- Fast Hessenberg reduction of some rank structured matrices
- An implicit multishift \(QR\)-algorithm for Hermitian plus low rank matrices
- Structured backward errors in linearizations
- A fast implicit QR eigenvalue algorithm for companion matrices
- Finding roots of complex analytic functions via generalized colleague matrices
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- The fast bisection eigenvalue method for Hermitian order one quasiseparable matrices and computations of norms
- A CMV-Based Eigensolver for Companion Matrices
- Real fast structure-preserving algorithm for eigenproblem of complex Hermitian matrices
- Rank-Structured QR for Chebyshev Rootfinding
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- Block tridiagonal reduction of perturbed normal and rank structured matrices
- Fast and Backward Stable Computation of Roots of Polynomials
- On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
- Fast computation of eigenvalues of companion, comrade, and related matrices
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
- A condensed representation of almost normal matrices
Uses Software
This page was built for publication: Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483050)
