International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a class of rational functions of the form 1/(x − c)2 + K(a,b, c,n)/(x − c) on [a, b] represented by their Chebyshev expansion, where a, b, and c are real numbers, n − 1 denotes the degree of the best approximating polynomial, and K is a constant determined by a, b, c, and n. Our result is based on the explicit determination of a phase angle η in the representation of the approximation error by a trigonometric function. Moreover, we formulate an ansatz which offers a heuristic strategies to determine the best approximating polynomial to a function represented by its Chebyshev expansion. Combined with the phase angle method, this ansatz can be use...
For the uniform approximation of x on [0; 1] by rational functions the following strong error es...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
AbstractWe explicitly determine the best uniform polynomial approximation pn−1∗ to a class of ration...
AbstractIn this research paper using the Chebyshev expansion, we explicitly determine the best unifo...
AbstractA class of continuous functions is defined, and the best uniform rational approximations to ...
A thorough, self-contained and easily accessible treatment of the theory on the polynomial best appr...
In the paper the polynomial mean-square approximation method was applied, where the applied criterio...
Abstract. We consider the classical problem of finding the best uniform approxi-mation by polynomial...
AbstractSome rational approximations which share the properties of Padé and best uniform approximati...
This thesis presents new numerical algorithms for approximating functions by trigonometric polynomia...
This thesis presents new numerical algorithms for approximating functions by trigonometric polynomia...
AbstractLet A(z) = Am(z) + amzmB(z,m) where Am(z) is a polynomial in z of degree m-1. Suppose A(z) a...
Let {alpha} be a positive number, and let E{sub n}(chi{sup {alpha}}; (0,1)) denote the error of best...
For the uniform approximation of x on [0; 1] by rational functions the following strong error es...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
International audienceWe explicitly determine the best uniform polynomial approximation p∗n−1 to a c...
AbstractWe explicitly determine the best uniform polynomial approximation pn−1∗ to a class of ration...
AbstractIn this research paper using the Chebyshev expansion, we explicitly determine the best unifo...
AbstractA class of continuous functions is defined, and the best uniform rational approximations to ...
A thorough, self-contained and easily accessible treatment of the theory on the polynomial best appr...
In the paper the polynomial mean-square approximation method was applied, where the applied criterio...
Abstract. We consider the classical problem of finding the best uniform approxi-mation by polynomial...
AbstractSome rational approximations which share the properties of Padé and best uniform approximati...
This thesis presents new numerical algorithms for approximating functions by trigonometric polynomia...
This thesis presents new numerical algorithms for approximating functions by trigonometric polynomia...
AbstractLet A(z) = Am(z) + amzmB(z,m) where Am(z) is a polynomial in z of degree m-1. Suppose A(z) a...
Let {alpha} be a positive number, and let E{sub n}(chi{sup {alpha}}; (0,1)) denote the error of best...
For the uniform approximation of x on [0; 1] by rational functions the following strong error es...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...
Variants of the Remez algorithm for best polynomial approximation are presented based on two key fea...