Multiplicative character theory provides a natural setting for developing the complexity results of Auslander, Feig and Winograd . The first reason for this is the simplicity of the formulas describing the action of FT on multiplicative characters. We will now discuss a second important property of multiplicative characters. In a sense defined below, the spaces spanned by certain subsets of multiplicative characters are rational subspaces. As a consequence, we will be able to rationally manipulate the FT matrix F(p m ) into block diagonal matrices where each block action corresponds to some polynomial multiplication modulo a rational polynomial of a special kind. This is the main result in the work of Auslander, Feig and Winograd. Details from the point of view of multiplicative character theory can be found in .
KeywordsRational Basis Discrete Fourier Transform Basis Matrix Vandermonde Matrix Multiplicative Character
Unable to display preview. Download preview PDF.
- Winograd, S. “Arithmetic Complexity of Computations”, CBMS Regional Conf. Ser. in Math. SIAM, 33, Philadelphia, 1980.Google Scholar