In this paper, double Sumudu and double Elzaki transforms methods are used to compute the numerical solutions for some types of fractional order partial differential equations with constant coefficients and explaining the efficiently of the method by illustrating some numerical examples that are computed by using  Mathcad 15.and graphic in Matlab R2015a.

This paper is dealing with non-polynomial spline functions "generalized spline" to find the approximate solution of linear Volterra integro-differential equations of the second kind and extension of this work to solve system of linear Volterra integro-differential equations. The performance of generalized spline functions are illustrated in test examples

This paper presents a newly developed method with new algorithms to find the numerical solution of nth-order state-space equations (SSE) of linear continuous-time control system by using block method. The algorithms have been written in Matlab language. The state-space equation is the modern representation to the analysis of continuous-time system. It was treated numerically to the single-input-single-output (SISO) systems as well as multiple-input-multiple-output (MIMO) systems by using fourth-order-six-steps block method. We show that it is possible to find the output values of the state-space method using block method. Comparison between the numerical and exact results has been given for some numerical examples for solving different type

The aim of this paper is to present the numerical method for solving linear system of Fredholm integral equations, based on the Haar wavelet approach. Many test problems, for which the exact solution is known, are considered. Compare the results of suggested method with the results of another method (Trapezoidal method). Algorithm and program is written by Matlab vergion 7.

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.

In this paper, a new analytical method is introduced to find the general solution of linear partial differential equations. In this method, each Laplace transform (LT) and Sumudu transform (ST) is used independently along with canonical coordinates. The strength of this method is that it is easy to implement and does not require initial conditions.

  This work discusses the beginning of fractional calculus and how the Sumudu and Elzaki transforms are applied to fractional derivatives. This approach combines a double Sumudu-Elzaki transform strategy to discover analytic solutions to space-time fractional partial differential equations in Mittag-Leffler functions subject to initial and boundary conditions. Where this method gets closer and closer to the correct answer, and the technique's efficacy is demonstrated using numerical examples performed with Matlab R2015a.

This paper introduces the Multistep Modified Reduced Differential Transform Method (MMRDTM). It is applied to approximate the solution for Nonlinear Schrodinger Equations (NLSEs) of power law nonlinearity. The proposed method has some advantages. An analytical approximation can be generated in a fast converging series by applying the proposed approach. On top of that, the number of computed terms is also significantly reduced. Compared to the RDTM, the nonlinear term in this method is replaced by related Adomian polynomials prior to the implementation of a multistep approach. As a consequence, only a smaller number of NLSE computed terms are required in the attained approximation. Moreover, the approximation also converges rapidly over a

The basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.