An asymptotic result for the degree of approximation by monotone polynomials

DOI10.1016/0021-9045(88)90078-0zbMath0687.41002OpenAlexW1981236138MaRDI QIDQ1263020

Vasant A. Ubhaya

Publication date: 1988

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(88)90078-0

zbMATH Keywords

convex conedegree of approximationmodulus of monotonicityFriedrichs Mollier functions

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Rate of convergence, degree of approximation (41A25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Determination of Chebyshev approximations by nonlinear admissible subsets
• Lipschitz condition in minimum norm problems on bounded functions
• Optimal Lipschitzian selection operator in quasi-convex optimization
• Uniform approximation with constraints
• Uniform approximation of differentiable functions by algebraic polynomials
• Some remarks on the degree of monotone approximation
• The degree of monotone approximation
• Nonlinear programming, approximation, and optimization on infinitely differentiable functions
• Nonlinear programming and an optimization problem on infinitely differentiable functions
• Monotone approximation
• Monotono approximation of certain classes of functions
• Degree of approximation by monotone polynomials. I
• Bemerkungen zur Stirlingschen Formel
• Moduli of Monotonicity with Applications to Monotone Polynomial Approximation
• Monotone Approximation by Polynomials
• Analytic Inequalities
• Approximation with Convex Constraints