Divide and conquer algorithms for the bandsymmetric eigenvalue problem (Q1201941): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Axel Ruhe / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Axel Ruhe / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: EISPACK / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:31, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Divide and conquer algorithms for the bandsymmetric eigenvalue problem |
scientific article |
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
