Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleA Symbolic-Numerical Branch and Prune Algorithm for Solving Non-linear Polynomial Systems
Author(s) Laurent Granvilliers
TypeArticle in Journal
AbstractThis paper discusses the processing of non-linear polynomial systems using a branch and prune algorithm within the framework of constraint programming. We propose a formalism for a kind of branch and prune algorithm implementing symbolic and numerical methods to reduce the systems with respect to a relation defined from both inclusion of variable domains and inclusion of sets of constraints. The second part of the paper presents an instantiation of this general scheme. The pruning step is implemented as a cooperation of factorizations, substitutions and partial computations of Grobner bases to simplify the systems, and interval Newton methods address the numerical, approximate solving. The branching step creates a
partition of domains or generates disjunctive constraints from equations in factorized form. Experimental results from a prototype show that interval methods generally benefit from the symbolic
processing of the initial constraints.
KeywordsBranch and prune algorithm, non-linear constraint solving, cooperative constraint solvers, symbolic simplification, interval Newton methods, Gröbner basis polynomial system
Length23
File
LanguageEnglish
JournalJournal of Universal Computer Science (J. UCS)
Volume4
Number2
Pages125-146
Year1998
Translation No
Refereed No
Webmaster