Fast generalized Fourier transforms
Computational complexity of the fast generalized Fourier transforms is discussed on the basis of the Wedderburn's structure theorem. In the sequel, the upper bound of the linear complexity is confidently estimated.
scientific article; zbMATH DE number 4110058
scientific article