Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

1 results

  • 10 - Minimax Polynomial Approximation

  • from Part II - Constructive Approximation Theory
  • Abner J. Salgado, University of Tennessee, Knoxville, Steven M. Wise, University of Tennessee, Knoxville
  • Book:
    Classical Numerical Analysis
    Published online:
    29 September 2022
    Print publication:
    20 October 2022, pp 266-299

  • Summary

    In this chapter we begin the study of best approximations. In this case we study the best (min) polynomial approximation in the uniform (max) norm. The existence a best approximating polynomial is first presented. The more subtle issue of uniqueness is then discussed. To show uniqueness the celebrated de la Vallee Poussin, and Chebyshev equi-oscillation theorems are presented. A first error estimate is then presented. The problems of interpolation, discussed in the previous chapter, and best approximation are then related via the Lebesgue constant. Chebyshev polynomials are then introduced, and their most relevant properties presented. Interpolation at Chebyshev nodes, and the mitigation of the Runge phenomenon are then discussed. Finally; Bernstein polynomials; moduli of continuity and smoothness; are detailed in order to study Weierstrass approximation theorem.