This paper investigates an effective computational method (ECM) based on the standard polynomials used to solve some nonlinear initial and boundary value problems appeared in engineering and applied sciences. Moreover, the effective computational methods in this paper were improved by suitable orthogonal base functions, especially the Chebyshev, Bernoulli, and Laguerre polynomials, to obtain novel approximate solutions for some nonlinear problems. These base functions enable the nonlinear problem to be effectively converted into a nonlinear algebraic system of equations, which are then solved using Mathematica^®12. The improved effective computational methods (I-ECMs) have been implemented to solve three applications involving

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.

     The work in this paper focuses on solving numerically and analytically a  nonlinear social epidemic model that represents an initial value problem  of ordinary differential equations. A recent moking habit model from Spain is applied and studied here. The accuracy and convergence of the numerical and approximation results are investigated for various methods; for example, Adomian decomposition, variation iteration, Finite difference and Runge-Kutta. The discussion of the present results has been tabulated and graphed. Finally, the comparison between the analytic and numerical solutions from the period 2006-2009 has been obtained by absolute and difference measure error.

In this paper, Touchard polynomials (TPs) are presented for solving Linear Volterra integral equations of the second kind (LVIEs-2k) and the first kind (LVIEs-1k) besides, the singular kernel type of this equation. Illustrative examples show the efficiency of the presented method, and the approximate numerical (AN) solutions are compared with one another method in some examples. All calculations and graphs are performed by program MATLAB2018b.

Some modified techniques are used in this article in order to have approximate solutions for systems of Volterra integro-differential equations. The suggested techniques are the so called Laplace-Adomian decomposition method and Laplace iterative method. The proposed methods are robust and accurate as can be seen from the given illustrative examples and from the comparison that are made with the exact solution.

     The idea of the paper is to consolidate Mahgoub transform and variational iteration method (MTVIM) to solve fractional delay differential equations (FDDEs). The fractional derivative was in Caputo sense. The convergences of approximate solutions to exact solution were quick. The MTVIM is characterized by ease of application in various problems and is capable of simplifying the size of computational operations.  Several non-linear (FDDEs) were analytically solved as illustrative examples and the results were compared numerically. The results for accentuating the efficiency, performance, and activity of suggested method were shown by comparisons with Adomian Decomposition Method (ADM), Laplace Adomian Decompos

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