Accurate spectral collocation computation of high order eigenvalues for singular Schrödinger equations

Abstract

We are concerned with the study of some classical spectral collocation methods, mainly Chebyshev and sinc as well as with the new software system Chebfun in computing high order eigenpairs of singular and regular Schrödinger eigenproblems. We want to highlight both the qualities as well as the shortcomings of these methods and evaluate them in conjunction with the usual ones. In order to resolve a boundary singularity, we use Chebfun with domain truncation. Although it is applicable with spectral collocation, a special technique to introduce boundary conditions as well as a coordinate transform, which maps an unbounded domain to a finite one, are the special ingredients. A challenging set of “hard” benchmark problems, for which usual numerical methods (FD, FEM, shooting, etc.) fail, were analyzed. In order to separate “good” and “bad”eigenvalues, we have estimated the drift of the set of eigenvalues of interest with respect to the order of approximation and/or scaling of domain parameter. It automatically provides us with a measure of the error within which the eigenvalues are computed and a hint on numerical stability. We pay a particular attention to problems with almost multiple eigenvalues as well as to problems with a mixed spectrum.

Authors

Calin-Ioan Gheorghiu
Tiberiu Popoviciu Institute of Numerical Analysis, Romanian Academy

Keywords

spectral collocation; Chebfun; singular Schrödinger; high index eigenpairs; multiple eigenpairs; accuracy; numerical stability

References

See the expanding box below.

PDF

Cite this paper as:

C.I. Gheorghiu, Accurate spectral collocation computation of high order eigenvalues for singular Schrödinger equations, Computation, 9 (2021) 2, 19 pp.
https://doi.org/10.3390/computation9010002

About this paper

Journal

MDPI Computation

Publisher Name

MDPI

Print ISSN

Not available yet.

Online ISSN

ISSN 2079-3197

Google Scholar Profile

Related Posts

Menu