Discrete Lehmann representation of imaginary time Green's functions

by   Jason Kaye, et al.

We present an efficient basis for imaginary time Green's functions based on a low rank decomposition of the spectral Lehmann representation. The basis functions are simply a set of well-chosen exponentials, so the corresponding expansion may be thought of as a discrete form of the Lehmann representation using an effective spectral density which is a sum of δ functions. The basis is determined only by an upper bound on the product βω_max, with β the inverse temperature and ω_max an energy cutoff, and a user-defined error tolerance ϵ. The number r of basis functions scales as 𝒪(log(βω_max) log (1/ϵ)). The discrete Lehmann representation of a particular imaginary time Green's function can be recovered by interpolation at a set of r imaginary time nodes. Both the basis functions and the interpolation nodes can be obtained rapidly using standard numerical linear algebra routines. Due to the simple form of the basis, the discrete Lehmann representation of a Green's function can be explicitly transformed to the Matsubara frequency domain, or obtained directly by interpolation on a Matsubara frequency grid. We benchmark the efficiency of the representation on simple cases, and with a high precision solution of the Sachdev-Ye-Kitaev equation at low temperature. We compare our approach with the related intermediate representation method, and introduce an improved algorithm to build the intermediate representation basis and a corresponding sampling grid.


page 1

page 2

page 3

page 4


libdlr: Efficient imaginary time calculations using the discrete Lehmann representation

We introduce libdlr, a library implementing the recently introduced disc...

On the numerical rank of radial basis function kernels in high dimension

Low-rank approximations are popular methods to reduce the high computati...

Decomposing imaginary time Feynman diagrams using separable basis functions: Anderson impurity model strong coupling expansion

We present a deterministic algorithm for the efficient evaluation of ima...

A nearly optimal explicitly-sparse representation for oscillatory kernels with curvelet-like functions

A nearly optimal explicitly-sparse representation for oscillatory kernel...

irbasis: Open-source database and software for intermediate-representation basis functions of imaginary-time Green's function

The open-source library, irbasis, provides easy-to-use tools for two set...

Efficient representation of head-related transfer functions in continuous space-frequency domains

Utilizing spherical harmonic (SH) domain has been established as the def...

On the stability of unevenly spaced samples for interpolation and quadrature

Unevenly spaced samples from a periodic function are common in signal pr...

Please sign up or login with your details

Forgot password? Click here to reset