Initial conditions for a safe and fast convergence of the Chebyshev like iterative method for the simultaneous determination of all simple zeros of a polynomial are considered. It is proved that, under the stated conditions, this method converges cubically. The proposed convergence conditions are computationaly verifiable since they depend only on initial approximations and the degree of a given polynomial, which is of practical importance.