The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

    This paper deals with finding an approximate solution to the index-2 time-varying linear differential algebraic control system based on the theory of variational formulation. The solution of index-2 time-varying differential algebraic equations (DAEs) is the critical point of the equivalent variational formulation. In addition, the variational problem is transformed from the indirect into direct method by using a generalized Ritz bases approach. The approximate solution is found by solving an explicit linear algebraic equation, which makes the proposed technique reliable and efficient for many physical problems. From the numerical results, it can be implied that very good efficiency, accuracy, and simplicity of the pre

This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples

This paper is concerned with the existence of a unique state vector solution of a couple nonlinear hyperbolic equations using the Galerkin method when the continuous classical control vector is given, the existence theorem of a continuous classical optimal control vector with equality and inequality vector state constraints is proved, the existence of a unique solution of the adjoint equations associated with the state equations is studied. The Frcéhet derivative of the Hamiltonian is obtained. Finally the theorems of the necessary conditions and the sufficient conditions of optimality of the constrained problem are proved.

The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m

 The aim of this paper, is to discuss several high performance training algorithms fall into two main categories. The first category uses heuristic techniques, which were developed from an analysis of the performance of the standard gradient descent algorithm. The second category of fast algorithms uses standard numerical optimization techniques such as: quasi-Newton . Other aim is to solve the drawbacks related with these training algorithms and propose an efficient training algorithm for FFNN

    Feature selection represents one of the critical processes in machine learning (ML). The fundamental aim of the problem of feature selection is to maintain performance accuracy while reducing the dimension of feature selection. Different approaches were created for classifying the datasets. In a range of optimization problems, swarming techniques produced better outcomes. At the same time, hybrid algorithms have gotten a lot of attention recently when it comes to solving optimization problems. As a result, this study provides a thorough assessment of the literature on feature selection problems using hybrid swarm algorithms that have been developed over time (2018-2021). Lastly, when compared with current feature selection procedu

Abstract 

For sparse system identification,recent suggested algorithms are  -norm Least Mean Square (  -LMS), Zero-Attracting LMS (ZA-LMS), Reweighted Zero-Attracting LMS (RZA-LMS), and p-norm LMS (p-LMS) algorithms, that have modified the cost function of the conventional LMS algorithm by adding a constraint of coefficients sparsity. And so, the proposed algorithms are named  -ZA-LMS, 

    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.

In this work, we give an identity that leads to establishing the operator . Also, we introduce the polynomials . In addition, we provide Operator proof for the generating function with its extension and the Rogers formula for . The generating function with its extension and the Rogers formula for the bivariate Rogers-Szegö polynomials  are deduced. The Rogers formula for  allows to obtain the inverse linearization formula for , which allows to deduce the inverse linearization formula for . A solution to a q-difference equation is introduced and the solution is expressed in terms of the operators . The q-difference method is used to recover an identity of the operator  and the generating function for the polynomials