An efficient algorithm for the Schrödinger-Poisson eigenvalue problem (Q2372947)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for the Schrödinger-Poisson eigenvalue problem |
scientific article; zbMATH DE number 5171664
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for the Schrödinger-Poisson eigenvalue problem |
scientific article; zbMATH DE number 5171664 |
Statements
An efficient algorithm for the Schrödinger-Poisson eigenvalue problem (English)
0 references
17 July 2007
0 references
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)\).
0 references
Schrödinger eigenvalue problem
0 references
two-grid method
0 references
Schrödinger-Poisson system
0 references
wave functions
0 references
nonlinear potential
0 references
conjugate gradient iterations
0 references
Rayleigh quotient iteration
0 references
convergence
0 references
0 references
0 references
0.93646556
0 references
0.9128635
0 references
0.90609896
0 references
0.89367306
0 references
