arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.12659math.NAcs.DCcs.MScs.NAmath.AG
收藏

多倍双精度下用于多项式同伦泰勒级数解的GPU加速牛顿法

GPU Accelerated Newton for Taylor Series Solutions of Polynomial Homotopies in Multiple Double Precision

Jan Verschelde

AI总结:

针对多项式同伦解的坐标关于参数的多倍双精度幂级数精确计算问题,提出利用GPU大规模并行性的加速牛顿法,通过多项式求值求导后求解分块下三角线性系统,在多款NVIDIA GPU上验证了不同多倍精度下的有效性,代码已开源。

摘要:

多项式同伦是通常含单个参数$t$的一族多项式系统。我们的研究问题是利用多倍双精度运算,精确计算解的坐标关于参数$t$的幂级数展开。该问题的一项应用是借助Fabry定理确定多项式同伦中最近奇异解的位置,幂级数可作为构造Padé近似的输入。\n 利用每秒可执行数万亿次浮点运算的图形处理器(Graphics Processing Unit,GPU)的大规模并行性,研究目标是抵消多倍双精度下幂级数运算带来的成本开销。将牛顿法应用于该问题需要先对多项式求值并求导,随后求解分块下三角线性系统。实验在NVIDIA的多款GPU上开展,具体包括RTX 2080、RTX 4080、P100、V100和A100。\n 研究使用由CAMPARY软件生成的代码,得到了双双精度、四双精度和八双精度下的结果。本研究中的程序是自包含的,已在GitHub公共仓库以GPL-v3.0许可证发布。

英文摘要:

A polynomial homotopy is a family of polynomial systems, typically in one parameter $t$. Our problem is to compute power series expansions of the coordinates of the solutions in the parameter $t$, accurately, using multiple double arithmetic. One application of this problem is the location of the nearest singular solution in a polynomial homotopy, via the theorem of Fabry. Power series serve as input to construct Padé approximations. Exploiting the massive parallelism of Graphics Processing Units capable of performing several trillions floating-point operations per second, the objective is to compensate for the cost overhead caused by arithmetic with power series in multiple double precision. The application of Newton's method for this problem requires the evaluation and differentiation of polynomials, followed by solving a blocked lower triangular linear system. Experimental results are obtained on NVIDIA GPUs, in particular the RTX 2080, RTX 4080, P100, V100, and A100. Code generated by the CAMPARY software is used to obtain results in double double, quad double, and octo double precision. The programs in this study are self contained, available in a public github repository under the GPL-v3.0 License.

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

↑