scholarly journals Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for Matrix Computations

2015 ◽  
Vol 70 (11) ◽  
pp. 2709-2718 ◽  
Author(s):  
Vassil Alexandrov ◽  
Oscar A. Esquivel-Flores
Keyword(s):  
Monte Carlo ◽  
Matrix Computations ◽  
Hybrid Monte Carlo ◽  
Monte Carlo Algorithms

scholarly journals Parallel Hybrid Monte Carlo Algorithms for Matrix Computations

2005 ◽  
pp. 752-759 ◽  
Author(s):  
V. Alexandrov ◽  
E. Atanassov ◽  
I. Dimov ◽  
S. Branford ◽  
A. Thandavan ◽  
...  
Keyword(s):  
Monte Carlo ◽  
Matrix Computations ◽  
Hybrid Monte Carlo ◽  
Monte Carlo Algorithms ◽  
Parallel Hybrid

Higher-order hybrid Monte Carlo algorithms

1989 ◽  
Vol 63 (1) ◽  
pp. 9-12 ◽  
Author(s):  
Michael Creutz ◽  
Andreas Gocksch
Keyword(s):  
Monte Carlo ◽  
Higher Order ◽  
Hybrid Monte Carlo ◽  
Monte Carlo Algorithms

scholarly journals Constrained hybrid Monte Carlo algorithms for gauge–Higgs models

2020 ◽  
Vol 254 ◽  
pp. 107192
Author(s):  
Michael Günther ◽  
Roman Höllwieser ◽  
Francesco Knechtli
Keyword(s):  
Monte Carlo ◽  
Hybrid Monte Carlo ◽  
Monte Carlo Algorithms

Efficient molecular dynamics and hybrid Monte Carlo algorithms for path integrals

1993 ◽  
Vol 99 (4) ◽  
pp. 2796-2808 ◽  
Author(s):  
Mark E. Tuckerman ◽  
Bruce J. Berne ◽  
Glenn J. Martyna ◽  
Michael L. Klein
Keyword(s):  
Molecular Dynamics ◽  
Monte Carlo ◽  
Path Integrals ◽  
Hybrid Monte Carlo ◽  
Monte Carlo Algorithms

scholarly journals ODD-FLAVOR HYBRID MONTE CARLO ALGORITHM FOR LATTICE QCD

2002 ◽  
Vol 13 (03) ◽  
pp. 343-365 ◽  
Author(s):  
TETSUYA TAKAISHI ◽  
PHILIPPE de FORCRAND
Keyword(s):  
Monte Carlo ◽  
Lattice Qcd ◽  
Correction Factor ◽  
Polynomial Approximation ◽  
Monte Carlo Algorithm ◽  
Hybrid Monte Carlo ◽  
Monte Carlo Algorithms

We discuss hybrid Monte Carlo algorithms for odd-flavor lattice QCD simulations. The algorithms include a polynomial approximation, which enables us to simulate odd-flavor QCD in the framework of the hybrid Monte Carlo algorithm. In order to make the algorithms exact, the correction factor to the polynomial approximation is also included in an economical, stochastic way. We test the algorithms for nf = 1, 1 + 1 and 2 + 1 flavors and compare results with other algorithms.

Sign in / Sign up

Export Citation Format

Share Document