Evaluation of multivariate polynomials and their derivatives
HTML articles powered by AMS MathViewer
- by J. Carnicer and M. Gasca PDF
- Math. Comp. 54 (1990), 231-243 Request permission
Abstract:
An extension of Horner’s algorithm to the evaluation of m-variate polynomials and their derivatives is obtained. The schemes of computation are represented by trees because this type of graph describes exactly in which order the computations must be done. Some examples of algorithms for one and two variables are given.References
-
J. Butcher, Numerical analysis of differential equations, Wiley, New York, 1985.
- M. Gasca and J. I. Maeztu, On Lagrange and Hermite interpolation in $\textbf {R}^{k}$, Numer. Math. 39 (1982), no. 1, 1–14. MR 664533, DOI 10.1007/BF01399308
- M. Gasca and V. Ramírez, Interpolation systems in $\textbf {R}^{k}$, J. Approx. Theory 42 (1984), no. 1, 36–51. MR 757103, DOI 10.1016/0021-9045(84)90054-6
- Donald E. Knuth, The art of computer programming, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975. Volume 1: Fundamental algorithms. MR 0378456 L. Schumaker and W. Volk, Efficient evaluation of multivariate polynomials, Comput. Aided Geom. Des. 3 (1986), 149-154.
Additional Information
- © Copyright 1990 American Mathematical Society
- Journal: Math. Comp. 54 (1990), 231-243
- MSC: Primary 12-04; Secondary 68Q20, 68Q40, 68R10
- DOI: https://doi.org/10.1090/S0025-5718-1990-0993925-1
- MathSciNet review: 993925