We present a fast method for polynomial evaluation at points in arithmetic progression. By dividing the progression into m new ones and evaluating the polynomial at each point of these new progressions recursively,this method saves most of the multiplications in the price of little increase of additions comparing to Horner’s method, while their accuracy are almost the same. We also introduce vector structure to the recursive process making it suitable for parallel applications.