摘要 : In lattice quantum chromodynamics (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 ph... 展开 In lattice quantum chromodynamics (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 preconditioner 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 separately in lattice QCD before. We show in extensive numerical tests conducted with a parallel production code implementation that considerable speedup can be achieved compared to conventional Krylov subspace methods, domain decomposition methods, and other hierarchical approaches for realistic system sizes. 收起