In this paper, we introduce and discuss an algorithm for the numerical solution of some kinds of fractional integral and fractional integrodifferential equations. The algorithm for the numerical solution of these equations is based on iterative approach. The stability and convergence of the fractional order numerical method are described. Finally, some numerical examples are provided to show that the numerical method for solving the fractional integral and fractional integrodifferential equations is an effective solution method.

This paper is concerned with the numerical blow-up solutions of semi-linear heat equations, where the nonlinear terms are of power type functions, with zero Dirichlet boundary conditions. We use explicit linear and implicit Euler finite difference schemes with a special time-steps formula to compute the blow-up solutions, and to estimate the blow-up times for three numerical experiments. Moreover, we calculate the error bounds and the numerical order of convergence arise from using these methods. Finally, we carry out the numerical simulations to the discrete graphs obtained from using these methods to support the numerical results and to confirm some known blow-up properties for the studied problems.

In this paper the oscillation criterion was investigated for all solutions of the third-order half linear neutral differential equations. Some necessary and sufficient conditions are established for every solution of (a(t)[(x(t)±p(t)x(?(t) ) )^'' ]^? )^'+q(t) x^? (?(t) )=0, t?t_0, to be oscillatory. Examples are given to illustrate our main results.

In this paper, a sufficient condition for stability of a system of nonlinear multi-fractional order differential equations on a finite time interval with an illustrative example, has been presented to demonstrate our result. Also, an idea to extend our result on such system on an infinite time interval is suggested.

A method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.

Acquires this research importance of addressing the subject (environmental problems) with
age group task, a category that children pre-school, and also reflected the importance of
research, because the (environmental problems) constitute a major threat to the continuation
of human life, particularly the children, so the environment is Bmchkladtha within
kindergarten programs represent the basis of a hub of learning where the axis, where the
kindergarten took into account included in the programs in order to help the development of
environmental awareness among children and get them used to the sound practices and
behaviors since childhood .
The research also detected problem-solving skills creative with kids Riyad

    Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the proble

Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,

In this paper we have presented a comparison between two novel integral transformations that are of great importance in the solution of differential equations. These two transformations are the complex Sadik transform and the KAJ transform. An uncompressed forced oscillator, which is an important application, served as the basis for comparison. The application was solved and exact solutions were obtained. Therefore, in this paper, the exact solution was found based on two different integral transforms: the first integral transform complex Sadik and the second integral transform KAJ. And these exact solutions obtained from these two integral transforms were new methods with simple algebraic calculations and applied to different problems.