The method of operational matrices is based on the Bernoulli and Shifted Legendre polynomials which is used to solve the Falkner-Skan equation. The nonlinear differential equation converting to a system of nonlinear equations is solved using Mathematica®12, and the approximate solutions are obtained. The efficiency of these methods was studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as increases. Moreover, the obtained approximate solutions are compared with the numerical solution obtained by the fourth-order Runge-Kutta method (RK4), which gives a good agreement.
The purpose of this research is to implement the orthogonal polynomials associated with operational matrices to get the approximate solutions for solving two-dimensional elliptic partial differential equations (E-PDEs) with mixed boundary conditions. The orthogonal polynomials are based on the Standard polynomial (
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.
Based on analyzing the properties of Bernstein polynomials, the extended orthonormal Bernstein polynomials, defined on the interval [0, 1] for n=7 is achieved. Another method for computing operational matrices of derivative and integration D_b and R_(n+1)^B respectively is presented. Also the result of the proposed method is compared with true answers to show the convergence and advantages of the new method.
In this paper, two meshless methods have been introduced to solve some nonlinear problems arising in engineering and applied sciences. These two methods include the operational matrix Bernstein polynomials and the operational matrix with Chebyshev polynomials. They provide an approximate solution by converting the nonlinear differential equation into a system of nonlinear algebraic equations, which is solved by using
In this paper, two meshless methods have been introduced to solve some nonlinear problems arising in engineering and applied sciences. These two methods include the operational matrix Bernstein polynomials and the operational matrix with Chebyshev polynomials. They provide an approximate solution by converting the nonlinear differential equation into a system of nonlinear algebraic equations, which is solved by using
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 the met
... 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.
In this paper the modified trapezoidal rule is presented for solving Volterra linear Integral Equations (V.I.E) of the second kind and we noticed that this procedure is effective in solving the equations. Two examples are given with their comparison tables to answer the validity of the procedure.