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

In this paper, we present an approximate analytical and numerical solutions for the differential equations with multiple delay using the extend differential transform method (DTM). This method is used to solve many linear and non linear problems.

The main aim of this paper is to apply a new technique suggested by Temimi and Ansari namely (TAM) for solving higher order Integro-Differential Equations. These equations are commonly hard to handle analytically so it is request numerical methods to get an efficient approximate solution. Series solutions of the problem under consideration are presented by means of the Iterative Method (IM). The numerical results show that the method is effective, accurate and easy to implement rapidly convergent series to the exact solution with minimum amount of computation. The MATLAB is used as a software for the calculations.           

This study synthesized zeolite 4A, and hierarchical composite structure consisting of zeolite 4A- carbon were successfully prepared. Hydrothermal method was used to grow a layer of zeolite 4A over porous carbon surfaces to enhance mass transfer and increase surface area of zeolite. The products then were used to remove radioactive cesium¹³⁷Cs from liquid wastewater. Iraqi dates leaves midribs (DM) were used as locally available agricultural waste to prepare low- cost porous carbon, using carbonization method in tubular furnace at 900C for two hours. Hierarchical porous structures including zeolite are prepared by mechanically activating the carbon surface via Ultrasonicating nanoparticles suspension of ground zeolite type 4A.F

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

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh