AbstractIn this paper we show that the best approximation of a convex function by convex algebraic polynomials in Lp, 1 ≤ p < ∞, is O(n−2/p)
AbstractLet X = C[0, 1] and let b be the set of continuous convex functions on [0, 1]. If ƒ ϵ X, the...
Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa aris...
Let X = C[0, 1] and let b be the set of continuous convex functions on [0, 1]. If ƒ ϵ X, then the se...
AbstractIn this paper we show that the best approximation of a convex function by convex algebraic p...
AbstractA convex function f given on [−1, 1] can be approximated in Lp, 1 < p < ∞, by convex polynom...
AbstractA convex function f given on [−1, 1] can be approximated in Lp, 1 < p < ∞, by convex polynom...
AbstractWe prove that for each convex function ƒ ∈ Lp, 0 < p < 1, there exists a convex algebraic po...
AbstractIf S is a bounded convex subset of Rm, the problem is to find a best approximation to a func...
We consider here best approximation by n-convex functions. We first show that if f∈L1[0,1], then the...
We prove a direct theorem for convex polynomial L p-approximation, 0 < p < 1, in terms of the ...
Abstract. We prove that a convex function f 2 L p [1; 1], 0 < p < 1, can be approxi-mated by c...
The fundamental theorem, as far as this work is concerned, is Weierstrass' theorem (1885) on the app...
AbstractThe problem considered in this paper is best Lp approximation with multiple constraints for ...
We study the behavior of the best simultaneous approximation to two functions from a convex set in L...
AbstractGiven a bounded function f defined on a convex subset of Rn, the two problems considered are...
AbstractLet X = C[0, 1] and let b be the set of continuous convex functions on [0, 1]. If ƒ ϵ X, the...
Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa aris...
Let X = C[0, 1] and let b be the set of continuous convex functions on [0, 1]. If ƒ ϵ X, then the se...
AbstractIn this paper we show that the best approximation of a convex function by convex algebraic p...
AbstractA convex function f given on [−1, 1] can be approximated in Lp, 1 < p < ∞, by convex polynom...
AbstractA convex function f given on [−1, 1] can be approximated in Lp, 1 < p < ∞, by convex polynom...
AbstractWe prove that for each convex function ƒ ∈ Lp, 0 < p < 1, there exists a convex algebraic po...
AbstractIf S is a bounded convex subset of Rm, the problem is to find a best approximation to a func...
We consider here best approximation by n-convex functions. We first show that if f∈L1[0,1], then the...
We prove a direct theorem for convex polynomial L p-approximation, 0 < p < 1, in terms of the ...
Abstract. We prove that a convex function f 2 L p [1; 1], 0 < p < 1, can be approxi-mated by c...
The fundamental theorem, as far as this work is concerned, is Weierstrass' theorem (1885) on the app...
AbstractThe problem considered in this paper is best Lp approximation with multiple constraints for ...
We study the behavior of the best simultaneous approximation to two functions from a convex set in L...
AbstractGiven a bounded function f defined on a convex subset of Rn, the two problems considered are...
AbstractLet X = C[0, 1] and let b be the set of continuous convex functions on [0, 1]. If ƒ ϵ X, the...
Given a univariate polynomial, its abscissa is the maximum real part of its roots. The abscissa aris...
Let X = C[0, 1] and let b be the set of continuous convex functions on [0, 1]. If ƒ ϵ X, then the se...
DOI
Add to ORKG