Results 11 to 20 of about 1,545,364 (282)
On Rate of Approximation by Modified Beta Operators [PDF]
International Journal of Mathematics and Mathematical Sciences, 2009 We establish the rate of convergence for the modified Beta operators 𝐵𝑛(𝑓,𝑥), for functions having derivatives of bounded variation.
Prerna Maheshwari (Sharma), Vijay Gupta
doaj +3 more sources
Approximation by matrix transform in generalized grand Lebesgue spaces with variable exponent
Journal of Numerical Analysis and Approximation Theory, 2021 In this work the Lipschitz subclass of the generalized grand Lebesgue space with variable exponent is defined and the error of approximation by matrix transforms in this subclass is estimated.
Ahmet Testici, Daniyal Israfilov
doaj +7 more sources
On the convergence rates of Legendre approximation [PDF]
Mathematics of Computation, 2011 Expansions of suitable univariate functions in infinite or truncated series of Legendre polynomials are considered in this article. Under analyticity conditions or conditions on the continuity of the approximand and its derivatives, upper bounds on the coefficients in these series are established.
Haiyong Wang, Shuhuang Xiang
openaire +1 more source
Pointwise approximation of modified conjugate functions by matrix operators of their Fourier series; pp 50-60 [PDF]
Proceedings of the Estonian Academy of Sciences, 2018 We extend the results presented by Xh. Z. Krasniqi (Slight extensions of some theorems on the rate of pointwise approximation of functions from some subclasses of Lp. Acta Comment. Univ. Tartu. Math., 2013, 17, 89â101) and W. Lenski and B.
Włodzimierz Łenski, Bogdan Szal
doaj +1 more source
On approximating the sum-rate for multiple-unicasts [PDF]
2015 IEEE International Symposium on Information Theory (ISIT), 2015 10 pages; Shorter version appeared at ISIT (International Symposium on Information Theory) 2015; some typos ...
Karthikeyan Shanmugam +2 more
openaire +2 more sources
Minimum rates of approximate sufficient statistics [PDF]
2017 IEEE International Symposium on Information Theory (ISIT), 2017 Given a sufficient statistic for a parametric family of distributions, one can estimate the parameter without access to the data. However, the memory or code size for storing the sufficient statistic may nonetheless still be prohibitive. Indeed, for $n$ independent samples drawn from a $k$-nomial distribution with $d=k-1$ degrees of freedom, the length
Masahito Hayashi, Vincent Y. F. Tan
openaire +2 more sources
Approximation of integrable functions by general linear matrix operators of their Fourier series
Demonstratio Mathematica, 2022 The pointwise estimates of the deviation Tn,Af(⋅)−f(⋅){T}_{n,A}f(\cdot )-f\left(\cdot ) in terms of pointwise moduli of continuity based on the points of differentiability of indefinite integral of ff, with application of the rth differences of the ...
Mishra Vishnu Narayan +2 more
doaj +1 more source
Mathematics, 2022 The goal of this research article is to introduce a sequence of α–Stancu–Schurer–Kantorovich operators. We calculate moments and central moments and find the order of approximation with the aid of modulus of continuity.
Md. Heshamuddin +4 more
doaj +1 more source
On the convergence rate of vanishing viscosity approximations [PDF]
Communications on Pure and Applied Mathematics, 2004 AbstractGiven a strictly hyperbolic, genuinely nonlinear system of conservation laws, we prove the a priori bound ‖u(t, ·) −uϵ(t, ·)‖=O(1)(1 +t) ·$\sqrt{\varepsilon}$|ln ϵ| on the distance between an exact BV solutionuand a viscous approximationuϵ, letting the viscosity coefficient ϵ → 0. In the proof, starting fromuwe construct an approximation of the
Bressan, Alberto, YANG T.
openaire +4 more sources
On the Rate of Convergence of Greedy Algorithms
Mathematics, 2023 In this paper, a new criterion for the evaluation of the theoretical efficiency of a greedy algorithm is suggested. Using this criterion, we prove some results on the rate of convergence of greedy algorithms, which provide expansions.
Vladimir Temlyakov
doaj +1 more source