Publication:4717965

Charles W. Wampler, Andrew John Sommese

Publication date: 7 January 1997

probabilistic algorithms; polynomial systems; isolated complex solutions; positive dimensional solution sets

65H10: Numerical computation of solutions to systems of equations

30C15: Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral)

Related Items

VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities, Global multiplicity, special closure and non-degeneracy of gradient maps, Sparse trace tests, On the null spaces of the Macaulay matrix, Global optimality conditions and optimization methods for polynomial programming problems, Foreword. What is numerical algebraic geometry?, Mixed cell computation in HOM4ps, Parallel degree computation for binomial systems, Numerical factorization of multivariate complex polynomials, Regenerative cascade homotopies for solving polynomial systems, Numerical computation of Galois groups, A constrained homotopy technique for excluding unwanted solutions from polynomial equations arising in kinematics problems, Nearest multivariate system with given root multiplicities, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety, A hybrid procedure for finding real points on a real algebraic set, Unification and extension of intersection algorithms in numerical algebraic geometry, Numerically computing real points on algebraic sets, The complexity of local dimensions for constructible sets, Homotopy techniques for tensor decomposition and perfect identifiability, Computing singular points of projective plane algebraic curves by homotopy continuation methods, Adaptive strategies for solving parameterized systems using homotopy continuation, A numerical realization of the conditions of Max Nöther's residual intersection theorem, Unmixing the mixed volume computation, Sampling algebraic sets in local intrinsic coordinates, Determining dimension of the solution component that contains a computed zero of a polynomial system, Newton's method with deflation for isolated singularities of polynomial systems, Regeneration homotopies for solving systems of polynomials