Using monodromy to decompose solution sets of polynomial systems into irreducible components

MaRDI QIDQ2754425zbMATH OpenFDO

Authors J. Verschelde, Charles W. Wampler, Andrew J. Sommese

Publication date 23 August 2002

zbMATH Keywords

components of solutionsembeddinggeneric pointshomotopy continuationirreducible componentsmonodromy groupmultivariate interpolationnumerical algebraic geometrynumerical conditioningnumerical examplespolynomial systemprimary decomposition

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05) Computational aspects in algebraic geometry (14Q99) Numerical computation of solutions to systems of equations (65H10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Numerical decomposition of the solution sets of polynomial systems into irreducible components
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• Numerical local irreducible decomposition
• scientific article; zbMATH DE number 1961539
• Regeneration homotopies for solving systems of polynomials

Cited in

(31)

• Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
• Unification and extension of intersection algorithms in numerical algebraic geometry
• Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
• Numerically computing real points on algebraic sets
• Using monodromy to statistically estimate the number of solutions
• Multiprojective witness sets and a trace test
• Real monodromy action
• Homotopy techniques for tensor decomposition and perfect identifiability
• Cell decomposition of almost smooth real algebraic surfaces
• Sampling algebraic sets in local intrinsic coordinates
• Determining dimension of the solution component that contains a computed zero of a polynomial system
• Numerical decomposition of the solution sets of polynomial systems into irreducible components
• Applying the system DERIVE to investigate the truncation related to the monomials defined on the set of natural numbers
• Numerical local irreducible decomposition
• Decomposing solution sets of polynomial systems using derivatives
• Regeneration homotopies for solving systems of polynomials
• Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
• Exceptional Stewart-Gough platforms, Segre embeddings, and the special Euclidean group
• Using monodromy to avoid high precision in homotopy continuation
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• Foreword. What is numerical algebraic geometry?
• A numerical toolkit for multiprojective varieties
• Numerical computation of the genus of an irreducible curve within an algebraic set
• Numerical factorization of multivariate complex polynomials
• Computing monodromy via continuation methods on random Riemann surfaces
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Solving parameterized polynomial systems with decomposable projections
• Robust numerical algebraic geometry
• Galois groups in enumerative geometry and applications
• Irreducible decomposition of curves
• Certified predictor-corrector tracking for Newton homotopies

This page was built for publication: Using monodromy to decompose solution sets of polynomial systems into irreducible components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2754425)