Approximation by Boolean sums of positive linear operators. VII: Fejér-Korovkin kernels of higher order (Q1307433)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Approximation by Boolean sums of positive linear operators. VII: Fejér-Korovkin kernels of higher order
scientific article

    Statements

    Approximation by Boolean sums of positive linear operators. VII: Fejér-Korovkin kernels of higher order (English)
    0 references
    0 references
    0 references
    0 references
    31 October 1999
    0 references
    Let \(Lf\) denote the linear function interpolating \(f\in C[-1,1]\) at the point \(\pm 1\). If \(A:C[-1,1]\to C[-1,1]\) is a linear operator, the Boolean sum of \(L\) and \(A\) is given by \(A^+:=L\oplus A=L+A-L\circ A\). By using the \hbox{\(p\)-th} \((p\in\mathbb{N})\) powers of the ordinary Fejér-Korovkin kernels the convolution type operators \(F_{np}\) are constructed. For \(f\in C[-1,1]\), \(n\geq 3\) and \(p\geq 2\) the De Vore-Gopengauz type inequality \[ |F^+_{(n-2)p}(f,x)-f(x)|\leq C_p \omega_2(f,{\sqrt{1-x^2}\over n}),\quad |x|\leq 1 \] is proved, where the constant \(C_p\) is independent of \(f,x\) and \(n\). Two asymptotic inequalities and several numerical calculations are included in order to obtain information on the magnitude of the constants in these estimates.
    0 references
    approximation
    0 references
    Boolean sums of operators
    0 references
    Fejér-Korovkin kernel
    0 references
    continuous functions
    0 references
    positive linear opertors
    0 references
    0 references

    Identifiers