Sciweavers

35 search results - page 3 / 7
» Numerically validating the completeness of the real solution...
Sort
View
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
14 years 12 days ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
CP
2010
Springer
13 years 4 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...
CAD
1998
Springer
13 years 6 months ago
Solving geometric constraint systems. II. A symbolic approach and decision of Rc-constructibility
Abstract. This paper reports a geometric constraint solving approach based on symbolic computation. With this approach, we can compute robust numerical solutions for a set of equat...
Xiao-Shan Gao, Shang-Ching Chou
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
13 years 11 months ago
Complexity Theory for Operators in Analysis
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
Akitoshi Kawamura and Stephen Cook
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
13 years 10 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi