Results 31 to 40 of about 1,343 (179)

An approximation method for numerical solution of multi-dimensional feedback delay fractional optimal control problems by Bernstein polynomials [PDF]

Iranian Journal of Numerical Analysis and Optimization, 2014
In this paper we present a new method for solving fractional optimal control problems with delays in state and control. This method is based upon Bernstein polynomial basis and using feedback control.
Elahe Safaie, Mohammadhadi Farahi
doaj   +1 more source

An Enhanced Adaptive Bernstein Collocation Method for Solving Systems of ODEs

Mathematics, 2021
In this paper, we introduce two new methods to solve systems of ordinary differential equations. The first method is constituted of the generalized Bernstein functions, which are obtained by Bernstein polynomials, and operational matrix of ...
Ahmad Sami Bataineh, Osman Rasit Isik, Moa’ath Oqielat, Ishak Hashim   +3 more
doaj   +1 more source

Change of Basis Transformation from the Bernstein Polynomials to the Chebyshev Polynomials of the Fourth Kind

Mathematics, 2019
In this paper, the change of bases transformations between the Bernstein polynomial basis and the Chebyshev polynomial basis of the fourth kind are studied and the matrices of transformation among these bases are constructed. Some examples are given.
Abedallah Rababah, Esraa Hijazi
doaj   +1 more source

Point-wise estimates for the derivative of algebraic polynomials

Математичні Студії, 2021
We give a sufficient condition on coefficients $a_k$ of an algebraic polynomial $P(z)=\sum\limits_{k=0}^{n}a_kz^k$, $a_n\not=0,$ such that the pointwise Bernstein inequality $|P'(z)|\le n|P(z)|$ is true for all $z,\ |z|\le 1$.
A. V. Savchuk
doaj   +1 more source

Linear Optimization of Polynomial Rational Functions: Applications for Positivity Analysis

Mathematics, 2020
In this paper, we provide tight linear lower bounding functions for multivariate polynomials given over boxes. These functions are obtained by the expansion of polynomials into Bernstein basis and using the linear least squares function.
Tareq Hamadneh, Mohammed Ali, Hassan AL-Zoubi   +2 more
doaj   +1 more source

Sparse polynomial interpolation with Bernstein polynomials

TURKISH JOURNAL OF MATHEMATICS, 2021
Summary: We present an algorithm for interpolating an unknown univariate polynomial \(f\) that has a \(t\) sparse representation (\(t\ll\deg(f)\)) using Bernstein polynomials as term basis from \(2t\) evaluations. Our method is based on manipulating given black box polynomial for \(f\) so that we can make use of Prony's algorithm.
openaire   +4 more sources

Bernstein Polynomials

Mapana Journal of Sciences, 2021
Bernstein polynomials (aka, B-polys) have excellent properties allowing them to be used as basis functions in many applications of physics. In this paper, a brief tutorial description of their properties is given and then their use in obtaining B-polys, B-splines or Basis spline functions, Bezier curves and ODE solution curves, is computationally ...
openaire   +1 more source

On the F-Bernstein Polynomials

Ukrainian Mathematical Journal
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erdem, Alper, Dişkaya, Orhan, Menken, Hamza   +2 more
openaire   +2 more sources

Correction to: On Bernstein’s inequality for polynomials [PDF]

Analysis and Mathematical Physics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Queffélec, H., Zarouf, R.
openaire   +1 more source

Multi-threshold algorithm about image segmentation based on polynomial uniform approximation

Tongxin xuebao, 2016
Aiming at those shortcomings of previous multi-threshold image segmentation algorithm such as large complexity and instability caused by the image histogram glitch interference,a new multi-threshold image segmentation algorithm was proposed using ...
Yan-jun WEI, Bo-qin FENG, Wei-guo WU
doaj   +2 more sources