Greedy algorithms for optimizing multivariate Horner schemes

@article{Ceberio2004GreedyAF,
  title={Greedy algorithms for optimizing multivariate Horner schemes},
  author={Martine Ceberio and Vladik Kreinovich},
  journal={ACM SIGSAM Bulletin},
  year={2004},
  volume={38},
  pages={8-15}
}
For univariate polynomials <i>f</i>(<i>x</i><sub>1</sub>), Horner's scheme provides the fastest way to compute a value. For multivariate polynomials, several different version of Horner's scheme are possible; it is not clear which of them is optimal. In this paper, we propose a greedy algorithm, which it is hoped will lead to good computation times.The univariate Horner scheme has another advantage: if the value <i>x</i><sub>1</sub> is known with uncertainty, and we are interested in the… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

Similar Papers

Loading similar papers…