Chasing Algorithms for the Eigenvalue Problem
From MaRDI portal
Recommendations
Cited in
(16)- A multiple shift \(QR\)-step for structured rank matrices
- A fast method to diagonalize a Hankel matrix
- SR and SZ algorithms for the symplectic (butterfly) eigenproblem
- The symplectic eigenvalue problem, the butterfly form, the SR algorithm, and the Lanczos method
- Eigenvalue computation in the 20th century
- \(QR\)-like algorithms for eigenvalue problems
- The transmission of shifts and shift blurring in the QR algorithm
- Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
- scientific article; zbMATH DE number 17465 (Why is no real title available?)
- Bidirectional Chasing Algorithms for the Eigenvalue Problem
- Theory of Decomposition and Bulge-Chasing Algorithms for the Generalized Eigenvalue Problem
- Core-Chasing Algorithms for the Eigenvalue Problem
- Parallel solvers for discrete‐time algebric Riccati equations
- A QR-method for computing the singular values via semiseparable matrices
- Convergence of algorithms of decomposition type for the eigenvalue problem
- An inexact Krylov-Schur algorithm for the unitary eigenvalue problem
This page was built for publication: 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 Q3350662)