Abstract
Interval arithmetic is able to be applied in the case that we evaluate the ranges of polynomials. When we evaluate the ranges of polynomials by applying the interval arithmetic, the problem that interval widths of the ranges increase extremely exists. Horner's method is widely known as the evaluating method which mitigates this problem. The purpose of this paper is to propose the new methods which are able to mitigate this problem more efficiently than the Horner's method. And in this paper, we show and compare the efficiencies of the each new method by the results of some numerical examples.
| Original language | English |
|---|---|
| Pages (from-to) | 254-261 |
| Number of pages | 8 |
| Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Volume | 2907 |
| Publication status | Published - 2004 Dec 1 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)