AbstractLet f(z) be a continuous function defined on the compact set K⊂C and let En(f)=En(f,K) be the degree of approximation to f, for the supremum norm on K, by polynomials of degree (at most) n. ThusEn(f,K)=infP∈Pn∥f-P∥.Here Pn denotes the space of polynomials of degree at most n and ∥.∥ is the supremum norm on K.For a positive integer s and for 0<a<b, letK=Ka,bs=⋃k=0s-1e2πiks[a,b].We show that for a large class of piecewise analytic functions f defined on Klimsupn→∞En(f,K)1n=bs2-as2bs2+as2s,thus recovering several classical results.The proof of this error estimate is then translated into an algorithm that finds the polynomial of near best approximation
In this paper, we provide an efficient method for computing the Taylor coefficients of 1−pnf, where ...
International audienceWe address the problem of computing good floating-point-coefficient polynomial...
AbstractWe describe some approximation properties of polynomials of degree at most 2n withweight (1 ...
For disjoint compact subsets I, J of a real interval [A, B] construction is given for polynomials P-...
AbstractLet ƒbe a continuous function and sn be the polynomial of degree at most n of best L2(μ)-app...
AbstractFor function f defined on the interval I := [−1, 1], let pn,2∗(f) be its best approximant ou...
The polynomial approximation behaviour of the class of functions $$ F_s: R^2\(x_0, y_0 ) -> R, F_s...
AbstractThe problem considered is the approximation of a continuous function defined on an interval ...
AbstractThe approximation of functions by Müntz polynomials pn(x) = ∑v=0navxλv, nϵN, is studied. Con...
AbstractWe construct polynomial approximations in terms of the weighted kth modulus of continuity, k...
AbstractWassily Hoeffding (J. Approximation Theory 4 (1971), 347–356) obtained a convergence rate fo...
AbstractThis paper establishes bounds on the uniform error in the approximation of a continuous func...
AbstractThe best uniform approximation to the function ¦x¦β, β > 0, on [−1, 1] by any of the standar...
In this paper, we provide an efficient method for computing the Taylor coefficients of 1−pnf, where ...
In this paper, we provide an efficient method for computing the Taylor coefficients of 1−pnf, where ...
In this paper, we provide an efficient method for computing the Taylor coefficients of 1−pnf, where ...
International audienceWe address the problem of computing good floating-point-coefficient polynomial...
AbstractWe describe some approximation properties of polynomials of degree at most 2n withweight (1 ...
For disjoint compact subsets I, J of a real interval [A, B] construction is given for polynomials P-...
AbstractLet ƒbe a continuous function and sn be the polynomial of degree at most n of best L2(μ)-app...
AbstractFor function f defined on the interval I := [−1, 1], let pn,2∗(f) be its best approximant ou...
The polynomial approximation behaviour of the class of functions $$ F_s: R^2\(x_0, y_0 ) -> R, F_s...
AbstractThe problem considered is the approximation of a continuous function defined on an interval ...
AbstractThe approximation of functions by Müntz polynomials pn(x) = ∑v=0navxλv, nϵN, is studied. Con...
AbstractWe construct polynomial approximations in terms of the weighted kth modulus of continuity, k...
AbstractWassily Hoeffding (J. Approximation Theory 4 (1971), 347–356) obtained a convergence rate fo...
AbstractThis paper establishes bounds on the uniform error in the approximation of a continuous func...
AbstractThe best uniform approximation to the function ¦x¦β, β > 0, on [−1, 1] by any of the standar...
In this paper, we provide an efficient method for computing the Taylor coefficients of 1−pnf, where ...
In this paper, we provide an efficient method for computing the Taylor coefficients of 1−pnf, where ...
In this paper, we provide an efficient method for computing the Taylor coefficients of 1−pnf, where ...
International audienceWe address the problem of computing good floating-point-coefficient polynomial...
AbstractWe describe some approximation properties of polynomials of degree at most 2n withweight (1 ...