Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations (Q3440463)
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: Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations |
scientific article; zbMATH DE number 5155953
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations |
scientific article; zbMATH DE number 5155953 |
Statements
Performance comparison of data-reordering algorithms for sparse matrix–vector multiplication in edge-based unstructured grid computations (English)
0 references
22 May 2007
0 references
data reordering
0 references
unstructured grids
0 references
edge-based finite elements
0 references
cache-based machines
0 references
0.8008586168289185
0 references
0.7564293146133423
0 references
0.7463712692260742
0 references
0.7407179474830627
0 references
