From: Zero Mind (lord.zerom1nd_at_[hidden])
Date: 2008-03-25 12:35:46
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)
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.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk