对GPU上求解线性方程组的分裂方法分析
Analysis of A Splitting Approach for the Parallel Solution of Linear Systems on GPU Cards
AI总结:
本文提出一种在GPU上并行求解稀疏或密集带状线性方程组的分裂方法,通过将矩阵分成对角子块并并行分解,与PARDISO、SuperLU和MUMPS等直接求解器进行效率比较,展示了其在密集带状方程组中的有效性。
摘要:
我们讨论了一种在图形处理单元(GPU)上求解稀疏或密集带状线性方程组A x = b的方法。矩阵A ∈ R^{N×N}可能是非对称的且规模较大;即10000 ≤ N ≤ 500000。split and parallelize(SaP)方法旨在将矩阵A分成对角子块A_i,i=1,…,P,并独立并行分解。解法可以选择考虑或忽略连接对角子块A_i的矩阵。该方法与基于Krylov子空间的迭代方法相结合,实现了一个名为SaP::GPU的求解器,与三个常用的稀疏直接求解器PARDISO、SuperLU和MUMPS进行效率比较。SaP::GPU在GPU上运行,除了初步行-列排列涉及的几个阶段外,其鲁棒性在与上述直接求解器的比较中表现良好。在与Intel的MKL比较中,当用于求解接近对角占优的密集带状方程组时,SaP::GPU也表现良好。SaP::GPU作为开源软件,以宽松的BSD3许可证分发。
英文摘要:
We discuss an approach for solving sparse or dense banded linear systems ${\bf A} {\bf x} = {\bf b}$ on a Graphics Processing Unit (GPU) card. The matrix ${\bf A} \in {\mathbb{R}}^{N \times N}$ is possibly nonsymmetric and moderately large; i.e., $10000 \leq N \leq 500000$. The ${\it split\ and\ parallelize}$ (${\tt SaP}$) approach seeks to partition the matrix ${\bf A}$ into diagonal sub-blocks ${\bf A}_i$, $i=1,\ldots,P$, which are independently factored in parallel. The solution may choose to consider or to ignore the matrices that couple the diagonal sub-blocks ${\bf A}_i$. This approach, along with the Krylov subspace-based iterative method that it preconditions, are implemented in a solver called ${\tt SaP::GPU}$, which is compared in terms of efficiency with three commonly used sparse direct solvers: ${\tt PARDISO}$, ${\tt SuperLU}$, and ${\tt MUMPS}$. ${\tt SaP::GPU}$, which runs entirely on the GPU except several stages involved in preliminary row-column permutations, is robust and compares well in terms of efficiency with the aforementioned direct solvers. In a comparison against Intel's ${\tt MKL}$, ${\tt SaP::GPU}$ also fares well when used to solve dense banded systems that are close to being diagonally dominant. ${\tt SaP::GPU}$ is publicly available and distributed as open source under a permissive BSD3 license.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。