Parallel Architectures, Algorithms and Programming, International Symposium on (2010)
Dalian, Liaoning China
Dec. 18, 2010 to Dec. 20, 2010
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2010.62
This paper presents a parallel refined Jacobi-Davidson method for computing extreme eigenpairs of quadratic eigenvalue problems. The method directly computes the refined Ritz pairs in the projection subspace, and expands the subspace by the solution of the correction equation. Combining with the restarting scheme, the method can solve several eigenpairs of quadratic eigenvalue problems. The numerical experiments on a parallel computer show that the parallel refined Jacobi-Davidson method for computing quadratic eigenvalue problems is very effective.
Parallel algorithm, Quadratic eigenvalue problems, Jacobi-Davidson method, Refined method
S. Wang, "A Parallel Refined Jacobi-Davidson Method for Quadratic Eigenvalue Problems," Parallel Architectures, Algorithms and Programming, International Symposium on(PAAP), Dalian, Liaoning China, 2010, pp. 111-115.