Details:

Title	Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving
Author(s)	Frederic Benhamou, Laurent Granvilliers
Text	F. Benhamou and L. Granvilliers. Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving. Reliable Computing, 3(3):335-344, 1997.
Type	Article in Journal
Abstract	In this paper we present a framework for the cooperation of symbolic and propagation-based numerical solvers over the real numbers. This cooperation is expressed in terms of fixed points of closure operators over a complete lattice of constraint systems. In a second part we instantiate this framework to a particular cooperation scheme, where propagation is associated to pruning operators implementing interval algorithms enclosing the possible solutions of constraint systems, whereas symbolic methods are mainly devoted to generate redundant constraints. When carefully chosen, it is well known that the addition of redundant constraint drastically improve the performances of systems based on local consistency (e.g. Prolog IV or Newton). We propose here a method which computes sets of redundant polynomials called partial Grobner bases and show on some benchmarks the advantages of such computations.
Keywords
Length	10
File
Language	English
Journal	Reliable Computing
Volume	3
Pages	335 - 344
Year	1997
Translation	No
Refereed	No