This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

The method of solving volterra integral equation by using numerical solution is a simple operation but to require many memory space to compute and save the operation. The importance of this equation appeares new direction to solve the equation by using new methods to avoid obstacles. One of these methods employ neural network for obtaining the solution.

This paper presents a proposed method by using cascade-forward neural network to simulate volterra integral equations solutions. This method depends on training cascade-forward neural network by inputs which represent the mean of volterra integral equations solutions, the target of cascade-forward neural network is to get the desired output of this network. Cascade-forward neural

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

In this paper the Galerkin method is used to prove the existence and uniqueness theorem for the solution of the state vector of the triple linear elliptic partial differential equations for fixed continuous classical optimal control vector. Also, the existence theorem of a continuous classical optimal control vector related with the triple linear equations of elliptic types is proved. The existence of a unique solution for the triple adjoint equations related with the considered triple of the state equations is studied. The Fréchet derivative of the cost function is derived. Finally the theorem of necessary conditions for optimality of the considered problem is proved.

Abstract:
This investigation was carried out to study the nutritional adequacy for
infant milk formula, which imported by Iraqi Ministry of Trade, and are
available in local markets .Most of these formulas contained nearly the same
composition of nutrients which are ,Matines ,Sunny Boy , Salsabeel AL- Badie
,Moroug, ,Charton ,Materna Lery Celia ,Lacstar Lailac,Nactalia. yet they are
unbalanced for providing the daily nutritional requirements for infants whom
depend on bottle feeding for six times daily in their first six month of age. As
there were an increase in daily intake for protein content and most vitamins
that included D, E, C, B1, B2, Niacin, B6, B12, and Biotin as well as most
minerals namely Calci

Simulated annealing (SA) has been an effective means that can address difficulties related to optimization problems. is now a common discipline for research with several productive applications such as production planning. Due to the fact that aggregate production planning (APP) is one of the most considerable problems in production planning, in this paper, we present multi-objective linear programming model for APP and optimized by . During the course of optimizing for the APP problem, it uncovered that the capability of was inadequate and its performance was substandard, particularly for a sizable controlled problem with many decision variables and plenty of constraints. Since this algorithm works sequentially then the current state wi