arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.18134math.NAcs.NA
收藏

利用混合精度单侧雅可比算法计算准确的奇异值

Computing accurate singular values using a mixed-precision one-sided Jacobi algorithm

University of Manchester(曼彻斯特大学)

Zhengbo Zhou, Françoise Tisseur, Marcus Webb

AI总结:

本文提出了一种混合精度单侧雅可比算法,通过预处理和高精度计算提高奇异值计算的准确性,尤其在ill-conditioned矩阵中表现更优。

摘要:

我们对一种混合精度预处理的单侧雅可比算法进行了相对前向误差分析,类似于[1]中介绍的双侧版本。该算法使用低精度计算预处理矩阵,然后在高精度下应用,利用单侧雅可比算法在工作精度下计算奇异值分解。我们的分析结果表明,所计算的奇异值的相对前向误差界比标准SVD算法更小。我们提出了两种构建有效预处理矩阵的方法。数值实验支持了理论结果,并展示了我们的算法在ill-conditioned矩阵上比LAPACK例行程序DGESVJ和DGEJSV以及MATLAB函数svd具有更小的相对前向误差。定时测试显示,我们的方法加速了雅可比迭代的收敛速度,且主要成本来自于一次高精度矩阵-矩阵乘法。随着软件或硬件对这一瓶颈的支持改进,我们的算法将比LAPACK单侧雅可比算法DGESVJ更快,但与最先进的预处理单侧雅可比算法DGEJSV速度相当,但准确性更高。

英文摘要:

We present a relative forward error analysis of a mixed-precision preconditioned one-sided Jacobi algorithm, analogous to a two-sided version introduced in [N. J. Higham, F. Tisseur, M. Webb and Z. Zhou, SIAM J. Matrix Anal. Appl. 46 (2025), pp. 2423-2448], which uses low precision to compute the preconditioner, applies it in high precision, and computes the singular value decomposition using the one-sided Jacobi algorithm at working precision. Our analysis yields relative forward error bounds involving the scaled condition number of the preconditioned matrix rather than that of the input matrix, potentially improving accuracy when the former is smaller. We present and analyze two approaches for constructing effective preconditioners. Our numerical experiments demonstrate that our algorithm achieves smaller relative forward errors than the LAPACK routines $\texttt{DGESVJ}$ and $\texttt{DGEJSV}$, as well as the MATLAB function $\texttt{svd}$, particularly for ill-conditioned matrices. Timing tests show that our approach accelerates the convergence of the Jacobi iterations and that the dominant cost arises from a single high-precision matrix-matrix multiplication. With improved software or hardware support for this bottleneck, our algorithm would be faster than the LAPACK one-sided Jacobi algorithm $\texttt{DGESVJ}$ and comparable in speed to the state-of-the-art preconditioned one-sided Jacobi algorithm $\texttt{DGEJSV}$, but much more accurate.

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

↑