Saturation for Bernstein type rational functions (Q793259)

From MaRDI portal
Revision as of 12:47, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Saturation for Bernstein type rational functions
scientific article

    Statements

    Saturation for Bernstein type rational functions (English)
    0 references
    0 references
    1984
    0 references
    C. Balázs introduced the Bernstein type rational functions \[ R_ n(f,x)=(1/(1+a_ nx)^ n)\sum^{n}_{k=0}f(k/b_ n)\left( \begin{matrix} n\\ k\end{matrix} \right)(a_ nx)^ k\quad(x\geq 0) \] that can be used for the approximation of \(f\in C[0,\infty)\). For \(a_ n=n^{\beta -1}\), \(b_ n=n^{\beta}\), \(0<\beta<1\) we solve the saturation problem of \(R_ n\) away from the point 0. The saturation classes are quite unlike the saturation classes of other approximation methods for which one usually gets the Lipschitz classes. For general \(a_ n\), \(b_ n\) we characterize the approximation property of \(R_ n\), e.g. \(R_ n(f,x)\to f(x)\) for every \(f\in C[0,\infty)\) uniformly on compact subsets of \([0,\infty)\) if and only if \(\lim_{n\to \infty}b_{n,[na_ nx/(1+a_ nx)]}=x\) for every \(x\geq 0\).
    0 references
    0 references
    Bernstein type rational functions
    0 references
    saturation problem
    0 references
    saturation classes
    0 references
    0 references