Sciweavers

6 search results - page 1 / 2
» Numerical Homotopies to Compute Generic Points on Positive D...
Sort
View
ICPPW
2005
IEEE
14 years 15 days ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde
DAGSTUHL
2003
13 years 8 months ago
Numerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
Andrew J. Sommese, Jan Verschelde, Charles W. Wamp...
ISSAC
1995
Springer
125views Mathematics» more  ISSAC 1995»
13 years 10 months ago
Numeric-Symbolic Algorithms for Evaluating One-Dimensional Algebraic Sets
: We present e cient algorithms based on a combination of numeric and symbolic techniques for evaluating one-dimensional algebraic sets in a subset of the real domain. Given a desc...
Shankar Krishnan, Dinesh Manocha
FOCM
2008
59views more  FOCM 2008»
13 years 7 months ago
Semidefinite Characterization and Computation of Zero-Dimensional Real Radical Ideals
For an ideal I R[x] given by a set of generators, a new semidefinite characterization of its real radical I(VR(I)) is presented, provided it is zero-dimensional (even if I is not...
Jean B. Lasserre, Monique Laurent, Philipp Rostals...