Numerical methods for solving radial Schrödinger equations (Q909412)

An algorithm for solving radial Schrödinger equations is given. It is assumed that the asymptotic solution at the origin and at infinity is known. The basic structure of the algorithm is the same as the one given by \textit{G. E. Brown}, \textit{J. H. Gunn}, \textit{P. Gould} [Nucl. Phys. 46 (1963)]. One could say that it is a double shooting process, one integrates from 0 to \(R_ m\) and from \(R_{\infty}>R_ m\) to \(R_ m.\) The resulting matching condition at \(R_ m\) is solved using a Newton- like algorithm, where for the computation of the derivative the special structure of the problem is used, in particular one has to approximate an integral and a derivative. For each of these three needed numerical approximations, initial value problem, quadrature and onesided divided difference two methods of different order have been used. The overall scheme using in each of the three approximations the one of highest order gave the best result. As examples eigenvalues for the Woods-Saxon and the Morse potential and the Coulomb-like potentials such as the Hulthén and the Hellmann potential have been given.