In the paper we are concerned with a method for choosing the initial approximations to the zeros of a polynomial. Methods for finding all the zeros of a polynomial simultaneously, which can be considered modified a Newton Method, have been reported by quite a few authors. The initial approximations for these simultaneous methods take much CPU-time to find all the zeros of a polynomial, since CPU time depends mostly on the situation of the initial distribution of zeros. Here, a new method for choosing the initial approximations is proposed, which simplifies Aberth's method for choosing the initial approximations, and reduces the CPU time to obtain initial approximations and find all the zeros of a polynomial. In this method, the quasistandard deviation obtained by the degree and coefficients of a polynomial is defined, and the initial approximations to zeros are given by this quasi-standard deviation. A comparison between Aberth's method and our proposing method for choosing the initial approximations is made through numerical experiments.