In this paper we present a parallel method for finding several eigen-values and eigenvectors of a generalized eigenvalue problem Ax = λBx, where A and B are large sparse matrices. A moment-based method by which to find all of the eigenvalues that lie inside a given domain is used. In this method, a small matrix pencil that has only the desired eigenvalues is derived by solving large sparse systems of linear equations constructed from A and B. Since these equations can be solved independently, we solve them on remote hosts in parallel. This approach is suitable for master-worker programming models. We have implemented and tested the proposed method in a grid environment using a grid RPC (remote procedure call) system called OmniRPC. The performance of the method on PC clusters that were used over a wide-area network was evaluated. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Sakurai, T., Hayakawa, K., Sato, M., & Takahashi, D. (2006). A parallel method for large sparse generalized Eigenvalue problems by OmniRPC in a grid environment. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3732 LNCS, pp. 1151–1158). https://doi.org/10.1007/11558958_138
Mendeley helps you to discover research relevant for your work.