Asymptotic approximation of functions and their derivatives by Müller’s Gamma operators

2003 ◽  
Vol 43 (1-2) ◽  
pp. 1-12 ◽  
Author(s):  
Ulrich Abel ◽  
Mircea Ivan



2012 ◽  
Vol 15 (3) ◽  
pp. 173-179
Author(s):  
Sahib Al-Saidy ◽  
◽  
Salim Dawood ◽  


2020 ◽  
Vol 2020 (1) ◽  
Author(s):  
Abhishek Mishra ◽  
Vishnu Narayan Mishra ◽  
M. Mursaleen

AbstractIn this paper, we establish a new estimate for the degree of approximation of functions $f(x,y)$ f ( x , y ) belonging to the generalized Lipschitz class $Lip ((\xi _{1}, \xi _{2} );r )$ L i p ( ( ξ 1 , ξ 2 ) ; r ) , $r \geq 1$ r ≥ 1 , by double Hausdorff matrix summability means of double Fourier series. We also deduce the degree of approximation of functions from $Lip ((\alpha ,\beta );r )$ L i p ( ( α , β ) ; r ) and $Lip(\alpha ,\beta )$ L i p ( α , β ) in the form of corollary. We establish some auxiliary results on trigonometric approximation for almost Euler means and $(C, \gamma , \delta )$ ( C , γ , δ ) means.



1992 ◽  
Vol 35 (4) ◽  
pp. 439-448 ◽  
Author(s):  
Gerald Beer

AbstractLet X be a complete metric space. Viewing continuous real functions on X as closed subsets of X × R, equipped with Hausdorff distance, we show that C(X, R) is completely metrizable provided X is complete and sigma compact. Following the Bulgarian school of constructive approximation theory, a bounded discontinuous function may be identified with its completed graph, the set of points between the upper and lower envelopes of the function. We show that the space of completed graphs, too, is completely metrizable, provided X is locally connected as well as sigma compact and complete. In the process, when X is a Polish space, we provide a simple answer to the following foundational question: which subsets of X × R arise as completed graphs?



2016 ◽  
Vol 115 (6) ◽  
pp. 60008
Author(s):  
N. Grama ◽  
C. Grama ◽  
I. Zamfirescu


1989 ◽  
Vol 26 (03) ◽  
pp. 512-523
Author(s):  
Clifton Sutton

Codes having all pairs of words separated by a Hamming distance of at least d are stochastically constructed by sequentially packing randomly generated q-ary n-tuples. Estimates of the random packing densities are obtained by repeated simulation. Using non-linear regression to fit the estimated densities, an asymptotic approximation formula is obtained for the packing densities which depends only on q, n, d, and an empirical constant.



Sign in / Sign up

Export Citation Format

Share Document