Exploiting Mixed Precision for Computing Eigenvalues of Symmetric Matrices and Singular Values
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1005418
- Eigenvalue decomposition of real symmetric matrices with low computational precision
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- High relative accuracy algorithms for the symmetric eigenproblem
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
- Efficient eigenvalue and singular value computations on shared memory machines
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Singular value decomposition in extended double precision arithmetic
- Mixed precision algorithms in numerical linear algebra
- Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations
Cited in
(6)- Iterative diagonalization of symmetric matrices in mixed precision and its application to electronic structure calculations
- Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects
- On the fast Lanczos method for computation of eigenvalues of Hankel matrices using multiprecision arithmetics.
- Eigenvalue decomposition of real symmetric matrices with low computational precision
- Squeezing a Matrix into Half Precision, with an Application to Solving Linear Systems
- Computing accurate eigenvalues using a mixed-precision Jacobi algorithm
This page was built for publication: Exploiting Mixed Precision for Computing Eigenvalues of Symmetric Matrices and Singular Values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4582503)
