The method of operational matrices based on different types of polynomials such as Bernstein, shifted Legendre and Bernoulli polynomials will be presented and implemented to solve the nonlinear Blasius equations approximately. The nonlinear differential equation will be converted into a system of nonlinear algebraic equations that can be solved using Mathematica^®12. The efficiency of these methods has been studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as the polynomial degree (n) increases, since the errors decrease. Moreover, the approximate solutions obtained by the proposed methods are compared with the solution of the 4^th order Runge-Kutta meth

With the growth of mobile phones, short message service (SMS) became an essential text communication service. However, the low cost and ease use of SMS led to an increase in SMS Spam. In this paper, the characteristics of SMS spam has studied and a set of features has introduced to get rid of SMS spam. In addition, the problem of SMS spam detection was addressed as a clustering analysis that requires a metaheuristic algorithm to find the clustering structures. Three differential evolution variants viz DE/rand/1, jDE/rand/1, jDE/best/1, are adopted for solving the SMS spam problem. Experimental results illustrate that the jDE/best/1 produces best results over other variants in terms of accuracy, false-positive rate and false-negative

     In this article, we investigate a mathematical fractional model of tuberculosis that takes into account vaccination as a possible way to treat the disease. We use an in-host tuberculosis fractional model that shows how Macrophages and Mycobacterium tuberculosis interact to knowledge of how vaccination treatments affect macrophages that have not been infected. The existence of optimal control is proven. The Hamiltonian function and the maximum principle of the Pontryagin are used to describe the optimal control. In addition, we use the theory of optimal control to develop an algorithm that leads to choosing the best vaccination plan. The best numerical solutions have been discovered using the forward and backward fractional Euler

            In this paper, several conditions are put in order to compose the sequence of partial sums ,  and  of the fractional operators of analytic univalent functions ,  and   of bounded turning which are bounded turning too.

In this paper, cubic trigonometric spline is used to solve nonlinear Volterra integral equations of second kind. Examples are illustrated to show the presented method’s efficiency and convenience.

     The method of operational matrices is based on the Bernoulli and Shifted Legendre polynomials which is used to solve the Falkner-Skan equation. The nonlinear differential equation converting to a system of nonlinear equations is solved using Mathematica^®12, and the approximate solutions are obtained. The efficiency of these methods was studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as  increases. Moreover, the obtained approximate solutions are compared with the numerical solution obtained by the fourth-order Runge-Kutta method (RK4), which gives  a good agreement.

This paper presents a new transform method to solve partial differential equations, for finding suitable accurate solutions in a wider domain. It can be used to solve the problems without resorting to the frequency domain. The new transform is combined with the homotopy perturbation method in order to solve three dimensional second order partial differential equations with initial condition, and the convergence of the solution to the exact form is proved. The implementation of the suggested method demonstrates the usefulness in finding exact solutions. The practical implications show the effectiveness of approach and it is easily implemented in finding exact solutions.

       Finally, all algori

A new method based on the Touchard polynomials (TPs) was presented for the numerical solution of the linear Fredholm integro-differential equation (FIDE) of the first order and second kind with condition. The derivative and integration of the (TPs) were simply obtained. The convergence analysis of the presented method was given and the applicability was proved by some numerical examples. The results obtained in this method are compared with other known results.

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