A Parallel Davidson-Type Algorithm for Several Eigenvalues
نویسنده
چکیده
In this paper we propose a new parallelization of the Davidson algorithm adapted for many eigenvalues. In our parallelization we use a relationship between two consecutive subspaces which allows us to calculate eigenvalues in the subspace through an arrowhead matrix. Theoretical timing estimates for the parallel algorithm are developed and compared against our numerical results on the Paragon. Finally our algorithm is compared against another recent parallel algorithm for multiple eigenvalues, but based on Arnoldi: PARPACK. c © 1998 Academic Press
منابع مشابه
A Parallel Davidson-type Algorithm for Running Title: Parallel Algorithm for Several Eigenvalues a Parallel Davidson-type Algorithm for Several Eigenvalues
In this paper we propose a new parallelization of the Davidson algorithm adapted for many eigenvalues. In our parallelization we use a relationship between two consecutive subspaces which allows us to calculate eigenvalues in the subspace through an arrowhead matrix. Theoretical timing estimates for the parallel algorithm are developed and compared against our numerical results on the Paragon. ...
متن کاملA Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation
The Jacobi-Davidson (JD) algorithm recently has gained popularity for finding a few selected interior eigenvalues of large sparse polynomial eigenvalue problems, which commonly appear in many computational science and engineering PDE based applications. As other inner–outer algorithms like Newton type method, the bottleneck of the JD algorithm is to solve approximately the inner correction equa...
متن کاملA Parallel Implementation of the Jacobi-Davidson Eigensolver and Its Application in a Plasma Turbulence Code
In the numerical solution of large-scale eigenvalue problems, Davidson-type methods are an increasingly popular alternative to Krylov eigensolvers. The main motivation is to avoid the expensive factorizations that are often needed by Krylov solvers when the problem is generalized or interior eigenvalues are desired. In Davidson-type methods, the factorization is replaced by iterative linear sol...
متن کاملA Parallel Solver for Extreme Eigenpairs1
In this paper a parallel algorithm for nding a group of extreme eigenvalues is presented. The algorithm is based on the well known Davidson method for nding one eigenvalue of a matrix. Here we incorporate knowledge about the structure of the subspace through the use of an arrowhead solver which allows more parallelization in both the original Davidson and our new version. In our numerical resul...
متن کاملComputational experience with sequential and parallel, preconditioned Jacobi–Davidson for large, sparse symmetric matrices
The Jacobi–Davidson (JD) algorithm was recently proposed for evaluating a number of the eigenvalues of a matrix. JD goes beyond pure Krylov-space techniques; it cleverly expands its search space, by solving the so-called correction equation, thus in principle providing a more powerful method. Preconditioning the Jacobi–Davidson correction equation is mandatory when large, sparse matrices are an...
متن کامل