Results 51 to 60 of about 169,552 (158)
The second order modulus revisited: remarks, applications, problems
Several questions concerning the second order modulus of smoothness are addressed in this note. The central part is a refined analysis of a construction of certain smooth functions by Zhuk and its application to several problems in approximation theory,
Heiner Gonska, Ralitza K. Kovacheva
doaj +1 more source
On the degree of approximation of the Hermite and Hermite-Fejer interpolation
Here we find the order of convergence of the Hermite and Hermite-Fejér interpolation polynomials constructed on the zeros of (1−x2)Pn(x) where Pn(x) is the Legendre polynomial of degree n with normalization Pn(1)=1.
J. Prasad
doaj +1 more source
Approximation theorems for modified Szasz-Mirakjan operators in polynomial weight spaces
In this paper we will study properties of Szasz-Mirakjan type operators A_n^ν , B_n^ ν defined by modified Bessel function I_ν . We shall present theorems giving a degree of approximation for these operators.
Monika Herzog
doaj
Various investigators such as Khan (1974), Chandra (2002), and Liendler (2005) have determined the degree of approximation of 2π-periodic signals (functions) belonging to Lip(α,r) class of functions through trigonometric Fourier approximation using ...
Uaday Singh, M. L. Mittal, Smita Sonker
doaj +1 more source
Rate of convergence of Stancu beta operators for functions of bounded variation
In this paper we study beta operators of second kind recently introduced by Prof. D. D. Stancu. We obtain an estimate on the rate of convergence for functions of bounded variation by means of the decomposition technique.
Ulrich Abel, Vijay Gupta
doaj +2 more sources
Degree of Approximation on a Jordan Curve [PDF]
Walsh, J. L., Elliott, H. Margaret
openaire +2 more sources
Bounded Degree Approximations of Stochastic Networks
We propose algorithms to approximate directed information graphs. Directed information graphs are probabilistic graphical models that depict causal dependencies between stochastic processes in a network. The proposed algorithms identify optimal and near-optimal approximations in terms of Kullback-Leibler divergence.
Quinn, Christopher J. +2 more
openaire +2 more sources
The degree of monotone approximation [PDF]
openaire +2 more sources
Degree of approximation by monotone polynomials I
Lorentz, G.G, Zeller, K.L
openaire +2 more sources
Degree of uniform approximation on disjoint intervals [PDF]
Chui, Charles K., Hasson, Maurice
openaire +3 more sources

