๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dynamical overlap fermions, results with HMC algorithm

โœ Scribed by Z. Fodor; S.D. Katz; K.K. Szabo

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
133 KB
Volume
140
Category
Article
ISSN
0920-5632

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present results of a hybrid Monte-Carlo algorithm for dynamical, n f = 2, four-dimensional QCD with overlap fermions. The fermionic force requires careful treatment, when changing topological sectors. The pion mass dependence of the topological susceptibility is studied on 6 4 and 12 โ€ข 6 3 lattices. The results are transformed into physical units.

๐Ÿ“œ SIMILAR VOLUMES

Algorithms for Lattice QCD with Dynamica
Algorithms for Lattice QCD with Dynamical Fermions
โœ A.D. Kennedy ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 833 KB

We consider recent progress in algorithms for generating gauge field configurations that include the dynamical effects of light fermions. We survey what has been achieved in recent state-of-the-art computations, and examine the trade-offs between performance and control of systematic errors. We brie

Single-machine scheduling with dynamic a
Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
โœ Suresh Chand; Rodney Traub; Reha Uzsoy ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 689 KB

This article considers the single-machine dynamic scheduling problem where the jobs have different arrival times and the objective is to minimize the sum of completion times. This problem is known to be strongly NP-hard. We develop decomposition results for this problem such that a large problem can