libdlr: efficient imaginary time calculations using the discrete Lehmann representation (Q6043056): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cpc.2022.108458 / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q114192626 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3207664862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: irbasis: open-source database and software for intermediate-representation basis functions of imaginary-time Green's function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compression of Low Rank Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for the low-rank approximation of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting rules and positivity in finite temperature many-body theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textbf{NESSi}: The \textbf{N}on-\textbf{E}quilibrium \textbf{S}ystems \textbf{Si}mulation package / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.CPC.2022.108458 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:55, 30 December 2024

scientific article; zbMATH DE number 7682139
Language Label Description Also known as
English
libdlr: efficient imaginary time calculations using the discrete Lehmann representation
scientific article; zbMATH DE number 7682139

    Statements

    libdlr: efficient imaginary time calculations using the discrete Lehmann representation (English)
    0 references
    0 references
    0 references
    0 references
    4 May 2023
    0 references
    many-body quantum physics
    0 references
    imaginary time Green's functions
    0 references
    low rank compression
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references