Pages that link to "Item:Q5856681"
From MaRDI portal
The following pages link to Three-Precision GMRES-Based Iterative Refinement for Least Squares Problems (Q5856681):
Displaying 11 items.
- R\(^3\)GMRES: including prior information in GMRES-type methods for discrete inverse problems (Q468263) (← links)
- Solving large linear least squares problems with linear equality constraints (Q2098770) (← links)
- Numerical algorithms for high-performance computational science (Q4993515) (← links)
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems (Q5066598) (← links)
- Mixed-precision iterative refinement using tensor cores on GPUs to accelerate solution of linear systems (Q5161159) (← links)
- Exploiting Lower Precision Arithmetic in Solving Symmetric Positive Definite Linear Systems and Least Squares Problems (Q5857837) (← links)
- Mixed precision algorithms in numerical linear algebra (Q5887837) (← links)
- Mixed Precision Iterative Refinement with Sparse Approximate Inverse Preconditioning (Q6098511) (← links)
- Five-Precision GMRES-Based Iterative Refinement (Q6154942) (← links)
- Double precision is not necessary for LSQR for solving discrete linear ill-posed problems (Q6191356) (← links)
- Avoiding breakdown in incomplete factorizations in low precision arithmetic (Q6604161) (← links)
