Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification (Q5038410): Difference between revisions

From MaRDI portal
← Older edit
ReferenceBot (talk | contribs)
Bots
1,903,984 edits
‎Changed an Item
Set OpenAlex properties.
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W3212944728 / rank
 
Normal rank

Latest revision as of 09:45, 30 July 2024

scientific article; zbMATH DE number 7595097
Language Label Description Also known as
English
Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification
scientific article; zbMATH DE number 7595097

    Statements

    title
    Approximating Matrix Eigenvalues by Subspace Iteration with Repeated Random Sparsification (English)
    0 references
    author
    Samuel M. Greene
    0 references
    Robert J. Webber
    0 references
    Timothy C. Berkelbach
    0 references
    Jonathan Weare
    0 references
    publication date
    30 September 2022
    0 references
    zbMATH Keywords
    eigenvalues
    0 references
    subspace iteration
    0 references
    randomized algorithms
    0 references
    Monte Carlo method
    0 references
    describes a project that uses
    GitHub
    0 references
    PySCF
    0 references
    JDQZ
    0 references
    emcee
    0 references
    cites work
    Q5090373
    0 references
    Q4595047
    0 references
    Q4348515
    0 references
    Q4185363
    0 references
    Q4378387
    0 references
    Q4220521
    0 references
    Matrix Algorithms
    0 references

    Identifiers

    DOI
    10.1137/21M1422513
    0 references
    Mathematics Subject Classification ID
    65F15
    0 references
    68W20
    0 references
    65C05
    0 references
    zbMATH DE Number
    7595097
    0 references
    arXiv ID
    2103.12109
    0 references
    OpenAlex ID
    W3212944728
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5038410&oldid=37142761"
    Powered by MediaWiki