Practical aspects of domain decomposition in Jacobi-Davidson for parallel performance

DOI10.1007/978-3-319-05789-7_81MaRDI QIDQ3133701zbMATH OpenOpenAlexFDO

Authors Menno Genseberger

Publication date 5 February 2018

Published in Lecture Notes in Computational Science and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-05789-7_81

zbMATH Keywords

Jacobi-Davidsondomain decompositionnumerical exampleparallel computationiterative methodcorrection equationlarge scale eigenvalue problems

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15)

Recommendations

• Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems
• Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
• scientific article; zbMATH DE number 1262866
• scientific article; zbMATH DE number 218070
• A Parallel Jacobi--Davidson-type Method for Solving Large Generalized Eigenvalue Problems in Magnetohydrodynamics

Cited in

(2)

• A domain decomposition based Jacobi-Davidson algorithm for quantum dot simulation
• Improving the parallel performance of a domain decomposition preconditioning technique in the Jacobi-Davidson method for large scale eigenvalue problems

This page was built for publication: Practical aspects of domain decomposition in Jacobi-Davidson for parallel performance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3133701)