Results 11 to 20 of about 169,552 (158)
Degree of Approximation by Hybrid Operators [PDF]
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 +3 more sources
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 +3 more sources
Low-Degree Approximation of Random Polynomials [PDF]
Foundations of Computational Mathematics, 2021 AbstractWe prove that with “high probability” a random Kostlan polynomial in $$n+1$$ n + 1 many variables and of degree d can be approximated by a polynomial of “low degree” without changing the topology of its zero set on the sphere ...
Diatta, Daouda Niang, Lerario, Antonio
openaire +3 more sources
Degree of adaptive approximation [PDF]
Mathematics of Computation, 1990 We obtain various estimates for the error in adaptive approximation and also establish a relationship between adaptive approximation and free-knot spline approximation.
DeVore, Ronald A, XIANG, Ming Yu
openaire +1 more source
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
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem [PDF]
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021 This subsumes an earlier preprint by a subset of the authors (arXiv:2004.13231)
Aaronson, Scott +4 more
openaire +2 more sources
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
The degree of approximation by Chebyshevian splines [PDF]
Transactions of the American Mathematical Society, 1973 This paper studies the connections between the smoothness of a function and its degree of approximation by Chebyshevian splines. This is accomplished by proving companion direct and inverse theorems which give a characterization of smoothness in terms of degree of approximation. A determination of the saturation properties is included.
DeVore, R., Richards, F.
openaire +2 more sources
Mustansiriyah Journal of Pure and Applied Sciences, 2023 Many researchers related to the degree of unconstrained approximation to constrained approximation, and proved the inequality: For a continuous function on a closed interval we have where is a positive constant.
null W. A. Ajel, null E. S. Bhaya
openaire +1 more source
DEGREE OF APPROXIMATION BY PERIODIC NEURAL NETWORKS [PDF]
Korean Journal of Mathematics, 2014 Summary: We investigate an approximation order of a continuous \(2 \pi \)-periodic function by periodic neural networks. By using the De La Vallée Poussin sum and the modulus of continuity, we obtain a degree of approximation by periodic neural networks.
Hahm, Nahmwoo, Hong, Bum Il
openaire +2 more sources