\(q\)-Bernstein polynomials and their iterates. (Q1404933): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0021-9045(03)00104-7 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1971507256 / rank | |||
Normal rank |
Latest revision as of 10:01, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \(q\)-Bernstein polynomials and their iterates. |
scientific article |
Statements
\(q\)-Bernstein polynomials and their iterates. (English)
0 references
25 August 2003
0 references
\(q\)-Bernstein polynomials have been introduced by \textit{G. M. Phillips} [in Numerical Analysis: A. R. Mitchell 75th Birthday Volume, World Scientific, Singapore, 263--269 (1996)]. For \(q=1\) they reduce to the classical Bernstein polynomials. When \(q\) is in \((0,1)\), the corresponding linear operators are positive; several papers deal with this case. When \(q>1\), the positivity fails. The author shows that in this case the approximation properties of \(q\)-Bernstein polynomials may be better than in the case \(q<1\) or \(q=1\); in particular, for entire functions the rate of convergence is exponential. The iterates of \(q\)-Bernstein operators are also investigated. For \(q>1\), the situation is very similar to the classical case \(q=1\); for \(0<q<1\), it is essentially different.
0 references
\(q\)-Bernstein polynomials
0 references
convergence
0 references
iterates
0 references