Results 11 to 20 of about 166,471,289 (242)
Approximation degree of Durrmeyer–Bézier type operators
Journal of Inequalities and Applications, 2018 Recently, a mixed hybrid operator, generalizing the well-known Phillips operators and Baskakov–Szász type operators, was introduced. In this paper, we study Bézier variant of these new operators.
Purshottam N. Agrawal +3 more
doaj +2 more sources
Degree of simultaneous approximation by Birkhoff splines [PDF]
Journal of Numerical Analysis and Approximation Theory, 2001 In the present note we study the degree of simultaneous approximation by certain Birkhoff spline interpolation operators. Special emphasis is on estimates in terms of higher order moduli of smoothness. This generalizes earlier results of Meir and Sharma,
Heiner Gonska, Daniela Kacsó
doaj +3 more sources
Algorithms and error bounds for multivariate piecewise constant approximation [PDF]
, 2011 We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewise constants. This covers for example the Sobolev-Poincar´e inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree ...
Davydov, Oleg
core +4 more sources
Superconvergence properties of quintic interpolatroy splines [PDF]
, 1980 Let Q be a quintic spline with equi-spaced knots on [a,b] interpolating a given function y at the knots. The parameters which determine Q are used to construct a piecewise defined polynomial P of degree six.
Papamichael, N, Behforooz, GH
core +6 more sources
Extension of Dasgupta’s Technique for Higher Degree Approximation
Universitas Scientiarum, 2021 In the present paper, rational wedge functions for degree two approximation have been computed over a pentagonal discretization of the domain, by using an analytic approach which is an extension of Dasgupta’s approach for linear approximation.
P. L. Powar +2 more
doaj +1 more source
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements [PDF]
, 2014 We consider degree bounded network design problems with element and vertex connectivity requirements. In the degree bounded Survivable Network Design (SNDP) problem, the input is an undirected graph G = (V, E) with weights w(e) on the edges and degree ...
Ali Vakilian +3 more
core +1 more source
The Rate of Convergence for Linear Shape-Preserving Algorithms
Concrete Operators, 2015 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 ...
Boytsov Dmitry, Sidorov Sergei
doaj +1 more source
Degree of Approximation by Hybrid Operators
Abstract and Applied Analysis, 2013 We consider hybrid (Szász-beta) operators, which are a general sequence of integral type operators including beta function, and we give the degree of approximation by these Szász-beta-Durrmeyer operators.
Naokant Deo, Hee Sun Jung, Ryozi Sakai
doaj +1 more source
Complexity of approximating bounded variants of optimization problems [PDF]
, 2006 We study low degree graph problems such as Maximum Independent Set and Minimum Vertex Cover. The goal is to improve approximation lower bounds for them and for a number of related problems like Max-B-Set Packing, Min-B-Set Cover, and Max-B-Dimensional ...
Chlebikova, Janka +3 more
core +1 more source