A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix (Q3225537)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix |
scientific article; zbMATH DE number 6016687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast randomized algorithm for computing a hierarchically semiseparable representation of a matrix |
scientific article; zbMATH DE number 6016687 |
Statements
A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix (English)
0 references
21 March 2012
0 references
data-sparse matrix
0 references
randomized algorithm
0 references
matrix factorization
0 references
hierarchically semiseparable matrix
0 references
direct solver
0 references
numerical examples
0 references
matrix inversion
0 references
matrix-vector multiplications
0 references
fast multipole method
0 references
0.9029293060302734
0 references
0.8809033036231995
0 references
0.8456805944442749
0 references
0.8456804156303406
0 references
