✦ LIBER ✦

QCDPAX: A parallel computer for lattice QCD simulation

✍ Scribed by Y. Iwasaki; T. Hoshino; T. Shirakawa; Y. Oyanagi; T. Kawai

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 603 KB
Volume: 49
Category: Article
ISSN: 0010-4655
DOI: 10.1016/0010-4655(88)90005-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel SSOR preconditioner for latti

A parallel SSOR preconditioner for lattice QCD

✍ S. Fischer; A. Frommer; U. Glässner; Th. Lippert; G. Ritzenhöfer; K. Schilling 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 919 KB

We present a parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers which proves to be efficient in lattice QCD applications involving Wilson fermions. Our preconditioner is based on a locally lexicographic ordering of the lattice points. In actual Hybrid Monte Carlo applic

Optimizing a lattice QCD simulation prog

Optimizing a lattice QCD simulation program

✍ Ph de Forcrand; D Lellouch; C Roiesnel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 381 KB

Lattice QCD — A challenge in large scale

Lattice QCD — A challenge in large scale computing

✍ K. Schilling 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 847 KB

Parallel FDTD simulator for MIMD compute

Parallel FDTD simulator for MIMD computers

✍ U. Effing; W. Kümpel; I. Wolff 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 327 KB

A parallel implementation of the finite difference time-domain algorithm for the analysis of planar microwave circuits is presented in this paper. For this the FDTD mesh is divided in equal-sized subspaces. Every processor of the parallel computer calculates the field in one subspace. Furthermore de

An 8 parameter representation of SU(3) m

An 8 parameter representation of SU(3) matrices and its application for simulating lattice qcd

✍ B Bunk; R Sommer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We present a representation of SU(3) matrices by 8 real parameters. By truncating each parameter to 8 bits we are able to code each SU(3) link variable in one (64 bit) word of memory which reduces the amount of storage space needed by a factor of at least 6. A ten hit Metropolis program using this s

General Algorithm for Improved Lattice A

General Algorithm for Improved Lattice Actions on Parallel Computing Architectures

✍ Frédéric D.R. Bonnet; Derek B. Leinweber; Anthony G. Williams 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Quantum field theories underlie all of our understanding of the fundamental forces of nature. There are relatively few first-principles approaches to the study of quantum field theories (such as quantum chromodynamics [QCD] relevant to the strong interaction) apart from the perturbative (i.e., weak-