An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (Q2222486)

From MaRDI portal
Revision as of 20:47, 1 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries
scientific article

    Statements

    An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (English)
    0 references
    0 references
    0 references
    27 January 2021
    0 references
    fast kernel summation
    0 references
    randomized algorithm
    0 references
    matrix approximation
    0 references
    singular value decomposition
    0 references
    \(\mathcal{H}\)-matrix
    0 references
    hierarchical algorithms
    0 references

    Identifiers