Solving the symmetric tridiagonal eigenvalue problem on the hypercube
Journal Article
·
· SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (USA)
- Dept. of Computer Science, Yale Univ., New Haven, CT (US)
This paper describes implementations of Cuppen's method, bisection, and multisection for the computation of all eigenvalues and eigenvectors of a real symmetric tridiagonal matrix on a distributed-memory hypercube multiprocessor. Numerical results and timings for Intel's iPSC-1 are presented. Cuppen's method is found to be the numerically most accurate of three methods, while bisection with inverse iteration is observed experimentally to be the fastest method.
- OSTI ID:
- 6502729
- Journal Information:
- SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (USA), Journal Name: SIAM Journal on Scientific and Statistical Computing (Society for Industrial and Applied Mathematics); (USA) Vol. 11:2; ISSN 0196-5204; ISSN SIJCD
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel solution of the symmetric tridiagonal eigenproblem. Research report
Parallel solution of the symmetric tridiagonal eigenproblem
Multiprocessor algorithm for the symmetric tridiagonal eigenvalue problem
Technical Report
·
Sun Oct 01 00:00:00 EDT 1989
·
OSTI ID:7230838
Parallel solution of the symmetric tridiagonal eigenproblem
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6155839
Multiprocessor algorithm for the symmetric tridiagonal eigenvalue problem
Technical Report
·
Tue Jan 07 23:00:00 EST 1986
·
OSTI ID:7008081