An efficient algorithm for the Schrödinger-Poisson eigenvalue problem

From MaRDI portal
Publication:2372947





The authors present a new two-grid method for computing extremum eigenpairs of the Schrödinger eigenvalue problem. First, a nonlinear potential corresponding to the Schrödinger equation is deduced. Then, conjugate gradient iterations are used in order to solve the associated linear system on the fine grid. The accuracy of the metod is improved by using the Rayleigh quotient iteration. The convergence rate of eigenvalue computations on the fine grid is of order \(O(h^3)\).



Cites work



Describes a project that uses

Uses Software






This page was built for publication: An efficient algorithm for the Schrödinger-Poisson eigenvalue problem

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