Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounds on strong unicity for Chebyshev approximation with bounded coefficients

Published 23 Apr 2019 in math.CA and math.LO | (1904.10284v3)

Abstract: We obtain new effective results in best approximation theory, specifically moduli of uniqueness and constants of strong unicity, for the problem of best uniform approximation with bounded coefficients, as first considered by Roulier and Taylor. We make use of techniques from the field of proof mining, as introduced by Kohlenbach in the 1990s. In addition, some bounds are obtained via the Lagrangian interpolation formula as extended through the use of Schur polynomials to cover the case when certain coefficients are restricted to be zero.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.