Results 201 to 210 of about 43,913 (238)
Some of the next articles are maybe not open access.
On Generalized Bernstein Polynomials
SIAM Journal on Mathematical Analysis, 1974The 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
Generalized Bernstein Polynomials
BIT Numerical Mathematics, 2004The authors define generalized Bernstein polynomials of degree \(n\), for \(n \in \mathbb{N}\) and \(i \in \{0,1,\dots,n\}\), by \[ B_i^n(x;\omega| q):= \frac{1}{(\omega;q)_n} \begin{bmatrix} n \\i \end{bmatrix}_q x^i(\omega x^{-1};q)_i(x;q)_{n-i}. \] Here \(q\) and \(\omega\) are real parameters such that \(q \neq 1\) and \(\omega \neq 1,q^{-1},\dots ...
Lewanowicz, Stanisław, Woźny, Paweł
openaire +2 more sources
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
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
An identity for multivariate Bernstein polynomials
Computer Aided Geometric Design, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kurt Jetter, Joachim Stöckler
openaire +2 more sources
Approximation by Bernstein Polynomials
American Journal of Mathematics, 1994Let \[ 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
Bernstein Polynomial and Tjurina Number
Geometriae Dedicata, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hertling, Claus, Stahlke, Colin
openaire +3 more sources
Moment Sequences and the Bernstein Polynomials*
Canadian Mathematical Bulletin, 1969The Bernstein polynomials(1.1)and the Bernstein power series(1.2)have been the subject of much research (e. g. [1; 2; 3; 6; 7; 8]). It is the purpose of this paper to demonstrate the relationship between these linear operators and certain classes of moment sequences defined below.
openaire +1 more source
On simulating a class of Bernstein polynomials
ACM Transactions on Modeling and Computer Simulation, 2012Given a black box that generates independent Bernoulli samples with an unknown bias p, we consider the problem of simulating a Bernoulli random variable with bias f ( p ) (where f is a given function) using a finite (computable in advance) number of independent ...
Vineet Goyal, Karl Sigman
openaire +1 more source
Linear Combinations of Bernstein Polynomials
Canadian Journal of Mathematics, 1953If f(x) is denned on [0, 1], then its corresponding Bernstein polynomialapproaches f(x) uniformly on [0, 1], if f(x) is continuous on [0, 1]. If f(x) is bounded on [0, 1], then at every point x where the second derivative exists (Voronowskaja [7], see also [5])
openaire +2 more sources
Multivariate Bernstein polynomials and convexity
Computer Aided Geometric Design, 1991Many properties of a univariate convex function are known to be associated with those of the Bernstein polynomials of the same function. Yet, this often doesn't hold for multivariate functions. The author presents two new conceptions of convexity. One of them is the axial convexity, which is close to the classical definition and suggests a function's ...
openaire +1 more source

