%0 Journal Article %1 Krieg2019Accelerating %A Krieg, Stefan %A Luu, Thomas %A Ostmeyer, Johann %A Papaphilippou, Philippos %A Urbach, Carsten %D 2019 %J Computer Physics Communications %K condensed %R 10.1016/j.cpc.2018.10.008 %T Accelerating Hybrid Monte Carlo simulations of the Hubbard model on the hexagonal lattice %U http://dx.doi.org/10.1016/j.cpc.2018.10.008 %X 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 \$102102\$ and \$N\_t=64\$. We find that the Hasenbusch algorithm leads to a speed up of more than an order of magnitude.

@article{Krieg2019Accelerating, abstract = {{ 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\times 102\$ and \$N\_t=64\$. We find that the Hasenbusch algorithm leads to a speed up of more than an order of magnitude.}}, added-at = {2019-02-23T22:09:48.000+0100}, archiveprefix = {arXiv}, author = {Krieg, Stefan and Luu, Thomas and Ostmeyer, Johann and Papaphilippou, Philippos and Urbach, Carsten}, biburl = {https://www.bibsonomy.org/bibtex/22a535b26a462371f2b6e474d04311e10/cmcneile}, citeulike-article-id = {14681517}, citeulike-linkout-0 = {http://arxiv.org/abs/1804.07195}, citeulike-linkout-1 = {http://arxiv.org/pdf/1804.07195}, citeulike-linkout-2 = {http://dx.doi.org/10.1016/j.cpc.2018.10.008}, day = 14, doi = {10.1016/j.cpc.2018.10.008}, eprint = {1804.07195}, interhash = {f708bfcdb0fa57ae661ff7c437c6b3b4}, intrahash = {2a535b26a462371f2b6e474d04311e10}, issn = {00104655}, journal = {Computer Physics Communications}, keywords = {condensed}, month = jan, posted-at = {2019-01-21 10:53:05}, priority = {2}, timestamp = {2019-02-23T22:15:27.000+0100}, title = {{Accelerating Hybrid Monte Carlo simulations of the Hubbard model on the hexagonal lattice}}, url = {http://dx.doi.org/10.1016/j.cpc.2018.10.008}, year = 2019 }