DOIAbstract
AbstractIn this article, it is proved that the Chebyshev polynomials are also the least deviation functions in the class Fn:= {ƒ∈C(n)[−1,1]:ƒ(n)(x)⩾1,x∈[−1,1]} with some norms
AbstractIn this article, it is proved that the Chebyshev polynomials are also the least deviation functions in the class Fn:= {ƒ∈C(n)[−1,1]:ƒ(n)(x)⩾1,x∈[−1,1]} with some norms
Abstract. We study the problem of minimizing the supremum norm, on a segment of the real line or on ...
Extending a classical result of Widom from 1969, polynomials with small supremum norms are construct...
AbstractWe are concerned with the problem of finding the polynomial with minimal uniform norm on E a...
AbstractIn this article, it is proved that the Chebyshev polynomials are also the least deviation fu...
Abstract In this paper, we consider polynomials that deviate least from zero in the L1 metric. Then...
AbstractIn the family of all r-variable real polynomials with total degree not exceeding μ and with ...
By considering four kinds of Chebyshev polynomials, an extended set of (real) results are given for ...
AbstractUsing works of Franz Peherstorfer, we examine how close the nth Chebyshev number for a set E...
The n-th Chebyshev polynomial of the first kind, Tn, maximizes various functionals on Bn, the unit b...
We are concerned with the problem of minimizing the supremum norm on [0; 1] of a nonzero polynomial ...
The Chebyshev polynomials are orthogonal polynomials used in many disparate areas of pure and applie...
We study Chebyshev's problem on polynomials that deviate least from zero with respect to \(L^p\)-mea...
The Chebyshev polynomials are orthogonal polynomials used in many disparate areas of pure and applie...
Extending a classical result of Widom from 1969, polynomials with small supremum norms are construct...
Abstract. We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero p...
Abstract. We study the problem of minimizing the supremum norm, on a segment of the real line or on ...
Extending a classical result of Widom from 1969, polynomials with small supremum norms are construct...
AbstractWe are concerned with the problem of finding the polynomial with minimal uniform norm on E a...
AbstractIn this article, it is proved that the Chebyshev polynomials are also the least deviation fu...
Abstract In this paper, we consider polynomials that deviate least from zero in the L1 metric. Then...
AbstractIn the family of all r-variable real polynomials with total degree not exceeding μ and with ...
By considering four kinds of Chebyshev polynomials, an extended set of (real) results are given for ...
AbstractUsing works of Franz Peherstorfer, we examine how close the nth Chebyshev number for a set E...
The n-th Chebyshev polynomial of the first kind, Tn, maximizes various functionals on Bn, the unit b...
We are concerned with the problem of minimizing the supremum norm on [0; 1] of a nonzero polynomial ...
The Chebyshev polynomials are orthogonal polynomials used in many disparate areas of pure and applie...
We study Chebyshev's problem on polynomials that deviate least from zero with respect to \(L^p\)-mea...
The Chebyshev polynomials are orthogonal polynomials used in many disparate areas of pure and applie...
Extending a classical result of Widom from 1969, polynomials with small supremum norms are construct...
Abstract. We are concerned with the problem of minimizing the supremum norm on [0, 1] of a nonzero p...
Abstract. We study the problem of minimizing the supremum norm, on a segment of the real line or on ...
Extending a classical result of Widom from 1969, polynomials with small supremum norms are construct...
AbstractWe are concerned with the problem of finding the polynomial with minimal uniform norm on E a...
Add to ORKG