A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices (Q1201942): 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: Plamen Yordanov Yalamov / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Plamen Yordanov Yalamov / 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 03:31, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices |
scientific article |
Statements
A parallel algorithm for determining all eigenvalues of large real symmetric tridiagonal matrices (English)
0 references
17 January 1993
0 references
A method for determining all eigenvalues of large real symmetric tridiagonal matrices on multiprocessor systems with vector facilities is presented. The method is based on the Sturm sequence and uses bisection for isolating and extracting the eigenvalues. For the extraction bisection is accelerated by a superlinear convergent zero finder, the Pegasus method. Some new ideas are presented for weighting the values of the characteristic polynomial to avoid under- and overflow. The experiments are realized on SUPRENUM (with 16 processors) and CRAY Y- MP8/832 (with 8 processors).
0 references
superlinear convergence
0 references
eigenvalues
0 references
large real symmetric tridiagonal matrices
0 references
multiprocessor systems
0 references
Sturm sequence
0 references
bisection
0 references
Pegasus method
0 references
