An Efficiency Study of Polynomial Eigenvalue Problem Solvers for Quantum Dot Simulations
Resource
Taiwanese Journal of Mathematics.
Journal
Taiwanese Journal of Mathematics
Pages
999-1021
Date Issued
2010-05
Date
2010-05
Author(s)
Abstract
Nano-scale quantum dot simulations result in large-scale polynomial eigenvalue problems. It remains unclear how these problems can be solved efficiently. We fill this gap in capability partially by proposing a polynomial Jacobi-Davidson method framework, including several varied schemes for solving the associated correction equations. We investigate the performance of the proposed Jacobi-Davidson methods for solving the polynomial eigenvalue problems and several Krylov subspace methods for solving the linear eigenvalue problems with the use of various linear solvers and preconditioning schemes. This study finds the most efficient scheme combinations for different types of target problems.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
901.pdf
Size
23.45 KB
Format
Adobe PDF
Checksum
(MD5):a8aaaaedf844fceed8297a5be7e9070a