An efficiency study of polynomial eigenvalue problem solvers for quantum dot simulations

DOI10.11650/twjm/1500405878zbMath1198.65070OpenAlexW1535693982MaRDI QIDQ987884

Tsung-Ming Huang, Chang-Tse Lee, Wei-Chung Wang

Publication date: 2 September 2010

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/twjm/1500405878

zbMATH Keywords

numerical examplesquantum dotSchrödinger equationKrylov subspace methodsJacobi-Davidson methodspolynomial eigenvalue problemscorrection equationspreconditioning schemes

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Preconditioners for iterative methods (65F08)

Related Items

An efficient numerical algorithm for computing densely distributed positive interior transmission eigenvalues ⋮ A parallel polynomial Jacobi-Davidson approach for dissipative acoustic eigenvalue problems

Uses Software

• SLEPc
• PETSc
• ARPACK

This page was built for publication: An efficiency study of polynomial eigenvalue problem solvers for quantum dot simulations