Thread Links Date Links
Thread Prev Thread Next Thread Index Date Prev Date Next Date Index

Re: Information



On 2013-09-15 22:09:00 +0200, Ulrich Kulisch wrote:
> Am 07.09.2013 02:20, schrieb Vincent Lefevre:
> > And exact polynomial evaluation could be useful too.
> 
> With an EDP you get an exact polynomial evaluation easily.

One can get *faster* polynomial evaluation without EDP.

> See the paper S. Rump and H. Boehm: /Least significant bit
> evaluation of arithmetic expressions,/ Computing 30 (1983), pp.
> 189-199.

That's old! Things have evolved since, for instance with the
FMA operation.

-- 
Vincent Lefèvre <vincent@xxxxxxxxxx> - Web: <http://www.vinc17.net/>
100% accessible validated (X)HTML - Blog: <http://www.vinc17.net/blog/>
Work: CR INRIA - computer arithmetic / AriC project (LIP, ENS-Lyon)