The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).
This paper is dealing with non-polynomial spline functions "generalized spline" to find the approximate solution of linear Volterra integro-differential equations of the second kind and extension of this work to solve system of linear Volterra integro-differential equations. The performance of generalized spline functions are illustrated in test examples
In this paper we use non-polynomial spline functions to develop numerical methods to approximate the solution of 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of these method, and to compare the computed results with other known methods.
This work is devoted to define new generalized gamma and beta functions involving the recently suggested seven-parameter Mittag-Leffler function, followed by a review of all related special cases. In addition, necessary investigations are affirmed for the new generalized beta function, including, Mellin transform, differential formulas, integral representations, and essential summation relations. Furthermore, crucial statistical application has been realized for the new generalized beta function.
In this paper, we focus on designing feed forward neural network (FFNN) for solving Mixed Volterra – Fredholm Integral Equations (MVFIEs) of second kind in 2–dimensions. in our method, we present a multi – layers model consisting of a hidden layer which has five hidden units (neurons) and one linear output unit. Transfer function (Log – sigmoid) and training algorithm (Levenberg – Marquardt) are used as a sigmoid activation of each unit. A comparison between the results of numerical experiment and the analytic solution of some examples has been carried out in order to justify the efficiency and the accuracy of our method.
... Show More
The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
The research aims to apply one of the techniques of management accounting, which is the Quality Function Deployment(QFD) on the Pepsi product in Baghdad Soft Drinks Company and to determine the technical requirements objectively that have been applied in practice in Baghdad Soft Drinks Company / a private shareholding company, as it focuses on meeting the quality requirements and achieving positive quality to provide a product It meets the requirements of current and future customers, hence the importance of research that indicates that the Quality Function Deployment(QFD) is a useful tool to develop the requirements of new products, being a design process driven by customers through their voices, and thus contribute to achieve a competi
... Show More