Fast Interpolation for a Polynomial Through some Points
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    At first,a fast polynomial division algorithm is developed in this paper at O(n log2m) times, where,n, m are degrees of dividend and divisior polynomial,respectively,We then discuss a fast interpolation algorithm through n+1 points that extends n+1 with power of two to any number,the running times is O(n log22n).

    Reference
    Related
    Cited by
Get Citation
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 06,1992
  • Revised:
  • Adopted:
  • Online: January 23,2015
  • Published:
Article QR Code