Algorithm 812: BPOLY: An object-oriented library of numerical algorithms for polynomials in bernstein form

ACM Transactions on Mathematical Software

Volumn 27, Issue 2, 2001, Pages 267-296

  Tsai, Yi Feng ^a   Farouki, Rida T ^a  

^a University of California   (United States)

Author keywords

Algorithms; Bernstein basis; G.1.0 Numerical Analysis : General; G.1.5 Numerical Analysis : Roots of Nonlinear Equations; G.4 Mathematics of Computing : Mathematical Software Algorithm design and analysis; Performance; Theory

Indexed keywords

EID: 0038375748     PISSN: 00983500     EISSN: None     Source Type: Journal    
DOI: 10.1145/383738.383743     Document Type: Article

References (34)

1. ATKINSON, K. 1989. An Introduction to Numerical Analysis. 2nd ed. John Wiley, New York, NY.
2. BERCHTOLD, J. AND BOWYER, A. 2000. Robust arithmetics for multivariate Bernstein-form polynomials. Comput. Aided Des. 32, 681-689.
3. BERNSTEIN, S. N. 1912. On the best approximation of continuous functions by polynomials of a given degree. Commun. Kharkow Math. Soc. (Series 2) 13, 49-194. In Russian.
4. BOGDANOVICH, A. E. 2000. Three-dimensional variational theory of laminated composite plates and its implementation with Bernstein basis functions. Comput. Methods Appl. Mech. Eng. 185, 2-4, 279-304.
5. BOGDANOVICH, A. E. AND YUSHANOV, S. P. 1999. Progressive failure analysis of adhesive bonded joints with laminated composite adherends. J. Reinforced Plastics Composites 18, 18, 1689-1707.
6. DANIEL, M. AND DAUBISSE, J. C. 1989. The numerical problem of using Bézier curves and surfaces in the power basis. Comput. Aided Geom. Des. 6, 2 (May), 121-128.
7. DEROSE, T. D. 1988. Composing Bezier simplexes. ACM Trans. Graph. 7, 3 (July), 198-221.
8. FARIN, G. 1997. Curves and Surfaces for Computer Aided-Geometric Design. 4th ed. Academic Press, Inc., New York, NY.
9. FAROUKI, R. T. 1991a. On the stability of transformations between power and Bernstein polynomial forms. Comput. Aided Geom. Des. 8, 1 (Feb.), 29-36.
10. FAROUKI, R. T. 1991b. Computing with barycentric polynomials. Math. Intell. 13, 61-69.
11. FAROUKI, R. T. 2000. Legendre-Bernstein basis transformations. J. Comput. Appl. Math. 119, 1-2, 145-160.
12. FAROUKI, R. T. AND GOODMAN, T. N. T. 1996. On the optimal stability of the Bernstein basis. Math. Comput. 65, 216, 1553-1566.
13. FAROUKI, R. T. AND NEFF, C. A. 1990. On the numerical condition of Bernstein-Bézier subdivision processes. Math. Comput. 55, 192, 637-647.
14. FAROUKI, R. T. AND RAJAN, V. T. 1987. On the numerical condition of polynomials in Bernstein form. Comput. Aided Geom. Des. 4, 3 (Nov.), 191-216.
15. FAROUKI, R. T. AND RAJAN, V. T. 1988. Algorithms for polynomials in Bernstein form. Comput. Aided Geom. Des. 5, 1 (June), 1-26.
16. FAROUKI, R. T., TSAI, Y.-F., AND WILSON, C. S. 2000. Physical constraints on feedrates and feed accelerations along curved tool paths. Comput. Aided Geom. Des. 17, 4, 337-359.
17. GOETGHELUCK, P. 1987. Computing binomial coefficients. Am. Math. Monthly 94, 4 (Apr.), 360-365.
18. GOETGHELUCK, P. 1988. On prime divisors of binomial coefficients. Math. Comput. 51, 183, 325-329.
19. HENRICI, P. 1964. Elements of Numerical Analysis. John Wiley, New York, NY.
20. HERMANN, T. 1996. On the stability of polynomial transformations between Taylor, Bézier, and Hermite forms. Num. Alg. 13, 307-320.
21. HO, T.-S. AND RABITZ, H. 2000. Proper construction of ab intio global potential surfaces with accurate long-range interactions. J. Chem. Phys. 113, 10, 3960-3968.
22. HOSCHEK, J. AND LASSER, D. 1993. Fundamentals of Computer Aided Geometric Design. A. K. Peters, Ltd., Wellesley, MA.
23. LANE, J. M. AND RIESENFELD, R. F. 1980. A theoretical development for the computer generation and display of piecewise polynomial surfaces. IEEE Trans. Pattern Anal. Mach. Intell. 2, 1, 35-46.
24. LANE, J. M. AND RIESENFELD, R. F. 1981. Bounds on a polynmomial. BIT 21, 112-117.
25. MÜLLER, H. AND OTTE, M. 1991. Solving algebraic systems in Bernstein-Bézier representation. In Computational Geometry - Methods, Algorithms, and Applications, H. Bieri and H. Noltemeier, Eds. Springer Lecture Notes in Computer Science, vol. 553. Springer-Verlag, New York, NY, 161-169.
26. RAMSHAW, L. 1987. Blossoming: A connect-the-dots approach to splines. Tech. Rep. 19. Digital Systems Research Center.
27. RAMSHAW, L. 1989. Blossoms are polar forms. Comput. Aided Geom. Des. 6, 4 (Nov.), 323-358.
28. RIVLIN, T. J. 1990. Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory. 2nd ed. John Wiley, New York, NY.
29. SAMADI, S. 2000. Explicit formula for improved filter sharpening polymomial. IEEE Trans. Signal Process. 9, 10, 2957-2959.
30. SCHÖNHAGE, A. 1985. Quasi-GCD computations. J. Complexity 1, 1, 118-137.
31. SPENCER, M. R. 1994. Polynomial real root finding in Bernstein form. Ph.D. Dissertation. Brigham Young University, Provo, UT.
32. STROUSTRUP, B. 1997. The C++ Programming Language. 3rd ed. Addison-Wesley, Reading, MA.
33. USPENSKY, J. V. 1948. Theory of Equations. McGraw-Hill, Inc., New York, NY.
34. ZETTLER, M. AND GARLOFF, J. 1998. Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion. IEEE Trans. Automat. Contr. 43, 3, 425-431.