libdlr: efficient imaginary time calculations using the discrete Lehmann representation
DOI10.1016/j.cpc.2022.108458zbMath1522.81786arXiv2110.06765OpenAlexW3207664862WikidataQ114192626 ScholiaQ114192626MaRDI QIDQ6043056
Hugo U. R. Strand, Jason Kaye, Kun Chen
Publication date: 4 May 2023
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.06765
Structure and classification for modules, bimodules and ideals (except as in 16Gxx), direct sum decomposition and cancellation in associative algebras) (16D70) Many-body theory; quantum Hall effect (81V70) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Interpolation, preservation, definability (03C40) Green's functions for elliptic equations (35J08)
Related Items
Cites Work
- irbasis: open-source database and software for intermediate-representation basis functions of imaginary-time Green's function
- Randomized algorithms for the low-rank approximation of matrices
- Cutting rules and positivity in finite temperature many-body theory
- On the Compression of Low Rank Matrices
- \textbf{NESSi}: The \textbf{N}on-\textbf{E}quilibrium \textbf{S}ystems \textbf{Si}mulation package