Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes approximately 12.5% of the polynomial coefficients, and then symmetry relations are employed to compute the rest of the polynomial coefficients. The proposed method is evaluated against existing methods in terms of computational cost and maximum size can be generated. In addition, a reconstruction error analysis for image is performed using the proposed method for large signal sizes. The evaluation shows that the proposed method outperforms other existing methods.
The impact of a simple trailing-edge plain flap on the aerodynamics of the SD7037 airfoil have been studied in this paper using computational fluid dynamics at Reynolds number of 3×105 across various low angles of attack and flap deflection angles. The computational model was evaluated by using Star CCM+ software with κ--ω SST turbulence and gamma transition model to solve Navier-Stokes equations. The accuracy of the computational model has been confirmed through comparison with experimental data, showing a high level of agreement at low angles of attack. The findings revealed that specific combinations of angles of attack and flap deflection angles could increase the lift-to-drag ratio by over 70% compared to baseline conditions, benefi
... Show MoreIn this paper, the computational method (CM) based on the standard polynomials has been implemented to solve some nonlinear differential equations arising in engineering and applied sciences. Moreover, novel computational methods have been developed in this study by orthogonal base functions, namely Hermite, Legendre, and Bernstein polynomials. The nonlinear problem is successfully converted into a nonlinear algebraic system of equations, which are then solved by Mathematica®12. The developed computational methods (D-CMs) have been applied to solve three applications involving well-known nonlinear problems: the Darcy-Brinkman-Forchheimer equation, the Blasius equation, and the Falkner-Skan equation, and a comparison between t
... Show MoreThis article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). The application of the collection method will be expanding for presenting a numerical technique for solving M-SFBHE based on “shifted Jacobi-Gauss-Labatto polynomials” (SJ-GL-Ps) in the matrix form. The Caputo formula has been utilized to approximate the fractional derivative and to demonstrate its usefulness and accuracy, the proposed methodology was applied in two examples. The numerical results revealed that the used approach is very effective and gives high accuracy and good convergence.
This work implements an Electroencephalogram (EEG) signal classifier. The implemented method uses Orthogonal Polynomials (OP) to convert the EEG signal samples to moments. A Sparse Filter (SF) reduces the number of converted moments to increase the classification accuracy. A Support Vector Machine (SVM) is used to classify the reduced moments between two classes. The proposed method’s performance is tested and compared with two methods by using two datasets. The datasets are divided into 80% for training and 20% for testing, with 5 -fold used for cross-validation. The results show that this method overcomes the accuracy of other methods. The proposed method’s best accuracy is 95.6% and 99.5%, respectively. Finally, from the results, it
... Show MoreThe researcher focused on the importance of the physical abilities of the tennis game, as this game is one of the games that are characterized by its specificity in performance as this game is characterized by continuous movement and dealing with different elements, so this game requires the development of muscle strength, which plays an important role in Performance skills in the game of tennis. There are several methods to develop strength, including flat hierarchical technique, which is one of the most common forms of training in the development of muscle strength. As for the research problem, the researcher found a method that has an effect on the development of force. Therefore, the researcher tried to diversify a
... Show MoreThe researcher focused on the importance of the physical abilities of the tennis game, as this game is one of the games that are characterized by its specificity in performance as this game is characterized by continuous movement and dealing with different elements, so this game requires the development of muscle strength, which plays an important role in Performance skills in the game of tennis. There are several methods to develop strength, including flat hierarchical technique, which is one of the most common forms of training in the development of muscle strength. As for the research problem, the researcher found a method that has an effect on the development of force. Therefore, the researcher tried to diversify a
... Show MoreIn this paper, we proposed a new class of weighted Rayleigh distribution based on two parameters, scale and shape parameters which are introduced in Rayleigh distribution. The main properties of this class are investigated and derived.
In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.
The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.