Robust numerical algebraic geometry

DOI10.1137/24M1644870MaRDI QIDQ6864601zbMATH OpenFDO

Authors Emma R. Cobian, Jonathan D. Hauenstein, Charles W. Wampler

Publication date 3 February 2026

Published in SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1644870

zbMATH Keywords

fiber productshigher dimensional solution setsmultiplicitynumerical algebraic geometryparameterized polynomial systemsrobustness

Mathematics Subject Classification ID

Geometric aspects of numerical algebraic geometry (14Q65) Numerical algebraic geometry (65H14)

Cites work

• A homotopy for solving general polynomial systems that respects m- homogeneous structures
• A numerical local dimension test for points on the solution set of a system of polynomial equations
• A Polyhedral Method for Solving Sparse Polynomial Systems
• A transformation to avoid solutions at infinity for polynomial systems
• Algebraic Geometry Tools in Systems Biology
• Algebraic properties of multilinear constraints
• Algorithm 921: alphaCertified: certifying solutions to polynomial systems
• Algorithm 931
• An invitation to 3-D vision. From images to geometric models.
• Chemical reaction systems with toric steady states
• Coefficient-parameter polynomial continuation
• Complexity of the resolution of parametric systems of polynomial equations and inequations
• Computing parametric geometric resolutions
• Computing the multiplicity structure in solving polynomial systems
• Decomposing solution sets of polynomial systems using derivatives
• Exceptional sets and fiber products
• Exceptional Stewart-Gough platforms, Segre embeddings, and the special Euclidean group
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• scientific article; zbMATH DE number 3649911 (Why is no real title available?)
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 578220 (Why is no real title available?)
• scientific article; zbMATH DE number 1069614 (Why is no real title available?)
• scientific article; zbMATH DE number 953044 (Why is no real title available?)
• scientific article; zbMATH DE number 3992817 (Why is no real title available?)
• Numerical computation of the Hilbert function and regularity of a zero dimensional scheme
• Numerical decomposition of the rank-deficiency set of a matrix of multivariate polynomials
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Numerical Polynomial Algebra
• Numerically solving polynomial systems with Bertini
• Polynomial homotopy continuation with PHCpack
• Real solutions to systems of polynomial equations and parameter continuation
• Recovering exact results from inexact numerical data in algebraic geometry
• Regenerative cascade homotopies for solving polynomial systems
• Solving parametric polynomial systems
• Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
• Sparse trace tests
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• The closedness subspace method for computing the multiplicity structure of a polynomial system
• The numerical factorization of polynomials
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Trace test
• Unification and extension of intersection algorithms in numerical algebraic geometry
• Using monodromy to decompose solution sets of polynomial systems into irreducible components
• Witness sets of projections

This page was built for publication: Robust numerical algebraic geometry

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