arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.1377hep-lat
收藏

格点Wilson Dirac算子基于自适应聚集的区域分解多重网格

Adaptive Aggregation Based Domain Decomposition Multigrid for the Lattice Wilson Dirac Operator

Andreas Frommer, Karsten Kahl, Stefan Krieg, Björn Leder, Matthias Rottmann

摘要:

在格点量子色动力学计算中,大量的工作都花在求解离散化的狄拉克方程上。传统的Krylov解算器显示出大系统尺寸和物理上有趣的参数区域的临界减速。本文提出了一种区域分解自适应代数多重网格方法,用于求解Dirac方程的“三叶草改进”Wilson离散。该方法结合并改进了格点量子色动力学中的区域分解和自适应代数多重网格两种方法。我们表明,在广泛的数值测试进行了并行生产代码的实现,相当大的速度比传统的Krylov子空间方法,区域分解方法和其他层次的方法,现实的系统规模可以实现。

英文摘要:

In lattice QCD computations a substantial amount of work is spent in solving discretized versions of the Dirac equation. Conventional Krylov solvers show critical slowing down for large system sizes and physically interesting parameter regions. We present a domain decomposition adaptive algebraic multigrid method used as a precondtioner to solve the "clover improved" Wilson discretization of the Dirac equation. This approach combines and improves two approaches, namely domain decomposition and adaptive algebraic multigrid, that have been used seperately in lattice QCD before. We show in extensive numerical test conducted with a parallel production code implementation that considerable speed-up over conventional Krylov subspace methods, domain decomposition methods and other hierarchical approaches for realistic system sizes can be achieved.

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

↑