Abstract
A classical scheme for multiplying polynomials is given by the Cauchy product formula. Faster methods for computing this product have been developed using circular convolution and fast Fourier transform algorithms. From the numerical point of view the Chebyshev expansion of polynomials is preferred to the monomial form. We develop a direct scheme for multiplication of polynomials in Chebyshev form as well as a fast algorithm using discrete cosine transforms. This approach leads to a new convolution operation and a new type of circulant matrices, both related to the discrete cosine transform. Extensions to bivariate polynomial products are also discussed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
