In this work, we will combine the Laplace transform method with the Adomian decomposition method and modified Adomian decomposition method for semi-analytic treatments of the nonlinear integro-fractional differential equations of the Volterra-Hammerstein type with difference kernel and such a problem which the kernel has a first order simple degenerate kind which the higher-multi fractional derivative is described in the Caputo sense. In these methods, the solution of a functional equation is considered as the sum of infinite series of components after applying the inverse of Laplace transformation usually converging to the solution, where a closed form solution is not obtainable, a truncated number of terms is usually used for numerical

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.

       In this paper, we apply a new technique combined by a Sumudu transform and iterative method called the Sumudu iterative method for resolving non-linear partial differential equations to compute analytic solutions. The aim of this paper is to construct the efficacious frequent relation to resolve these problems. The suggested technique is tested on four problems. So the results of this study are debated to show how useful this method is in terms of being a powerful, accurate and fast tool with a little effort compared to other iterative methods.

This paper is attempt to study the nonlinear second order delay multi-value problems. We want to say that the properties of such kind of problems are the same as the properties of those with out delay just more technically involved. Our results discuss several known properties, introduce some notations and definitions. We also give an approximate solution to the coined problems using the Galerkin's method.

In this article, the numerical and approximate solutions for the nonlinear differential equation systems, represented by the epidemic SIR model, are determined. The effective iterative methods, namely the Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM), and the Banach contraction method (BCM), are used to obtain the approximate solutions. The results showed many advantages over other iterative methods, such as Adomian decomposition method (ADM) and the variation iteration method (VIM) which were applied to the non-linear terms of the Adomian polynomial and the Lagrange multiplier, respectively. Furthermore, numerical solutions were obtained by using the fourth-orde Runge-Kutta (RK4), where the maximum remaining errors showed th

In this paper, we deal with the problem of general matching of two images one of them has experienced geometrical transformations, to find the correspondence between two images. We develop the invariant moments for traditional techniques (moments of inertia) with new approach to enhance the performance for these methods. We test various projections directional moments, to extract the difference between Block Distance Moment (BDM) and evaluate their reliability. Three adaptive strategies are shown for projections directional moments, that are raster (vertical and horizontal) projection, Fan-Bean projection and new projection procedure that is the square projection method. Our paper started with the description of a new algorithm that is low

In this paper, cubic trigonometric spline is used to solve nonlinear Volterra integral equations of second kind. Examples are illustrated to show the presented method’s efficiency and convenience.

The approximate solution of a nonlinear parabolic boundary value problem with variable coefficients (NLPBVPVC) is found by using mixed Galekin finite element method (GFEM) in space variable with Crank Nicolson (C-N) scheme in time variable. The problem is reduced to solve a Galerkin nonlinear algebraic system (NLAS), which is solved by applying the predictor and the corrector method (PCM), which transforms the NLAS into a Galerkin linear algebraic system (LAS). This LAS is solved once using the Cholesky technique (CHT) as it appears in the MATLAB package and once again using the General Cholesky Reduction Order Technique (GCHROT), the GCHROT is employed here at first time to play an important role for saving a massive time. Illustrative

In this paper , an efficient new procedure is proposed to modify third –order iterative method obtained by Rostom and Fuad [Saeed. R. K. and Khthr. F.W. New third –order iterative method for solving nonlinear equations. J. Appl. Sci .7(2011): 916-921] , using three steps based on Newton equation , finite difference method and linear interpolation. Analysis of convergence is given to show the efficiency and the performance of the new method for solving nonlinear equations. The efficiency of the new method is demonstrated by numerical examples.