Veselý, Vítězslav Algebraic theory of fast mixed-radix transforms. II: Computational complexity and applications. (English) Zbl 0731.65128 Arch. Math., Brno 26, No. 1, 19-26 (1990). This paper continues part I [ibid. 25, No.3, 149-161 (1989; Zbl 0702.15007)] where a method of generalized Kronecker product for fast mixed-radix transforms was introduced. Here the author gives estimates on computational complexity and applies it to the parametric discrete Fourier transform. Reviewer: K.H.Kim (Montgomery) MSC: 65T50 Numerical methods for discrete and fast Fourier transforms 65F30 Other matrix algorithms (MSC2010) 65Y20 Complexity and performance of numerical algorithms 15A23 Factorization of matrices 15A04 Linear transformations, semilinear transformations Keywords:generalized Kronecker product; fast mixed-radix transforms; computational complexity; parametric discrete Fourier transform Citations:Zbl 0702.15007 × Cite Format Result Cite Review PDF Full Text: EuDML