A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
From MaRDI portal
Publication:964069
Recommendations
- The QR iteration method for Hermitian quasiseparable matrices of an arbitrary order
- A unitary Hessenberg \(QR\)-based algorithm via semiseparable matrices
- AQZ-method based on semiseparable matrices
- An Orthogonal Similarity Reduction of a Matrix into Semiseparable Form
- An implicit QR algorithm for symmetric semiseparable matrices
Cited in
(9)- A multiple shift \(QR\)-step for structured rank matrices
- A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
- Divide and conquer algorithms for computing the eigendecomposition of symmetric diagonal-plus-semiseparable matrices
- scientific article; zbMATH DE number 5015741 (Why is no real title available?)
- An implicit QR algorithm for symmetric semiseparable matrices
- scientific article; zbMATH DE number 5527834 (Why is no real title available?)
- Deflation for the symmetric arrowhead and diagonal-plus-rank-one eigenvalue problems
- AQZ-method based on semiseparable matrices
- Rational QR-iteration without inversion
This page was built for publication: A new iteration for computing the eigenvalues of semiseparable (plus diagonal) matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964069)