24 citations · 85 across the 39 of their papers we have counts for
Showing 2005Show all
2 papers · 1 filter
cs.DC2005
Decomposing Solution Sets of Polynomial Systems: A New Parallel Monodromy Breakup Algorithm
Anton Leykin, Jan Verschelde
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops…
math.NA2005
Solving Polynomial Systems Equation by Equation
Andrew J. Sommese, Jan Verschelde, Charles W. Wampler
By a numerical continuation method called a diagonal homotopy we can compute the intersection of two positive dimensional solution sets of polynomial systems. This paper proposes t…