AbstractLet Πn,m = {(x + 1)nPm(x) : Pm(x) ∈ Πm} be the set of incomplete polynomials of type (n, m) on [−1, 1]. We consider the distribution of the extreme points of the error curve in the best approximation of ƒ ∈ C[−1, 1] with ƒ(−1) = 0 by incomplete polynomials of type (n, m) on [−1, 1] and give a Kadec-type result for this setting. In particular, we improve the rate of convergence of the original Kadec result
AbstractWe consider the distribution of alternation points in best real polynomial approximation of ...
The best approximation problem is a classical topic of the approximation theory and the Remez algori...
The best approximation problem is a classical topic of the approximation theory and the Remez algori...
AbstractLet Πn,m = {(x + 1)nPm(x) : Pm(x) ∈ Πm} be the set of incomplete polynomials of type (n, m) ...
AbstractLet E be a compact set in C with connected complement and positive logarithmic capacity. For...
AbstractWe consider the sequence of errors (En(f))nof best uniform approximation to a functionf∈C[−1...
For any θ with 0\u3cθ\u3c1, it is known that, for the set of all incomplete polynomials of type θ, i...
For any θ with 0\u3cθ\u3c1, it is known that, for the set of all incomplete polynomials of type θ, i...
AbstractFor any Θ with 0 < Θ < 1, it is known that the set of all incomplete polynomials of form Pn(...
For any θ with 0<θ<1, it is known that, for the set of all incomplete polynomials of type θ, i.e, {p...
AbstractLet f ϵ Cn+1[−1, 1] and let H[f](x) be the nth degree weighted least squares polynomial appr...
AbstractThe approximation of functions by Müntz polynomials pn(x) = ∑v=0navxλv, nϵN, is studied. Con...
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known t...
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known ...
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known ...
AbstractWe consider the distribution of alternation points in best real polynomial approximation of ...
The best approximation problem is a classical topic of the approximation theory and the Remez algori...
The best approximation problem is a classical topic of the approximation theory and the Remez algori...
AbstractLet Πn,m = {(x + 1)nPm(x) : Pm(x) ∈ Πm} be the set of incomplete polynomials of type (n, m) ...
AbstractLet E be a compact set in C with connected complement and positive logarithmic capacity. For...
AbstractWe consider the sequence of errors (En(f))nof best uniform approximation to a functionf∈C[−1...
For any θ with 0\u3cθ\u3c1, it is known that, for the set of all incomplete polynomials of type θ, i...
For any θ with 0\u3cθ\u3c1, it is known that, for the set of all incomplete polynomials of type θ, i...
AbstractFor any Θ with 0 < Θ < 1, it is known that the set of all incomplete polynomials of form Pn(...
For any θ with 0<θ<1, it is known that, for the set of all incomplete polynomials of type θ, i.e, {p...
AbstractLet f ϵ Cn+1[−1, 1] and let H[f](x) be the nth degree weighted least squares polynomial appr...
AbstractThe approximation of functions by Müntz polynomials pn(x) = ∑v=0navxλv, nϵN, is studied. Con...
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known t...
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known ...
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known ...
AbstractWe consider the distribution of alternation points in best real polynomial approximation of ...
The best approximation problem is a classical topic of the approximation theory and the Remez algori...
The best approximation problem is a classical topic of the approximation theory and the Remez algori...