An optimal algorithm for expanding the composition of polynomials

  • Authors:
  • Wayne Liu;Stephen Mann

  • Affiliations:
  • Univ. of Waterloo, Waterloo, Ont., Canada;Univ. of Waterloo, Waterloo, Ont., Canada

  • Venue:
  • ACM Transactions on Graphics (TOG)
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

A runtime analysis is made of a previously published algorithm for polynomial composition. The relationship between this composition algorithm and Sablonnie`re's algorithm is explored. This composition algorithm is then made optimal aby first performing a change of basis.