Approximation of set-valued functions with compact images-an overview

Nira Dyn; Elza Farkhi

Banach Center Publications (2006)

  • Volume: 72, Issue: 1, page 71-84
  • ISSN: 0137-6934

Abstract

top
Continuous set-valued functions with convex images can be approximated by known positive operators of approximation, such as the Bernstein polynomial operators and the Schoenberg spline operators, with the usual sum between numbers replaced by the Minkowski sum of sets. Yet these operators fail to approximate set-valued functions with general sets as images. The Bernstein operators with growing degree, and the Schoenberg operators, when represented as spline subdivision schemes, converge to set-valued functions with convex images. To obtain approximating operators for set-valued functions with general images, we use a binary average between sets, termed the "metric average", which was introduced by Artstein for the construction of piecewise linear interpolants to set-valued functions. Representing each of the above mentioned operators in terms of repeated binary averages, and replacing the binary average between numbers by the metric average, we obtain operators for set-valued functions with compact images. In case of the Schoenberg operators, represented either by the de Boor algorithm or by spline subdivision schemes, the operators are approximating. In case of the Bernstein operators, the convergence with the increase of the degree is established only for set-valued functions with 1D images, consisting of the same number of intervals.

How to cite

top

Nira Dyn, and Elza Farkhi. "Approximation of set-valued functions with compact images-an overview." Banach Center Publications 72.1 (2006): 71-84. <http://eudml.org/doc/281956>.

@article{NiraDyn2006,
abstract = {Continuous set-valued functions with convex images can be approximated by known positive operators of approximation, such as the Bernstein polynomial operators and the Schoenberg spline operators, with the usual sum between numbers replaced by the Minkowski sum of sets. Yet these operators fail to approximate set-valued functions with general sets as images. The Bernstein operators with growing degree, and the Schoenberg operators, when represented as spline subdivision schemes, converge to set-valued functions with convex images. To obtain approximating operators for set-valued functions with general images, we use a binary average between sets, termed the "metric average", which was introduced by Artstein for the construction of piecewise linear interpolants to set-valued functions. Representing each of the above mentioned operators in terms of repeated binary averages, and replacing the binary average between numbers by the metric average, we obtain operators for set-valued functions with compact images. In case of the Schoenberg operators, represented either by the de Boor algorithm or by spline subdivision schemes, the operators are approximating. In case of the Bernstein operators, the convergence with the increase of the degree is established only for set-valued functions with 1D images, consisting of the same number of intervals.},
author = {Nira Dyn, Elza Farkhi},
journal = {Banach Center Publications},
keywords = {Bernstein operator},
language = {eng},
number = {1},
pages = {71-84},
title = {Approximation of set-valued functions with compact images-an overview},
url = {http://eudml.org/doc/281956},
volume = {72},
year = {2006},
}

TY - JOUR
AU - Nira Dyn
AU - Elza Farkhi
TI - Approximation of set-valued functions with compact images-an overview
JO - Banach Center Publications
PY - 2006
VL - 72
IS - 1
SP - 71
EP - 84
AB - Continuous set-valued functions with convex images can be approximated by known positive operators of approximation, such as the Bernstein polynomial operators and the Schoenberg spline operators, with the usual sum between numbers replaced by the Minkowski sum of sets. Yet these operators fail to approximate set-valued functions with general sets as images. The Bernstein operators with growing degree, and the Schoenberg operators, when represented as spline subdivision schemes, converge to set-valued functions with convex images. To obtain approximating operators for set-valued functions with general images, we use a binary average between sets, termed the "metric average", which was introduced by Artstein for the construction of piecewise linear interpolants to set-valued functions. Representing each of the above mentioned operators in terms of repeated binary averages, and replacing the binary average between numbers by the metric average, we obtain operators for set-valued functions with compact images. In case of the Schoenberg operators, represented either by the de Boor algorithm or by spline subdivision schemes, the operators are approximating. In case of the Bernstein operators, the convergence with the increase of the degree is established only for set-valued functions with 1D images, consisting of the same number of intervals.
LA - eng
KW - Bernstein operator
UR - http://eudml.org/doc/281956
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.