Searcharxiv⌕ Search

arXiv subjects

U. Glaessner

Publications and source records attributed to U. Glaessner.

7 recordsLinked to original sources
arXiv1997

Critical Dynamics of the Hybrid Monte Carlo Algorithm

We investigate the critical dynamics of the Hybrid Monte Carlo algorithm approaching the chiral limit of standard Wilson fermions. Our observations are based on time series of lengths O(5000) for a variety of observables. The lattice sizes are 16^3 x 32 and 24^3 x 40. We work at beta=5.6, and kappa=0.156, 0.157, 0.1575, 0.158, with 0.83 > m_pi/m_rho > 0.55. We find surprisingly small integrated autocorrelation times for local and extended observables. The dynamical critical exponent $z$ of the exponential autocorrelation time is compatible with 2. We estimate the total computational effort to scale between V^2 and V^2.25 towards the chiral limit.

hep-lat↗
arXiv1996

Full QCD with dynamical Wilson fermions on a 24^3 x 40-lattice -- a feasibility study

The investigation of light sea-quark effects in lattice QCD with dynamical Wilson fermions requires both larger physical volumes and finer lattice resolutions than achieved previously. As high-end supercomputers like the 512-node APE Tower provide the compute power to perform a major step towards the chiral limit (T-chi-L), we have launched a feasibility study on a 24^3 x 40 lattice. We approach the chiral limit--while refining the resolution--, using the standard Wilson fermion action. Following previous work, our Hybrid Monte Carlo simulation runs at beta=5.6 and two kappa-values, 0.1575 and 0.158. From our study, we are confident that, for the APE Tower, a realistic working point has been found corresponding to a volume of 2 fm^3, with chirality characterized by 1/(a m_pi) = 5.6.

hep-lat↗
arXiv1996

A Parallel SSOR Preconditioner for Lattice QCD

A parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers in lattice QCD applications involving Wilson fermions is presented. In actual Hybrid Monte Carlo and quark propagator calculations it helps to reduce the number of iterations by a factor of 2 compared to conventional odd-even preconditioning. This corresponds to a gain in cpu-time of 30\% - 70\% over odd-even preconditioning.

hep-lat↗
arXiv1996

How to compute Green's Functions for entire Mass Trajectories within Krylov Solvers

The availability of efficient Krylov subspace solvers play a vital role for the solution of a variety of numerical problems in computational science. Here we consider lattice field theory. We present a new general numerical method to compute many Green's functions for complex non-singular matrices within one iteration process. Our procedure applies to matrices of structure $A=D-m$, with $m$ proportional to the unit matrix, and can be integrated within any Krylov subspace solver. We can compute the derivatives $x^{(n)}$ of the solution vector $x$ with respect to the parameter $m$ and construct the Taylor expansion of $x$ around $m$. We demonstrate the advantages of our method using a minimal residual solver. Here the procedure requires $1$ intermediate vector for each Green's function to compute. As real life example, we determine a mass trajectory of the Wilson fermion matrix for lattice QCD. Here we find that we can obtain Green's functions at all masses $\geq m$ at the price of one inversion at mass $m$.

hep-lat↗
arXiv1996

A Parallel SSOR Preconditioner for Lattice QCD

We present a parallelizable SSOR preconditioning scheme for Krylov subspace iterative solvers which proves to be efficient in lattice QCD applications involving Wilson fermions. Our preconditioner is based on a locally lexicographic ordering of the lattice points. In actual hybrid Monte Carlo applications with the bi-conjugate gradient stabilized method BiCGstab, we achieve a gain factor of about 2 in the number of iterations compared to conventional odd-even preconditioning. Whether this translates into similar reductions in run time will depend on the parallel computer in use. We discuss implementation issues using the `Eisenstat-trick' and machine specific advantages of the method for the APE100/Quadrics parallel computer. In a full QCD simulation with Wilson fermions on a 512-processor Quadrics QH4 we find a gain in cpu-time of a factor of 1.7 over odd-even preconditioning for a 24^3 x 40 lattice.

hep-lat↗