量子色动力学中多个右手边线性方程组的特征值计算和收缩
Computing and deflating eigenvalues while solving multiple right hand side linear systems in Quantum Chromodynamics
摘要:
提出了一种新的算法,在求解共轭梯度线性方程组时,计算Hermitian正定矩阵的特征值和特征向量。传统上,所有CG迭代向量都可以通过三对角投影矩阵的特征向量保存和重组,理论上相当于未重新启动的Lanczos。我们的算法利用CG产生的迭代向量来更新近似特征向量的向量的小窗口。当该窗口以局部最优方式重新启动时,线性系统的CG算法不受影响。然而,在我们所有的实验中,这个小窗口以与未重新启动的Lanczos相同的速率收敛到所需的特征向量。在线性系统的解之后,还没有精确收敛的特征向量可以通过求解额外的线性系统以增量方式改进。在这种情况下,在早期系统中识别的特征向量可以用于收缩,从而加速后续系统的收敛。在格点量子色动力学的应用中,我们使用了这个算法,得到了很好的结果。具体地说,在求解24个右手边之后,获得了大约70个特征向量。从大量随后的右手边收缩这些,消除了可怕的临界减速,当夸克质量达到临界值时,矩阵的条件作用增加。我们的实验表明,我们的方法的迭代次数几乎是恒定的,无论夸克质量如何,并且对于轻夸克质量,比原始CG加速8。
英文摘要:
We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate Gradient (CG). Traditionally, all the CG iteration vectors could be saved and recombined through the eigenvectors of the tridiagonal projection matrix, which is equivalent theoretically to unrestarted Lanczos. Our algorithm capitalizes on the iteration vectors produced by CG to update only a small window of vectors that approximate the eigenvectors. While this window is restarted in a locally optimal way, the CG algorithm for the linear system is unaffected. Yet, in all our experiments, this small window converges to the required eigenvectors at a rate identical to unrestarted Lanczos. After the solution of the linear system, eigenvectors that have not accurately converged can be improved in an incremental fashion by solving additional linear systems. In this case, eigenvectors identified in earlier systems can be used to deflate, and thus accelerate, the convergence of subsequent systems. We have used this algorithm with excellent results in lattice QCD applications, where hundreds of right hand sides may be needed. Specifically, about 70 eigenvectors are obtained to full accuracy after solving 24 right hand sides. Deflating these from the large number of subsequent right hand sides removes the dreaded critical slowdown, where the conditioning of the matrix increases as the quark mass reaches a critical value. Our experiments show almost a constant number of iterations for our method, regardless of quark mass, and speedups of 8 over original CG for light quark masses.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。