Hugo Duncan wrote:
How about a numerically faithful evaluation function, eg,
Langlois et al. Faithful Polynomial Evaluation with Compensated Horner Algorithm. Arxiv preprint cs.NA (2006) http://arxiv.org/abs/cs/0610122v1
Hi Hugo. You're right. I've been wondering about more faithful methods, too. The simple Horner scheme is fast (optimal without preconditioning) and efficient. However, faster algorithms are available and useful if a polynomial is to be evaluated many times. Such a function is a must in my opinion and I would like to add it to the library. On the other hand a programmer may use the library for precise calculations and here these algorithms from your link would be really helpful. I think both fast and faithful functions may be added. A programmer would choose between both. Thank you very much for this article! I haven't read it before. chose
Regards, Hugo
Regards, Pawel