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

DOI10.1007/S11075-023-01590-1arXiv2206.02869OpenAlexW4382560881MaRDI QIDQ6140899FDOQ6140899

Timothy Duff, Anton Leykin, Jose Israel Rodriguez

Publication date: 22 January 2024

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

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.$

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)

Cites Work

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

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)