Abstract
Most computational work in Jacobi–Davidson [G.L.G. Sleijpen, H.A. van der Vorst, A Jacobi–Davidson iteration method for linear eigenvalue problems, SIAM J. Matrix Anal. Appl. 17 (1996) 401–425], an iterative method for large scale eigenvalue problems, is due to a so-called correction equation. In [M. Genseberger, G.L.G. Sleijpen, H.A. van der Vorst, Domain decomposition in Jacobi–Davidson for PDE related eigenvalue problems, in preparation] a strategy for the approximate solution of the correction equation was proposed. This strategy is based on a domain decomposition preconditioning technique in order to reduce wall clock time and local memory requirements. This paper discusses the aspect that the original strategy can be improved. For large scale eigenvalue problems that need a massively parallel treatment this aspect turns out to be nontrivial. The impact on the parallel performance will be shown by results of scaling experiments up to 1024 cores.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.