<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>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].</p></abstract>

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].

Multiplication of Polynomials using Discrete Fourier Transformation

Department of Computer Science, University of Gdańsk, Wita Stwosza 57, 80-952 Gdańsk, Poland

Formalized Mathematics

{"article-title":"Multiplication of Polynomials using Discrete Fourier Transformation"}

In this article we define the Discrete Fourier Transformation for univariate polynomials and show that multiplication of polynomials can be carried out by two...

Multiplication of Polynomials using Discrete Fourier Transformation

Published Online: Jun 13, 2008

Page range: 121 - 128

DOI: https://doi.org/10.2478/v10037-006-0015-y

This content is open access.