Accurate Spectral Collocation Computations of High Order Eigenvalues for Singular Schrödinger Equations-Revisited

In this paper, we continue to solve as accurately as possible singular eigenvalues problems attached to the Schrödinger equation. We use the conventional ChC and SiC as well as Chebfun. In order to quantify the accuracy of our outcomes, we use the drift with respect to some parameters, i.e., the order of approximation N, the length of integration interval X, or a small parameter $\epsilon$, of a set of eigenvalues of interest. The deficiency of orthogonality of eigenvectors, which approximate eigenfunctions, is also an indication of the accuracy of the computations. The drift of eigenvalues provides an error estimation and, from that, one can achieve an error control. In both situations, conventional spectral collocation or Chebfun, the computing codes are simple and very efficient. An example for each such code is displayed so that it can be used. An extension to a 2D problem is also considered.