Cargando…
Simulation of $n_{f}$ = 3 QCD by Hybrid Monte Carlo
Simulations of odd flavors QCD can be performed in the framework of the hybrid Monte Carlo algorithm where the inverse of the fermion matrix is approximated by a polynomial. In this exploratory study we perform three flavors QCD simulations. We make a comparison of the hybrid Monte Carlo algorithm a...
Autores principales: | , |
---|---|
Lenguaje: | eng |
Publicado: |
2001
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1016/S0920-5632(01)01013-1 http://cds.cern.ch/record/474338 |
Sumario: | Simulations of odd flavors QCD can be performed in the framework of the hybrid Monte Carlo algorithm where the inverse of the fermion matrix is approximated by a polynomial. In this exploratory study we perform three flavors QCD simulations. We make a comparison of the hybrid Monte Carlo algorithm and the R-algorithm which also simulates odd flavors systems but has step-size errors. We find that results from our hybrid Monte Carlo algorithm are in agreement with those from the R-algorithm obtained at very small step-size. |
---|