Related papers: Continuous momentum dependence in the dynamical cl…
We employ the Dynamical Cluster Approximation (DCA) in conjunction with the Fluctuation Exchange Approximation (FLEX) to study the Hubbard model. The DCA is a technique to systematically restore the momentum conservation at the internal…
The coherent potential approximation, CPA, is a useful tool to treat systems with disorder. Cluster theories have been proposed to go beyond the translation invariant single-site CPA approximation and include some short range correlations.…
The Boosted Difference of Convex functions Algorithm (BDCA) has been recently introduced to accelerate the performance of the classical Difference of Convex functions Algorithm (DCA). This acceleration is achieved thanks to an extrapolation…
Recent years have seen the development of two types of non-local extensions to the single-site dynamical mean field theory. On one hand, cluster approximations, such as the dynamical cluster approximation, recover short-range…
The difference-of-convex algorithm (DCA) is a well-established nonlinear programming technique that solves successive convex optimization problems. These sub-problems are obtained from the difference-of-convex~(DC) decompositions of the…
We investigate the cluster size convergence of the energy and observables using two forms of density matrix embedding theory (DMET): the original cluster form (CDMET) and a new formulation motivated by the dynamical cluster approximation…
The Difference of Convex functions Algorithm (DCA) is widely used for minimizing the difference of two convex functions. A recently proposed accelerated version, termed BDCA for Boosted DC Algorithm, incorporates a line search step to…
The Dynamical Cluster Approximation (DCA) is used to study non-local corrections to the dynamical mean field phase diagram of the two-dimensional Hubbard model. Regions of antiferromagnetic, d-wave superconducting, pseudo-gapped non-Fermi…
A self-energy-functional approach is applied to construct cluster approximations for correlated lattice models. It turns out that the cluster-perturbation theory (Senechal et al, PRL 84, 522 (2000)) and the cellular dynamical mean-field…
Proposals for superconductivity emerging from correlated electrons in the doped Hubbard model on the honeycomb lattice range from chiral $d+id$ singlet to $p+ip$ triplet pairing, depending on the considered range of doping and interaction…
The superconducting instabilities of the doped repulsive 2D Hubbard model are studied in the intermediate to strong coupling regime with help of the Dynamical Cluster Approximation (DCA). To solve the effective cluster problem we employ an…
We extend the single-site coherent potential approximation (CPA) to include the effects of non-local disorder correlations (alloy short-range order) on the electronic structure of random alloy systems. This is achieved by mapping the…
We study the continuous-time structure of the difference-of-convex algorithm (DCA) for smooth DC decompositions with a strongly convex component. In dual coordinates, classical DCA is exactly the full-step explicit Euler discretization of a…
We present a combination of local density approximation (LDA) with the dynamical cluster approximation (LDA+DCA) in the framework of the full-potential linear augmented plane-wave method, and compare our LDA+DCA results for SrVO$_3$ to LDA…
We introduce an extension of the dynamical mean field approximation (DMFA) which retains the causal properties and generality of the DMFA, but allows for systematic inclusion of non-local corrections. Our technique maps the problem to a…
The typical medium dynamical cluster approximation (TMDCA) is reformulated in the language of multiple scattering theory to make possible first principles calculations of the electronic structure of substitutionally disordered alloys…
The variational cluster approach (VCA) is applied to the one-dimensional Hubbard model at zero temperature using clusters (chains) of up to ten sites with full diagonalization and the Lanczos method as cluster solver. Within the framework…
The difference-of-convex algorithm (DCA) and its variants are the most popular methods to solve the difference-of-convex optimization problem. Each iteration of them is reduced to a convex optimization problem, which generally needs to be…
Using the variational cluster approach (VCA), we study the transition from the antiferromagnetic to the superconducting phase of the two-dimensional Hubbard model at zero temperature. Our calculations are based on a new method to evaluate…
This paper aims to investigate the effectiveness of the recently proposed Boosted Difference of Convex functions Algorithm (BDCA) when applied to clustering with constraints and set clustering with constraints problems. This is the first…