Evaluation of Polynomials
Ulrich Kulisch,
Rolf Hammer,
Matthias Hocks and
Dietmar Ratz
Additional contact information
Ulrich Kulisch: Universität Karlsruhe, Institut für Angewandte Mathematik
Rolf Hammer: Universität Karlsruhe, Institut für Angewandte Mathematik
Matthias Hocks: Universität Karlsruhe, Institut für Angewandte Mathematik
Dietmar Ratz: Universität Karlsruhe, Institut für Angewandte Mathematik
Chapter Chapter 4 in C++ Toolbox for Verified Computing I, 1995, pp 57-69 from Springer
Abstract:
Abstract In this chapter, we consider the evaluation of a polynomial function of a single variable. We usually compute the value of an arithmetic function by replacing each arithmetic operation by its corresponding floating-point machine operation (see Section 3.5). Roundoff errors and cancellations sometimes cause the calculated result to be drastically wrong. For similar reasons, a naive interval evaluation of a polynomial may lead to intervals so large as to be practically useless. Roundoff and cancellation errors are especially dangerous if we are evaluating a function close to a root, as we will see in Chapter 9 when we compute verified enclosures of zeros of polynomials.
Keywords: Interval Arithmetic; Maximum Accuracy; Real Polynomial; Error Code; Iterative Refinement (search for similar items in EconPapers)
Date: 1995
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-79651-7_4
Ordering information: This item can be ordered from
http://www.springer.com/9783642796517
DOI: 10.1007/978-3-642-79651-7_4
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().