Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
From MaRDI portal
Recommendations
- Iterative refinement for symmetric eigenvalue decomposition
- Publication:4864091
- Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues
- Iterative refinement of Schur decompositions
- Spectral refinement for clustered eigenvalues of quasi-diagonal matrices
Cites work
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Accuracy and Stability of Numerical Algorithms
- Accurate Sum and Dot Product
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Design, implementation and testing of extended and mixed precision BLAS
- Error bounds for approximate solutions of systems of equations
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Fast and parallel interval arithmetic
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Iterative refinement for symmetric eigenvalue decomposition
- LAPACK Users' Guide
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Numerical enclosure for each eigenvalue in generalized eigenvalue problem
- Solution of the \(k\)-th eigenvalue problem in large-scale electronic structure calculations
- The Rotation of Eigenvectors by a Perturbation. III
- Theoretical Numerical Analysis
Cited in
(14)- An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations
- Mixed precision algorithms in numerical linear algebra
- A mixed precision LOBPCG algorithm
- Eigenvalue clustering of coefficient matrices in the iterative stride reductions for linear systems
- Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues
- Symmetric-diagonal reductions as preprocessing for symmetric positive definite generalized eigenvalue solvers
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method
- Iterative refinement for symmetric eigenvalue decomposition
- Iterative refinement for an eigenpair subset of a real symmetric matrix
- Iterative refinement of Schur decompositions
- Iterative refinement for singular value decomposition based on matrix multiplication
- Extension of accurate numerical algorithms for matrix multiplication based on error-free transformation
- Eigenvalue decomposition of real symmetric matrices with low computational precision
This page was built for publication: Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318500)
