Numerical computation of the genus of an irreducible curve within an algebraic set
type: Item
instance of: scholarly article
title: Numerical computation of the genus of an irreducible curve within an algebraic set
zbMATH Open document ID: 1211.14062
author: Daniel J. Bates
author: Chris Peterson
author: Charles W. Wampler
author: Andrew J. Sommese
published in: Journal of Pure and Applied Algebra
publication date: 2011-05-10T00:00:00Z
Mathematics Subject Classification ID: 14Q05
Mathematics Subject Classification ID: 65H10
Mathematics Subject Classification ID: 65E05
Mathematics Subject Classification ID: 14H99
zbMATH DE Number: 5886344
describes a project that uses: MultRoot
describes a project that uses: Bertini
MaRDI profile type: Publication
full work available at URL: j.jpaa.2010.10.016
OpenAlex ID: W2072691921
cites work: Adaptive Multiprecision Path Tracking
cites work: Q3514371
cites work: A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
cites work: Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
cites work: The approximate GCD of inexact polynomials
cites work: Computing the multiplicity structure in solving polynomial systems
cites work: Regeneration homotopies for solving systems of polynomials
cites work: Newton's method with deflation for isolated singularities of polynomial systems
cites work: A Rank-Revealing Method with Updating, Downdating, and Applications
cites work: Q4697470
cites work: Computing singular solutions to nonlinear analytic systems
cites work: A power series method for computing singular solutions to nonlinear analytic systems
cites work: Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: Complexity of Bezout's theorem. III: Condition number and packing
cites work: Q3135179
cites work: Complexity of Bezout's theorem. V: Polynomial time
cites work: Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
cites work: Numerical decomposition of the solution sets of polynomial systems into irreducible components
cites work: Using monodromy to decompose solution sets of polynomial systems into irreducible components
cites work: Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
cites work: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
cites work: Computing multiple roots of inexact polynomials
DOI: 10.1016/J.JPAA.2010.10.016
description: scientific article; zbMATH DE number 5886344