Optimizing a lattice QCD simulation program (Q1075005): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Philippe de Forcrand / rank
Normal rank
 
Property / author
 
Property / author: Claude Roiesnel / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Brian L. Burrows / rank
Normal rank
 
Property / author
 
Property / author: Philippe de Forcrand / rank
 
Normal rank
Property / author
 
Property / author: Claude Roiesnel / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Brian L. Burrows / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0021-9991(85)90149-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068398760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank

Latest revision as of 12:51, 17 June 2024

scientific article
Language Label Description Also known as
English
Optimizing a lattice QCD simulation program
scientific article

    Statements

    Optimizing a lattice QCD simulation program (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    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\).
    0 references
    computer time saving
    0 references
    Quantum Chromo Dynamics
    0 references
    lattice
    0 references
    link updating order algorithm
    0 references
    data compaction algorithm
    0 references
    pseudo-heatbath algorithm
    0 references

    Identifiers