Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems (Q1310587)
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: Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems |
scientific article; zbMATH DE number 482219
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems |
scientific article; zbMATH DE number 482219 |
Statements
Applying parallel computer systems to solve symmetric tridiagonal eigenvalue problems (English)
0 references
6 January 1994
0 references
An algorithm for the symmetric eigenvalue problem is given. It uses the advantages of the segmentation and the cyclic reduction methods. The proposed algorithm has a linear speed-up. Experimental results are given. These results are shown to achieve the expected performance. The relative efficiency of the proposed algorithm over the currently available algorithms is also discussed.
0 references
numerical examples
0 references
parallel computation
0 references
symmetric eigenvalue problem
0 references
segmentation
0 references
cyclic reduction methods
0 references
algorithm
0 references
performance
0 references
efficiency
0 references
0.95195365
0 references
0.94104636
0 references
0.9395411
0 references
0.9346786
0 references
