Multiple explicitly restarted Arnoldi method for solving large eigenproblems. 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.par 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.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Shahzadeh Fazeli, S.A.; Emad, Nahid; Liu, Zifan: A key to choose subspace size in implicitly restarted Arnoldi method (2015)
- Ainsworth, G.O. jun.; Ribeiro, F.L.B.; Magluta, C.: A parallel subdomain by subdomain implementation of the implicitly restarted Arnoldi/Lanczos method (2011)
- Dubois, Jér^ome; Calvin, Christophe; Petiton, Serge: Accelerating the explicitly restarted Arnoldi method with GPUs using an autotuned matrix vector product (2011)
- Emad, Nahid; Petiton, Serge; Edjlali, Guy: Multiple explicitly restarted Arnoldi method for solving large eigenproblems (2005)