Given a multivariate real (or complex) polynomial p and a domain D, we would like to decide whether an algorithm exists to evaluate p(x) accurately for all x ∈ 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 ab, its computed value is op(a, b)� (1+δ), where |δ| is bounded by some constant ǫ where 0 < ǫ ≪ 1, but δ 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 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 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 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,D = C n , using only arithmetic operations +, − and � .
[1]
B. Sturmfels,et al.
Combinatorial Commutative Algebra
,
2004
.
[2]
J. Demmel.
On condition numbers and the distance to the nearest ill-posed problem
,
2015
.
[3]
Olga Taussky-Todd.
SOME CONCRETE ASPECTS OF HILBERT'S 17TH PROBLEM
,
1996
.
[4]
G. Alefeld,et al.
Introduction to Interval Computation
,
1983
.
[5]
G. Ziegler.
Lectures on Polytopes
,
1994
.
[7]
J. Renegar,et al.
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I
,
1989
.
[8]
James Demmel,et al.
Toward accurate polynomial evaluation in rounded arithmetic
,
2005,
ArXiv.
[9]
G. Sacks.
A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY
,
2003
.
[10]
James Demmel,et al.
Accurate and Ecient Algorithms for Floating Point Computation
,
2003
.
[11]
Kenneth L. Clarkson,et al.
Safe and effective determinant evaluation
,
1992,
Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[12]
James Renegar,et al.
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination
,
1992,
J. Symb. Comput..
[13]
Jonathan Richard Shewchuk,et al.
Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates
,
1997,
Discret. Comput. Geom..