Corpus ID: 128358591

Bounds on strong unicity for Chebyshev approximation with bounded coefficients

@article{Sipos2019BoundsOS,
  title={Bounds on strong unicity for Chebyshev approximation with bounded coefficients},
  author={A. Sipos},
  journal={arXiv: Classical Analysis and ODEs},
  year={2019}
}
  • A. Sipos
  • Published 2019
  • Mathematics
  • arXiv: Classical Analysis and ODEs
  • 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… CONTINUE READING

    References

    SHOWING 1-10 OF 15 REFERENCES
    Analysing proofs in analysis
    • 92
    Effective Moduli from Ineffective Uniqueness Proofs. An Unwinding of de La Vallée Poussin's Proof for Chebycheff Approximation
    • U. Kohlenbach
    • Mathematics, Computer Science
    • Ann. Pure Appl. Log.
    • 1993
    • 95
    PROOF-THEORETIC METHODS IN NONLINEAR ANALYSIS
    • 24
    • PDF
    Proof mining in L1-approximation
    • 32
    Recent Progress in Proof Mining in Nonlinear Analysis
    • 24
    • PDF
    Equivalence of the combinatorial and the classical definitions of schur functions
    • R. A. Proctor
    • Computer Science, Mathematics
    • J. Comb. Theory, Ser. A
    • 1989
    • 15
    Symmetric functions and Hall polynomials
    • 6,667
    • PDF