Related papers: Fast generalized DFTs for all finite groups
Most of the FFT methods available for homogenization of the mechanical response use the strain/deformation gradient as unknown, imposing their compatibility using Green's functions or projection operators. This implies the allocation of…
We define a universal deformation formula (UDF) for the actions of the affine group on Frechet algebras. More precisely, starting with any associative Frechet algebra which the affine group acts on in a strongly continuous and isometrical…
In this work, we study the function $f_2(G)$ that counts the number of exact factorizations of a finite group $G$. We compute $f_2(G)$ for some well-known families of finite groups and use the results of Wiegold and Williamson \cite{WW} to…
This paper proposes a class of power-of-two FFT (Fast Fourier Transform) algorithms, called AM-QFT algorithms, that contains the improved QFT (Quick Fourier Transform), an algorithm recently published, as a special case. The main idea is to…
Numeric modeling of electromagnetics and acoustics frequently entails matrix-vector multiplication with block Toeplitz structure. When the corresponding block Toeplitz matrix is not highly sparse, e.g. when considering the electromagnetic…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
We implement an efficient method of computation of two dimensional Fourier-type integrals based on approximation of the integrand by Gaussian radial basis functions, which constitute a standard tool in approximation theory. As a result, we…
The quadratic phase Fourier transform (QPFT) is a generalization of several well-known integral transforms, including the linear canonical transform (LCT), fractional Fourier transform (FrFT), and Fourier transform (FT). This paper…
We define a family of quaternary sequences over the residue class ring modulo $4$ of length $pq$, a product of two distinct odd primes, using the generalized cyclotomic classes modulo $pq$ and calculate the discrete Fourier transform (DFT)…
A generalized fractional derivative (GFD) definition is proposed in this work. For a differentiable function that can be expanded by Taylor series, we show that D^Elafa*D^Beta f(t)=D^(Elafa+Beta)f(t). GFD is applied for some functions in…
The generic vector memory based accelerator is considered which supports DIT and DIF FFT with fixed datapath. The regular mixed-radix factorization of the DFT matrix coherent with the accelerator architecture is proposed and the correction…
The affine Weyl groups with their corresponding four types of orbit functions are considered. Two independent admissible shifts, which preserve the symmetries of the weight and the dual weight lattices, are classified. Finite subsets of the…
We give a detailed study of the discrete Fourier transform (DFT) of $r$-even arithmetic functions, which form a subspace of the space of $r$-periodic arithmetic functions. We consider the DFT of sequences of $r$-even functions, their mean…
The spectral decomposition for an explicit second-order differential operator $T$ is determined. The spectrum consists of a continuous part with multiplicity two, a continuous part with multiplicity one, and a finite discrete part with…
Shift registers/Primitive polynomials find applications in various branches of Mathematics, Coding Theory and Cryptography. Matrix analogues of primitive polynomials do exist. In this paper, an algorithmic approach to generating all such…
We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.
We develop and describe continuous and discrete transforms of class functions on compact simple Lie group $G$ as their expansions into series of uncommon special functions, called here $\E$-functions in recognition of the fact that the…
This paper deals with circulant matrices. It is shown that a circulant matrix can be multiplied by a vector in time O(n log(n)) in a ring with roots of unity without making use of an FFT algorithm. With our algorithm we achieve a speedup of…