Pages that link to "Item:Q2318500"
From MaRDI portal
The following pages link to Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues (Q2318500):
Displaying 13 items.
- Iterative refinement for symmetric eigenvalue decomposition (Q1630225) (← links)
- An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations (Q1987430) (← links)
- Eigenvalue clustering of coefficient matrices in the iterative stride reductions for linear systems (Q2006614) (← links)
- Iterative refinement for singular value decomposition based on matrix multiplication (Q2293602) (← links)
- Iterative refinement of Schur decompositions (Q2679661) (← links)
- Revisiting the (block) Jacobi subspace rotation method for the symmetric eigenvalue problem (Q2679692) (← links)
- Fixed-point analysis of Ogita-Aishima's symmetric eigendecomposition refinement algorithm for multiple eigenvalues (Q5121387) (← links)
- Mixed precision algorithms in numerical linear algebra (Q5887837) (← links)
- Claculating interior eigenvalues and eigenvectors with an implicitly restarted and a filter diagonalization method (Q5937473) (← links)
- A mixed precision LOBPCG algorithm (Q6141529) (← links)
- (Q6151388) (← links)
- Iterative refinement for an eigenpair subset of a real symmetric matrix (Q6640057) (← links)
- Extension of accurate numerical algorithms for matrix multiplication based on error-free transformation (Q6671874) (← links)