This paper discusses ways of computer time saving in numerical simulation of Quantum Chromo Dynamics on a lattice. The three time saving devices considered are a link updating order algorithm, a data compaction algorithm and the pseudo-heatbath algorithm for the Monte Carlo simulation. The link updating algorithm involves looking at about half the lattice points and updating the links in 8 directions (positive and negative directions) at each stage and the data compaction algorithm stores \(3\times 3\) matrices as 2 rows the third being calculated from the first two. Finally, the pseudo-heatbath algorithm involves approximating a distribution of the form \(e^{\kappa x}\sqrt{1-x^ 2}\), -1\(\leq x\leq 1,\) by \(e^{0.7\kappa x}\) for \(-1\leq x\leq x_ 0<1\) and by m for \(x_ 0\leq x<1\).
- Program for efficient Monte Carlo computations of quenched SU(3) lattice gauge theory using the quasi-heatbath method on a CDC CYBER 205 computer
- General algorithm for improved lattice actions on parallel computing architectures
- Computer techniques for lattice gauge theories
- scientific article; zbMATH DE number 1206092
- Performance of lattice QCD programs on CP-PACS
- Program for efficient Monte Carlo computations of quenched SU(3) lattice gauge theory using the quasi-heatbath method on a CDC CYBER 205 computer
- An improved heat bath method for vectorized processing
- Towards lattice quantum chromodynamics on FPGA devices
- Coulomb, Landau and maximally abelian gauge fixing in lattice QCD with multi-gpus
- Efficient lattice assessment for LCG and GLP parameter searches
- Solving lattice QCD systems of equations using mixed precision solvers on GPUs
- General algorithm for improved lattice actions on parallel computing architectures
- tmLQCD: a program suite to simulate Wilson twisted mass lattice QCD
This page was built for publication: Optimizing a lattice QCD simulation program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075005)
