.png){kind=icon}
返回
Accelerating Restarted GMRES With Mixed Precision Arithmetic
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2021.3090757.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The generalized minimum residual method (GMRES) is a commonly used iterative Krylov solver for sparse, non-symmetric systems of linear equations. Like other iterative solvers, data movement dominates its run time. To improve this performance, we propose running GMRES in reduced precision with key operations remaining in full precision. Additionally, we provide theoretical results linking the convergence of finite precision GMRES with classical Gram-Schmidt with reorthogonalization (CGSR) and its infinite precision counterpart which helps justify the convergence of this method to double-precision accuracy. We tested the mixed-precision approach with a variety of matrices and preconditioners on a GPU-accelerated node. Excluding the incomplete LU factorization without fill in (ILU(0)) preconditioner, we achieved average speedups ranging from 8 to 61 percent relative to comparable double-precision implementations, with the simpler preconditioners achieving the higher speedups.
Keyword:
Iterative methods
Lifting equipment
Convergence
Stability analysis
Linear systems
Kernel
Error correction
Linear systems
multiple precision arithmetic
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
Theory of inexact Krylov subspace methods and applications to scientific computing不精确Krylov子空间方法的理论及其在科学计算中的应用
PREAI
分享收藏分享收藏Thermal stabilities of some magnetic chromium chalcogenides with spinel and hexagonal structures
PREAI
分享收藏
查看更多内容