Using parallel banded linear system solvers in generalized eigenvalue problems
- National Aeronautics and Space Administration Langley Research Cent, Hampton, VA (United States)
Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented. 29 refs.
- Research Organization:
- NASA Langley Research Center, Hampton, VA (United States)
- OSTI ID:
- 101945
- Journal Information:
- Parallel Computing, Vol. 20, Issue 8; Other Information: PBD: Aug 1994
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance modeling of parallel algorithms for solving neutron diffusion problems
Parallel solution of the symmetric tridiagonal eigenproblem