This paper devoted to the analysis of regular singular initial value problems for ordinary differential equations with a singularity of the first kind , we propose semi - analytic technique using two point osculatory interpolation to construct polynomial solution, and discussion behavior of the solution in the neighborhood of the regular singular points and its numerical approximation, two examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.

     This paper develop conventional Runge-Kutta methods of order four and order five to solve ordinary differential equations with oscillating solutions. The new modified Runge-Kutta methods (MRK) contain the invalidation of phase lag, phase lag’s derivatives, and amplification error. Numerical tests from their outcomes show the robustness and competence of the new methods compared to the well-known Runge-Kutta methods in the scientific literature.

In this paper, we deal with games of fuzzy payoffs problem while there is uncertainty in data. We use the trapezoidal membership function to transform the data into fuzzy numbers and utilize the three different ranking function algorithms. Then we compare between these three ranking algorithms by using trapezoidal fuzzy numbers for the decision maker to get the best gains

An advertisement is a form of communication intended to promote the sale of a product or service, influence public opinion, gain political support, or to elicit some other response. It consists of various type, including style, target audience, geographic scope, medium, or purpose. An advertisement should catch a person's attention and quickly create a memorable impression. The main aim of the present paper is to investigate the phonological problems of translating English international TV advertisements into Arabic. It deals with the most common and popular TV advertisements. The importance of such advertisements lies not in its information content rather than in the achievement of the desired impact on the receivers. When translating such

This paper presents the matrix completion problem for image denoising. Three problems based on matrix norm are performing: Spectral norm minimization problem (SNP), Nuclear norm minimization problem (NNP), and Weighted nuclear norm minimization problem (WNNP). In general, images representing by a matrix this matrix contains the information of the image, some information is irrelevant or unfavorable, so to overcome this unwanted information in the image matrix, information completion is used to comperes the matrix and remove this unwanted information. The unwanted information is handled by defining {0,1}-operator under some threshold. Applying this operator on a given ma

The purpose of this paper is to solve the stochastic demand for the unbalanced transport problem using heuristic algorithms to obtain the optimum solution, by minimizing the costs of transporting the gasoline product for the Oil Products Distribution Company of the Iraqi Ministry of Oil. The most important conclusions that were reached are the results prove the possibility of solving the random transportation problem when the demand is uncertain by the stochastic programming model. The most obvious finding to emerge from this work is that the genetic algorithm was able to address the problems of unbalanced transport, And the possibility of applying the model approved by the oil products distribution company in the Iraqi Ministry of Oil to m

  This paper studies the existence of  positive solutions for the following boundary value problem :-
 
 y(b) 0 α y(a) - β y(a) 0     bta             f(y) g(t) λy    
 
 
The solution procedure follows using the Fixed point theorem and obtains that this problem has at least one positive solution .Also,it determines (  ) Eigenvalue which would be needed to find the positive solution .

DBN Rashid, IMPAT: International Journal of Research in Humanities, Arts, and Literature, 2016 - Cited by 5

Among a variety of approaches introduced in the literature to establish duality theory, Fenchel duality was of great importance in convex analysis and optimization. In this paper we establish some conditions to obtain classical strong Fenchel duality for evenly convex optimization problems defined in infinite dimensional spaces. The objective function of the primal problem is a family of (possible) infinite even convex functions. The strong duality conditions we present are based on the consideration of the epigraphs of the c-conjugate of the dual objective functions and the ε-c-subdifferential of the primal objective functions.

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric