Solving Polynomial Systems Using a Branch and Prune Approach

  title={Solving Polynomial Systems Using a Branch and Prune Approach},
  author={Pascal Van Hentenryck and David McAllester and Deepak Kapur},
This paper presents Newton, a branch and prune algorithm used to find all isolated solutions of a system of polynomial constraints. Newton can be characterized as a global search method which uses intervals for numerical correctness and for pruning the search space early. The pruning in Newton consists of enforcing at each node of the search tree a unique local consistency condition, called box-consistency, which approximates the notion of arc-consistency well known in artificial intelligence… CONTINUE READING
Highly Influential
This paper has highly influenced 24 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 288 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 165 extracted citations

Systemic optimization of an active vibration micro-isolator: An interval computation and constraint propagation based approach

2014 IEEE/ASME International Conference on Advanced Intelligent Mechatronics • 2014
View 5 Excerpts
Highly Influenced

Progress in the Solving of a Circuit Design Problem

J. Global Optimization • 2001
View 6 Excerpts
Highly Influenced

Combining Interval Constraint Solving Methods

IRIN, France Laurent. Granvilliers
View 14 Excerpts
Highly Influenced

288 Citations

Citations per Year
Semantic Scholar estimates that this publication has 288 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 34 references

Homotopies Exploiting Newton Polytopes For Solving Sparse Polynomial Systems

J Verschelde, P. Verlinden, R. Cools
SIAM Journal on Numerical Analysis, 31(3):915{930 • 1994
View 9 Excerpts
Highly Influenced

Safe starting regions by fixed points and tightening

Computing • 1994
View 7 Excerpts
Highly Influenced

Bounding Solutions of Systems of Equations Using Interval Analysis

E. R. Hansen, S. Sengupta
BIT, 21:203{211 • 1981
View 4 Excerpts
Highly Influenced

Interval Arithmetic in Matrix Computation: Part II

E. R. Hansen, R. R. Smith
SIAM Journal on Numerical Analysis, 4:1{9 • 1967
View 3 Excerpts
Highly Influenced

The Design

P Van Hentenryck, V. Saraswat, Y. Deville
Implementation, and Evaluation of the Constraint Language cc(FD), volume Constraint Programming: Basics and Trends. Springer Verlag • 1995
View 1 Excerpt

The Design , Implementation , and Evaluationof the Constraint Language cc ( FD )

V. Saraswat P. Van Hentenryck
Constraint Programming : Basics and Trends . SpringerVerlag • 1995

Similar Papers

Loading similar papers…