In this work, an analytical approximation solution is presented, as well as a comparison of the Variational Iteration Adomian Decomposition Method (VIADM) and the Modified Sumudu Transform Adomian Decomposition Method (M STADM), both of which are capable of solving nonlinear partial differential equations (NPDEs) such as nonhomogeneous Kertewege-de Vries (kdv) problems and the nonlinear Klein-Gordon. The results demonstrate the solution’s dependability and excellent accuracy.

In this work, we are concerned with how to find an explicit approximate solution (AS) for the telegraph equation of space-fractional order (TESFO) using Sumudu transform method (STM). In this method, the space-fractional order derivatives are defined in the Caputo idea. The Sumudu method (SM) is established to be reliable and accurate. Three examples are discussed to check the applicability and the simplicity of this method. Finally, the Numerical results are tabulated and displayed graphically whenever possible to make comparisons between the AS and exact solution (ES).

The aim of this paper is adopted to give an approximate solution for advection dispersion equation of time fractional order derivative by using the Chebyshev wavelets-Galerkin Method . The Chebyshev wavelet and Galerkin method properties are presented. This technique is used to convert the problem into the solution of linear algebraic equations. The fractional derivatives are described based on the Caputo sense. Illustrative examples are included to demonstrate the validity and applicability of the proposed technique.

An efficient combination of Adomian Decomposition iterative technique coupled with Laplace transformation to solve non-linear Random Integro differential equation (NRIDE) is introduced in a novel way to get an accurate analytical solution. This technique is an elegant combination of theLaplace transform, and the Adomian polynomial. The suggested method will convert differential equations into iterative algebraic equations, thus reducing processing and analytical work. The technique solves the problem of calculating the Adomian polynomials. The method’s efficiency was investigated using some numerical instances, and the findings demonstrate that it is easier to use than many other numerical procedures. It has also been established that (LT

     In this paper, we studied the travelling wave solving for some models of Burger's equations. We used sine-cosine method to solution nonlinear equation and we used direct solution after getting travelling wave equation.

We present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.

This study relates to  the estimation of  a simultaneous equations system for the Tobit model where the dependent variables  ( )  are limited, and this will affect the method to choose the good estimator. So, we will use new estimations methods  different from the classical methods, which if used in such a case, will produce biased and inconsistent estimators which is (Nelson-Olson) method  and  Two- Stage limited dependent variables(2SLDV) method  to get of estimators that hold characteristics the good estimator .

That is , parameters will be estim

A non-polynomial spline (NPS) is an approximation method that relies on the triangular and polynomial parts, so the method has infinite derivatives of the triangular part of the NPS to compensate for the loss of smoothness inherited by the polynomial. In this paper, we propose polynomial-free linear and quadratic spline types to solve fuzzy Volterra integral equations (FVIE) of the 2nd kind with the weakly singular kernel (FVIEWSK) and Abel's type kernel. The linear type algorithm gives four parameters to form a linear spline. In comparison, the quadratic type algorithm gives five parameters to create a quadratic spline, which is more of a credit for the exact solution. These algorithms process kernel singularities with a simple techniqu