×

Algebraic theory of fast mixed-radix transforms. II: Computational complexity and applications. (English) Zbl 0731.65128

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.

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

Citations:

Zbl 0702.15007