I need to solve polynomials in multiple variables using Horner's scheme in Fortran90/95. The main reason for doing this is the increased efficiency and accuracy that occurs when using Horner's scheme to evaluate polynomials.

I currently have an implementation of Horner's scheme for univariate/single variable polynomials. However, developing a function to evaluate multivariate polynomials using Horner's scheme is proving to be beyond me.

An example bivariate polynomial would be: $12x^2y^2+8x^2y+6xy^2+4xy+2x+2y$ which would factorised to $x(x(y(12y+8))+y(6y+4)+2)+2y$ and then evaluated for particular values of x & y.


I've done my research and found a number of papers such as:


However, I'm not a mathematician or computer scientist, so I'm having trouble with the mathematics used to convey the algorithms and ideas.

As far as I can tell the basic strategy is to turn a multivariate polynomial into separate univariate polynomials and compute it that way.

Can anyone help me? If anyone could help me turn the algorithms into pseudo-code that I can implement into Fortran myself, I would be very grateful.

  • $\begingroup$ Maybe you'd get more help on StackOverflow than here. $\endgroup$ – Gerry Myerson Jun 17 '10 at 7:08

The paper you cite, "On the multivariate Horner scheme" (Pena, Sauer) has an explicit algorithm specified on p.3. The remaining challenge is to penetrate the notation and conventions in the paper laid out in the first three pages far enough to turn their algorithm presentation into code.

It also seems that this paper (just reading the abstract) specifies an explicit algorithm: "Evaluation of Multivariate Polynomials and Their Derivatives," J. Carnicer and M. Gasca, Mathematics of Computation, Vol. 54, No. 189 (Jan., 1990), pp. 231-243.


I implemented this in Python: multivar_horner

You can look at the approach used there and port it to Fortran.

NOTE: To the best of my knowledge there is no known algorithm for finding the optimal horner factorisation of a multivariate polynomial. The best one can do is to use a clever heuristic to find "good" factorisations. I implemented a greedy heuristic similar to the one described in the paper "Greedy Algorithms for Optimizing Multivariate Horner Schemes".

The authors of some related publications (including the above mentioned) claim to have an implementation of their proposed algorithms, but I was not able to find any publicly available ones.


Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.