Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va

In light of the enquiry raised by the Economist Mary Finn in 1995 concluding that high utilization in absorptive capacity of the economy is of inflationary tendency for industrial countries due to the equality between high rates of utilization of absorptive capacity and resource – shortage conditions leading to price inflation, the same idea was used to prove that budget utilization of operational costs and elevating absorptive capacity at the expense of investment budget leads to inflationary tendency that becomes a burden on financing the step- in policy of the Central bank to control prices through its foreign currency reserves at a time when the economy turned  into an importer of non- tradable goods and being subject

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

Abstract:

                In light of the development in the banking environment and the increasing reliance on electronic systems in providing banking services and due to the intense competition witnessed by the banking sector, the need has emerged to apply the comprehensive electronic banking system, which works on the Internet in providing new and diverse banking services regardless of time and place by linking all branches to one central database, and despite the advantages achieved from the application of the comprehensive system, there is a set of risks that accompany the use of that system, What requires the auditors to develop the audit method in line with the size of the development in the

This paper presents a new numerical method for the solution of ordinary differential equations (ODE). The linear second-order equations considered herein are solved using operational matrices of Wang-Ball Polynomials. By the improvement of the operational matrix, the singularity of the ODE is removed, hence ensuring that a solution is obtained. In order to show the employability of the method, several problems were considered. The results indicate that the method is suitable to obtain accurate solutions.

This research sheds light on the contributions of a group of scientific Kurdish scholars in the seventh and eighth Hijri centuries, who devoted themselves to serving science with the bad political and economic conditions at the time, and the research pointed to the flowering of science and how students travel in order to provide them with science, obtain a scientific certificate, then take up The research efforts of the scholars in the two Hijri century mentioned in the science of the Qur’an, whether in the field of recitations, intonation or interpretation, and the research ends with a conclusion in which I mentioned the most important conclusions reached in this research.

Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall