Spectral refinement on quasi-diagonal matrices
From MaRDI portal
In several applications needing the numerical computation of eigenvalues and eigenvectors strongly quasi-diagonal matrices occur. An iterative explicit method for this kind of problem is proposed here. Its convergence is proved by means of an argument based on the perturbed fixed slope method. Numerical examples are given to complete their work.
Recommendations
Cites work
- A note on refining eigenelements of symmetric matrices
- scientific article; zbMATH DE number 3818979 (Why is no real title available?)
- scientific article; zbMATH DE number 3566016 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- LAPACK Users' Guide
Cited in
(7)- ``Diagonal shadow -- A quasi-Newton iteration in spectral domain
- Iterative refinement for symmetric eigenvalue decomposition
- A note on perturbed fixed slope iterations
- scientific article; zbMATH DE number 839240 (Why is no real title available?)
- Spectral decomposition and eigenvectors of matrices by residue calculus
- Symmetric-diagonal reductions as preprocessing for symmetric positive definite generalized eigenvalue solvers
- Spectral refinement for clustered eigenvalues of quasi-diagonal matrices
This page was built for publication: Spectral refinement on quasi-diagonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779387)