Divide and conquer algorithms for the bandsymmetric eigenvalue problem (Q1201941)
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: Divide and conquer algorithms for the bandsymmetric eigenvalue problem |
scientific article; zbMATH DE number 98849
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Divide and conquer algorithms for the bandsymmetric eigenvalue problem |
scientific article; zbMATH DE number 98849 |
Statements
Divide and conquer algorithms for the bandsymmetric eigenvalue problem (English)
0 references
17 January 1993
0 references
A block version of the divide and conquer algorithm of \textit{J. J. M. Cuppen} [Numer. Math. 36, 177-195 (1981; Zbl 0431.65022)] for the symmetric eigenvalue problem is derived. Tests on a shared memory computer are reported, where the new algorithm is compared to the bandwidth reduction and full matrix algorithms of EISPACK.
0 references
comparison of algorithms
0 references
divide and conquer algorithm
0 references
symmetric eigenvalue problem
0 references
shared memory computer
0 references
bandwidth reduction
0 references
EISPACK
0 references
0.8262372016906738
0 references
0.8262372016906738
0 references
