Solving nonlinear systems by constraint inversion and interval arithmetic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1930, Issue , 2001, Pages 127-141

  Ceberio, Martine ^a   Granvilliers, Laurent ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

AI and symbolic mathematical computing; Constraint solving; Interval arithmetic; Nonlinear system; Symbolic numeric algorithm

Indexed keywords

APPROXIMATION ALGORITHMS; LOGIC PROGRAMMING; NONLINEAR SYSTEMS; POLYNOMIALS;

BRANCH-AND-PRUNE ALGORITHMS; CONSTRAINT SOLVING; INTERVAL ARITHMETIC; INTERVAL CONSTRAINT PROPAGATION; MATHEMATICAL COMPUTING; OUTER APPROXIMATION; POLYNOMIAL EXPRESSION; SYMBOLIC-NUMERIC ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 33846105672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44990-6_10     Document Type: Conference Paper

References (20)

1. Götz Alefeld and Jürgen Herzberger. Introduction to Interval Computations. Academic Press, 1983.
2. Philippe Aubry, Daniel Lazard, and Marc Moreno Maza. On the Theories of Triangular Sets. Journal of Symbolic Computation, 28: 105-124, 1998.
3. Frédéric Benhamou and Laurent Granvilliers. Combining Local Consistency, Symbolic Rewriting and Interval Methods. In J. Calmet, J.A. Campbell, and J. Pfalzgraf, editors, Proceedings of the 3rd International Conference on Artificial Intelligence and Symbolic Mathematical Computation, volume 1138 of LNCS, pages 144-159, Steyr, Austria, 1996. Springer-Verlag.
4. Dario Bini and Bernard Mourrain. Handbook of Polynomial Systems. http://www-sop.inria.fr/saga/POL/, 1996.
5. Bruno Buchberger. Gröbner Bases: an Algorithmic Method in Polynomial Ideal Theory. In Multidimensional Systems Theory, pages 184-232. D. Reidel Publishing Company, 1985.
6. John G. Cleary. Logical Arithmetic. Future Computing Systems, 2(2): 125-149, 1987.
7. Georges Edwin Collins and Hoon Hong. Partial Cylindrical Algebraic Decomposition for Quantifier Elimination. Journal of Symbolic Computation, 12(3): 299-328, 1991.
8. Eldon Robert Hansen. Global Optimization using Interval Analysis. Marcel Dekker, 1992.
9. Ralph Baker Kearfott. Some Tests of Generalized Bisection. ACM Transactions on Mathematical Software, 13(3): 197-220, 1987.
10. Shankar Krishnan and Dinesh Manocha. Numeric-symbolic Algorithms for Evaluating One-dimensional Algebraic Sets. In Proceedings of International Symposium on Symbolic and Algebraic Computation, pages 59-67. ACM Press, 1995.
11. Alan K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8(1): 99-118, 1977.
12. Kyoko Makino and Martin Berz. Efficient Control of the Dependency Problem based on Taylor Model Method. Reliable Computing, 5: 3-12, 1999.
13. Ramon Edgar Moore. Interval Analysis. Prentice-Hall, Englewood Cliffs, NJ, 1966.
14. Volker Stahl. Interval Methods for Bounding the Range of Polynomials and Solving Systems of Nonlinear Equations. PhD thesis, University of Linz, Austria, 1995.
15. Josef Stoer and Roland Bulirsch. Introduction to Numerical Analysis. Texts in Applied Mathematics. Springer, 2nd edition, 1993.
16. Maarten Hermann Van Emden. Canonical extensions as common basis for interval constraints and interval arithmetic. In F. Benhamou, editor, Proceedings of the 6th French Conference on Logic Programming and Constraint Programming, pages 71-83. Hermès, 1997.
17. Pascal Van Hentenryck, David McAllester, and Deepak Kapur. Solving Polynomial Systems Using a Branch and Prune Approach. SIAM Journal on Numerical Analysis, 34(2): 797-827, 1997.
18. Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica: a Modeling Language for Global Optimization. MIT Press, 1997.
19. Jan Verschelde. Database of Polynomial Systems. Michigan State University, USA, 1999. http://www.math.msu.edu/~jan/demo.html.
20. Jan Verschelde. PHCpack: A General-purpose Solver for Polynomial Systems by Homotopy Continuation. ACM Transactions on Mathematical Software, 25(2): 251-276, 1999.