This paper presents an O(nlog_2n)fast algorithm for computing all derivatives of an nth degree polynomial at some point. It improves the O(nlog_2^2n)fast algorithm showed by H.T.kung. And by this new method, we further reduce the orders of the computational complexities in [2] and [3].
