Open Access

Multiplication of Polynomials using Discrete Fourier Transformation


Cite

In this article we define the Discrete Fourier Transformation for univariate polynomials and show that multiplication of polynomials can be carried out by two Fourier Transformations with a vector multiplication in-between. Our proof follows the standard one found in the literature and uses Vandermonde matrices, see e.g. [27].

eISSN:
1898-9934
ISSN:
1426-2630
Language:
English
Publication timeframe:
4 times per year
Journal Subjects:
Computer Sciences, other, Mathematics, General Mathematics