Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems

DOI10.1016/j.apnum.2009.07.004zbMath1200.65026OpenAlexW2142341108MaRDI QIDQ607119

Menno Genseberger

Publication date: 19 November 2010

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apnum.2009.07.004

zbMATH Keywords

domain decompositioneigenvalue problemsinexact Newton methodJacobi-DavidsonKrylov methodSchwarz method

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25)

Related Items (4)

Optimized interface conditions in domain decomposition methods for problems with extreme contrasts in the coefficients ⋮ A parallel subdomain by subdomain implementation of the implicitly restarted Arnoldi/Lanczos method ⋮ Unstructured quotient fixed modes and decentralised stabilisability ⋮ A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc

Uses Software

• JDQR
• JDQZ

Cites Work

• Unnamed Item
• Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
• BiCGstab(\(l\)) for linear equations involving unsymmetric matrices with complex spectrum
• IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
• Controlling Inner Iterations in the Jacobi–Davidson Method
• GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
• Inexact Newton Methods
• Generalized Schwarz Splittings
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
• Accelerated Inexact Newton Schemes for Large Systems of Nonlinear Equations
• A comparison of some domain decomposition and ILU preconditioned iterative methods for nonsymmetric elliptic problems
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• Optimized Schwarz Methods

This page was built for publication: Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems