Solving polynomial systems using a branch and prune approach

SIAM Journal on Numerical Analysis

Volumn 34, Issue 2, 1997, Pages 797-827

  Van Hentenryck, Pascal ^a,b,c   Mcallester, David ^a,b,c   Kapur, Deepak ^a,b,c  

^a Brown University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c State University of New York   (United States)

Author keywords

Global methods; Interval and finite analysis; System of equations

Indexed keywords

EID: 0000524439     PISSN: 00361429     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0036142995281504     Document Type: Article

References (35)

1. G. ALEFELD AND J. HERZBERGER, Introduction to Interval Computations, Academic Press, New York, 1983.
2. F. BENHAMOU, D. MCALLESTER, AND P. VAN HENTENRYCK, CLP (intervals) revisited, in Proceedings of the International Symposium on Logic Programming (ILPS-94), Ithaca, NY, November 1994, pp. 124-138.
3. F. BENHAMOU AND W. OLDER, Applying interval arithmetic to real, integer and Boolean constraints, J. Logic Programming, to appear.
4. R. HAMMER, M. HOCKS, M. KULISCH, AND D. RATZ, Numerical Toolbox for Verified Computing I - Basic Numerical Problems, Theory, Algorithms, and PASCAL-XSC Programs, Springer-Verlag, Heidelberg, 1993.
5. E. HANSEN, Global Optimization Using Interval Analysis, Marcel Dekker, New York, 1992.
6. E. R. HANSEN, Global optimization using interval analysis: The multi-dimensional case, Numer. Math, 34 (1980), pp. 247-270.
7. E. R. HANSEN AND R. I. GREENBERG, An interval Newton method, Appl. Math. Comput., 12 (1983), pp. 89-98.
8. E. R. HANSEN AND S. SENGUPTA, Bounding solutions of systems of equations using interval analysis, BIT, 21 (1981), pp. 203-211.
9. E. R. HANSEN AND R. R. SMITH, Interval arithmetic in matrix computation: Part II, SIAM J. Numer. Anal., 4 (1967), pp. 1-9.
10. R. J. HANSON, Interval Arithmetic as a Closed Arithmetic System on a Computer, Jet Propulsion Laboratory Report 197, Pasadena, CA, 1968.
11. H. HONG AND V. STAHL, Safe starting regions by fixed points and tightening, Computing, 53 (1994), pp. 323-335.
12. W. M. KAHAN, A More Complete Interval Arithmetic, Lecture notes, University of Michigan, Ann Arbor, MI, Summer 1968.
13. H. B. KEARFOTT, Preconditioned for the interval Gauss-Seidel method, SIAM J. Numer. Anal., 27 (1990), pp. 804-822.
14. R. B. KEARFOTT, A Review of preconditioned for the interval Gauss-Seidel method, Interval Comput., 1 (1991), pp. 59-85.
15. R. KRAWCZYK, Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken, Computing, 4 (1969), pp. 187-201.
16. A. K. MACKWORTH, Consistency in networks of relations, Artificial Intelligence, 8 (1977), pp. 99-118.
17. K. MEINTJES AND A. P. MORGAN, Chemical equilibrium systems as numerical test problems, ACM Trans. Math. Software, 16 (1990), pp. 143-151.
18. U. MONTANARI, Networks of constraints: Fundamental properties and applications to picture processing, Inform. Sci., 7 (1974), pp. 95-132.
19. R. E. MOORE, Interval Analysis, Prentice-Hall, Englewood Cliffs, NJ, 1966.
20. R. E. MOORE, Methods and Applications of Interval Analysis, SIAM, Philadelphia, PA, 1979.
21. R. E. MOORE AND S. T. JONES, Safe starting regions for iterative methods, SIAM J. Numer. Anal., 14 (1977), pp. 1051-1065.
22. J. J. MORE AND M. Y. COSNARD, Numerical solution of nonlinear equations, ACM Trans. Math. Software, 5 (1979), pp. 64-85.
23. A. P. MORGAN, Computing all solutions to polynomial systems using homotopy continuation, Appl. Math. Comput., 24 (1987), pp. 115-138.
24. A. P. MORGAN, Solving Polynomial Systems Using Continuation for Scientific and Engineering Problems, Prentice-Hall, Englewood Cliffs, NJ, 1987.
25. A. NEUMAIER, Interval methods for systems of equations, Prentice-Hall Internat. Ser. Comput. Sci., Cambridge University Press, Cambridge, 1990.
26. W. OLDER AND A. VELLINO, Extending prolog with constraint arithmetics on real intervals, in Canadian Conference on Computer and Electrical Engineering, Ottawa, 1990.
27. L. B. RALL, Automatic differentiation: Techniques and applications, Lecture Notes in Comput. Sci., Springer-Verlag, New York, 1981.
28. H. RATSCHEK AND J. ROKNE, New Computer Methods for Global Optimization, Ellis Horwood Limited, Chichester, 1988.
29. S. M. RUMP, Verification methods for dense and sparse systems of equations, in Topics in Validated Computations, J. (Ed.) Herzberger, ed., Eisevier, New York, 1988, pp. 217-231.
30. J. SlSKIND AND D. McALLESTER, Nondeterministic lisp as a substrate for constraint logic programming, in AAAI-93, 1993, pp. 133-138.
31. P. VAN HENTENRYCK, A logic language for combinatorial optimization, Ann. Oper. Res., 21 (1989), pp. 247-274.
32. P. VAN HENTENRYCK, Constraint Satisfaction in Logic Programming, Logic Programming Series, MIT Press, Cambridge, MA, 1989.
33. P. VAN HENTENRYCK, D. McALLESTER, AND D. KAPUR, Interval Methods Revisited, Tech. report No. 1524, MIT AI Lab, MIT, Cambridge, MA, 1995.
34. P. VAN HENTENRYCK, V. SARASWAT, AND Y. DEVILLE, The design, implementation, and evaluation of the constraint language cc(FD), in Constraint Programming: Basics and Trends, Springer-Verlag, New York, 1995.
35. J VERSCHELDE, P. VERLINDEN, AND R. COOLS, Homotopies exploiting Newton polytopes For solving sparse polynomial systems, SIAM J. Numer. Anal., 31 (1994), pp. 915-930.