Solving decomposable sparse systems
From MaRDI portal
Publication:2048838
DOI10.1007/s11075-020-01045-xzbMath1473.65059arXiv2001.04228OpenAlexW3118309125MaRDI QIDQ2048838
Taylor Brysiewicz, Jose Israel Rodriguez, Thomas Yahl, Frank J. Sottile
Publication date: 24 August 2021
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.04228
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Related Items
Decomposable sparse polynomial systems ⋮ Galois/Monodromy Groups for Decomposing Minimal Problems in 3D Reconstruction ⋮ The Maximum Likelihood Degree of Sparse Polynomial Systems ⋮ Using monodromy to recover symmetries of polynomial systems ⋮ Classification of Schubert Galois groups in \(Gr(4, 9)\) ⋮ Sparse trace tests
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed volume techniques for embeddings of Laman graphs
- Coefficient-parameter polynomial continuation
- Galois groups of enumerative problems
- The number of roots of a system of equations
- Polyhedral end games for polynomial continuation
- Computational invariant theory
- Interfacing with PHCpack
- Unmixing the mixed volume computation
- Algorithm 921
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- Finding all solutions to polynomial systems and other systems of equations
- Algorithm 795
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Galois theory for general systems of polynomial equations
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Monodromy of projective curves
- Solving polynomial systems via homotopy continuation and monodromy
