A note on generating finer‐grain parallelism in a representation tree (Q4924936)
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 note on generating finer‐grain parallelism in a representation tree |
scientific article; zbMATH DE number 6172691
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on generating finer‐grain parallelism in a representation tree |
scientific article; zbMATH DE number 6172691 |
Statements
A note on generating finer‐grain parallelism in a representation tree (English)
0 references
10 June 2013
0 references
multiple relatively robust representations
0 references
complexity
0 references
GPU
0 references
multicore
0 references
representation tree
0 references
spectrum peeling
0 references
LAPACK
0 references
algorithm
0 references
orthogonal eigenvectors
0 references
symmetric tridiagonal matrix
0 references
eigenvalue clusters
0 references
parallelism
0 references
graphics processing unit
0 references
0 references
0 references
0 references
0.86641216
0 references
0.8627928
0 references
0.8517541
0 references
0.8452803
0 references
