The focus of this article is to add a new class of rank one of  modified Quasi-Newton techniques to solve the problem of unconstrained optimization by updating the inverse Hessian matrix with an update of rank 1, where a diagonal matrix is the first component of the next inverse Hessian approximation, The inverse Hessian matrix is  generated by the method proposed which is symmetric and it satisfies the condition of modified quasi-Newton, so the global convergence is retained. In addition, it is positive definite that  guarantees the existence of the minimizer at every iteration of the objective function. We use  the program MATLAB to solve an algorithm function to introduce the feasibility of

    In this paper generalized spline method is used for solving linear system of fractional integro-differential equation approximately. The suggested method reduces the system to system of  linear algebraic equations. Different orders of fractional derivative for test example is given in this paper to show the accuracy and applicability of the presented method.

Background: Gliomas are brain tumours of supporting tissue of the brain. The management of low grade glioma is still a great debate ranges from just follow up to extensive surgery followed by DXT, with or without chemothery.
Patients and Methods: 282 patients taken from neuro-surgical hospital between 1980-1990, divided to 3 groups with different modality of management & follow up for 15 years.
Results: the five years survival and symptomatic improvement was higher in the group managed by extensive surgery and DXT with or without cytoxic drugs followed by group managed by biopsy and DXT with or without cytoxic.
Conclusion: management of low grade glioma symptoms & out come (survival) is best by extensive surgery & DX

     This 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

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