Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry

DOI10.1080/10586458.2013.737640zbMath1284.14084OpenAlexW2143435955WikidataQ57428993 ScholiaQ57428993MaRDI QIDQ5298836

Chris Peterson, Timothy McCoy, Jonathan D. Hauenstein, Daniel J. Bates, Andrew John Sommese

Publication date: 24 June 2013

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10586458.2013.737640

zbMATH Keywords

homotopy continuationalgebraic setnumerical algebraic geometryprimary decompositionalgebraic varietywitness setgeneric pointLLLnumerical irreducible decomposition

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Computational aspects and applications of commutative rings (13P99) Computational aspects in algebraic geometry (14Q99)

Related Items (13)

Evaluating and Differentiating a Polynomial Using a Pseudo-witness Set ⋮ Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety ⋮ Binomiality testing and computing sparse polynomials via witness sets ⋮ Exceptional Stewart--Gough Platforms, Segre Embeddings, and the Special Euclidean Group ⋮ Certifying solutions to overdetermined and singular polynomial systems over \(\mathbb{Q}\) ⋮ Inverse multivariate polynomial root-finding: numerical implementations of the affine and projective Buchberger-Möller algorithm ⋮ Tensor decomposition and homotopy continuation ⋮ Computing Geometric Feature Sizes for Algebraic Manifolds ⋮ A numerical toolkit for multiprojective varieties ⋮ Newton polytopes and witness sets ⋮ Foreword. What is numerical algebraic geometry? ⋮ A hybrid symbolic-numerical approach to the center-focus problem ⋮ Numerical elimination and moduli space of vacua

Uses Software

• CoCoA
• Macaulay2
• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring polynomials with rational coefficients
• Direct methods for primary decomposition
• An improved LLL algorithm
• A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• The tilting tensor product theorem and decomposition numbers for symmetric groups.
• Numerical Decomposition of the Solution Sets of Polynomial Systems into Irreducible Components
• Polynomial Time Algorithms for Finding Integer Relations among Real Numbers
• A Numerical Local Dimension Test for Points on the Solution Set of a System of Polynomial Equations
• An LLL Algorithm with Quadratic Complexity
• Adaptive Multiprecision Path Tracking
• Introduction to Numerical Continuation Methods
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems

This page was built for publication: Recovering Exact Results from Inexact Numerical Data in Algebraic Geometry