Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods (Q3581084): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FFTW / rank | |||
Normal rank | |||
Revision as of 07:14, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods |
scientific article |
Statements
Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods (English)
0 references
16 August 2010
0 references
matrix-vector multiplication
0 references
sparse matrix
0 references
parallel computing
0 references
recursive bipartitioning
0 references
cache-oblivious
0 references
numerical examples
0 references
