This title appears in the Scientific Report :
2019
Please use the identifier:
http://dx.doi.org/10.1016/j.cpc.2018.10.008 in citations.
Please use the identifier: http://hdl.handle.net/2128/21487 in citations.
Accelerating Hybrid Monte Carlo simulations of the Hubbard model on the hexagonal lattice
Accelerating Hybrid Monte Carlo simulations of the Hubbard model on the hexagonal lattice
We present different methods to increase the performance of Hybrid Monte Carlo simulations of the Hubbard model in two-dimensions. Our simulations concentrate on a hexagonal lattice, though can be easily generalized to other lattices. It is found that best results can be achieved using a flexible GM...
Saved in:
Personal Name(s): | Krieg, Stefan (Corresponding author) |
---|---|
Luu, Thomas / Ostmeyer, Johann / Papaphilippou, Philippos / Urbach, Carsten | |
Contributing Institute: |
Jülich Supercomputing Center; JSC Theorie der Starken Wechselwirkung; IAS-4 |
Published in: | Computer physics communications, 236 (2019) S. 15-25 |
Imprint: |
Amsterdam
North Holland Publ. Co.
2019
|
DOI: |
10.1016/j.cpc.2018.10.008 |
Document Type: |
Journal Article |
Research Program: |
Dynamical Exascale Entry Platform DEEP Extended Reach DEEP - Extreme Scale Technologies TRR 55: Hadronenphysik mit Gitter-QCD Computational Science and Mathematical Methods PRACE 5th Implementation Phase Project |
Link: |
Get full text OpenAccess Get full text OpenAccess |
Publikationsportal JuSER |
Please use the identifier: http://hdl.handle.net/2128/21487 in citations.
We present different methods to increase the performance of Hybrid Monte Carlo simulations of the Hubbard model in two-dimensions. Our simulations concentrate on a hexagonal lattice, though can be easily generalized to other lattices. It is found that best results can be achieved using a flexible GMRES solver for matrix inversions and the second order Omelyan integrator with Hasenbusch acceleration on different time scales for molecular dynamics. We demonstrate how an arbitrary number of Hasenbusch mass terms can be included into this geometry and find that the optimal speed depends weakly on the choice of the number of Hasenbusch masses and their values. As such, the tuning of these masses is amenable to automization and we present an algorithm for this tuning that is based on the knowledge of the dependence of solver time and forces on the Hasenbusch masses. We benchmark our algorithms to systems where direct numerical diagonalization is feasible and find excellent agreement. We also simulate systems with hexagonal lattice dimensions up to 102 × 102 and Nt=64 . We find that the Hasenbusch algorithm leads to a speed up of more than an order of magnitude. |