Minimum-Error Method for Scattering Problems in Quantum Mechanics: Two Stable and Efficient Implementations

Abstract

We examine here, by using a simple example, two implementations of the minimum error method (MEM), a least-squares minimization for scattering problems in quantum mechanics, and show that they provide an efficient, numerically stable alternative to Kohn variational principle. MEM defines an error-functional consisting of the sum of the values of (HPsi - EPsi)2 at a set of grid points. The wave function Psi, is forced to satisfy the scattering boundary conditions and is determined by minimizing the least-squares error. We study two implementations of this idea. In one, we represent the wave function as a linear combination of Chebyshev polynomials and minimize the error by varying the coefficients of the expansion and the R-matrix (present in the asymptotic form of Psi). This leads to a linear equation for the coefficients and the R-matrix, which we solve by matrix inversion. In the other implementation, we use a conjugate-gradient procedure to minimize the error with respect to the values of Psi at the grid points and the R-matrix. The use of the Chebyshev polynomials allows an efficient and accurate calculation of the derivative of the wave function, by using Fast Chebyshev Transforms. We find that, unlike KVP, MEM is numerically stable when we use the R-matrix asymptotic condition and gives accurate wave functions in the interaction region.