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

将随机蝴蝶变换推广至任意矩阵尺寸

Generalizing Random Butterfly Transforms to Arbitrary Matrix Sizes

Neil Lindquist, Piotr Luszczek, Jack Dongarra

AI总结:

本文通过截断变换各层维度,将随机蝴蝶变换(RBT)推广至任意矩阵尺寸,扩展了理论分析证明其在精确算术下无主元高斯消去法以概率1成功,实验表明性能较原方法提升高达62%,并已集成至SLATE库。

摘要:

Parker和Lê引入了随机蝴蝶变换(RBTs),作为一种预处理技术来替代稠密LU分解中的选主元。然而,其类似FFT的递归结构限制了矩阵的维度。此外,在多节点系统上,通信开销的高效管理进一步限制了矩阵的分布。为消除这些限制,我们通过截断变换中每一层的维度,将RBT推广至任意矩阵尺寸。我们将Parker的理论分析扩展至广义RBT,具体而言,在精确算术下,使用全深度RBT对矩阵进行变换后,无主元高斯消去法将以概率1成功。此外,实验表明这些广义变换在保留替代主元能力的同时,性能较Parker的公式提升了高达62%。该广义RBT已在SLATE数值软件库中提供。

英文摘要:

Parker and Lê introduced random butterfly transforms (RBTs) as a preprocessing technique to replace pivoting in dense LU factorization. Unfortunately, their FFT-like recursive structure restricts the dimensions of the matrix. Furthermore, on multi-node systems, efficient management of the communication overheads restricts the matrix's distribution even more. To remove these limitations, we have generalized the RBT to arbitrary matrix sizes by truncating the dimensions of each layer in the transform. We expanded Parker's theoretical analysis to generalized RBT, specifically that in exact arithmetic, Gaussian elimination with no pivoting will succeed with probability 1 after transforming a matrix with full-depth RBTs. Furthermore, we experimentally show that these generalized transforms improve performance over Parker's formulation by up to 62\% while retaining the ability to replace pivoting. This generalized RBT is available in the SLATE numerical software library.

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

↑