On range evaluation of polynomials by applying interval arithmetic. (English) Zbl 1151.65322
Lirkov, Ivan (ed.) et al., Large-scale scientific computing. 4th international conference, LSSC 2003, Sozopol, Bulgaria, June 4–8, 2003. Revised papers. Berlin: Springer (ISBN 3-540-21090-3/pbk). Lecture Notes in Computer Science 2907, 254-261 (2004).
Summary: 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 com pare the efficiencies of the each new method by the results of some numerical examples.
For the entire collection see [Zbl 1049.65004].
For the entire collection see [Zbl 1049.65004].
MSC:
| 65G30 | Interval and finite arithmetic |
