The method of operational matrices based on different types of polynomials such as Bernstein, shifted Legendre and Bernoulli polynomials will be presented and implemented to solve the nonlinear Blasius equations approximately. The nonlinear differential equation will be converted into a system of nonlinear algebraic equations that can be solved using Mathematica®12. The efficiency of these methods has been studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as the polynomial degree (n) increases, since the errors decrease. Moreover, the approximate solutions obtained by the proposed methods are compared with the solution of the 4th order Runge-Kutta method (RK4), which gives very good agreement. In addition, the convergence of the proposed approximate methods is given based on one of the Banach fixed point theorem results.
In this paper, our aim is to solve analytically a nonlinear social epidemic model as an initial value problem (IVP) of ordinary differential equations. The mathematical social epidemic model under study is applied to alcohol consumption model in Spain. The economic cost of alcohol consumption in Spain is affected by the amount of alcohol consumed. This paper refers to the study of alcohol consumption using some analytical methods. Adomian decomposition and variation iteration methods for solving alcohol consumption model have used. Finally, a compression between the analytic solutions of the two used methods and the previous actual values from 1997 to 2007 years is obtained using the absolute and
... Show MoreThe aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.
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
... Show MoreIn 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.
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.
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.
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).