The Rate of Convergence for Linear Shape-Preserving Algorithms

We prove some results which give explicit methods for determining an upper bound for the rate of approximation by means of operators preserving a cone. Thenwe obtain some quantitative results on the rate of convergence for some sequences of linear shape-preserving operators.

Bibliographic Details
Main Authors:	Boytsov Dmitry, Sidorov Sergei
Format:	Article
Language:	English
Published:	De Gruyter 2015-11-01
Series:	Concrete Operators
Subjects:	shape-preserving approximation Korovkin-type results degree of approximation
Online Access:	http://www.degruyter.com/view/j/conop.2014.2.issue-1/conop-2015-0008/conop-2015-0008.xml?format=INT

id	doaj-bd9f00bcdb414d91b69d075c38dc2fa7
record_format	Article
spelling	doaj-bd9f00bcdb414d91b69d075c38dc2fa72020-11-25T00:40:28ZengDe GruyterConcrete Operators2299-32822015-11-012110.1515/conop-2015-0008conop-2015-0008The Rate of Convergence for Linear Shape-Preserving AlgorithmsBoytsov Dmitry0Sidorov Sergei1Saratov State University, 83, Astrakhanskaya Str., 410012 Saratov, RussiaSaratov State University, 83, Astrakhanskaya Str., 410012 Saratov, RussiaWe prove some results which give explicit methods for determining an upper bound for the rate of approximation by means of operators preserving a cone. Thenwe obtain some quantitative results on the rate of convergence for some sequences of linear shape-preserving operators.http://www.degruyter.com/view/j/conop.2014.2.issue-1/conop-2015-0008/conop-2015-0008.xml?format=INTshape-preserving approximation Korovkin-type results degree of approximation
collection	DOAJ
language	English
format	Article
sources	DOAJ
author	Boytsov Dmitry Sidorov Sergei
spellingShingle	Boytsov Dmitry Sidorov Sergei The Rate of Convergence for Linear Shape-Preserving Algorithms Concrete Operators shape-preserving approximation Korovkin-type results degree of approximation
author_facet	Boytsov Dmitry Sidorov Sergei
author_sort	Boytsov Dmitry
title	The Rate of Convergence for Linear Shape-Preserving Algorithms
title_short	The Rate of Convergence for Linear Shape-Preserving Algorithms
title_full	The Rate of Convergence for Linear Shape-Preserving Algorithms
title_fullStr	The Rate of Convergence for Linear Shape-Preserving Algorithms
title_full_unstemmed	The Rate of Convergence for Linear Shape-Preserving Algorithms
title_sort	rate of convergence for linear shape-preserving algorithms
publisher	De Gruyter
series	Concrete Operators
issn	2299-3282
publishDate	2015-11-01
description	We prove some results which give explicit methods for determining an upper bound for the rate of approximation by means of operators preserving a cone. Thenwe obtain some quantitative results on the rate of convergence for some sequences of linear shape-preserving operators.
topic	shape-preserving approximation Korovkin-type results degree of approximation
url	http://www.degruyter.com/view/j/conop.2014.2.issue-1/conop-2015-0008/conop-2015-0008.xml?format=INT
work_keys_str_mv	AT boytsovdmitry therateofconvergenceforlinearshapepreservingalgorithms AT sidorovsergei therateofconvergenceforlinearshapepreservingalgorithms AT boytsovdmitry rateofconvergenceforlinearshapepreservingalgorithms AT sidorovsergei rateofconvergenceforlinearshapepreservingalgorithms
_version_	1725289859157852160

The Rate of Convergence for Linear Shape-Preserving Algorithms

Similar Items