Numerical computation of the genus of an irreducible curve within an algebraic set

DOI10.1016/J.JPAA.2010.10.016zbMath1211.14062OpenAlexW2072691921MaRDI QIDQ534004

Charles W. Wampler, Chris Peterson, Daniel J. Bates, Andrew John Sommese

Publication date: 10 May 2011

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpaa.2010.10.016

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Computational aspects of algebraic curves (14Q05) Curves in algebraic geometry (14H99)

Related Items (7)

A regularization approach for estimating the type of a plane curve singularity ⋮ Robust certified numerical homotopy tracking ⋮ Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme ⋮ Global structure of curves from generalized unitarity cut of three-loop diagrams ⋮ Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials ⋮ An algebraic study of linkages with helical joints ⋮ Galois groups of Schubert problems via homotopy computation

Uses Software

• Bertini
• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• A power series method for computing singular solutions to nonlinear analytic systems
• Complexity of Bezout's theorem. V: Polynomial time
• Complexity of Bezout's theorem. III: Condition number and packing
• Newton's method with deflation for isolated singularities of polynomial systems
• A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
• Computing singular solutions to nonlinear analytic systems
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
• Regeneration homotopies for solving systems of polynomials
• Adaptive Multiprecision Path Tracking
• Complexity of Bezout's Theorem I: Geometric Aspects
• Computing multiple roots of inexact polynomials
• The approximate GCD of inexact polynomials
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
• Computing the multiplicity structure in solving polynomial systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• A Rank-Revealing Method with Updating, Downdating, and Applications

This page was built for publication: Numerical computation of the genus of an irreducible curve within an algebraic set