改进的 dqds 算法
An improved dqds algorithm
AI总结:
提出一种改进的 dqds 算法,通过新的收缩策略和改进的移位策略,加速双对角矩阵奇异值的高精度计算,最坏情况线性复杂度,典型加速比 1.2x-4x。
摘要:
本文提出一种改进的 dqds 算法,用于高相对精度计算双对角矩阵的所有奇异值。有两个关键贡献:一种新颖的收缩策略,改善了病态矩阵的收敛性;以及对某些移位策略的修改,加速了大多数双对角矩阵的收敛。这些技术共同确保了改进算法(记为 V5)的最坏情况线性复杂度。我们的大量数值实验表明,V5 通常比 DLASQ(LAPACK-3.4.0 中 dqds 的实现)快 1.2 倍到 4 倍,且精度无任何下降。对于 DLASQ 收敛非常慢的矩阵,V5 可以快 3 倍到 10 倍。在本文末尾,通过将我们的改进与激进早期收缩策略([SIAM J. Matrix Anal. Appl., 33(2012), 22-51] 中的 AggDef2)相结合,开发了一种混合算法(HDLASQ)。数值结果表明,HDLASQ 是这些不同版本中最快的。
英文摘要:
In this paper we present an improved dqds algorithm for computing all the singular values of a bidiagonal matrix to high relative accuracy. There are two key contributions: a novel deflation strategy that improves the convergence for badly scaled matrices, and some modifications to certain shift strategies that accelerate the convergence for most bidiagonal matrices. These techniques together ensure linear worst case complexity of the improved algorithm (denoted by V5). Our extensive numerical experiments indicate that V5 is typically 1.2x--4x faster than DLASQ (the LAPACK-3.4.0 implementation of dqds) without any degradation in accuracy. On matrices for which DLASQ shows very slow convergence, V5 can be 3x--10x faster. At the end of this paper, a hybrid algorithm (HDLASQ) is developed by combining our improvements with the aggressive early deflation strategy (AggDef2 in [SIAM J. Matrix Anal. Appl., 33(2012), 22-51]). Numerical results show that HDLASQ is the fastest among these different versions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。