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 anefficient, numerically stable alternative to Kohn variational principle. MEM defines an error-functionalconsisting of the sum of the
values of (
H -
E)
2 at a set of grid points. The wave function
, is forcedto satisfy the scattering
boundary conditions and is
determined by minimizing the least-squares error. Westudy two implementations of this idea. In one, we represent the wave function as a linear combination ofChebyshev polynomials and minimize the error by varying the coefficients of the expansion and the
R-matrix(present in the asymptotic form of
). 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 tominimize the error with respect to the
values of
at the grid points and the
R-matrix. The use of the Chebyshevpolynomials allows an efficient and accurate calculation of the derivative of the wave function, by using FastChebyshev Transforms. We find that, unlike KVP, MEM is numerically stable when we use the
R-matrixasymptotic condition and gives accurate wave functions in the interaction region.