An asynchronous algorithm on the NetSolve global computing system
Future Generation Computer Systems
Resolution of large symmetric eigenproblems on a world-wide grid
International Journal of Grid and Utility Computing
Workflow Global Computing with YML
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
An asynchronous algorithm on the NetSolve global computing system
Future Generation Computer Systems
SIAM Journal on Scientific Computing
Eigenvalue computation with netsolve global computing system
LSSC'05 Proceedings of the 5th international conference on Large-Scale Scientific Computing
| Hi-index | 0.00 |
In this paper we propose a new approach for calculating some eigenpairs of large sparse non-Hermitian matrices. This method, called Multiple Explicitly Restarted Arnoldi (MERAM), is particularly well suited for environments that combine different parallel programming paradigms. This technique is based on a multiple use of the Explicitly Restarted Arnoldi method (ERAM) and improves its convergence.This technique is implemented and tested on a distributed environment consisting of two interconnected parallel machines. The MERAM technique is compared with ERAM, and one can notice that the convergence is improved. In some cases, more than a twofold improvement can be seen in MERAM results.We also implemented MERAM on a cluster of workstations. According to our experiments, MERAM converges better than the Explicitly Restarted Block Arnoldi method and, for some matrices, more quickly than the PARPACK package, which implements the Implicitly Restarted Arnoldi method.