Jump to ContentJump to Main Navigation
Modern Perspectives in Lattice QCD: Quantum Field Theory and High Performance ComputingLecture Notes of the Les Houches Summer School: Volume 93, August 2009$
Users without a subscription are not able to see the full content.

Laurent Lellouch, Rainer Sommer, Benjamin Svetitsky, Anastassios Vladikas, and Leticia F. Cugliandolo

Print publication date: 2011

Print ISBN-13: 9780199691609

Published to Oxford Scholarship Online: January 2012

DOI: 10.1093/acprof:oso/9780199691609.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 16 October 2019

Computational strategies in lattice QCD

Computational strategies in lattice QCD

Chapter:
(p.331) 6 Computational strategies in lattice QCD
Source:
Modern Perspectives in Lattice QCD: Quantum Field Theory and High Performance Computing
Author(s):

Martin Lüscher

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199691609.003.0006

This chapter provides an introduction to some of the basic numerical techniques used in lattice QCD. The topics covered include Markov-chain simulations, the HMC algorithm, deflation and variance reduction methods as well as a theoretical analysis of the statistical error propagation from the calculated correlation functions to the physical quantities.

Keywords:   Lattice QCD, Markov chain, HMC algorithm, deflation, variance reduction, statistical error propagation

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .