pith. sign in

arxiv: quant-ph/0605205 · v1 · submitted 2006-05-24 · 🪐 quant-ph · math-ph· math.MP

Improving the Convergence of an Iterative Algorithm Proposed By Waxman

classification 🪐 quant-ph math-phmath.MP
keywords algorithmconvergenceeigenvalueiterativeproposedwaxmananalyticalasymptotically
0
0 comments X
read the original abstract

In the iterative algorithm recently proposed by Waxman for solving eigenvalue problems, we point out that the convergence rate may be improved. For many non-singular symmetric potentials which vanish asymptotically, a simple analytical relationship between the coupling constant of the potential and the ground state eigenvalue is obtained which can be used to make the algorithm more efficient.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.