Chiral Fermions Algorithms In Lattice QCD

• Main Authors: Dafina Xhako, Rudina Zeqirllari
• Format: Article
• Language: English
• Published: V.N. Karazin Kharkiv National University Publishing 2019-03-01
• Series: East European Journal of Physics
• Subjects: algorithms; chiral; critical-slowing; fermions; lattice; QCD
• Online Access: https://periodicals.karazin.ua/eejp/article/view/12396
• ISSN: 2312-4334; 2312-4539

The theory that explains the strong interactions of the elementary particles, as part of the standard model, it is the so-called Quantum Chromodynamics (QCD) theory. In regimes of low energy this theory it is formulated and solved in a lattice with four dimensions using numerical simulations. This method it is called the lattice QCD theory. Quark propagator it the most important element that is calculated because it contains the physical information of lattice QCD. Computing quark propagator of chiral fermions in lattice means that we should invert the chiral Dirac operator, which has high complexity. In the standard inversion algorithms of the Krylov subspace methods, that are used in these kinds of simulations, the time of inversion is scaled with the inverse of the quark mass. In lattice QCD simulations with chiral fermions, this phenomenon it is knowing as the critical slowing-down problem. The purpose of this work is to show that the preconditioned GMRESR algorithm, developed in our previous work, solves this problem. The preconditioned GMRESR algorithm it is developed in U(1) group symmetry using QCDLAB 1.0 package, as good “environment” for testing new algorithms. In this paper we study the escalation of the time of inversion with the quark mass for this algorithm. It turned out that it is a fast inversion algorithm for lattice QCD simulations with chiral fermions, that “soothes” the critical slowing-down of standard algorithms. The results are compared with SHUMR algorithm that is optimal algorithm used in these kinds of simulations. The calculations are made for 100 statistically independent configurations on 64 x 64 lattice gauge U(1) field for three coupling constant and for some quark masses. The results showed that for the preconditioned GMRESR algorithm the coefficient k, related to the critical slowing down phenomena, it is approximately - 0.3 compared to the inverse proportional standard law (k = -1) that it is scaled SHUMR algorithm, even for dense lattices. These results make more stable and confirm the efficiency of our algorithm as an algorithm that avoid the critical slowing down phenomenon in lattice QCD simulations. In our future studies we have to develop the preconditioned GMRESR algorithm in four dimensions, in SU (3) lattice gauge theory.