@phdthesis{Seifert2020,
  author    = {Seifert, Bastian},
  title     = {Multivariate Chebyshev polynomials and FFT-like algorithms},
  doi       = {10.25972/OPUS-20684},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-206845},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2020},
  abstract  = {This dissertation investigates the application of multivariate Chebyshev polynomials in the algebraic signal processing theory for the development of FFT-like algorithms for discrete cosine transforms on weight lattices of compact Lie groups. After an introduction of the algebraic signal processing theory, a multivariate Gauss-Jacobi procedure for the development of orthogonal transforms is proven. Two theorems on fast algorithms in algebraic signal processing, one based on a decomposition property of certain polynomials and the other based on induced modules, are proven as multivariate generalizations of prior theorems. The definition of multivariate Chebyshev polynomials based on the theory of root systems is recalled. It is shown how to use these polynomials to define discrete cosine transforms on weight lattices of compact Lie groups. Furthermore it is shown how to develop FFT-like algorithms for these transforms. Then the theory of matrix-valued, multivariate Chebyshev polynomials is developed based on prior ideas. Under an existence assumption a formula for generating functions of these matrix-valued Chebyshev polynomials is deduced.},
  subject      = {Schnelle Fourier-Transformation},
  language  = {en}
}