Accession Number : AD0767703

Title :   A New Upper Bound on the Complexity of Derivative Evaluation,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Kung,H. T.

Report Date : SEP 1973

Pagination or Media Count : 9

Abstract : Let T(n) denote the number of arithmetic operations needed to evaluate the normalized derivatives (P sub (i)) (t)/i factorial, i = 0,...,n, for an nth degree polynomial p(t) over the field of complex numbers. The author shows T(n) < or = 1/2 c n log squared n + lower order terms where c may be taken as 12. (Author)

Descriptors :   (*INTERPOLATION, ALGORITHMS), COMPLEX NUMBERS, POLYNOMIALS, ITERATIONS, THEOREMS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE