u-generation: solving systems of polynomials equation-by-equation

DOI10.1007/S11075-023-01590-1MaRDI QIDQ6140899OpenAlexFDO

Authors 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

regenerationnumerical algebraic geometrysolving 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)

Abstract: We develop a new method that improves the efficiency of equation-by-equation algorithms for solving polynomial systems. Our method is based on a novel geometric construction, and reduces the total number of homotopy paths that must be numerically continued. These improvements may be applied to the basic algorithms of numerical algebraic geometry in the settings of both projective and multiprojective varieties. Our computational experiments demonstrate significant savings obtained on several benchmark systems. We also present an extended case study on maximum likelihood estimation for rank-constrained symmetric $nimesn$ matrices, in which multiprojective $u$-generation allows us to complete the list of ML degrees for $nle6.$

Recommendations

• Regeneration homotopies for solving systems of polynomials
• Solving polynomial systems equation by equation
• Beyond polyhedral homotopies
• Publication:3477888
• MultiRegeneration for polynomial system solving

Cites work

• scientific article; zbMATH DE number 1273647 (Why is no real title available?)
• scientific article; zbMATH DE number 5245181 (Why is no real title available?)
• A Gröbner free alternative for polynomial system solving
• A Polyhedral Method for Solving Sparse Polynomial Systems
• A numerical toolkit for multiprojective varieties
• A robust numerical path tracking algorithm for polynomial homotopy continuation
• Algebraic statistics
• Algorithm 795
• Computing Tropical Curves via Homotopy Continuation
• Critical points via monodromy and local methods
• Decomposable sparse polynomial systems
• Fixed points of the EM algorithm and nonnegative rank boundaries
• General witness sets for numerical algebraic geometry
• Hom4PS-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods
• HomotopyContinuation.jl: a package for homotopy continuation in Julia
• Maximum likelihood duality for determinantal varieties
• Maximum likelihood for matrices with rank constraints
• Multiprojective witness sets and a trace test
• Numerical algebraic geometry
• Numerical homotopies to compute generic points on positive dimensional algebraic sets
• Numerically solving polynomial systems with Bertini
• Regeneration homotopies for solving systems of polynomials
• Regenerative cascade homotopies for solving polynomial systems
• Solving polynomial systems equation by equation
• Solving polynomial systems via homotopy continuation and monodromy
• Stability of projective varieties
• Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Unification and extension of intersection algorithms in numerical algebraic geometry
• Witness sets of projections

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

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