sparse-ir: Optimal compression and sparse sampling of many-body propagators

37Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce sparse-ir, a collection of libraries to efficiently handle imaginary-time propagators, a central object in finite-temperature quantum many-body calculations. We leverage two concepts: firstly, the intermediate representation (IR), an optimal compression of the propagator with robust a priori error estimates, and secondly, sparse sampling, near-optimal grids in imaginary time and imaginary frequency from which the propagator can be reconstructed and on which diagrammatic equations can be solved. IR and sparse sampling are packaged into stand-alone, easy-to-use Python, Julia and Fortran libraries, which can readily be included into existing software. We also include an extensive set of sample codes showcasing the library for typical many-body and ab initio methods.

Cite

CITATION STYLE

APA

Wallerberger, M., Badr, S., Hoshino, S., Huber, S., Kakizawa, F., Koretsune, T., … Shinaoka, H. (2023). sparse-ir: Optimal compression and sparse sampling of many-body propagators. SoftwareX, 21. https://doi.org/10.1016/j.softx.2022.101266

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free