A note on generating finer‐grain parallelism in a representation tree (Q4924936): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
Property / describes a project that uses | |||
Property / describes a project that uses: Algorithm 880 / rank | |||
Normal rank |
Revision as of 01:31, 29 February 2024
scientific article; zbMATH DE number 6172691
Language | Label | Description | Also known as |
---|---|---|---|
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