Fast fermion Monte Carlo

被引:52
作者
deForcrand, P
Takaishi, T
机构
[1] Swiss Ctr. for Scientific Computing, ETH-Zentrum, RZ
关键词
D O I
10.1016/S0920-5632(96)00829-8
中图分类号
O412 [相对论、场论]; O572.2 [粒子物理学];
学科分类号
摘要
Three possibilities to speed up the Hybrid Monte Carlo algorithm are investigated. Changing the step-size adaptively brings no practical gain. On the other hand, substantial improvements result from using an approximate Hamiltonian or a preconditioned action.
引用
收藏
页码:968 / 970
页数:3
相关论文
共 9 条
[1]  
BROWER RC, HEPLAT9509012
[2]   Progress on lattice QCD algorithms [J].
deForcrand, P .
NUCLEAR PHYSICS B, 1996, :228-235
[3]  
DEFORCRAND P, HEPLAT9606020
[4]  
DUANE S, 1980, PHYS LETT B, V195, P222
[5]  
JANSEN K, HEPLAT9607051
[6]   A NEW APPROACH TO THE PROBLEM OF DYNAMICAL QUARKS IN NUMERICAL SIMULATIONS OF LATTICE QCD [J].
LUSCHER, M .
NUCLEAR PHYSICS B, 1994, 418 (03) :637-648
[7]  
*SESAM COLL, 1996, NUCL PHYS B, V47, P386
[8]   HAMILTONIAN EVOLUTION FOR THE HYBRID MONTE-CARLO ALGORITHM [J].
SEXTON, JC ;
WEINGARTEN, DH .
NUCLEAR PHYSICS B, 1992, 380 (03) :665-677
[9]   VARIABLE STEPS FOR REVERSIBLE INTEGRATION METHODS [J].
STOFFER, D .
COMPUTING, 1995, 55 (01) :1-22