Numerical computation of the genus of an irreducible curve within an algebraic set
DOI10.1016/J.JPAA.2010.10.016zbMATH Open1211.14062OpenAlexW2072691921MaRDI QIDQ534004FDOQ534004
Authors: Daniel J. Bates, Chris Peterson, Charles W. Wampler, Andrew J. 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
Recommendations
- Irreducible decomposition of curves
- Computing the irreducible real factors and components of an algebraic curve
- A Symbolic-Numeric Algorithm for Genus Computation
- Semi-numerical determination of irreducible branches of a reduced space curve
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical computation of solutions to systems of equations (65H10) Computational aspects of algebraic curves (14Q05) Curves in algebraic geometry (14H99)
Cites Work
- Title not available (Why is that?)
- Newton's method with deflation for isolated singularities of polynomial systems
- Software for numerical algebraic geometry: a paradigm and progress towards its implementation
- Computing the multiplicity structure in solving polynomial systems
- Smale's 17th problem: average polynomial time to compute affine and projective solutions
- The approximate GCD of inexact polynomials
- Title not available (Why is that?)
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- Regeneration homotopies for solving systems of polynomials
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Complexity of Bezout's theorem. V: Polynomial time
- Complexity of Bezout's theorem. III: Condition number and packing
- Complexity of Bezout's Theorem I: Geometric Aspects
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- A power series method for computing singular solutions to nonlinear analytic systems
- Computing singular solutions to nonlinear analytic systems
- Adaptive Multiprecision Path Tracking
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- Computing multiple roots of inexact polynomials
- A Rank-Revealing Method with Updating, Downdating, and Applications
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Using monodromy to decompose solution sets of polynomial systems into irreducible components
Cited In (18)
- Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
- Global structure of curves from generalized unitarity cut of three-loop diagrams
- A Symbolic-Numeric Algorithm for Genus Computation
- Galois groups of Schubert problems via homotopy computation
- Title not available (Why is that?)
- Computer search for curves with many points among abelian covers of genus 2 curves
- Genus calculations of complete intersections
- Irreducible decomposition of curves
- An algebraic study of linkages with helical joints
- Title not available (Why is that?)
- A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
- Numerically deciding the arithmetically Cohen-Macaulayness of a projective scheme
- A practical algorithm for the computation of the genus
- GENOM3CK: a library for genus computation of plane complex algebraic curves using knot theory
- Semi-numerical determination of irreducible branches of a reduced space curve
- Some remarks on the computation of Pythagoras numbers of real irreducible algebroid curves through Gram matrices.
- Robust certified numerical homotopy tracking
- A regularization approach for estimating the type of a plane curve singularity
Uses Software
This page was built for publication: Numerical computation of the genus of an irreducible curve within an algebraic set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534004)
