DOIAbstract
AbstractWe consider the sequence of errors (En(f))nof best uniform approximation to a functionf∈C[−1, 1] by algebraic polynomials. It is shown that the regularity offin subsets of [−1, 1] implies certain conditions on the sequence (En(f))n
AbstractWe consider the sequence of errors (En(f))nof best uniform approximation to a functionf∈C[−1, 1] by algebraic polynomials. It is shown that the regularity offin subsets of [−1, 1] implies certain conditions on the sequence (En(f))n
We obtain an exact error estimate of the best approximation by algebraic polynomials in the Lebesgue...
We obtain an exact error estimate of the best approximation by algebraic polynomials in the Lebesgue...
In analogy with the regularity lemma of Szemerédi [Sze75], regularity lemmas for polynomials shown ...
AbstractWe consider the sequence of errors (En(f))nof best uniform approximation to a functionf∈C[−1...
AbstractLet E be a compact set in C with connected complement and positive logarithmic capacity. For...
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...
Abstract. We consider the classical problem of finding the best uniform approxi-mation by polynomial...
Let f: [0, 1]p → Rq be a bounded function. In this paper, we used technique from [11] to give a boun...
AbstractThis paper establishes bounds on the uniform error in the approximation of a continuous func...
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...
AbstractLet Πn,m = {(x + 1)nPm(x) : Pm(x) ∈ Πm} be the set of incomplete polynomials of type (n, m) ...
AbstractLet Πn,m = {(x + 1)nPm(x) : Pm(x) ∈ Πm} be the set of incomplete polynomials of type (n, m) ...
We obtain an exact error estimate of the best approximation by algebraic polynomials in the Lebesgue...
We obtain an exact error estimate of the best approximation by algebraic polynomials in the Lebesgue...
We obtain an exact error estimate of the best approximation by algebraic polynomials in the Lebesgue...
In analogy with the regularity lemma of Szemerédi [Sze75], regularity lemmas for polynomials shown ...
AbstractWe consider the sequence of errors (En(f))nof best uniform approximation to a functionf∈C[−1...
AbstractLet E be a compact set in C with connected complement and positive logarithmic capacity. For...
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...
Abstract. We consider the classical problem of finding the best uniform approxi-mation by polynomial...
Let f: [0, 1]p → Rq be a bounded function. In this paper, we used technique from [11] to give a boun...
AbstractThis paper establishes bounds on the uniform error in the approximation of a continuous func...
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...
AbstractLet Πn,m = {(x + 1)nPm(x) : Pm(x) ∈ Πm} be the set of incomplete polynomials of type (n, m) ...
AbstractLet Πn,m = {(x + 1)nPm(x) : Pm(x) ∈ Πm} be the set of incomplete polynomials of type (n, m) ...
We obtain an exact error estimate of the best approximation by algebraic polynomials in the Lebesgue...
We obtain an exact error estimate of the best approximation by algebraic polynomials in the Lebesgue...
We obtain an exact error estimate of the best approximation by algebraic polynomials in the Lebesgue...
In analogy with the regularity lemma of Szemerédi [Sze75], regularity lemmas for polynomials shown ...
Add to ORKG