Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem (Q4908665)
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: Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem |
scientific article; zbMATH DE number 6142135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Toward a high performance tile divide and conquer algorithm for the dense symmetric eigenvalue problem |
scientific article; zbMATH DE number 6142135 |
Statements
Toward a High Performance Tile Divide and Conquer Algorithm for the Dense Symmetric Eigenvalue Problem (English)
0 references
6 March 2013
0 references
divide and conquer
0 references
symmetric eigenvalue solver
0 references
tile algorithms
0 references
dynamic scheduling
0 references
numerical examples
0 references
algorithm
0 references
performance
0 references
0.7888032793998718
0 references
0.7831506729125977
0 references
