A fully parallel condensation method for generalized eigenvalue problems on distributed memory computers
β Scribed by Kai Rothe; Heinrich Voss
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 882 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, a fully parallel method for finding some or all finite eigenvalues of a real symmetric matrix pencil (A, B) is presented, where A is a symmetric tridiagonal matrix and B is a diagonal matrix with bl > 0 and bi :> 0, i = 2,3,...,n. The method is based on the homotopy continuation with
This paper describes the parallel implementation of a numerical model for the simulation of problems from fluid dynamics on distributed memory multiprocessors. The basic procedure is to apply a fully explicit upwind finite difference approximation on a staggered grid. A theoretical time complexity a
The Sakurai-Sugiura projection method, which solves generalized eigenvalue problems to find certain eigenvalues in a given domain, was reformulated by using the resolvent theory. A new interpretation based on filter diagonalization was given, and the corresponding filter function was derived explici