The Chebyshev Polynomials Of The First Kind For Analysis Rates Shares Of Enterprises
Chebyshev polynomials of the first kind have long been used to approximate experimental data in solving various technical problems. Within the framework of this study, the dynamics of shares of eight Czech enterprises was analyzed by the Chebyshev polynomial decomposition: CEZ A.S. (CEZP), Colt CZ Group SE (CZG), Erste Bank (ERST), Komercni Banka (BKOM), Moneta Money Bank A.S. (MONET), Photon (PENP), Vienna insurance group (VIGR) in 2021. An investor, when making a decision to purchase a security , is guided largely by an heuristic approach . And variance and correlation are not observed by human senses. The vectors of decomposition of time series of exchange values of securities allow analyzing the dynamics of exchange values of securities more effectively if their dynamics does not correspond to the normal distribution law. The proposed model allows analyzing the dynamics of the exchange value of a securities portfolio without calculating variance and correlation. This model can be useful if the dynamics of the exchange values of securities does not obey, due to certain circumstances, the normal law of distribution.
Code (0)
등록된 구현이 없습니다.
Tasks
Time SeriesSimilar Papers 제목 키워드 기반
CKANIO: Learnable Chebyshev Polynomials for Inertial Odometry
Inertial odometry (IO) relies exclusively on signals from an inertial measurement unit (IMU) for localization and offers a promising avenue for consumer grade positioning. However, accurate modeling of the nonlinear moti…
Improvement of Color Image Analysis Using a New Hybrid Face Recognition Algorithm based on Discrete Wavelets and Chebyshev Polynomials
This work is unique in the use of discrete wavelets that were built from or derived from Chebyshev polynomials of the second and third kind, filter the Discrete Second Chebyshev Wavelets Transform (DSCWT), and derive two…
Face RecognitionImage CompressionConvolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited
Designing spectral convolutional networks is a challenging problem in graph learning. ChebNet, one of the early attempts, approximates the spectral graph convolutions using Chebyshev polynomials. GCN simplifies ChebNet b…
GPRGraph LearningNode ClassificationScaling Up Graph Propagation Computation on Large Graphs: A Local Chebyshev Approximation Approach
Graph propagation (GP) computation plays a crucial role in graph data analysis, supporting various applications such as graph node similarity queries, graph node ranking, graph clustering, and graph neural networks. Exis…
Graph ClusteringConvergence Acceleration via Chebyshev Step: Plausible Interpretation of Deep-Unfolded Gradient Descent
Deep unfolding is a promising deep-learning technique, whose network architecture is based on expanding the recursive structure of existing iterative algorithms. Although convergence acceleration is a remarkable advantag…