In this article, we investigate the heat transfer on nanoparticles Jeffrey Hamel flow problem between two rigid plane walls. Water is used as a main fluid using four different types of nanoparticles, namely aluminum, cuprous, titanium, and silver. The results of nonlinear transformational equations with boundary conditions are solved analytically and numerically. The perturbation iteration scheme (PIS) is used for the analytic solution, while for determining the numerical results, the Rang-Kutta of the four-order scheme (RK4S) is used. The effects on the behavior of non-dimensional velocity and temperature distributions are presented in the form of tables and graphs for different values of emerging physical parameters (Reynolds number, Prandtl number, Eckert number and open angles).The solid component of nanoparticles has an influence on the heat transfer and flow characteristics that is more visible when compared to other types of particles. The temperature distribution increases with the increase of the Reynolds number, Bruntel number, Eckert number, but the velocity distribution decreases with the increase of the Reynolds number. Finally, the obtained findings demonstrate PIS efficacy, accuracy, and convenience in solving the problem of nanofluid flow.
This research introduce a study with application on Principal Component Regression obtained from some of the explainatory variables to limitate Multicollinearity problem among these variables and gain staibilty in their estimations more than those which yield from Ordinary Least Squares. But the cost that we pay in the other hand losing a little power of the estimation of the predictive regression function in explaining the essential variations. A suggested numerical formula has been proposed and applied by the researchers as optimal solution, and vererifing the its efficiency by a program written by the researchers themselves for this porpuse through some creterions: Cumulative Percentage Variance, Coefficient of Determination, Variance
... Show MoreIn this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin
... Show MoreIn this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
In this paper we introduce many different Methods of ridge regression to solve multicollinearity problem in linear regression model. These Methods include two types of ordinary ridge regression (ORR1), (ORR2) according to the choice of ridge parameter as well as generalized ridge regression (GRR). These methods were applied on a dataset suffers from a high degree of multicollinearity, then according to the criterion of mean square error (MSE) and coefficient of determination (R2) it was found that (GRR) method performs better than the other two methods.
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,
... Show MoreIn this paper, the problem of developing turbulent flow in rectangular duct is investigated by obtaining numerical results of the velocity profiles in duct by using large eddy simulation model in two dimensions with different Reynolds numbers, filter equations and mesh sizes. Reynolds numbers range from (11,000) to (110,000) for velocities (1 m/sec) to (50 m/sec) with (56×56), (76×76) and (96×96) mesh sizes with different filter equations. The numerical results of the large eddy simulation model are compared with k-ε model and analytic velocity distribution and validated with experimental data of other researcher. The large eddy simulation model has a good agreement with experimental data for high Reynolds number with the first, seco
... Show MoreNowadays, the power plant is changing the power industry from a centralized and vertically integrated form into regional, competitive and functionally separate units. This is done with the future aims of increasing efficiency by better management and better employment of existing equipment and lower price of electricity to all types of customers while retaining a reliable system. This research is aimed to solve the optimal power flow (OPF) problem. The OPF is used to minimize the total generations fuel cost function. Optimal power flow may be single objective or multi objective function. In this thesis, an attempt is made to minimize the objective function with keeping the voltages magnitudes of all load buses, real outp
... Show MoreThe research tackled to solve Sudoku grid problem 9 ×9 , one of artificial intelligence problems. This problem has many of solutions in search space to generate Sudoku grid by using magic square of odd order as 3. This research concludes solution by proposed heuristic algorithm from magic square of odd order as 3 and no given numbers (from 1 to 9) in each cell of nine Sudoku grid cells in starting of problem solution, this is not similar the solution in old classic methods to generate all sub grids in Sudoku grid. The experimental results in this paper show the easily implementation to solve the problem to manage without manual method, additional to position of numbers (1, 2,..9) in center of each sub grid in Sudoku grid
... Show MoreThis study is dedicated to solving multicollinearity problem for the general linear model by using Ridge regression method. The basic formulation of this method and suggested forms for Ridge parameter is applied to the Gross Domestic Product data in Iraq. This data has normal distribution. The best linear regression model is obtained after solving multicollinearity problem with the suggesting of 10 k value.
A new spectrophotometric flow injection method has been establish for the determintaions of some catecholaminedrugs