The goal of this study is to provide a new explicit iterative process method  approach for solving maximal monotone(M.M )operators in Hilbert spaces utilizing a finite family of different types of  mappings as( nonexpansive mappings,resolvent mappings and projection mappings. The findings given in this research strengthen and extend key previous findings in the literature. Then, utilizing various structural conditions in Hilbert space and variational inequality problems, we examine the strong convergence to nearest point projection for these explicit iterative process methods Under the presence of two important conditions for convergence, namely closure and convexity. The findings reported in this research strengthen and extend

     In this study, an efficient novel technique is presented to obtain a more accurate analytical solution to nonlinear pantograph differential equations. This technique combines the Adomian decomposition method (ADM) with the homotopy analysis method concepts (HAM). The whole integral part of HAM is used instead of an integral part of ADM approach to get higher accurate results. The main advantage of this technique is that it  gives a large and more extended convergent region of iterative approximate solutions for long time intervals that rapidly converge to the exact solution. Another advantage is capable of providing a continuous representation of the approximate solutions, which gives  better information over whole time interv

In this paper Volterra Runge-Kutta methods which include: method of order two and four will be applied to general nonlinear Volterra integral equations of the second kind. Moreover we study the convergent of the algorithms of Volterra Runge-Kutta methods. Finally, programs for each method are written in MATLAB language and a comparison between the two types has been made depending on the least square errors.

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.

Many numerical approaches have been suggested to solve nonlinear problems. In this paper, we suggest a new two-step iterative method for solving nonlinear equations. This iterative method has cubic convergence. Several numerical examples to illustrate the efficiency of this method by Comparison with other similar methods is given.

In this paper a modified approach have been used to find the approximate solution of ordinary delay differential equations with constant delay using the collocation method based on Bernstien polynomials.

     The goal of this research is to solve several one-dimensional partial differential equations in linear and nonlinear forms using a powerful approximate analytical approach. Many of these equations are difficult to find the exact solutions due to their governing equations. Therefore, examining and analyzing efficient approximate analytical approaches to treat these problems are required. In this work, the homotopy analysis method (HAM) is proposed. We use convergence control parameters to optimize the approximate solution. This method relay on choosing with complete freedom an auxiliary function linear operator and initial guess to generate the series solution. Moreover, the method gives a convenient way to guarantee the converge

In this paper, the computational method (CM) based on the standard polynomials has been implemented to solve some nonlinear differential equations arising in engineering and applied sciences. Moreover, novel computational methods have been developed in this study by orthogonal base functions, namely Hermite, Legendre, and Bernstein polynomials. The nonlinear problem is successfully converted into a nonlinear algebraic system of equations, which are then solved by Mathematica^®12. The developed computational methods (D-CMs) have been applied to solve three applications involving well-known nonlinear problems: the Darcy-Brinkman-Forchheimer equation, the Blasius equation, and the Falkner-Skan equation, and a comparison between t

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).