Results 171 to 180 of about 564,269 (235)
Some of the next articles are maybe not open access.

On Generalized Bernstein Polynomials

SIAM Journal on Mathematical Analysis, 1974
The generalized Bernstein polynomials of Jakimovski and Leviatan and the generalized Euler summability method of Wood are considered in the general context of Gronwall-like transformations. It is shown under general circumstances that, for bounded sequences, generalized Euler summability is equivalent to Euler summability.
Bustoz, J., Groetsch, C. W.
openaire   +1 more source

BeBOT: Bernstein Polynomial Toolkit for Trajectory Generation

IEEE/RJS International Conference on Intelligent RObots and Systems, 2019
We present a method and an open-source implementation (BeBOT) for the generation of trajectories for autonomous system operations using Bernstein polynomials.
Calvin Kielas-Jensen, V. Cichella
semanticscholar   +1 more source

Tensor product q-Bernstein polynomials

BIT Numerical Mathematics, 2008
Given a real number \(q>0\), \(q\)-Bernstein polynomials are a generalization, in the spirit of \(q\)-calculus, of the classical Bernstein polynomials (which can be obtained for \(q=1\)) where some of the integers in the definition of the classical ones are substituted by \(q\)-integers.
Dişibüyük, Çetin, Oruç, Halil
openaire   +2 more sources

Random Bernstein Polynomials

Scandinavian Journal of Statistics, 1999
Random Bernstein polynomials which are also probability distribution functions on the closed unit interval are studied. The probability law of a Bernstein polynomial so defined provides a novel prior on the space of distribution functions on [0, 1] which has full support and can easily select absolutely continuous distribution functions with a ...
openaire   +3 more sources

Kantorovich-Bernstein polynomials

Constructive Approximation, 1990
The authors unify the saturation and direct-converse theorems for a steady rate of convergence in \(L_ p[0,1 ...
Ditzian, Zeev, Zhou, Xinlong
openaire   +1 more source

Bernstein Polynomial and Tjurina Number

Geometriae Dedicata, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. Hertling, C. Stahlke
semanticscholar   +4 more sources

Approximation by Bernstein Polynomials

American Journal of Mathematics, 1994
Let \[ B_ n(f; x)= \sum^ n_{k=0} f\left({k\over n}\right)\left(\begin{smallmatrix} n\\ k\end{smallmatrix}\right) x^ k(1-x)^{n- k} \] and \(w_ \varphi(f; \delta)= \sup_{0\leq t\leq \delta} \sup_ x| f(x- t\varphi(x))- 2f(x)+ f(x+ t\varphi(x)))|\), where \(f\in C[0,1]\), \(\varphi(x)= \sqrt{x(1-x)}\) and the second supremum is taken for those values of ...
openaire   +2 more sources

Asymptotics of Differentiated Bernstein Polynomials

Constructive Approximation, 2001
The \(m-\)th derivative of the \(n-\)th order Bernstein polynomial of a function \(f\) is considered for large values of \(n\). For functions \(f\) satisfiyng a certain Lipschitz condition the asymptotics is done by using the Gauss-Weierstrass singular integral.
Impens, C., Vernaeve, H.
openaire   +1 more source

Evaluating Bernstein–Rabin–Winograd polynomials

Designs, Codes and Cryptography, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sebati Ghosh, Palash Sarkar
openaire   +1 more source

Home - About - Disclaimer - Privacy