Michael A. Clark
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Michael A. Clark has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Anthony D. Kennedy
University of Edinburgh
9 shared publications - Claudio Rebbi
Boston University
3 shared publications - Richard C. Brower
Boston University
3 shared publications - Ronald Babich
Department of Physics Boston University 590 Commonwealth Avenue 02215 Boston MA USA
3 shared publications - George T. Fleming
Fermi National Accelerator Laboratory
2 shared publications C. Rebbi
1 shared publication
Latest Publications
- Open Access
The removal of critical slowing down
We present promising initial results of our adaptive multigrid solver developed for application directly to the non-Hermitian Wilson-Dirac system in 4 dimensions, as opposed to the solver developed in [1] for the corresponding normal equations. The key behind the success of this algorithm is the use of an adaptive projection onto coarse grids that preserves the near null space of the system matrix. We demonstrate that the resulting algorithm has weak dependence on the gauge coupling and exhibits extremely mild critical slowing down in the chiral limit.
Open AccessThe removal of critical slowing down
We present promising initial results of our adaptive multigrid solver developed for application directly to the non-Hermitian Wilson-Dirac system in 4 dimensions, as opposed to the solver developed in [1] for the corresponding normal equations. The key behind the success of this algorithm is the use of an adaptive projection onto coarse grids that preserves the near null space of the system matrix. We demonstrate that the resulting algorithm has weak dependence on the gauge coupling and exhibits extremely mild critical slowing down in the chiral limit.
- Open Access
Strange quark content of the nucleon
We discuss the calculation of disconnected diagrams needed for determining the strange quark content of the nucleon on the lattice. We present results for the strange scalar form factor and the related parameter f_Ts, which enters into the cross-section for the scattering of dark matter off nuclei in supersymmetric extensions of the standard model. In addition, we present results for the strange contribution to the nucleon's axial and electromagnetic form factors. The calculations were performed with two dynamical flavors of Wilson fermions on a 24^3 x 64 anisotropic lattice with a_s = 3a_t = 0.11 fm and M_pi ~ 400 MeV.
Open AccessStrange quark content of the nucleon
We discuss the calculation of disconnected diagrams needed for determining the strange quark content of the nucleon on the lattice. We present results for the strange scalar form factor and the related parameter f_Ts, which enters into the cross-section for the scattering of dark matter off nuclei in supersymmetric extensions of the standard model. In addition, we present results for the strange contribution to the nucleon's axial and electromagnetic form factors. The calculations were performed with two dynamical flavors of Wilson fermions on a 24^3 x 64 anisotropic lattice with a_s = 3a_t = 0.11 fm and M_pi ~ 400 MeV.
- Open Access
Blasting through lattice calculations using CUDA
Modern graphics hardware is designed for highly parallel numerical tasks and provides significant cost and performance benefits. Graphics hardware vendors are now making available development tools to support general purpose high performance computing. Nvidia's CUDA platform, in particular, offers direct access to graphics hardware through a programming language similar to C. Using the CUDA platform we have implemented a Wilson-Dirac operator which runs at an effective 68 Gflops on the Tesla C870. The recently released GeForce GTX 280 runs this same code at 92 Gflops, and we expect further improvement pending code optimization.
Open AccessBlasting through lattice calculations using CUDA
Modern graphics hardware is designed for highly parallel numerical tasks and provides significant cost and performance benefits. Graphics hardware vendors are now making available development tools to support general purpose high performance computing. Nvidia's CUDA platform, in particular, offers direct access to graphics hardware through a programming language similar to C. Using the CUDA platform we have implemented a Wilson-Dirac operator which runs at an effective 68 Gflops on the Tesla C870. The recently released GeForce GTX 280 runs this same code at 92 Gflops, and we expect further improvement pending code optimization.
- Open Access
Tuning HMC using Poisson brackets
We discuss how the integrators used for the Hybrid Monte Carlo (HMC) algorithm not only approximately conserve some Hamiltonian $H$ but exactly conserve a nearby shadow Hamiltonian (\tilde H), and how the difference $\Delta H \equiv \tilde H - H $ may be expressed as an expansion in Poisson brackets. By measuring average values of these Poisson brackets over the equilibrium distribution $\propto e^{-H}$ generated by HMC we can find the optimal integrator parameters from a single simulation. We show that a good way of doing this in practice is to minimize the variance of $\Delta H$ rather than its magnitude, as has been previously suggested. Some details of how to compute Poisson brackets for gauge and fermion fields, and for nested and force gradient integrators are also presented.Open AccessTuning HMC using Poisson brackets
We discuss how the integrators used for the Hybrid Monte Carlo (HMC) algorithm not only approximately conserve some Hamiltonian $H$ but exactly conserve a nearby shadow Hamiltonian (\tilde H), and how the difference $\Delta H \equiv \tilde H - H $ may be expressed as an expansion in Poisson brackets. By measuring average values of these Poisson brackets over the equilibrium distribution $\propto e^{-H}$ generated by HMC we can find the optimal integrator parameters from a single simulation. We show that a good way of doing this in practice is to minimize the variance of $\Delta H$ rather than its magnitude, as has been previously suggested. Some details of how to compute Poisson brackets for gauge and fermion fields, and for nested and force gradient integrators are also presented. - Open Access
Strange quark contribution to nucleon form factors
We discuss methods for the calculation of disconnected diagrams and their application to various form factors of the nucleon. In particular, we present preliminary results for the strange contribution to the scalar and axial form factors, calculated with N_f=2 dynamical flavors of Wilson fermions on an anisotropic lattice.
Open AccessStrange quark contribution to nucleon form factors
We discuss methods for the calculation of disconnected diagrams and their application to various form factors of the nucleon. In particular, we present preliminary results for the strange contribution to the scalar and axial form factors, calculated with N_f=2 dynamical flavors of Wilson fermions on an anisotropic lattice.
- 29 October 2007
- Published by American Physical Society (APS) in Physical Review D
- Vol. 76 (7) , 074508
Asymptotics of fixed point distributions for inexact Monte Carlo algorithms
We introduce a simple general method for finding the equilibrium distribution for a class of widely used inexact Markov chain Monte Carlo algorithms. The explicit error due to the noncommutativity of the updating operators when numerically integrating Hamilton’s equations can be derived using the Baker-Campbell-Hausdorff formula. This error is manifest in the conservation of a shadow Hamiltonian that lies close to the desired Hamiltonian. The fixed point distribution of inexact hybrid algorithms may then be derived taking into account that the fixed point of the momentum heat bath and that of the molecular dynamics do not coincide exactly. We perform this derivation for various inexact algorithms used for lattice QCD calculations.
- 29 October 2007
- Published by American Physical Society (APS) in Physical Review D
- Vol. 76 (7) , 074508
Asymptotics of fixed point distributions for inexact Monte Carlo algorithms
We introduce a simple general method for finding the equilibrium distribution for a class of widely used inexact Markov chain Monte Carlo algorithms. The explicit error due to the noncommutativity of the updating operators when numerically integrating Hamilton’s equations can be derived using the Baker-Campbell-Hausdorff formula. This error is manifest in the conservation of a shadow Hamiltonian that lies close to the desired Hamiltonian. The fixed point distribution of inexact hybrid algorithms may then be derived taking into account that the fixed point of the momentum heat bath and that of the molecular dynamics do not coincide exactly. We perform this derivation for various inexact algorithms used for lattice QCD calculations.
- Open Access
Speeding up HMC with better integrators
We discuss how dynamical fermion computations may be made yet cheaper by using symplectic integrators that conserve energy much more accurately without decreasing the integration step size. We first explain why symplectic integrators exactly conserve a ``shadow'' Hamiltonian close to the desired one, and how this Hamiltonian may be computed in terms of Poisson brackets. We then discuss how classical mechanics may be implemented on Lie groups and derive the form of the Poisson brackets and force terms for some interesting integrators such as those making use of second derivatives of the action (Hessian or force gradient integrators). We hope that these will be seen to greatly improve energy conservation for only a small additional cost and that their use will significantly reduce the cost of dynamical fermion computations.
Open AccessSpeeding up HMC with better integrators
We discuss how dynamical fermion computations may be made yet cheaper by using symplectic integrators that conserve energy much more accurately without decreasing the integration step size. We first explain why symplectic integrators exactly conserve a ``shadow'' Hamiltonian close to the desired one, and how this Hamiltonian may be computed in terms of Poisson brackets. We then discuss how classical mechanics may be implemented on Lie groups and derive the form of the Poisson brackets and force terms for some interesting integrators such as those making use of second derivatives of the action (Hessian or force gradient integrators). We hope that these will be seen to greatly improve energy conservation for only a small additional cost and that their use will significantly reduce the cost of dynamical fermion computations.
- Open Access
Asymptotics of Fixed Point Distributions for Inexact Monte Carlo Algorithms
We introduce a simple general method for finding the equilibrium distribution for a class of widely used inexact Markov Chain Monte Carlo algorithms. The explicit error due to the non-commutivity of the updating operators when numerically integrating Hamilton's equations can be derived using the Baker-Campbell-Hausdorff formula. This error is manifest in the conservation of a ``shadow'' Hamiltonian that lies close to the desired Hamiltonian. The fixed point distribution of inexact Hybrid algorithms may then be derived taking into account that the fixed point of the momentum heatbath and that of the molecular dynamics do not coincide exactly. We perform this derivation for various inexact algorithms used for lattice QCD calculations.
Open AccessAsymptotics of Fixed Point Distributions for Inexact Monte Carlo Algorithms
We introduce a simple general method for finding the equilibrium distribution for a class of widely used inexact Markov Chain Monte Carlo algorithms. The explicit error due to the non-commutivity of the updating operators when numerically integrating Hamilton's equations can be derived using the Baker-Campbell-Hausdorff formula. This error is manifest in the conservation of a ``shadow'' Hamiltonian that lies close to the desired Hamiltonian. The fixed point distribution of inexact Hybrid algorithms may then be derived taking into account that the fixed point of the momentum heatbath and that of the molecular dynamics do not coincide exactly. We perform this derivation for various inexact algorithms used for lattice QCD calculations.
- Open Access
Accelerating Staggered Fermion Dynamics with the Rational Hybrid Monte Carlo (RHMC) Algorithm
Improved staggered fermion formulations are a popular choice for lattice QCD calculations. Historically, the algorithm used for such calculations has been the inexact R algorithm, which has systematic errors that only vanish as the square of the integration step-size. We describe how the exact Rational Hybrid Monte Carlo (RHMC) algorithm may be used in this context, and show that for parameters corresponding to current state-of-the-art computations it leads to a factor of approximately seven decrease in cost as well as having no step-size errors.
Open AccessAccelerating Staggered Fermion Dynamics with the Rational Hybrid Monte Carlo (RHMC) Algorithm
Improved staggered fermion formulations are a popular choice for lattice QCD calculations. Historically, the algorithm used for such calculations has been the inexact R algorithm, which has systematic errors that only vanish as the square of the integration step-size. We describe how the exact Rational Hybrid Monte Carlo (RHMC) algorithm may be used in this context, and show that for parameters corresponding to current state-of-the-art computations it leads to a factor of approximately seven decrease in cost as well as having no step-size errors.
- 31 January 2007
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 98 (5) , 051601
Accelerating Dynamical-Fermion Computations Using the Rational Hybrid Monte Carlo Algorithm with Multiple Pseudofermion Fields
There has been much recent progress in the understanding and reduction of the computational cost of the hybrid Monte Carlo algorithm for lattice QCD as the quark mass parameter is reduced. In this letter we present a new solution to this problem, where we represent the fermionic determinant using pseudofermion fields, each with an th root kernel. We implement this within the framework of the rational hybrid Monte Carlo algorithm. We compare this algorithm with other recent methods in this area and find it is competitive with them.- 31 January 2007
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 98 (5) , 051601
Accelerating Dynamical-Fermion Computations Using the Rational Hybrid Monte Carlo Algorithm with Multiple Pseudofermion Fields
There has been much recent progress in the understanding and reduction of the computational cost of the hybrid Monte Carlo algorithm for lattice QCD as the quark mass parameter is reduced. In this letter we present a new solution to this problem, where we represent the fermionic determinant using pseudofermion fields, each with an th root kernel. We implement this within the framework of the rational hybrid Monte Carlo algorithm. We compare this algorithm with other recent methods in this area and find it is competitive with them.