| Thread Links | Date Links | ||||
|---|---|---|---|---|---|
| Thread Prev | Thread Next | Thread Index | Date Prev | Date Next | Date Index |
|
Vincent,
sometimes it takes time until the truth finds its way. It certainly is a mistake to identify new with better. For a more elaborate answer please see my mail of May 15, 2013 together with its attachments. With best regards Ulrich Am 16.09.2013 01:31, schrieb Vincent Lefevre: 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. -- Karlsruher Institut für Technologie (KIT) Institut für Angewandte und Numerische Mathematik D-76128 Karlsruhe, Germany Prof. Ulrich Kulisch Telefon: +49 721 608-42680 Fax: +49 721 608-46679 E-Mail: ulrich.kulisch@xxxxxxx www.kit.edu www.math.kit.edu/ianm2/~kulisch/ KIT - Universität des Landes Baden-Württemberg und nationales Großforschungszentrum in der Helmholtz-Gesellschaft |