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

DOI10.1016/J.JCO.2006.04.003zbMATH Open1100.65046OpenAlexW2052195169MaRDI QIDQ2507587FDOQ2507587

Authors: Dan Bates, Chris Peterson, Andrew J. 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

Recommendations

• scientific article; zbMATH DE number 1145287
• Numerical calculation of the multiplicity of a solution to algebraic equations
• On multiplicities in polynomial system solving
• scientific article; zbMATH DE number 3888807
• Numerical computation of the genus of an irreducible curve within an algebraic set

zbMATH Keywords

decompositionalgorithmembeddinghomotopy continuationpolynomial systemmultivariate polynomialsnumerical algebraic geometryirreducible componentsgeneric points

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (18)

• Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms
• Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
• Regularization and matrix computation in numerical polynomial algebra
• Multiplicity-preserving triangular set decomposition of two polynomials
• Numerical algebraic geometry and algebraic kinematics
• Multiple zeros of nonlinear systems
• Efficient computation of dual space and directional multiplicity of an isolated point
• Title not available (Why is that?)
• Numerical irreducible decomposition over a number field
• Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm
• Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
• Chern numbers of smooth varieties via homotopy continuation and intersection theory
• Mechanism mobility and a local dimension test
• Recovering exact results from inexact numerical data in algebraic geometry
• Regeneration homotopies for solving systems of polynomials
• Computing the multiplicity structure of an isolated singular solution: case of breadth one
• Numerical calculation of the multiplicity of a solution to algebraic equations
• Numerical computation of the genus of an irreducible curve within an algebraic set

Uses Software

• MultRoot
• SINGULAR

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

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