In this article, the backstepping control scheme is proposed to stabilize the fractional order Riccati matrix differential equation with retarded arguments in which the fractional derivative is presented using Caputo's definition of fractional derivative. The results are established using Mittag-Leffler stability. The fractional Lyapunov function is defined at each stage and the negativity of an overall fractional Lyapunov function is ensured by the proper selection of the control law. Numerical simulation has been used to demonstrate the effectiveness of the proposed control scheme for stabilizing such type of Riccati matrix differential equations.

    In this article, we introduce and study two new families of analytic functions by using strong differential subordinations and superordinations associated with Wanas differential operator/. We also give and establish some important properties of these families.

       The basic goal of this research is to utilize an analytical method which is called the Modified Iterative Method in order to gain an approximate analytic solution to the Sine-Gordon equation. The suggested method is the amalgamation of the iterative method and a well-known technique, namely the Adomian decomposition method. A method minimizes the computational size, averts round-off errors, transformation and linearization, or takes some restrictive assumptions. Several examples are chosen to show the importance and effectiveness of the proposed method. In addition, a modified iterative method gives faster and easier solutions than other methods. These solutions are accurate and in agreement with the series

Discriminant analysis is a technique used to distinguish and classification an individual to a group among a number of  groups based on a linear combination of a set of relevant variables know discriminant function. In this research  discriminant analysis used to analysis data from repeated measurements design. We  will  deal  with the problem of  discrimination  and  classification in the case of  two  groups by assuming the Compound Symmetry covariance structure  under  the  assumption  of  normality for  univariate  repeated measures data.

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.

In this paper we use non-polynomial spline functions to develop numerical methods to approximate the solution of 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of these method, and to compare the computed results with other known methods.

     In this paper, some conditions to guarantee the existence of bounded solution to the second order multi delayed arguments differential equation are given. The Krasnoselskii theorem used to the Lebesgue’s dominated convergence and fixed point to obtain some new sufficient conditions for existence of solutions. Some important lemmas are established that are useful to prove the main results for oscillatory property. We also submitted some sufficient conditions to ensure the oscillation criteria of bounded solutions to the same equation.

Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par