Michael A. Clark

Michael A. Clark

Auto-generated profile, based on publicly available information

Michael A. Clark

Center for Computational Science Boston University 3 Cummington Street 02215 Boston MA USA

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 January 2007 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
MCM. A. Clark
M. A. Clark
AKA. D. Kennedy
A. D. Kennedy
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 n pseudofermion fields, each with an nth 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.

24 January 2007 in Physical Review D
Verified
Journal Article
Closed access
PDF file
MCM. A. Clark
M. A. Clark
AKA. D. Kennedy
A. D. Kennedy
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.

29 October 2007 in Physical Review D
Verified
Journal Article
Closed access
PDF file
MCM. A. Clark
M. A. Clark
AKA. D. Kennedy
A. D. Kennedy
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.

22 August 2006 in arXiv
Verified
Preprint
Open access
PDF file
MCM. A. Clark
M. A. Clark
AKA. D. Kennedy
A. D. Kennedy
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 (n) pseudofermion fields, each with an (\nth) root kernel. We implement this within the framework of the Rational Hybrid Monte Carlo (RHMC) algorithm. We compare this algorithm with other recent methods in this area and find it is competitive with them.

19 October 2007 in arXiv
Verified
Preprint
Open access
PDF file
MCM. A. Clark
M. A. Clark
AKA. D. Kennedy
A. D. Kennedy
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.

1 April 2010 in arXiv
Verified
Preprint
Open access
PDF file
MCM. A. Clark
M. A. Clark
JBJ. Brannick
J. Brannick
RBR. C. Brower
R. C. Brower
SMS. F. McCormick
S. F. McCormick
TMT. A. Manteuffel
T. A. Manteuffel
CRC. Rebbi
C. Rebbi
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.