Skip to main content
Log in

On the bernstein conjecture in approximation theory

  • Published:
Constructive Approximation Aims and scope

Abstract

WithE 2n (|x|) denoting the error of best uniform approximation to |x| by polynomials of degree at most 2n on the interval [−1, +1], the famous Russian mathematician S. Bernstein in 1914 established the existence of a positive constantβ for which lim 2nE 2n (|x|)=β.n→∞ Moreover, by means of numerical calculations, Bernstein determined, in the same paper, the following upper and lower bounds forβ: 0.278<β<0.286. Now, the average of these bounds is 0.282, which, as Bernstein noted as a “curious coincidence,” is very close to 1/(2√π)=0.2820947917... This observation has over the years become known as the Bernstein Conjecture: Isβ=1/(2√π)? We show here that the Bernstein conjecture isfalse. In addition, we determine rigorous upper and lower bounds forβ, and by means of the Richardson extrapolation procedure, estimateβ to approximately 50 decimal places.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. A. Bell, S. M. Shah (1969):Oscillating polynomials and approximations to |x|. Publ. of the Ramanujan Inst.1:167–177.

    Google Scholar 

  2. S. Bernstein (1914):Sur la meilleure approximation de |x| par des polynomes de degrés donnés. Acta. Math.,37:1–57.

    Google Scholar 

  3. R. Bojanic, J. M. Elkins (1975):Bernstein's constant and best approximation on [0, ∞). Publ. de l'Inst. Math., Nouvelle série,18 (32):19–30.

    Google Scholar 

  4. Richard P. Brent (1978):A FORTRAN multiple-precision arithmetic package. Assoc. Comput. Mach. Trans. Math. Software,4:57–70.

    Google Scholar 

  5. C. Brezinski (1978): Algorithmes d'Accélération de la Convergence. Paris: Éditions Technip.

    Google Scholar 

  6. W. J. Cody, A. J. Strecok, H. C. Thacher, Jr. (1973):Chebyshev approximations for the psi function. Math. of Comp.,27:123–127.

    Google Scholar 

  7. P. Henrici (1974): Applied and Computational Complex Analysis, vol. 1. New York: John Wiley & Sons.

    Google Scholar 

  8. G. Meinardus (1967): Approximations of Functions: Theory and Numerical Methods. New York: Springer-Verlag.

    Google Scholar 

  9. E. Ya. Remez (1934):Sur le calcul effectiv des polynômes d'approximation de Tchebichef. C.R. Acad. Sci. Paris,199:337–340.

    Google Scholar 

  10. T. J. Rivlin (1969): An Introduction to the Approximation of Functions. Waltham, Massachusetts: Blaisdell Publishing Co.

    Google Scholar 

  11. D. A. Salvati (1980): Numerical Computation of Polynomials of Best Uniform Approximation to the Function |x|. Master's Thesis, Ohio State University, 39 pp. Columbus, Ohio.

    Google Scholar 

  12. E. T. Whittaker, G. N. Watson (1962): A Course of Modern Analysis, 4th ed. Cambridge: Cambridge University Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by P. Henrici.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Varga, R.S., Carpenter, A.J. On the bernstein conjecture in approximation theory. Constr. Approx 1, 333–348 (1985). https://doi.org/10.1007/BF01890040

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01890040

AMS classification

Key words and phrases

Navigation