AbstractWe consider uniform polynomial approximation on [ −1, 1]. For the class of functions which are analytic in an ellipse with foci ± 1 and sum of semiaxes greater than 8.1722…, we prove several asymptotic results on the best approximation. We describe the CF-approximation method and prove that, for our class of functions, the CF-approximation is “not far away” from the best one. With the help of this result we show a Kadec type result on the alternants and prove a conjecture of Poreda on the strong uniqueness constants. Also we prove a lemma on the distance between the best approximation and a “good” approximating polynomial
AbstractLet ƒ ϵ C[−1, 1]. A sufficient condition is given which ensures that the nth polynomial of b...
AbstractLet F be a closed subset of the unit circle T and let f∈C(F). We investigate the problem of ...
AbstractLet L be an arbitrary quasidisk, and ƒ analytic in G and continuous on Ḡ. We prove two theor...
AbstractWe consider uniform polynomial approximation on [ −1, 1]. For the class of functions which a...
AbstractLet f∈C[−1, 1] be real-valued. We consider the sequence of strong unicity constants (γn(f))n...
AbstractFor each f continuous on the interval I, let Bn(f) denote the best uniform polynomial approx...
AbstractThis paper gives a counterexample that the strong unicity fails for best monotone approximat...
The book incorporates research papers and surveys written by participants ofan International Scienti...
Abstract. We consider the classical problem of finding the best uniform approxi-mation by polynomial...
AbstractGiven a function f, uniform limit of analytic polynomials on a compact, regular set E⊂CN, we...
AbstractIt is shown that an algebraic polynomial of degree ⩽k−1 which interpolates ak-monotone funct...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
AbstractA systematic description of the Carathéodory-Fejér method (CF method) is given for near-best...
AbstractLet X be a closed subset of I = [−1, 1], and let Bn(f) be the best uniform approximation to ...
AbstractWe explicitly determine the best uniform polynomial approximation pn−1∗ to a class of ration...
AbstractLet ƒ ϵ C[−1, 1]. A sufficient condition is given which ensures that the nth polynomial of b...
AbstractLet F be a closed subset of the unit circle T and let f∈C(F). We investigate the problem of ...
AbstractLet L be an arbitrary quasidisk, and ƒ analytic in G and continuous on Ḡ. We prove two theor...
AbstractWe consider uniform polynomial approximation on [ −1, 1]. For the class of functions which a...
AbstractLet f∈C[−1, 1] be real-valued. We consider the sequence of strong unicity constants (γn(f))n...
AbstractFor each f continuous on the interval I, let Bn(f) denote the best uniform polynomial approx...
AbstractThis paper gives a counterexample that the strong unicity fails for best monotone approximat...
The book incorporates research papers and surveys written by participants ofan International Scienti...
Abstract. We consider the classical problem of finding the best uniform approxi-mation by polynomial...
AbstractGiven a function f, uniform limit of analytic polynomials on a compact, regular set E⊂CN, we...
AbstractIt is shown that an algebraic polynomial of degree ⩽k−1 which interpolates ak-monotone funct...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
AbstractA systematic description of the Carathéodory-Fejér method (CF method) is given for near-best...
AbstractLet X be a closed subset of I = [−1, 1], and let Bn(f) be the best uniform approximation to ...
AbstractWe explicitly determine the best uniform polynomial approximation pn−1∗ to a class of ration...
AbstractLet ƒ ϵ C[−1, 1]. A sufficient condition is given which ensures that the nth polynomial of b...
AbstractLet F be a closed subset of the unit circle T and let f∈C(F). We investigate the problem of ...
AbstractLet L be an arbitrary quasidisk, and ƒ analytic in G and continuous on Ḡ. We prove two theor...