In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.
The aim of this paper is to present a method for solving third order ordinary differential equations with two point boundary condition , we propose two-point osculatory interpolation to construct polynomial solution. The original problem is concerned using two-points osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by compared with conventional method .
Corrosion behavior of aluminum alloy 7025 was investigated in hydrochloric acid (pH=1) containing 0.6 mol.dm-3 NaCl in the existence and absence of diverse concentrations of sulphamethoxazole as environmentally friendly corrosion inhibitor over the temperature range (298-313)K. Electrochemical polarization method using potentiostatic technique was employed. The inhibition efficiency has been raised with increased sulphamethoxazole concentration but lessened at temperature increases. The highest efficiency value was 96.5 at 298 K and 2 x10-4 mol.dm-3 concentration of sulphamethoxazole. The sulphamethoxazole adsorption was agreed with Langmuir adsorption isotherm. Some thermodynamic parameter (△Gads) and activation energy (Ea) were determin
... Show MoreThe inverse kinematics of redundant manipulators has infinite solutions by using conventional methods, so that, this work presents applicability of intelligent tool (artificial neural network ANN) for finding one desired solution from these solutions. The inverse analysis and trajectory planning of a three link redundant planar robot have been studied in this work using a proposed dual neural networks model (DNNM), which shows a predictable time decreasing in the training session. The effect of the number of the training sets on the DNNM output and the number of NN layers have been studied. Several trajectories have been implemented using point to point trajectory planning algorithm with DNNM and the result shows good accuracy of the end
... Show MoreThis 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
... Show MoreMCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with order
... Show MoreBased 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.
Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app
... Show More