Papers
Topics
Authors
Recent
Search
2000 character limit reached

The {\it victory} project v1.0: an efficient parquet equations solver

Published 24 Aug 2017 in cond-mat.str-el | (1708.07457v1)

Abstract: {\it Victory}, i.e. \underline{vi}enna \underline{c}omputational \underline{to}ol deposito\underline{ry}, is a collection of numerical tools for solving the parquet equations for the Hubbard model and similar many body problems. The parquet formalism is a self-consistent theory at both the single- and two-particle levels, and can thus describe individual fermions as well as their collective behavior on equal footing. This is essential for the understanding of various emergent phases and their transitions in many-body systems, in particular for cases in which a single-particle description fails. Our implementation of {\it victory} is in modern Fortran and it fully respects the structure of various vertex functions in both momentum and Matsubara frequency space. We found the latter to be crucial for the convergence of the parquet equations, as well as for the correct determination of various physical observables. In this release, we thoroughly explain the program structure and the controlled approximations to efficiently solve the parquet equations, i.e. the two-level kernel approximation and the high-frequency regulation.

Citations (38)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.