This 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.

Let  be an n-Banach space, M be a nonempty closed convex subset of , and S:M→M be a mapping that belongs to the class  mapping. The purpose of this paper is to study the stability and data dependence results of a Mann iteration scheme on n-Banach space

In this work, the classical continuous mixed optimal control vector (CCMOPCV) problem of couple nonlinear partial differential equations of parabolic (CNLPPDEs) type with state constraints (STCO) is studied. The existence and uniqueness theorem (EXUNTh) of the state vector solution (SVES) of the CNLPPDEs for a given CCMCV is demonstrated via the method of Galerkin (MGA). The EXUNTh of the CCMOPCV ruled with the CNLPPDEs is proved. The Frechet derivative (FÉDE) is obtained. Finally, both the necessary and the sufficient theorem conditions for optimality (NOPC and SOPC) of the CCMOPCV with state constraints (STCOs) are proved through using the Kuhn-Tucker-Lagrange (KUTULA) multipliers theorem (KUTULATH).

The numerical resolve nonlinear system of Volterra integral equation of the second kind (NLSVIEK2) has been considered. The exponential function is used as the base function of the collocation method to approximate the resolve of the problem. Arithmetic epitome are performed which have already been solved by weighted residual manner,  Taylor manner and block- by- block(2, 3, 5).

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.

In 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 .

In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.

Let Y be a"uniformly convex n-Banach space, M be a nonempty closed convex subset of Y, and S:M→M be adnonexpansive mapping. The purpose of this paper is to study some properties of uniform convex set that help us to develop iteration techniques for1approximationjof"fixed point of nonlinear mapping by using the Mann iteration processes in n-Banachlspace.