Results 31 to 40 of about 564,269 (235)

Generalized Bernstein-Chlodowsky Polynomials

Rocky Mountain Journal of Mathematics, 1998
For given positive integers \(n\) and \(m\), the generalization of Bernstein-Chlodowsky polynomials is defined by \[ B_{n,m}(f,x)= \Biggl( 1+(m-1) \frac{x}{b_n} \Biggr) \sum_{k=0}^{[n/m]} f\Biggl( \frac{b_nk} {n-(m-1)k}\Biggr) C_{n-(m-1)k}^k \Biggl( \frac{x}{b_n} \Biggr)^k \Biggl(1- \frac{x}{b_n} \Biggr)^{n-mk}, \] where \(b_n\) is a sequence of ...
Gadjiev, A.D., Efendiev, R.O., Ibikli, E.   +2 more
openaire   +3 more sources

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

Circular Bernstein polynomial distributions [PDF]

, 2010
This paper introduces a new non-parametric approach to the modeling of circular data, based on the use of Bernstein polynomial densities which generalizes the standard Bernstein polynomial model to account for the specific characteristics of circular ...
Ausín Olivera, María Concepción, Carnicero, José Antonio, Wiper, Michael Peter   +2 more
core   +4 more sources

Subresultants in multiple roots: an extremal case [PDF]

, 2017
We provide explicit formulae for the coefficients of the order-d polynomial subresultant of (x-\alpha)^m and (x-\beta)^n with respect to the set of Bernstein polynomials \{(x-\alpha)^j(x-\beta)^{d-j}, \, 0\le j\le d\}.
A. Bostan, A. Szanto, Andrews, Andrews, Apéry, Beckermann, C. D'Andrea, D'Andrea, D'Andrea, D'Andrea, D'Andrea, Hong, Jacobi, Krick, Lascoux, M. Valdettaro, Ma, Mishra, Ostrowski, Pfaff, Poisson, Roy, Saalschütz, Slater, Sylvester, Sylvester, Sylvester, Sylvester, T. Krick, von zur Gathen   +29 more
core   +5 more sources

Numerical Solution of Linear Volterra Integral Equation with Delay using Bernstein Polynomial

International Electronic Journal of Mathematics Education, 2019
Bernstein polynomial is one of the most valuable and attractive method used to develop numerical solution for several complex models because of its robustness to demonstrate approximation for anonymous equations.
Adhra’a M. Muhammad, A. Ayal
semanticscholar   +1 more source

Approximation by the modified $ \lambda $-Bernstein-polynomial in terms of basis function

AIMS Mathematics
In this article by means of shifted knots properties, we introduce a new type of coupled Bernstein operators for Bézier basis functions. First, we construct the operators based on shifted knots properties of Bézier basis functions then investigate the ...
Mohammad Ayman-Mursaleen, M. Nasiruzzaman, Nadeem Rao, Mohammad Dilshad, K. Nisar   +4 more
semanticscholar   +1 more source

Applications of mixed finite element method based on Bernstein polynomials in numerical solution of Stokes equations

AIMS Mathematics
The Stokes equation is fundamental in fluid mechanics. We used bivariate Bernstein polynomial bases to construct the function space for mixed finite element methods to solve the 2D Stokes equation.
Lanyin Sun, Siya Wen
doaj   +1 more source

Approximate Solution of Fractional Integro-Differential Equations by Using Bernstein Polynomials [PDF]

Engineering and Technology Journal, 2012
In this paper, Bernstein piecewise polynomial is used to approximate the solution of the fractional integro-differential equations, in which the fractional derivative is described in the (Caputo) sense. Examples are considered to verify the effectiveness
Osama H. Mohammed, Sarmad A. Altaie
doaj   +1 more source

On Bernstein’s inequality for polynomials [PDF]

Analysis and Mathematical Physics, 2019
Bernstein's classical inequality asserts that given a trigonometric polynomial $T$ of degree $n\geq1$, the sup-norm of the derivative of $T$ does not exceed $n$ times the sup-norm of $T$. We present various approaches to prove this inequality and some of its natural extensions/variants, especially when it comes to replacing the sup-norm with the $L^p ...
Queffélec, Hervé, Zarouf, Rachid
openaire   +4 more sources

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