Skip to main content
Log in

Computing with barycentric polynomials

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope Submit manuscript

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.

References

  1. J. H. Davenport, Y. Siret, and E. Tournier,Computer Algebra, London: Academic Press (1988).

    MATH  Google Scholar 

  2. P. J. Davis,Interpolation and Approximation, New York: Dover (1975).

    MATH  Google Scholar 

  3. J. W. Demmel, On condition numbers and the distance to the nearest ill-posed problem,Numer. Math. 51 (1988), 251–289.

    Article  MathSciNet  Google Scholar 

  4. G. Farin,Curves and Surfaces for Computer-aided Geometric Design, New York: Academic Press (1988).

    MATH  Google Scholar 

  5. R. T. Farouki, On the stability of transformations between power and Bernstein polynomial forms,Comput. Aided Geom. Design 8 (1991), 29–36.

    Article  MATH  MathSciNet  Google Scholar 

  6. R. T. Farouki and C. A. Neff, On the numerical condition of Bernstein-Bézier subdivision processes,Math. Comp. 55 (1990), 637–647.

    MATH  MathSciNet  Google Scholar 

  7. R. T. Farouki and V. T. Rajan, On the numerical condition of polynomials in Bernstein form,Comput. Aided Geom. Design 4 (1987), 191–216.

    Article  MATH  MathSciNet  Google Scholar 

  8. —, Algorithms for polynomials in Bernstein form,Comput. Aided Geom. Design 5 (1988), 1–26.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. R. Forrest, Interactive interpolation and approximation by Bézier polynomials,Computer J. 15 (1972), 71–79.

    Article  MATH  MathSciNet  Google Scholar 

  10. W. Gautschi, On the condition of algebraic equations,Numer. Math. 21 (1973), 405–424.

    Article  MATH  MathSciNet  Google Scholar 

  11. —, Questions of numerical condition related to polynomials,Studies in Numerical Analysis (G. H. Golub, ed.), MAA Studies in Mathematics 24 (1984), 140–177.

    MATH  MathSciNet  Google Scholar 

  12. W. J. Gordon and R. F. Riesenfeld, Bernstein-Bezier methods for the computer-aided design of free-form curves and surfaces,J. Assoc. Comput. Mach. 21 (1974), 293–310.

    Article  MATH  MathSciNet  Google Scholar 

  13. P. Henrici,Elements of Numerical Analysis, New York: Wiley (1964), 77–83.

    MATH  Google Scholar 

  14. J. M. Lane and R. F. Riesenfeld, Bounds on a polynomial,BIT 21 (1981), 112–117.

    Article  MATH  MathSciNet  Google Scholar 

  15. G. G. Lorentz,Bernstein Polynomials, New York: Chelsea (1986).

    MATH  Google Scholar 

  16. R. G. Mosier, Root neighborhoods of a polynomial,Math. Comp. 47 (1986), 265–273.

    Article  MATH  MathSciNet  Google Scholar 

  17. T. Poston and I. Stewart,Catastrophe Theory and Its Applications, London: Pitman (1978), 442–444.

    MATH  Google Scholar 

  18. J. R. Rice, On the conditioning of polynomial and rational forms,Numer. Math. 7 (1965), 426–435.

    Article  MATH  MathSciNet  Google Scholar 

  19. —, A theory of condition,SIAM J. Numer. Anal. 3 (1966), 287–310.

    Article  MATH  MathSciNet  Google Scholar 

  20. J. H. Wilkinson, The evaluation of the zeros of ill-conditioned polynomials,Numer. Math. 1 (1959), 150–180.

    Article  MATH  MathSciNet  Google Scholar 

  21. —, The perfidious polynomial,Studies in Numerical Analysis (G. H. Golub, ed.), MAA Studies in Mathematics 24 (1984), 1–28.

    MATH  MathSciNet  Google Scholar 

  22. —,The Algebraic Eigenvalue Problem, Oxford: Clarendon Press (1988).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Farouki, R.T. Computing with barycentric polynomials. The Mathematical Intelligencer 13, 61–69 (1991). https://doi.org/10.1007/BF03028345

Download citation

  • Published:

  • Issue Date:

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

Keywords

Navigation