An \(O(N \log N)\) hierarchical random compression method for kernel matrices by sampling partial matrix entries (Q2222486): Difference between revisions
From MaRDI portal
Latest revision as of 10:10, 24 July 2024
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
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
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references