License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-4477
URL: http://drops.dagstuhl.de/opus/volltexte/2006/447/

Demmel, James ; Dumitriu, Ioana ; Holtz, Olga

Toward accurate polynomial evaluation in rounded arithmetic (short report)

pdf-format:
Dokument 1.pdf (239 KB)


Abstract

Given a multivariate real (or complex) polynomial $p$ and a domain $cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x in {cal D}$ using rounded real (or complex) arithmetic. Here ``accurately'' means with relative error less than 1, i.e., with some correct leading digits. The answer depends on the model of rounded arithmetic: We assume that for any arithmetic operator $op(a,b)$, for example $a+b$ or $a cdot b$, its computed value is $op(a,b) cdot (1 + delta)$, where $| delta |$ is bounded by some constant $epsilon$ where $0 < epsilon ll 1$, but $delta$ is otherwise arbitrary. This model is the traditional one used to analyze the accuracy of floating point algorithms. Our ultimate goal is to establish a decision procedure that, for any $p$ and $cal D$, either exhibits an accurate algorithm or proves that none exists. In contrast to the case where numbers are stored and manipulated as finite bit strings (e.g., as floating point numbers or rational numbers) we show that some polynomials $p$ are impossible to evaluate accurately. The existence of an accurate algorithm will depend not just on $p$ and $cal D$, but on which arithmetic operators and constants are available to the algorithm and whether branching is permitted in the algorithm. Toward this goal, we present necessary conditions on $p$ for it to be accurately evaluable on open real or complex domains ${cal D}$. We also give sufficient conditions, and describe progress toward a complete decision procedure. We do present a complete decision procedure for homogeneous polynomials $p$ with integer coefficients, ${cal D} = C^n$, using only arithmetic operations $+$, $-$ and $cdot$.

BibTeX - Entry

@InProceedings{demmel_et_al:DSP:2006:447,
  author =	{James Demmel and Ioana Dumitriu and Olga Holtz},
  title =	{Toward accurate polynomial evaluation in rounded arithmetic (short report)},
  booktitle =	{Algebraic and Numerical Algorithms and Computer-assisted Proofs},
  year =	{2006},
  editor =	{Bruno Buchberger and Shin'ichi Oishi and Michael Plum and Sigfried M. Rump},
  number =	{05391},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/447},
  annote =	{Keywords: Accurate polynomial evaluation, models or rounded arithmetic}
}

Keywords: Accurate polynomial evaluation, models or rounded arithmetic
Seminar: 05391 - Algebraic and Numerical Algorithms and Computer-assisted Proofs
Issue date: 2006
Date of publication: 31.01.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI