Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDeflation and Flexible SAP-Preconditioning of GMRES in Lattice QCD Simulation
426
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The simulation of lattice QCD on massively parallel computers stimulated the development of scalable algorithms for the solution of sparse linear systems. We tackle the problem of the Wilson-Dirac operator inversion by combining a Schwarz alternating procedure (SAP) in multiplicative form with a flexible variant of the GMRES-DR algorithm. We show that restarted GMRES is not able to converge when the system is poorly conditioned. By adding deflation in the form of the FGMRES-DR algorithm, an important fraction of the information produced by the iterates is kept between successive restarts leading to convergence in cases in which FGMRES stagnates.
rate research
Read More
We propose a new strategy to evaluate the partition function of lattice QCD with Wilson gauge action coupled to staggered fermions, based on a strong coupling expansion in the inverse bare gauge coupling $beta= 2N/g^{2}$. Our method makes use of the recently developed formalism to evaluate the ${rm SU}(N)$ $1-$link integrals and consists in an exact rewriting of the partition function in terms of a set of additional dual degrees of freedom which we call Decoupling Operator Indices (DOI). The method is not limited to any particular number of dimensions or gauge group ${rm U}(N)$, ${rm SU}(N)$. In terms of the DOI the system takes the form of a Tensor Network which can be simulated using Worm-like algorithms. Higher order $beta$-corrections to strong coupling lattice QCD can be, in principle, systematically evaluated, helping to answer the question whether the finite density sign problem remains mild when plaquette contributions are included. Issues related to the complexity of the description and strategies for the stochastic evaluation of the partition function are discussed.
We present the results of the physical point simulation in 2+1 flavor lattice QCD with the nonperturbatively $O(a)$-improved Wilson quark action and the Iwasaki gauge action at $beta=1.9$ on a $32^3 times 64$ lattice. The physical quark masses together with the lattice spacing is determined with $m_pi$, $m_K$ and $m_Omega$ as physical inputs. There are two key algorithmic ingredients to make possible the direct simulation at the physical point: One is the mass-preconditioned domain-decomposed HMC algorithm to reduce the computational cost. The other is the reweighting technique to adjust the hopping parameters exactly to the physical point. The physics results include the hadron spectrum, the quark masses and the pseudoscalar meson decay constants. The renormalization factors are nonperturbatively evaluated with the Schr{o}dinger functional method. The results are compared with the previous ones obtained by the chiral extrapolation method.
In this paper we carry out a low-temperature scan of the phase diagram of dense two-color QCD with $N_f=2$ quarks. The study is conducted using lattice simulation with rooted staggered quarks. At small chemical potential we observe the hadronic phase, where the theory is in a confining state, chiral symmetry is broken, the baryon density is zero and there is no diquark condensate. At the critical point $mu = m_{pi}/2$ we observe the expected second order transition to Bose-Einstein condensation of scalar diquarks. In this phase the system is still in confinement in conjunction with non-zero baryon density, but the chiral symmetry is restored in the chiral limit. We have also found that in the first two phases the system is well described by chiral perturbation theory. For larger values of the chemical potential the system turns into another phase, where the relevant degrees of freedom are fermions residing inside the Fermi sphere, and the diquark condensation takes place on the Fermi surface. In this phase the system is still in confinement, chiral symmetry is restored and the system is very similar to the quarkyonic state predicted by SU($N_c$) theory at large $N_c$.
We present a polynomial preconditioner for solving large systems of linear equations. The polynomial is derived from the minimum residual polynomial and is straightforward to compute and implement. It this paper, we study the polynomial preconditioner applied to GMRES; however it could be used with any Krylov solver. Stability control using added roots allows for high degree polynomials. We discuss the effectiveness and challenges of root-adding and give an additional check for stability. This polynomial preconditioning algorithm can dramatically improve convergence for difficult problems and can reduce dot products by an even greater margin.
We investigate implementation of lattice Quantum Chromodynamics (QCD) code on the Intel AVX-512 architecture. The most time consuming part of the numerical simulations of lattice QCD is a solver of linear equation for a large sparse matrix that represents the strong interaction among quarks. To establish widely applicable prescriptions, we examine rather general methods for the SIMD architecture of AVX-512, such as using intrinsics and manual prefetching, for the matrix multiplication. Based on experience on the Oakforest-PACS system, a large scale cluster composed of Intel Xeon Phi Knights Landing, we discuss the performance tuning exploiting AVX-512 and code design on the SIMD architecture and massively parallel machines. We observe that the same code runs efficiently on an Intel Xeon Skylake-SP machine.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
