arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2408.13400math.NAcs.NA
收藏

使用低精度Posit的迭代求精

Iterative Refinement with Low-Precision Posits

James Quinlan, E. Theodore L. Omtzigt

AI总结:

本研究提出使用低精度posit数替代IEEE浮点格式的混合精度迭代求精方法,通过缩放技术与LU分解求解大型稀疏线性系统,发现16位posit配置能达到与fp16相当的精度,有效平衡了计算效率与精度。

摘要:

本研究探讨了使用posit数代替标准IEEE浮点格式的混合精度迭代求精方法。该方法用于求解由方程$Ax = b$表示的一般线性系统,其中$A$是大型稀疏矩阵。在执行$O(n^3)$分解操作前,采用行与列平衡等多种缩放技术,将矩阵元素映射至机器数的高密度区域。低精度LU分解结合前向/后向替换提供了初始估计。结果表明,16位posit配置结合平衡操作产生了与IEEE半精度(fp16)相当的精度,展现出在效率与精度间取得平衡的潜力。

英文摘要:

This research investigates using a mixed-precision iterative refinement method using posit numbers instead of the standard IEEE floating-point format. The method is applied to solve a general linear system represented by the equation $Ax = b$, where $A$ is a large sparse matrix. Various scaling techniques, such as row and column equilibration, map the matrix entries to higher-density regions of machine numbers before performing the $O(n^3)$ factorization operation. Low-precision LU factorization followed by forward/backward substitution provides an initial estimate. The results demonstrate that a 16-bit posit configuration combined with equilibration produces accuracy comparable to IEEE half-precision (fp16), indicating a potential for achieving a balance between efficiency and accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑