| Thread Links | Date Links | ||||
|---|---|---|---|---|---|
| Thread Prev | Thread Next | Thread Index | Date Prev | Date Next | Date Index |
|
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. See the paper S. Rump and H. Boehm: Least significant bit evaluation of arithmetic expressions, Computing 30 (1983), pp. 189-199. Of course, you can get a highly accurate enclosure of the value of the polynomial, of the EDP or of a sum also. Best regards Ulrich -- 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 |