Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/0004279 · Springer proceedings in physics

The Dynamical Cluster Approximation: A New Technique for Simulations of Strongly Correlated Electron Systems

S. Moukouri, Carey Huscroft, Mark Jarrell

Published Jan 1, 2001• 0 citations
arXivHTMLPDF
DOI
10.1007/978-3-642-56577-9_6

Related papers

Extended Correlation in Strongly Correlated Systems, Beyond Dynamical Cluster Approximation

Herbert F. Fotso, Shuxiang Yang, Hartmut Hafermann +4 more

Bulletin of the American Physical Society•Feb 27, 2012•1 citation

Dynamical Mean-Field Approximation and Cluster Methods for Correlated Electron Systems

Thomas Pruschke

Springer eBooks•Dec 8, 2007•2 citations

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

Urs R. Hähner, Gonzalo Álvarez, Thomas Maier +4 more

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-Tc 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. Program Title: DCA++ Program Files doi: http://dx.doi.org/10.17632/482jm5cv77.1 Licensing provisions: BSD-3-Clause Programming language: C++14 and CUDA Nature of problem: Understanding the fascinating physics of strongly correlated electron systems requires the development of sophisticated algorithms and their implementation on leadership computing systems. Solution method: The DCA++ code provides a highly scalable and efficient implementation of the dynamical cluster approximation (DCA) and its DCA+ extension.

arXiv:1901.01047•Computer Physics Communications•Jan 17, 2019•36 citations

Comment on “Cluster methods for strongly correlated electron systems”

Karan Aryanpour, Thomas Maier, Mark Jarrell

We comment on the article by Biroli and Kotliar [Phys. Rev. B 65, 155112 (2002)] in which they make a comparison between two cluster techniques, the cellular dynamical mean field theory (CDMFT) and the dynamical cluster approximation (DCA). Based upon an incorrect implementation of the DCA technique in their work, they conclude that the CDMFT is a faster converging technique than the DCA. We present the correct DCA prescription for the particular model Hamiltonian studied in their article and conclude that the DCA, once implemented correctly, is a faster converging technique for the quantities averaged over the cluster.

arXiv:cond-mat/0301460•Physical Review B•Jan 7, 2005•22 citations

Conserving Approximations for Strongly Correlated Electron Systems: Bethe-Salpeter Equation and Dynamics for the Two-Dimensional Hubbard Model

N. E. Bickers, Douglas J. Scalapino, Steven R. White

In this Letter we describe a new technique for investigating phase transitions and dynamics in interacting electron systems. This technique is based on the derivation and self-consistent solution of infinite-order conserving approximations. It provides a new approach to the study of two-particle correlations with strong frequency and momentum dependence. We use this technique to derive a low-temperature phase diagram and dynamic correlation functions for the two-dimensional Hubbard model.

Physical Review Letters•Feb 20, 1989•907 citations

APPROXIMATION TECHNIQUES IN STRONGLY CORRELATED ELECTRON SYSTEMS

Karan Aryanpour

•Jan 1, 2003•0 citations
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-Tc 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. Program Title: DCA++ Program Files doi: http://dx.doi.org/10.17632/482jm5cv77.1 Licensing provisions: BSD-3-Clause Programming language: C++14 and CUDA Nature of problem: Understanding the fascinating physics of strongly correlated electron systems requires the development of sophisticated algorithms and their implementation on leadership computing systems. Solution method: The DCA++ code provides a highly scalable and efficient implementation of the dynamical cluster approximation (DCA) and its DCA+ extension.
We comment on the article by Biroli and Kotliar [Phys. Rev. B 65, 155112 (2002)] in which they make a comparison between two cluster techniques, the cellular dynamical mean field theory (CDMFT) and the dynamical cluster approximation (DCA). Based upon an incorrect implementation of the DCA technique in their work, they conclude that the CDMFT is a faster converging technique than the DCA. We present the correct DCA prescription for the particular model Hamiltonian studied in their article and conclude that the DCA, once implemented correctly, is a faster converging technique for the quantities averaged over the cluster.