Iterative refinement for symmetric eigenvalue decomposition
From MaRDI portal
Recommendations
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- Iterative refinement for singular value decomposition based on matrix multiplication
- Publication:4864091
- Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues
- Iterative refinement of Schur decompositions
Cites work
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- 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?)
- A Divide-and-Conquer Algorithm for the Symmetric Tridiagonal Eigenproblem
- A Grassmann--Rayleigh quotient iteration for computing invariant subspaces
- A direct method for completing eigenproblem solutions on a parallel computer
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate Sum and Dot Product
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem
- Design, implementation and testing of extended and mixed precision BLAS
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Functions of Matrices
- IMPROVEMENT OF AN APPROXIMATE SET OF LATENT ROOTS AND MODAL COLUMNS OF A MATRIX BY METHODS AKIN TO THOSE OF CLASSICAL PERTURBATION THEORY
- Improving the Accuracy of Computed Eigenvalues and Eigenvectors
- LAPACK Users' Guide
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- Newton's method in floating point arithmetic and iterative refinement of generalized eigenvalue problems
- SOME NOTES ON JAHN'S METHOD FOR THE IMPROVEMENT OF APPROXIMATE LATENT ROOTS AND VECTORS OF A SQUARE MATRIX
- Spectral refinement on quasi-diagonal matrices
- Theoretical Numerical Analysis
- Updating the singular value decomposition
Cited in
(22)- Extension of accurate numerical algorithms for matrix multiplication based on error-free transformation
- Acceleration of iterative refinement for singular value decomposition
- Filtered Krylov-like sequence method for symmetric eigenvalue problems
- Iterative methods for the computation of a few eigenvalues of a large symmetric matrix
- Mixed precision algorithms in numerical linear algebra
- Inertia‐based spectrum slicing for symmetric quadratic eigenvalue problems
- Hybrid Iterative Refined Method for Computing a Few Extreme Eigenpairs of a Symmetric Matrix
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues
- A mixed precision LOBPCG algorithm
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem
- An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations
- Newton's method in floating point arithmetic and iterative refinement of generalized eigenvalue problems
- Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues
- A quadratically convergent algorithm for inverse generalized eigenvalue problems
- On convergence of iterative projection methods for symmetric eigenvalue problems
- Iterative refinement of Schur decompositions
- Symmetric-diagonal reductions as preprocessing for symmetric positive definite generalized eigenvalue solvers
- Iterative refinement for an eigenpair subset of a real symmetric matrix
- Iterative refinement for singular value decomposition based on matrix multiplication
- scientific article; zbMATH DE number 839240 (Why is no real title available?)
- Analysis of the Cholesky method with iterative refinement for solving the symmetric definite generalized eigenproblem
- Eigenvalue decomposition of real symmetric matrices with low computational precision
This page was built for publication: Iterative refinement for symmetric eigenvalue decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630225)
