The paper develops applications of symmetric orbit functions, known from irreducible representations of simple Lie groups, in numerical analysis. It is shown that these functions have remarkable properties which yield to cubature formulas, approximating a weighted integral of any function by a weighted finite sum of function values, in connection with any simple Lie group. The cubature formulas are specialized for simple Lie groups of rank two. An optimal approximation of any function by multivariate polynomials arising from symmetric orbit functions is discussed.
4 March 2019 in Journal of Fourier Analysis and Applications
The discrete cosine and sine transforms are generalized to a triangular fragment of the honeycomb lattice. The honeycomb point sets are constructed by subtracting the root lattice from the weight lattice points of the crystallographic root system A2. The two-variable orbit functions of the Weyl group of A2, discretized simultaneously on the weight and root lattices, induce a novel parametric family of extended Weyl orbit functions. The periodicity and von Neumann and Dirichlet boundary properties of the extended Weyl orbit functions are detailed. Three types of discrete complex Fourier-Weyl transforms and real-valued Hartley-Weyl transforms are described. Unitary transform matrices and interpolating behavior of the discrete transforms are exemplified. Consequences of the developed discrete transforms for transversal eigenvibrations of the mechanical graphene model are discussed.
Discrete transforms of Weyl orbit functions on finite fragments of shifted dual root lattices are established. The congruence classes of the dual weight lattices intersected with the fundamental domains of the affine Weyl groups constitute the point sets of the transforms. The shifted weight lattices intersected with the fundamental domains of the extended dual affine Weyl groups form the sets of labels of Weyl orbit functions. The coinciding cardinality of the point and label sets and corresponding discrete orthogonality relations of Weyl orbit functions are demonstrated. The explicit counting formulas for the numbers of elements contained in the point and label sets are calculated. The forward and backward discrete Fourier-Weyl transforms, together with the associated interpolation and Plancherel formulas, are presented. The unitary transform matrices of the discrete transforms are exemplified for the case .
9 February 2021 in Journal of Physics A: Mathematical and Theoretical
Classes of discrete quantum models that describe a free non-relativistic quantum particle propagating on rescaled and shifted dual root lattices inside closures of Weyl alcoves are constructed. Boundary conditions of the discrete quantum billiard systems on the borders of the Weyl alcoves are controlled by specific combinations of Dirichlet and Neumann walls that result from sign homomorphisms and admissible shifts inherent in generalized dual root lattice Fourier–Weyl transforms. The amplitudes of the particle’s jumps to neighbouring positions are controlled by a complex-valued dual root lattice hopping function with finite support. The solutions of the time-independent Schrödinger equation together with the eigenenergies of the quantum systems are explicitly determined. The matrix Hamiltonians and eigenenergies of the discrete models are exemplified for the rank two cases A2 and C2 .
Sixteen types of the discrete multivariate transforms, induced by the multivariate antisymmetric and symmetric sine functions, are explicitly developed. Provided by the discrete transforms, inherent interpolation methods are formulated. The four generated classes of the corresponding orthogonal polynomials generalize the formation of the Chebyshev polynomials of the second and fourth kinds. Continuous orthogonality relations of the polynomials together with the inherent weight functions are deduced. Sixteen cubature rules, including the four Gaussian, are produced by the related discrete transforms. For the three-dimensional case, interpolation tests, unitary transform matrices and recursive algorithms for calculation of the polynomials are presented.