Publication date
December 1990
DOI Publisher
Published by Elsevier Ltd. ISSN
0893-9659Abstract
AbstractInverse inequalities in the space of polynomials, relating the maximum norm in [-1,1] and weighted Sobolev norms, are shown
AbstractInverse inequalities in the space of polynomials, relating the maximum norm in [-1,1] and weighted Sobolev norms, are shown
AbstractApproximations Fnf and Hnf to a function f are defined, respectively, as the partial sums of...
We determine which sets saturate the Szegő and Schiefermayr lower bounds on the norms of Chebyshev P...
By considering four kinds of Chebyshev polynomials, an extended set of (real) results are given for ...
AbstractInverse inequalities in the space of polynomials, relating the maximum norm in [-1,1] and we...
Inverse inequalities in the space of polynomials, relating the maximum norm in [-1,1] and weighted S...
Inverse inequalities in the space of polynomials, relating the maximum norm in [-1,1] and weighted S...
AbstractThe linear inequality method is an algorithm for discrete Chebyshev approximation by general...
AbstractIn this paper we discuss the problem of weighted simultaneous Chebyshev approximation to fun...
AbstractIt is shown that best Chebyshev approximations by exponential-polynomial sums are characteri...
A classical inequality due to Bernstein which estimates the norm of polynomials on any given ellipse...
Let (a, b) subset of (0, infinity) and for any positive integer n, let S-n be the Chebyshev space in...
AbstractIn this article, it is proved that the Chebyshev polynomials are also the least deviation fu...
AbstractThe dependence of (powered) rational Chebyshev approximation on basis, domain, and function ...
AbstractBernstein–Markov-type inequalities provide estimates for the norms of derivatives of algebra...
The set of all first degree polynomials must be added to the set of approximations of the form a + b...
AbstractApproximations Fnf and Hnf to a function f are defined, respectively, as the partial sums of...
We determine which sets saturate the Szegő and Schiefermayr lower bounds on the norms of Chebyshev P...
By considering four kinds of Chebyshev polynomials, an extended set of (real) results are given for ...
AbstractInverse inequalities in the space of polynomials, relating the maximum norm in [-1,1] and we...
Inverse inequalities in the space of polynomials, relating the maximum norm in [-1,1] and weighted S...
Inverse inequalities in the space of polynomials, relating the maximum norm in [-1,1] and weighted S...
AbstractThe linear inequality method is an algorithm for discrete Chebyshev approximation by general...
AbstractIn this paper we discuss the problem of weighted simultaneous Chebyshev approximation to fun...
AbstractIt is shown that best Chebyshev approximations by exponential-polynomial sums are characteri...
A classical inequality due to Bernstein which estimates the norm of polynomials on any given ellipse...
Let (a, b) subset of (0, infinity) and for any positive integer n, let S-n be the Chebyshev space in...
AbstractIn this article, it is proved that the Chebyshev polynomials are also the least deviation fu...
AbstractThe dependence of (powered) rational Chebyshev approximation on basis, domain, and function ...
AbstractBernstein–Markov-type inequalities provide estimates for the norms of derivatives of algebra...
The set of all first degree polynomials must be added to the set of approximations of the form a + b...
AbstractApproximations Fnf and Hnf to a function f are defined, respectively, as the partial sums of...
We determine which sets saturate the Szegő and Schiefermayr lower bounds on the norms of Chebyshev P...
By considering four kinds of Chebyshev polynomials, an extended set of (real) results are given for ...
Add to ORKG