Discrete Cosine and Sine Transforms Generalized to Honeycomb Lattice
نویسندگان
چکیده
The discrete cosine and sine transforms are generalized to a triangular fragment of the honeycomb lattice. The two-variable orbit functions of the Weyl group A2, discretized simultaneously on the weight and root lattices, induce the family of the 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 behaviour of the discrete transforms are exemplified. Consequences of the developed discrete transforms for transversal eigenvibrations of the mechanical graphene model are discussed. 1 Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague, Břehová 7, CZ–115 19 Prague, Czech Republic E-mail: [email protected], [email protected]
منابع مشابه
Unified parallel lattice structures for time-recursive discrete cosine/sine/Hartley transforms
The problems of unified efficient computations of the discrete cosine transform (DCT), discrete sine transform (DST), discrete Hartley transform (DHT), and their inverse transforms are considered. In particular, a new scheme employing the time-recursive approach to compute these transforms is presented. Using such approach, unified parallel lattice structures that can dually generate the DCT an...
متن کاملModified Sine-Cosine Algorithm for Sizing Optimization of Truss Structures with Discrete Design Variables
This paper proposes a modified sine cosine algorithm (MSCA) for discrete sizing optimization of truss structures. The original sine cosine algorithm (SCA) is a population-based metaheuristic that fluctuates the search agents about the best solution based on sine and cosine functions. The efficiency of the original SCA in solving standard optimization problems of well-known mathematical function...
متن کاملHYBRID COLLIDING BODIES OPTIMIZATION AND SINE COSINE ALGORITHM FOR OPTIMUM DESIGN OF STRUCTURES
Colliding Bodies Optimization (CBO) is a population-based metaheuristic algorithm that complies physics laws of momentum and energy. Due to the stagnation susceptibility of CBO by premature convergence and falling into local optima, some meritorious methodologies based on Sine Cosine Algorithm and a mutation operator were considered to mitigate the shortcomings mentioned earlier. Sine Cosine Al...
متن کاملFractional cosine, sine, and Hartley transforms
In previous papers, the Fourier transform (FT) has been generalized into the fractional Fourier transform (FRFT), the linear canonical transform (LCT), and the simplified fractional Fourier transform (SFRFT). Because the cosine, sine, and Hartley transforms are very similar to the FT, it is reasonable to think they can also be generalized by the similar way. In this paper, we will introduce sev...
متن کاملDiscrete Cosine Transforms on Quantum Computers
A classical computer does not allow to calculate a discrete cosine transform on N points in less than linear time. This trivial lower bound is no longer valid for a computer that takes advantage of quantum mechanical superposition, entanglement, and interference principles. In fact, we show that it is possible to realize the discrete cosine transforms and the discrete sine transforms of size N ...
متن کامل