Share Your Research, Maximize Your Social Impacts
GENERALIZATIONS OF BERNSTEIN POLYNOMIALS IN PROBLEMS OF MULTIOBJECTIVE OPTIMIZATION
Journal: Science and world (Vol.1, No. 6)Publication Date: 2014-02-28
Authors : Zakharov V.V.; Kravtsov A.M.; Priymenko S.A.;
Page : 38-40
Keywords : Bernstein polynomials; optimization algorithms; parallel programming.;
Source : Download Find it from : Google Scholar
- GENERALIZATIONS OF BERNSTEIN POLYNOMIALS IN PROBLEMS OF MULTIOBJECTIVE OPTIMIZATION
- A collocation method for linear integral equations in terms of the generalized Bernstein polynomials
- A numerical method for solutions of pantograph type differential equations with variable coefficients using Bernstein polynomials
- A new algorithm for the numerical solution of the first order nonlinear differential equations with the mixed non-linear conditions by using bernstein polynomials
- Numerical solution of mixed Volterra-Fredholm integral equations using iterative method via two-variables Bernstein polynomials
Abstract
The algorithm for approximate solution of the problem of multiobjective optimization based on the presenting objective functions and constraint functions on functions by functions of a special kind ? continual predicates is suggested. The presentations are constructed by means of function approximation with generalizations of Bernstein polynomials. The computer implementation of the algorithm is focused on the use of parallel and vector computations.
Other Latest Articles
- THE NEW METHOD OF FINDING THE PARTIAL SUM OF POWERS OF NATURAL NUMBERS
- TEACHING THE ROTATION OF VECTOR FIELD USING DIFFERENT PHYSICOMATHEMATICAL PROBLEMS
- METHODS OF DEVELOPMENT OF THE BIOTECHNOLOGY DIRECTION AT SCHOOL
- CALCULATION OF THE LIMITING DRYNESS FRACTION AT THE END OF EVAPORATING SURFACE OF STEAM BOILER
- CREEPING FLOW OF A VISCOUS INCOMPRESSIBLE FLUID INSIDE THE CONE
Last modified: 2014-08-05 15:07:38