Related papers: Gauge Field Generation on Large-Scale GPU-Enabled …

We construct a hierarchy of lattice fermions, where the coarser lattice Dirac operator is the Schur complement of the block UL decomposition of the finer lattice operator. We show that the construction is an exact gauged renormalisation…

Symplectic gauge theories coupled to matter fields lead to symmetry enhancement phenomena that have potential applications in such diverse contexts as composite Higgs, top partial compositeness, strongly interacting dark matter, and…

Simulations of odd flavors QCD can be performed in the framework of the hybrid Monte Carlo algorithm where the inverse of the fermion matrix is approximated by a polynomial. In this exploratory study we perform three flavors QCD…

Lattice Quantum Chromodynamics simulations typically spend most of the runtime in inversions of the Fermion Matrix. This part is therefore frequently optimized for various HPC architectures. Here we compare the performance of the Intel Xeon…

Study of general purpose computation by GPU (Graphics Processing Unit) can improve the image processing capability of micro-computer system. This paper studies the parallelism of the different stages of decimation in time radix 2 FFT…

We report the first CUDA graphics-processing-unit (GPU) implementation of the polymer field-theoretic simulation framework for determining fully fluctuating expectation values of equilibrium properties for periodic and select aperiodic…

I review recent research and advances in algorithms for solvers and gauge generation, with an emphasis on practical algorithms for four dimensional simulations. Particular consideration is given to advances in multigrid solvers, fourier…

A parametrization of gauge fields on complex projective spaces of arbitrary dimension is given as a generalization of the two-dimensional case. Gauge transformations act homogeneously on the fields, facilitating a manifestly gauge-invariant…

This work addresses the problem of simulating Gaussian random fields that are continuously indexed over a class of metric graphs, termed graphs with Euclidean edges, being more general and flexible than linear networks. We introduce three…

We accelerated an ab-initio molecular QMC calculation by using GPGPU. Only the bottle-neck part of the calculation is replaced by CUDA subroutine and performed on GPU. The performance on a (single core CPU + GPU) is compared with that on a…

The strongly coupled lattice gauge models show an interesting mechanism of dynamical mass generation. If a suitable continuum limit can be found, one may think of it as an alternative to the Higgs mechanism. We present data on the spectrum,…

Adaptive finite elements combined with geometric multigrid solvers are one of the most efficient numerical methods for problems such as the instationary Navier-Stokes equations. Yet despite their efficiency, computations remain expensive…

High-dimensional multimodal sampling problems from lattice field theory (LFT) have become important benchmarks for machine learning assisted sampling methods. We show that GPU-accelerated particle methods, Sequential Monte Carlo (SMC) and…

The low-lying eigenvalues of a (sparse) hermitian matrix can be computed with controlled numerical errors by a conjugate gradient (CG) method. This CG algorithm is accelerated by alternating it with exact diagonalisations in the subspace…

Machine learning methods on graphs have proven useful in many applications due to their ability to handle generally structured data. The framework of Gaussian Markov Random Fields (GMRFs) provides a principled way to define Gaussian models…

The sign problem is a major obstacle to our understanding of the phase diagram of QCD at finite baryon density. Several numerical methods have been proposed to tackle this problem, but a full solution to the sign problem is still elusive.…

Gauge fixing is an essential step in lattice QCD calculations, particularly for studying gauge-dependent observables. Traditional iterative algorithms are computationally expensive and often suffer from critical slowing down and scaling…

We propose a novel way to break grand unified gauge symmetries via the Hosotani mechanism in models that can accommodate chiral fermions. Adjoint scalar fields are realized through the so-called diagonal embedding method which is often used…

A graphical user interface (GUI) software is provided for lattice QCD simulations, aimed at streamlining the process. The current version of the software employs the Metropolis algorithm with the Wilson gauge action. It is implemented in…

The increasing scale and wealth of inter-connected data, such as those accrued by social network applications, demand the design of new techniques and platforms to efficiently derive actionable knowledge from large-scale graphs. However,…