A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
From MaRDI portal
(Redirected from Publication:964293)
Recommendations
- A parallel scalable PETSc-based Jacobi-Davidson polynomial eigensolver with application in quantum dot simulation
- Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulation
- A domain decomposition based Jacobi-Davidson algorithm for quantum dot simulation
- An efficiency study of polynomial eigenvalue problem solvers for quantum dot simulations
- A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation
Cites work
- scientific article; zbMATH DE number 949303 (Why is no real title available?)
- scientific article; zbMATH DE number 2113718 (Why is no real title available?)
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- A Parallel Jacobi--Davidson-type Method for Solving Large Generalized Eigenvalue Problems in Magnetohydrodynamics
- A Restricted Additive Schwarz Preconditioner for General Sparse Linear Systems
- A second-order finite volume scheme for three dimensional truncated pyramidal quantum dot
- Backward error and condition of polynomial eigenvalue problems
- Calculating modes of quantum wire and dot systems using a finite differencing technique
- Computational Science – ICCS 2005
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Computer simulation of electron energy levels for different shape InAs/GaAs semiconductor quantum dots
- Electron energy level calculations for cylindrical narrow gap semiconductor quantum dot
- Energy states of vertically aligned quantum dot array with nonparabolic effective mass
- Iterative projection methods for computing relevant energy states of a quantum dot
- Jacobi-Davidson type methods for generalized eigenproblems and polynomial eigenproblems
- Modeling quantum structures with the boundary element method
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems Under Limited Memory. Part II: Seeking Many Eigenvalues
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- Numerical calculation of the electronic structure for three-dimensional quantum dots
- Numerical methods for semiconductor heterostructures with band nonparabolicity
- Numerical schemes for three-dimensional irregular shape quantum dots over curvilinear coordinate systems
- Numerical simulation of three dimensional pyramid quantum dot
- Optimal Scaling of Generalized and Polynomial Eigenvalue Problems
- Parallel iterative methods for sparse linear systems
- SLEPc
- State-of-the-art eigensolvers for electronic structure calculations of large scale nano-systems
- Stationary Schrödinger equations governing electronic states of quantum dots in the presence of spin-orbit splitting.
- The parallel computation of the smallest eigenpair of an acoustic problem with damping
- The use of bulk states to accelerate the band edge state calculation of a semiconductor quantum dot
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
Cited in
(21)- A polynomial Jacobi-Davidson solver with support for non-monomial bases and deflation
- A domain decomposition based Jacobi-Davidson algorithm for quantum dot simulation
- On optimizing Jacobi-Davidson method for calculating eigenvalues in low dimensional structures using eight band \(\mathbf{k}\cdot\mathbf{p}\) model
- Mathematical modeling of semiconductor quantum dots based on the nonparabolic effective-mass approximation
- A Newton-type method with nonequivalence deflation for nonlinear eigenvalue problems arising in photonic crystal modeling
- A nonlinear eigenvalue problem arising in a nanostructured quantum dot
- Parallel iterative refinement in polynomial eigenvalue problems.
- A novel method to compute all eigenvalues of the polynomial eigenvalue problems in an open half plane
- Parallel Krylov solvers for the polynomial eigenvalue problem in SLEPc
- On the convergence of a two-level preconditioned Jacobi–Davidson method for eigenvalue problems
- A parallel implementation of Davidson methods for large-scale eigenvalue problems in SLEPc
- Spectral element methods for eigenvalue problems based on domain decomposition
- Parallel two-level domain decomposition based Jacobi-Davidson algorithms for pyramidal quantum dot simulation
- A convergence analysis of the inexact simplified Jacobi-Davidson algorithm for polynomial eigenvalue problems
- Numerical modeling of the InAs quantum dot with application of coordinate transformation and the finite difference method
- A two-level overlapping hybrid domain decomposition method for eigenvalue problems
- A parallel polynomial Jacobi-Davidson approach for dissipative acoustic eigenvalue problems
- A parallel scalable PETSc-based Jacobi-Davidson polynomial eigensolver with application in quantum dot simulation
- An efficiency study of polynomial eigenvalue problem solvers for quantum dot simulations
- A multilevel Jacobi-Davidson method for polynomial PDE eigenvalue problems arising in plasma physics
- Implicitly restarted refined partially orthogonal projection method with deflation
This page was built for publication: A parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q964293)
