Discrete Fourier Analysis and Chebyshev Polynomials with G2 Group
نویسندگان
چکیده
Abstract. The discrete Fourier analysis on the 300–600–900 triangle is deduced from the corresponding results on the regular hexagon by considering functions invariant under the group G2, which leads to the definition of four families generalized Chebyshev polynomials. The study of these polynomials leads to a Sturm–Liouville eigenvalue problem that contains two parameters, whose solutions are analogues of the Jacobi polynomials. Under a concept of m-degree and by introducing a new ordering among monomials, these polynomials are shown to share properties of the ordinary orthogonal polynomials. In particular, their common zeros generate cubature rules of Gauss type.
منابع مشابه
A Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملOn Group Fourier Analysis and Symmetry Preserving Discretizations of PDEs
In this paper we review some group theoretic techniques applied to discretizations of PDEs. Inspired by the recent years active research in Lie groupand exponential time integrators for differential equations, we will in the first part of the article present algorithms for computing matrix exponentials based on Fourier transforms on finite groups. As an example, we consider spherically symmetri...
متن کاملMultivariate polynomial interpolation on Lissajous-Chebyshev nodes
In this contribution, we study multivariate polynomial interpolation and quadrature rules on non-tensor product node sets linked to Lissajous curves and Chebyshev varieties. After classifying multivariate Lissajous curves and the interpolation nodes related to these curves, we derive a discrete orthogonality structure on these node sets. Using this discrete orthogonality structure, we can deriv...
متن کاملOn Chebyshev interpolation of analytic functions
This paper reviews the notion of interpolation of a smooth function by means of Chebyshev polynomials, and the well-known associated results of spectral accuracy when the function is analytic. The rate of decay of the error is proportional to ρ−N , where ρ is a bound on the elliptical radius of the ellipse in which the function has a holomorphic extension. An additional theorem is provided to c...
متن کاملDISCRETE FOURIER ANALYSIS ON FUNDAMENTAL DOMAIN OF Ad LATTICE AND ON SIMPLEX IN d-VARIABLES
A discrete Fourier analysis on the fundamental domain Ωd of the d-dimensional lattice of type Ad is studied, where Ω2 is the regular hexagon and Ω3 is the rhombic dodecahedron, and analogous results on d-dimensional simplex are derived by considering invariant and anti-invariant elements. Our main results include Fourier analysis in trigonometric functions, interpolation and cubature formulas o...
متن کامل