Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
From MaRDI portal
(Redirected from Publication:2483050)
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
Cites work
- scientific article; zbMATH DE number 1805736 (Why is no real title available?)
- scientific article; zbMATH DE number 1974608 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- An implicit QR algorithm for symmetric semiseparable matrices
- Chasing Algorithms for the Eigenvalue Problem
- Effects of a parameter on a nonsymmetric algebraic Riccati equation
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Fast and stable eigendecomposition of symmetric banded plus semi-separable matrices
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- LAPACK Users' Guide
- Nonsymmetric Algebraic Riccati Equations and Hamiltonian-like Matrices
- On the fast reduction of a quasiseparable matrix to Hessenberg and tridiagonal forms
- The QR Transformation A Unitary Analogue to the LR Transformation--Part 1
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
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
- Structured backward errors in linearizations
- An implicit multishift \(QR\)-algorithm for Hermitian plus low rank matrices
- A fast implicit QR eigenvalue algorithm for companion matrices
- Finding roots of complex analytic functions via generalized colleague matrices
- The fast bisection eigenvalue method for Hermitian order one quasiseparable matrices and computations of norms
- Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
- Real fast structure-preserving algorithm for eigenproblem of complex Hermitian matrices
- A CMV-Based Eigensolver for Companion 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
- On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
- Fast and Backward Stable Computation of Roots of Polynomials
- Fast computation of eigenvalues of companion, comrade, and related matrices
- A condensed representation of almost normal matrices
- Fast QR Eigenvalue Algorithms for Hessenberg Matrices Which Are Rank‐One Perturbations of Unitary Matrices
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)
