A New Upper Bound on the Complexity of Derivative Evaluation,

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)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1973
Accession Number
AD0767703

Entities

People

  • H. T. Kung

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Arithmetic
  • Complex Numbers
  • Mathematics
  • Numbers
  • Polynomials

Fields of Study

  • Mathematics

Readers

  • Analytical Mechanics
  • Graph Algorithms and Convex Optimization.