In this paper, the homotopy perturbation method is presented for solving the second kind linear mixed Volterra-Fredholm integral equations. Then, Aitken method is used to accelerate the convergence. In this method, a series will be constructed whose sum is the solution of the considered integral equation. Convergence of the constructed series is discussed, and its proof is given; the error estimation is also obtained. For more illustration, the method is applied on several examples and programs, which are written in MATLAB (R2015a) to compute the results. The absolute errors are computed to clarify the efficiency of the method.
The objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits etc. The OPF solution includes an objective function. A common objective function concerns the active power generation cost. A Linear programming method is proposed to solve the OPF problem. The Linear Programming (LP) approach transforms the nonlinear optimization problem into an iterative algorithm that in each iteration solves a linear optimization problem resulting from linearization both the objective function and constrains. A computer program, written in MATLAB environme
... Show MoreThis manuscript presents a new approach to accurately calculating exponential integral function that arises in many applications such as contamination, groundwater flow, hydrological problems and mathematical physics. The calculation is obtained with easily computed components without any restrictive assumptions
A detailed comparison of the execution times is performed. The calculated results by the suggested approach are better and faster accuracy convergence than those calculated by other methods. Error analysis of the calculations is studied using the absolute error and high convergence is achieved. The suggested approach out-performs all previous methods used to calculate this function and this decision is
... Show MoreSentiment analysis refers to the task of identifying polarity of positive and negative for particular text that yield an opinion. Arabic language has been expanded dramatically in the last decade especially with the emergence of social websites (e.g. Twitter, Facebook, etc.). Several studies addressed sentiment analysis for Arabic language using various techniques. The most efficient techniques according to the literature were the machine learning due to their capabilities to build a training model. Yet, there is still issues facing the Arabic sentiment analysis using machine learning techniques. Such issues are related to employing robust features that have the ability to discrimina
... Show MoreIn this paper we shall generalize fifth explicit Runge-Kutta Feldberg(ERKF(5)) and Continuous explicit Runge-Kutta (CERK) method using shooting method to solve second order boundary value problem which can be reduced to order one.These methods we shall call them as shooting Continuous Explicit Runge-Kutta method, the results are computed using matlab program.
In this research, the results of the Integral breadth method were used to analyze the X-ray lines to determine the crystallite size and lattice strain of the zirconium oxide nanoparticles and the value of the crystal size was equal to (8.2nm) and the lattice strain (0.001955), and then the results were compared with three other methods, which are the Scherer and Scherer dynamical diffraction theory and two formulas of the Scherer and Wilson method.the results were as followsScherer crystallite size(7.4nm)and lattice strain(0.011968),Schererdynamic method crystallite size(7.5 nm),Scherrer and Wilson methodcrystallite size( 8.5nm) and lattice strain( 0.001919).And using another formula for Schearer and Wilson methodwe obtain the size of the c
... Show MoreIn this paper, we study the growth of solutions of the second order linear complex differential equations insuring that any nontrivial solutions are of infinite order. It is assumed that the coefficients satisfy the extremal condition for Yang’s inequality and the extremal condition for Denjoy’s conjecture. The other condition is that one of the coefficients itself is a solution of the differential equation .
The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.