The maximum entropy method for the Hausdorff moment problem suffers from ill conditioning as it uses monomial basis {1,x,x2,...,xn}. The maximum entropy method for the Chebyshev moment probelm was studied to overcome this drawback in. In this paper we review and modify the maximum entropy method for the Hausdorff and Chebyshev moment problems studied in and present the maximum entropy method for the Legendre moment problem. We also give the algorithms of converting the Hausdorff moments into the Chebyshev and Lengendre moments, respectively, and utilizing the corresponding maximum entropy method.

The key theme is converse forms of criteria for deciding determinateness in the classical moment problem. A method of proof due to Koosis is streamlined and generalized giving a convexity condition under which moments satisfying implies that c a positive constant. A contrapositive version is proved under a rapid variation condition on f (x), generalizing a result of Lin. These results are used to obtain converses of the Stieltjes versions of the Carleman and Krein criteria. Hamburger versions are obtained which relax the symmetry assumption of Koosis and Lin, respectively. A sufficient condition for Stieltjes determinateness of a discrete law is given in terms of its mass function. These criteria are illustrated through several examples.