32. Domain Decomposition Techniques for Contour Integration Eigenvalue Solvers
Event Type
Poster
TimeTuesday, November 15th8:30am - 5pm
LocationLower Lobby Concourse
DescriptionThis poster discusses techniques for computing a few selected eigenvalue-eigenvector pairs of large and sparse symmetric matrices. A recently developed powerful class of techniques to solve this type of problems is based on integrating the matrix resolvent operator along a complex contour that encloses the interval containing the eigenvalues of interest. This poster considers such contour integration techniques from a domain decomposition viewpoint, and extends the concept of domain decomposition linear system solvers in the framework of contour integration methods for eigenvalue problems, such as FEAST. We describe a multi-parallel implementation of FEAST using domain decomposition, discuss how the different levels of parallelism can be exploited, and report results on distributed computing environments reported. These results show that domain decomposition approaches can lead to reduced runtimes and improved scalability.
Archive
