libdlr: Efficient imaginary time calculations using the discrete Lehmann representation
Authors:
- Jason KayeJKJason Kaye
- Kun ChenKCKun Chen
- Hugo U.R. StrandHSHugo U.R. Strand
Open Access
- 8 July 2022
- journal article
- research article
- Published by Elsevier in Computer Physics Communications
- Vol. 280
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Engineering Research Centers
- European Research Council (854843-FASTCORR)
This publication has 24 references indexed in Scilit:
- Orthogonal polynomial representation of imaginary-time Green’s functionsPhysical Review B, 2011
- Continuous-time Monte Carlo methods for quantum impurity modelsReviews of Modern Physics, 2011
- Time propagation of the Kadanoff–Baym equations for inhomogeneous systemsThe Journal of Chemical Physics, 2009
- Randomized algorithms for the low-rank approximation of matricesProceedings of the National Academy of Sciences, 2007
- Self-consistent solution of the Dyson equation for atoms and molecules within a conserving approximationThe Journal of Chemical Physics, 2005
- On the Compression of Low Rank MatricesSIAM Journal on Scientific Computing, 2005
- Bayesian inference and the analytic continuation of imaginary-time quantum Monte Carlo dataPhysics Reports, 1996
- Dynamical mean-field theory of strongly correlated fermion systems and the limit of infinite dimensionsReviews of Modern Physics, 1996
- Gapless spin-fluid ground state in a random quantum Heisenberg magnetPhysical Review Letters, 1993
- New Method for Calculating the One-Particle Green's Function with Application to the Electron-Gas ProblemPhysical Review B, 1965