On \(j\)-convex preserving interpolation operators
type: Item
instance of: scholarly article
title: On \(j\)-convex preserving interpolation operators
zbMATH Open document ID: 0957.41016
published in: Journal of Approximation Theory
publication date: 2001-03-29T00:00:00Z
review text: The author researches the existence of \(j\)-convex preserving interpolation operators. The author includes an application in which we made use of a sufficient set of test-functions to characterize when every degree of convexity can be preserved among particular families of polynomial interpolation operators, which include the Bernstein operators. Let \((X,\|\cdot \|)= (C[a,b],\|\cdot\|_\infty)\) be a linear operator \(P:X\to X\) that can be written \(P=\sum^m_{i=0} \delta_{t_i} \otimes v_i\), where \(t_i\in [a,b]\), \(t_i< t_{i+1}\) and \(v_i\in X\), \(i=0,\dots,m\), is said to be an interpolation operator. We denote the set of interpolation operators by \({\mathcal P}\). By \(S\) we denote the set of \(j\)-convex functions of \(X\). Definition 2.1. Fix \(a=t_0<t_1< \cdots< t_m=b\) and let \(\Omega\subset X\). Let \({\mathcal P}_j\) denote the operators of \({\mathcal P}\) that leave \(\prod_{j-1}\) invariant. We say \(\Omega\) is a sufficient test-function set if, for all \(P\in{\mathcal P}_j\), \(P\Omega\subset S\) implies \(P\) preserves \(j\)-convexity. Similarly, we say \(\Omega\) is a necessary test-function set if \(P\Omega\subset S\) whenever \(P\in{\mathcal P}_j\) preserves \(j\)-convexity. Definition 2.2. For the integer \(j\geq 2\) and for \(k=0,\dots,m-j\), define \[ \omega^+_k (x):= \begin{cases} 0\quad & \text{for } a\leq x\leq t_{k+j-1}\\ \omega_k (x) \quad & \text{for } t_{k+j-1}\leq x\leq b\end{cases} \] where \(\omega_k(x):=(x-t_{k+1}) \cdots(x-t_{k+j}-1)\). Let \(\Omega=\{\omega^+_k\}^{m-j}_{k=0}\). Theorem 2.1: \(\Omega\) is a sufficient test-function set. Theorem 2.2: If \(j=1,2\) then \(\Omega\) is a necessarry and sufficient test -- function set. Theorem 2.3: If \(m=j\), \(j+1\) then \(\Omega\) is a necessary and sufficient test -- function set. Theorem 3.1: Let \(\Omega= \{\omega_1, \cdots,\omega_n\} \subset X\). Then \(\Omega\) is not a necessary and sufficient test-function set. Definition 4.1: An interpolation operator \(P=\sum^n_{i=0} \d…
Mathematics Subject Classification ID: 41A35
Mathematics Subject Classification ID: 41A10
Mathematics Subject Classification ID: 41A99
zbMATH DE Number: 1455758
zbMATH Keywords: \(j\)-convex preserving
zbMATH Keywords: Bernstein operatores
author: Michael P. Prophet
MaRDI profile type: Publication
full work available at URL: jath.2000.3433
OpenAlex ID: W2079230447
cites work: A criterion for \(n\)-convexity
cites work: Q3682940
cites work: Approximation properties of recursively defined Bernstein-type operators
cites work: Approximation by boolean sums of positive linear operators III: Estimates for some numerical approximation schemes
cites work: Pointwise estimates for higher order convexity preserving polynomial approximation
cites work: Minimal shape-preserving projections onto Πn
cites work: The existence of shape-preserving operators with a given action
cites work: Q4250279
cites work: Q3223360
cites work: Q4095322
cites work: Q4115576
cites work: The approximation of continuous functions by positive linear operators
cites work: Positive linear operators with equidistant nodes
cites work: Q3838541
cites work: Q5534404
cites work: A method for summability of Lagrange interpolation
cites work: Q3895980
DOI: 10.1006/JATH.2000.3433
description: scientific article; zbMATH DE number 1455758