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 initial value of the KP parameter. In addition, a new diagonal recurrence relation is introduced and used in the proposed algorithm. The diagonal recurrence algorithm was derived from the existing n direction and x direction recurrence algorithms. The diagonal and existing recurrence algorithms were subsequently exploited to compute the KP coefficients. First, the KP coefficients were computed for one partition after dividing the KP plane into four. To compute the KP coefficients in the other partitions, the symmetry relations were exploited. The performance evaluation of the proposed recurrence algorithm was determined through different comparisons which were carried out in state-of-the-art works in terms of reconstruction error, polynomial size, and computation cost. The obtained results indicate that the proposed algorithm is reliable and computes lesser coefficients when compared to the existing algorithms across wide ranges of parameter values of p and polynomial sizes N. The results also show that the improvement ratio of the computed coefficients ranges from 18.64% to 81.55% in comparison to the existing algorithms. Besides this, the proposed algorithm can generate polynomials of an order ∼8.5 times larger than those generated using state-of-the-art algorithms.
Abstract. In this paper, a high order extended state observer (HOESO) based a sliding mode control (SMC) is proposed for a flexible joint robot (FJR) system in the presence of time varying external disturbance. A composite controller is integrated the merits of both HOESO and SMC to enhance the tracking performance of FJR system under the time varying and fast lumped disturbance. First, the HOESO estimator is constructed based on only one measured state to precisely estimate unknown system states and lumped disturbance with its high order derivatives in the FJR system. Second, the SMC scheme is designed based on such accurate estimations to govern the nominal FJR system by well compensating the estimation errors in the states and the lumped
... Show MoreThere are a few studies that discuss the medical causes for diabetic foot (DF) ulcerations in Iraq, one of them in Wasit province. The aim of our study was to analyze the medical, therapeutic, and patient risk factors for developing DF ulcerations among diabetic patients in Baghdad, Iraq.
The main purpose of the work is to apply a new method, so-called LTAM, which couples the Tamimi and Ansari iterative method (TAM) with the Laplace transform (LT). This method involves solving a problem of non-fatal disease spread in a society that is assumed to have a fixed size during the epidemic period. We apply the method to give an approximate analytic solution to the nonlinear system of the intended model. Moreover, the absolute error resulting from the numerical solutions and the ten iterations of LTAM approximations of the epidemic model, along with the maximum error remainder, were calculated by using MATHEMATICA® 11.3 program to illustrate the effectiveness of the method.
The aim of this paper is to propose a reliable iterative method for resolving many types of Volterra - Fredholm Integro - Differential Equations of the second kind with initial conditions. The series solutions of the problems under consideration are obtained by means of the iterative method. Four various problems are resolved with high accuracy to make evident the enforcement of the iterative method on such type of integro differential equations. Results were compared with the exact solution which exhibits that this technique was compatible with the right solutions, simple, effective and easy for solving such problems. To evaluate the results in an iterative process the MATLAB is used as a math program for the calculations.
In this paper, we present new algorithm for the solution of the nonlinear high order multi-point boundary value problem with suitable multi boundary conditions. The algorithm is based on the semi-analytic technique and the solutions are calculated in the form of a rapid convergent series. It is observed that the method gives more realistic series solution that converges very rapidly in physical problems. Illustrative examples are provided to demonstrate the efficiency and simplicity of the proposed method in solving this type of multi- point boundary value problems.
In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H
... Show More