Compensated Horner scheme in complex floating point arithmetic

Abstract : Several different techniques and softwares intend to improve the accuracy of results computed in a fixed finite precision. Here we focus on a method to improve the accuracy of polynomial evaluation via Horner’s scheme. Such an algorithm exists for polynomials with real floating point coefficients. In this paper, we provide a new algorithm which deals with polynomials with complex floating point coefficients. We show that the computed result is as accurate as if computed in twice the working precision. The algorithm is simple since it only requires addition, subtraction and multiplication of floating point numbers in the same working precision as the given data. Such an algorithm can be useful for example to compute zeros of polynomial by Newton-like methods.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01300860
Contributor : Lip6 Publications <>
Submitted on : Monday, April 11, 2016 - 2:54:32 PM
Last modification on : Thursday, March 21, 2019 - 2:17:03 PM

Identifiers

  • HAL Id : hal-01300860, version 1

Citation

Stef Graillat, Valérie Ménissier-Morain. Compensated Horner scheme in complex floating point arithmetic. Proceedings, 8th Conference on Real Numbers and Computers, Jul 2008, Santiago de Compostela, Spain. pp.133-146. ⟨hal-01300860⟩

Share

Metrics

Record views

67