An adaptive aggregation based domain decomposition multilevel method for the lattice wilson dirac operator: multilevel results
arXiv:1307.6101
Abstract
In lattice QCD computations a substantial amount of work is spent in solving linear systems arising in Wilson's discretization of the Dirac equations. We show first numerical results of the extension of the two-level DD-αAMG method to a true multilevel method based on our parallel MPI-C implementation. Using additional levels pays off, allowing to cut down the core minutes spent on one system solve by a factor of approximately 700 compared to standard Krylov subspace methods and yielding another speed-up of a factor of 1.7 over the two-level approach.
12 pages, 5 figures
References in corpus (7)
- Lattice QCD at the physical point: Simulation and analysis details
- Adaptive multigrid algorithm for the lattice Wilson-Dirac operator
- Lattice QCD at the physical point: light quark masses
- Isospin splittings in the light baryon octet from lattice QCD and QED
- Adaptive Multigrid Algorithm for Lattice QCD
- One flavor mass reweighting in lattice QCD
- Adaptive Aggregation Based Domain Decomposition Multigrid for the Lattice Wilson Dirac Operator
Cited by in corpus (8)
- Simulation of QCD with N_f=2+1 flavors of non-perturbatively improved Wilson fermions
- Adaptive Aggregation-based Domain Decomposition Multigrid for Twisted Mass Fermions
- Lattice QCD with Domain Decomposition on Intel Xeon Phi Co-Processors
- QPACE 2 and Domain Decomposition on the Intel Xeon Phi
- Hierarchically deflated conjugate residual
- Comparison of Domain Wall Fermion Multigrid Methods
- (Approximate) Low-Mode Averaging with a new Multigrid Eigensolver
- Lattice QCD and the Balkan physicists contribution