Toric eigenvalue methods for solving sparse polynomial systems
From MaRDI portal
Publication:5097381
DOI10.1090/mcom/3744zbMath1502.14122arXiv2006.10654OpenAlexW3035846117MaRDI QIDQ5097381
Publication date: 23 August 2022
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.10654
toric varietiessymbolic-numeric algorithmCox ringssparse polynomial systemssolving polynomial systemseigenvalue theorem
Numerical computation of solutions to systems of equations (65H10) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Numerical computation of roots of polynomial equations (65H04)
Related Items
Landau discriminants, A Fast Algorithm for Computing Macaulay Null Spaces of Bivariate Polynomial Systems, Polyhedral homotopies in Cox coordinates, Dimension results for extremal-generic polynomial systems over complete toric varieties
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multigraded Hilbert functions and toric complete intersection codes
- Solving a sparse system using linear algebra
- Castelnuovo Mumford regularity with respect to multigraded ideals
- Multigraded regularity: Coarsenings and resolutions
- Multigraded regularity, \(a^{*}\)-invariant and the minimal free resolution
- Introduction to the solution of polynomial systems
- The regularity of points in multi-projective spaces.
- A stabilized normal form algorithm for generic systems of polynomial equations
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- Solving polynomial equations. Foundations, algorithms, and applications
- Matrices in elimination theory
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Numerical root finding via Cox rings
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Immaculate line bundles on toric varieties
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Multigraded regularity: syzygies and fat points
- On the complexity of sparse elimination
- 3264 and All That
- Condition
- Introduction to Toric Varieties. (AM-131)
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Using Algebraic Geometry
- Solving Polynomial Systems via Truncated Normal Forms
- Multigraded Castelnuovo-Mumford regularity
- Numerical Polynomial Algebra
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Stickelberger and the Eigenvalue Theorem
- Solving p-adic polynomial systems via iterative eigenvector algorithms
- Applications of Polynomial Systems
- Towards Mixed Gröbner Basis Algorithms
- Gröbner Basis over Semigroup Algebras
- Virtual resolutions for a product of projective spaces
- An Octanomial Model for Cubic Surfaces
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Codimension theorems for complete toric varieties
- On the complexity of computing Gröbner bases for weighted homogeneous systems
