A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set

DOI10.1016/J.JCO.2006.04.003zbMath1100.65046OpenAlexW2052195169MaRDI QIDQ2507587

Dan Bates, Chris Peterson, Andrew John Sommese

Publication date: 5 October 2006

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2006.04.003

zbMATH Keywords

algorithmdecompositionembeddinghomotopy continuationpolynomial systemmultivariate polynomialsirreducible componentsnumerical algebraic geometrygeneric points

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15)

Related Items (14)

Efficient computation of dual space and directional multiplicity of an isolated point ⋮ Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry ⋮ Numerical irreducible decomposition over a number field ⋮ Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm ⋮ Chern numbers of smooth varieties via homotopy continuation and intersection theory ⋮ Computing the multiplicity structure of an isolated singular solution: case of breadth one ⋮ Mechanism mobility and a local dimension test ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Numerical computation of the genus of an irreducible curve within an algebraic set ⋮ Regeneration homotopies for solving systems of polynomials ⋮ Multiple zeros of nonlinear systems ⋮ Numerical algebraic geometry and algebraic kinematics ⋮ Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms ⋮ Multiplicity-preserving triangular set decomposition of two polynomials

Uses Software

• Unnamed Item
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A criterion for detecting m-regularity
• Linear free resolutions and minimal multiplicity
• Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
• Numerical calculation of the multiplicity of a solution to algebraic equations
• Computing multiple roots of inexact polynomials
• Numerical Polynomial Algebra
• Computing the multiplicity structure in solving polynomial systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Algorithm 835
• Lectures on Curves on an Algebraic Surface. (AM-59)

This page was built for publication: A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set