Polynomial Approximation

  • Richard E. Bellman
  • Robert S. Roth
Part of the Mathematics and Its Applications book series (MAIA, volume 26)


In this chapter we shall consider polynomial approximation in its most simple form. As in the last chapter we shall restrict ourselves, for convenience, to the closed interval (0,1), and we will let f(x) be a real valued continuous function defined in the interval.


Dynamic Program Node Point Closed Interval Polynomial Approximation Unit Cube 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography and Comments

  1. Gillman, L. and M. Jerison,:1960, Rings of Continuous Functions SpringerGoogle Scholar
  2. Titchmarsh, E.C.:1939, Theory of Functions, Oxford University PressGoogle Scholar
  3. Bellman, R. and R.S. Roth,:1969, “Curve Fitting by Segmented Straight Lines”, J.Amer. Stat.Assoc, 64, 1079–1084MathSciNetCrossRefGoogle Scholar
  4. Bellman, R.:1957, Dynamic Programming, Princeton University Press, Princeton, N.J.Google Scholar
  5. Bellman, R. and S. Dreyfus,:1962, Applied Dynamic Programming, Princeton University Press, Princeton, N.J.zbMATHGoogle Scholar
  6. Gallagher, R.H.:1975, Finite Element Analysis Fundamentals, Prentice-Hall Englewood, N.J.Google Scholar
  7. Zienkiewicz, O.C.:1971, The Finite Element Method in Engineering Science, McGraw-Hill, LondonGoogle Scholar

Copyright information

© D Reidel Publishing Company 1986

Authors and Affiliations

  • Richard E. Bellman
    • 1
    • 2
  • Robert S. Roth
    • 3
  1. 1.Department of Electrical EngineeringUniversity of Southern CaliforniaLos AngelesUSA
  2. 2.Center for Applied MathematicsThe University of GeorgiaAthensUSA
  3. 3.BostonUSA

Personalised recommendations