New variable-step algorithms for computing eigenvalues of the one-dimensional Schrödinger equation (Q1271719)
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: New variable-step algorithms for computing eigenvalues of the one-dimensional Schrödinger equation |
scientific article; zbMATH DE number 1221215
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New variable-step algorithms for computing eigenvalues of the one-dimensional Schrödinger equation |
scientific article; zbMATH DE number 1221215 |
Statements
New variable-step algorithms for computing eigenvalues of the one-dimensional Schrödinger equation (English)
0 references
2 March 1999
0 references
Two variable-step algorithms have been developed for computing eigenvalues of the radial Schrödinger equation. The eigenvalues are computed directly as roots of a function known in transmission line theory as the impendance. The novel numerical algorithms are based also on the piecewise perturbation analysis. The first new variable-step method is based on two methods, one with zeroth-order solution and the other with first-order perturbative corrections. The second method called `` block method'' is based on three methods, one with zeroth-order solution, another with first-order perturbative corrections and another with second-order perturbative corrections. Numerical results presented indicate the efficiency of the new variable-step methods.
0 references
numerical examples
0 references
eigenvalue problems
0 references
perturbation analysis
0 references
variable-step algorithms
0 references
radial Schrödinger equation
0 references
block method
0 references