分裂网格和分块Lanczos算法的特征对生成
Split Grid and Block Lanczos Algorithm for Efficient Eigenpair Generation
摘要：
单个节点的计算能力与节点间带宽之间的不平衡性越来越大，这使得任何格点量子色动力学算法都非常需要最小化节点间通信量。相对较新的方法之一是“Split Grid”或“Split Domain”方法，其中数据在单个二进制文件的运行中重新排列，以便需要大量节点外通信的例程（例如Dirac运算符）在多个较小的分区上并行运行，具有更好的表面与体积比，而其他例程在一个分区中运行。虽然将分裂网格方法用于逆变器是相对简单的，但是具有一个起始向量的典型Lanczos算法并不自然地将其自身呈现为分裂网格方法。在这份报告中，我们调查的块Lanczos算法（BL），它允许多个起始向量被并行处理。结果表明，对于一个中等数量的起始向量，BL实现收敛类似调整的Implemented重新启动Lanczos算法（IRL）的2+1-味物理的Möbius/Möbius合奏。
英文摘要：
The increasing imbalance between the computing capabilities of individual nodes and the internode bandwidth makes it highly desirable for any Lattice QCD algorithm to minimize the amount of internode communication. One of the relatively new methods for this is the `Split Grid' or `Split Domain' method, where data is rearranged within the running of a single binary, so that the routines which requires significant off-node communications such as Dirac operators are run on multiple smaller partitions in parallel with a better surface to volume ratio, while other routines are run in one partition. While it is relatively straightforward to utilize Split Grid method for inverters, the typical Lanczos algorithm which has one starting vector does not render itself naturally to Split Grid method. In this report we investigate the Block Lanczos algorithm(BL), which allows multiple starting vectors to be processed in parallel. It is shown that for a moderate number of starting vectors, BL achieves convergence comparable to similarly tuned Implicitly Restarted Lanczos algorithm (IRL) on 2+1-flavor physical DWF/Möbius ensemble.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
