在通用图形处理单元上使用双倍双精度和四倍双精度算术的正交化
Orthogononalization on a general purpose graphics processing unit with double double and quad double arithmetic
AI总结:
针对多项式系统牛顿法中线性系统的精确求解,在GPU上实现双倍双精度和四倍双精度算术的修正Gram-Schmidt正交化方法,并验证加速比足以补偿额外精度开销。
摘要:
我们的问题是在通用图形处理单元上使用双倍双精度和四倍双精度算术精确求解线性系统。这些线性系统源于多项式系统上牛顿法的应用。牛顿法作为路径跟踪方法中的校正器,因此线性系统是顺序求解而非同时求解。一条解路径可能需要求解数千个线性系统。在之前的工作中,我们报告了在NVIDIA Tesla C2050上实现多项式系统求值和求导的良好加速比。尽管在牛顿法中求值和求导的成本通常主导线性系统求解的成本,但由于CPU和GPU之间通信带宽有限,我们无法在路径跟踪期间将线性系统发送到CPU求解。由于高次数的原因,雅可比矩阵可能包含极端值,需要扩展精度,从而导致显著的开销。这种多精度算术的开销是我们开发大规模并行算法的主要动机。为了处理超定线性系统,我们以最小二乘意义求解线性系统,通过修正Gram-Schmidt算法计算矩阵的QR分解。我们描述了在NVIDIA Tesla C2050上使用双倍双精度和四倍双精度算术实现修正Gram-Schmidt正交化方法。我们的实验结果表明,所实现的加速比足够高,足以补偿额外一个精度级别的开销。
英文摘要:
Our problem is to accurately solve linear systems on a general purpose graphics processing unit with double double and quad double arithmetic. The linear systems originate from the application of Newton's method on polynomial systems. Newton's method is applied as a corrector in a path following method, so the linear systems are solved in sequence and not simultaneously. One solution path may require the solution of thousands of linear systems. In previous work we reported good speedups with our implementation to evaluate and differentiate polynomial systems on the NVIDIA Tesla C2050. Although the cost of evaluation and differentiation often dominates the cost of linear system solving in Newton's method, because of the limited bandwidth of the communication between CPU and GPU, we cannot afford to send the linear system to the CPU for solving during path tracking. Because of large degrees, the Jacobian matrix may contain extreme values, requiring extended precision, leading to a significant overhead. This overhead of multiprecision arithmetic is our main motivation to develop a massively parallel algorithm. To allow overdetermined linear systems we solve linear systems in the least squares sense, computing the QR decomposition of the matrix by the modified Gram-Schmidt algorithm. We describe our implementation of the modified Gram-Schmidt orthogonalization method for the NVIDIA Tesla C2050, using double double and quad double arithmetic. Our experimental results show that the achieved speedups are sufficiently high to compensate for the overhead of one extra level of precision.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。