arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.01990cs.MScs.DC
收藏

对称三对角特征值问题的并行结构分治算法

A parallel structured divide-and-conquer algorithm for symmetric tridiagonal eigenvalue problems

Xia Liao, Shengguo Li, Yutong Lu, Jose E. Roman

摘要:

本文基于ScaLAPACK和并行结构矩阵乘法算法PSMMA,提出了一种对称三对角矩阵特征值求解器的并行结构分治(PSDC)算法。通过矩阵-矩阵乘法计算特征向量是分治算法中计算量最大的部分,并且这种乘法中涉及的矩阵之一是秩结构的柯西矩阵。PSMMA利用这一特性,在不进行任何通信的情况下,利用Cauchy矩阵的生成器构造局部矩阵,并利用结构化的低秩近似算法进一步降低计算量.因此,降低了通信和计算成本。实验结果表明,PSMMA和PSDC都是高度可扩展的,至少可扩展到4096个进程。PSDC具有比在[J. Comput. Appl.Math.344(2018)512- 520],并且对于相同的矩阵仅缩放到300个过程。与ScaLAPACK中的\texttt{PDSTEDC}相比,PSDC总是更快,并且对于一些具有很少收缩的矩阵,PSDC实现了$1.4$ x- $1.6$ x加速比。PSDC也可与ELPA相比较,当使用少数进程时,PSDC比ELPA快,当使用许多进程时,PSDC稍慢。

英文摘要:

In this paper, a parallel structured divide-and-conquer (PSDC) eigensolver is proposed for symmetric tridiagonal matrices based on ScaLAPACK and a parallel structured matrix multiplication algorithm, called PSMMA. Computing the eigenvectors via matrix-matrix multiplications is the most computationally expensive part of the divide-and-conquer algorithm, and one of the matrices involved in such multiplications is a rank-structured Cauchy-like matrix. By exploiting this particular property, PSMMA constructs the local matrices by using generators of Cauchy-like matrices without any communication, and further reduces the computation costs by using a structured low-rank approximation algorithm. Thus, both the communication and computation costs are reduced. Experimental results show that both PSMMA and PSDC are highly scalable and scale to 4096 processes at least. PSDC has better scalability than PHDC that was proposed in [J. Comput. Appl. Math. 344 (2018) 512--520] and only scaled to 300 processes for the same matrices. Comparing with \texttt{PDSTEDC} in ScaLAPACK, PSDC is always faster and achieves $1.4$x--$1.6$x speedup for some matrices with few deflations. PSDC is also comparable with ELPA, with PSDC being faster than ELPA when using few processes and a little slower when using many processes.

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

↑