Engineering Papers⌕ Search

Engineering topics

Summers, Michael Stuart

Publications and source records attributed to Summers, Michael Stuart.

DCA++: A software framework to solve correlated electron problems with modern quantum cluster methods

We present the first open release of the DCA++ project, a high-performance research software framework to solve quantum many-body problems with cutting edge quantum cluster algorithms. DCA++ implements the dynamical cluster approximation (DCA) and its DCA extension with a continuous self-energy. The algorithms capture nonlocal correlations in strongly correlated electron systems, thereby giving insight into high-$T_c$ superconductivity. The code’s scalability allows efficient usage of systems at all scales, from workstations to leadership computers. With regard to the increasing heterogeneity of modern computing machines, DCA++ provides portable performance on conventional and emerging new architectures, such as hybrid CPU–GPU, sustaining multiple petaflops on ORNL’s Titan and CSCS’ Piz Daint supercomputers. Moreover, we show how sustainable and scalable development of the code base has been achieved by adopting standard techniques of the software industry. These include employing a distributed version control system, applying test-driven development and following continuous integration.

97 MATHEMATICS AND COMPUTING↗

Fast and Efficient Stochastic Optimization for Analytic Continuation

In this analytic continuation of imaginary-time quantum Monte Carlo data to extract real-frequency spectra remains a key problem in connecting theory with experiment. Here we present a fast and efficient stochastic optimization method (FESOM) as a more accessible variant of the stochastic optimization method introduced by Mishchenko et al. [Phys. Rev. B 62, 6317 (2000)], and we benchmark the resulting spectra with those obtained by the standard maximum entropy method for three representative test cases, including data taken from studies of the two-dimensional Hubbard model. Genearally, we find that our FESOM approach yields spectra similar to the maximum entropy results. In particular, while the maximum entropy method yields superior results when the quality of the data is strong, we find that FESOM is able to resolve fine structure with more detail when the quality of the data is poor. In addition, because of its stochastic nature, the method provides detailed information on the frequency-dependent uncertainty of the resulting spectra, while the maximum entropy method does so only for the spectral weight integrated over a finite frequency region. Therefore, we believe that this variant of the stochastic optimization approach provides a viable alternative to the routinely used maximum entropy method, especially for data of poor quality.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Charge Excitations in Two-Leg Ladders: A tDMRG Approach

Abstract We study the dynamics of holon doublon pairs in two-leg Hubbard ladders with the time-dependent Density Matrix Renormalization-Group approach. Benchmark results show that the Krylov algorithm is well suited to calculate the time dependence of observables in these systems. Furthermore, we show that the dynamics of the holon doublon depend strongly on the coupling asymmetry within the ladder, indicating that the ladder geometry plays a role in the decay of these elementary charge excitations.

Dias da Silva, Luis↗

Dynamic Cluster Quantum Monte Carlo Simulations of a Two-Dimensional Hubbard Model with Stripelike Charge-Density-Wave Modulations: Interplay between Inhomogeneities and the Superconducting State

Using dynamic cluster quantum Monte Carlo simulations, we study the superconducting behavior of a 1=8 doped two-dimensional Hubbard model with imposed unidirectional stripelike charge-density-wave modulation. We find a significant increase of the pairing correlations and critical temperature relative to the homogeneous system when the modulation length scale is sufficiently large. With a separable form of the irreducible particle-particle vertex, we show that optimized superconductivity is obtained for a moderate modulation strength due to a delicate balance between the modulation enhanced pairing interaction, and a concomitant suppression of the bare particle-particle excitations by a modulation reduction of the quasiparticle weight.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Fast update algorithm for the quantum Monte Carlo simulation of the Hubbard model

This paper presents an efficient algorithm for computing the transition probability in auxiliary field quantum Monte Carlo simulations of strongly correlated electron systems using a Hubbard model. This algorithm is based on a low rank updating of the underlying linear algebra problem, and results in significant computational savings. The computational complexity of computing the transition probability and Green s function update reduces to O(k2) during the kth step, where k is the number of accepted spin flips, and results in an algorithm that is faster than the competing delayed update algorithm. Moreover, this algorithm is orders of magnitude faster than traditional algorithms that use naive updating of the Green s function matrix.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DCA++: A case for science driven application development for leadership computing platforms

Abstract. The DCA++ code was one of the early science applications that ran on jaguar at the National Center for Computational Sciences, and the rst application code to sustain a peta op/s under production conditions on a general-purpose supercomputer. The code implements a quantum cluster method with a Quantum Monte Carlo kernel to solve the 2D Hubbard model for high-temperature superconductivity. It is implemented in C++, making heavy use of the generic programming model. In this paper, we discuss how this code was developed, reaching scalability and high ef ciency on the world s fastest supercomputer in only a few years. We show how the use of generic concepts combined with systematic refactoring of codes is a better strategy for computational sciences than a comprehensive upfront design.

99 GENERAL AND MISCELLANEOUS↗