2019
DOI: 10.1016/j.cpc.2019.03.008
|View full text |Cite
|
Sign up to set email alerts
|

The victory project v1.0: An efficient parquet equations solver

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
43
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 37 publications
(43 citation statements)
references
References 24 publications
0
43
0
Order By: Relevance
“…This is also in sharp contrast to any ladder approximation where only a set of a priori chosen ladder diagrams are considered in favor of only certain type of fluctuations. More details about the parquet approach can be found in references [40][41][42][43][44][45][46][47][48][49][50][51] . Here we would like to concentrate on the extension of it to the EHM.…”
Section: Method: Parquet Approximation To the Ehmmentioning
confidence: 99%
See 1 more Smart Citation
“…This is also in sharp contrast to any ladder approximation where only a set of a priori chosen ladder diagrams are considered in favor of only certain type of fluctuations. More details about the parquet approach can be found in references [40][41][42][43][44][45][46][47][48][49][50][51] . Here we would like to concentrate on the extension of it to the EHM.…”
Section: Method: Parquet Approximation To the Ehmmentioning
confidence: 99%
“…The precise transition boundary is not of the prime interest of this work, instead we want to show how the transition is approached and how it is probed in the parquet approach, which is also of interest to many other cluster methods that have the access to the two-particle vertex functions. This work also represents a methodological progress which further extends the victory solver of the parquet equations [40][41][42] to include the non-local Coulomb interactions in a lattice model.…”
Section: Introductionmentioning
confidence: 99%
“…The traditional formulation of diagrammatic theories based on two-particle quantities poses however significant challenges. One of them is the immense algorithmic complexity of the parquet equations [13], which re-stricts direct numerical applications to impurity models [9,10,12,14] and small clusters [15][16][17][18][19][20]. Furthermore, the perturbation theory based on the two-particle self-energy has revealed fundamental problems which have received much attention in the context of nonperturbative approaches, such as the dynamical meanfield theory (DMFT) [3].…”
Section: Introductionmentioning
confidence: 99%
“…A state-of-the-art implementation is available in the recent victory release. 41 This package is an efficient parquet solver for electron systems in one or two dimensions, which properly takes the high-frequency asymptotics into account via so-called kernel functions. 32,53 While the parquet equations are an exact set of equations, they require the fully irreducible two-particle vertex Λ as an input.…”
Section: Method: Extending Victory To Treat Non-local Interactionsmentioning
confidence: 99%
“…These terms are actually evaluated as a difference and in imaginary time, see Ref. 41. A similar regularization (extension to high frequencies) is employed for the Dyson-Schwinger equation (2).…”
Section: Method: Extending Victory To Treat Non-local Interactionsmentioning
confidence: 99%