Randomized algorithms for low-rank matrix factorizations: sharp performance bounds (Q2345951)

From MaRDI portal
Revision as of 03:33, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
scientific article

    Statements

    Randomized algorithms for low-rank matrix factorizations: sharp performance bounds (English)
    0 references
    0 references
    0 references
    0 references
    21 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    randomized linear algebra
    0 references
    dimension reduction
    0 references
    pass efficient algorithm
    0 references
    matrix approximation
    0 references
    random matrix
    0 references
    0 references
    0 references
    0 references