Mixed-precision orthogonalization-free projection methods for eigenvalue and singular value problems
From MaRDI portal
Cites work
- A Geometric Theory for the QR, LU and Power Iterations
- A new implementation of the CMRH method for solving dense linear systems
- A non-perturbative approach to computing seismic normal modes in rotating planets
- CMRH: A new method for solving nonsymmetric linear systems based on the Hessenberg reduction algorithm
- scientific article; zbMATH DE number 192975 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Improved accuracy and parallelism for MRRR-based eigensolvers -- a mixed precision approach
- Improving the Accuracy of Computed Singular Values
- Iterative refinement for singular value decomposition based on matrix multiplication
- Iterative refinement for symmetric eigenvalue decomposition
- Mixed precision algorithms in numerical linear algebra
- Numerical methods for large eigenvalue problems
- Posterior covariance structures in Gaussian processes
- Rounding error analysis of the classical Gram-Schmidt orthogonalization process
- Single-pass Nyström approximation in mixed precision
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The University of Florida sparse matrix collection
This page was built for publication: Mixed-precision orthogonalization-free projection methods for eigenvalue and singular value problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295786)
