\(u\)-generation: solving systems of polynomials equation-by-equation

DOI10.1007/s11075-023-01590-1arXiv2206.02869OpenAlexW4382560881MaRDI QIDQ6140899

Timothy Duff, Anton Leykin, Jose Israel Rodriguez

Publication date: 22 January 2024

Published in: Numerical Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2206.02869

zbMATH Keywords

numerical algebraic geometryregenerationsolving polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Geometric aspects of numerical algebraic geometry (14Q65)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical points via monodromy and local methods
• Witness sets of projections
• Regenerative cascade homotopies for solving polynomial systems
• Stability of projective varieties
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• Unification and extension of intersection algorithms in numerical algebraic geometry
• Decomposable sparse polynomial systems
• Multiprojective witness sets and a trace test
• Fixed points of the EM algorithm and nonnegative rank boundaries
• Numerical algebraic geometry
• Computing Tropical Curves via Homotopy Continuation
• Maximum Likelihood for Matrices with Rank Constraints
• Hom4PS-3: A Parallel Numerical Solver for Systems of Polynomial Equations Based on Polyhedral Homotopy Continuation Methods
• Maximum Likelihood Duality for Determinantal Varieties
• Regeneration homotopies for solving systems of polynomials
• Algorithm 795
• Algebraic Statistics
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• A Polyhedral Method for Solving Sparse Polynomial Systems
• A numerical toolkit for multiprojective varieties
• General witness sets for numerical algebraic geometry
• A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Solving polynomial systems via homotopy continuation and monodromy
• A Gröbner free alternative for polynomial system solving

This page was built for publication: \(u\)-generation: solving systems of polynomials equation-by-equation