Adaptive Aggregation Based Domain Decomposition Multigrid for the Lattice Wilson Dirac Operator
Andreas Frommer, Karsten Kahl, Stefan Krieg, Björn Leder, Matthias Rottmann
备注:
Additional comparison to method of arXiv:1011.2775 and to mixed-precision odd-even preconditioned BiCGStab. Results of numerical experiments changed slightly due to more systematic use of odd-even preconditioning
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.
A first look at Structured-Multiscale Algebraic Multigrid for Lattice Field Theory
Fraunhofer Institute for Algorithms and Scientific Computing SCAI(弗劳恩霍夫算法与科学计算研究所);Institute for Numerical Simulation, Rheinische Friedrich-Wilhelms-Universität(莱茵弗里德里希·威廉斯大学数值模拟研究所);Jülich Supercomputing Centre, Forschungszentrum Jülich(于利希超级计算中心,于利希研究中心);Helmholtz-Institut für Strahlen- und Kernphysik, Rheinische Friedrich-Wilhelms-Universität Bonn(波恩莱茵弗里德里希·威廉斯大学亥姆霍兹辐射与核物理研究所)