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 study examines traveling wave solutions of the SIS epidemic model with nonlocal dispersion and delay. The research shows that a key factor in determining whether traveling waves exist is the basic reproduction number R0. In particular, the system permits nontrivial traveling wave solutions for σ≥σ∗ for R0>1, whereas there are no such solutions for σ<σ∗. This is because there is a minimal wave speed σ∗>0. On the other hand, there are no traveling wave solutions when R0≤1. In conclusion, we provide several numerical simulations that illustrate the existence of TWS.

The aim of this article is to solve the Volterra-Fredholm integro-differential equations of fractional order numerically by using the shifted Jacobi polynomial collocation method. The Jacobi polynomial and collocation method properties are presented. This technique is used to convert the problem into the solution of linear algebraic equations. The fractional derivatives are considered in the Caputo sense. Numerical examples are given to show the accuracy and reliability of the proposed technique.

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

The purpose of this paper to discriminate between the poetic poems of each poet depending on the characteristics and attribute of the Arabic letters. Four categories used for the Arabic letters, letters frequency have been included in a multidimensional contingency table and each dimension has two or more levels, then contingency coefficient calculated.

The paper sample consists of six poets from different historical ages, and each poet has five poems. The method was programmed using the MATLAB program, the efficiency of the proposed method is 53% for the whole sample, and between 90% and 95% for each poet's poems.