Toric eigenvalue methods for solving sparse polynomial systems
From MaRDI portal
Publication:5097381
Abstract: We consider the problem of computing homogeneous coordinates of points in a zero-dimensional subscheme of a compact, complex toric variety . Our starting point is a homogeneous ideal in the Cox ring of , which in practice might arise from homogenizing a sparse polynomial system. We prove a new eigenvalue theorem in the toric compact setting, which leads to a novel, robust numerical approach for solving this problem. Our method works in particular for systems having isolated solutions with arbitrary multiplicities. It depends on the multigraded regularity properties of . We study these properties and provide bounds on the size of the matrices appearing in our approach when is a complete intersection.
Recommendations
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Polynomial eigenvalue solver based on tropically scaled Lagrange linearization
- scientific article; zbMATH DE number 2092194
- Polynomial eigenvalue problems: theory, computation, and structure
- scientific article; zbMATH DE number 3874487
- scientific article; zbMATH DE number 2142706
- Computing isolated roots of sparse polynomial systems in affine space
- Sparse tensor approximation of parametric eigenvalue problems
- Solving degenerate sparse polynomial systems faster
- Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
Cites work
- scientific article; zbMATH DE number 3842033 (Why is no real title available?)
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 4076472 (Why is no real title available?)
- scientific article; zbMATH DE number 52945 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 503188 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 729195 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- 3264 and all that. A second course in algebraic geometry
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A stabilized normal form algorithm for generic systems of polynomial equations
- An octanomial model for cubic surfaces
- Applications of polynomial systems. With contributions by Carlos D'Andrea, Alicia Dickenstein, Jonathan Hauenstein, Hal Schenck, and Jessica Sidman
- Castelnuovo Mumford regularity with respect to multigraded ideals
- Codimension theorems for complete toric varieties
- Condition. The geometry of numerical algorithms
- Gröbner bases of ideals defined by functionals with an application to ideals of projective points
- Gröbner basis over semigroup algebras. Algorithms and applications for sparse polynomial systems
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- Immaculate line bundles on toric varieties
- Introduction to Toric Varieties. (AM-131)
- Introduction to the solution of polynomial systems
- Matrices in elimination theory
- Multigraded Castelnuovo-Mumford regularity
- Multigraded Hilbert functions and toric complete intersection codes
- Multigraded regularity, \(a^{*}\)-invariant and the minimal free resolution
- Multigraded regularity: Coarsenings and resolutions
- Multigraded regularity: syzygies and fat points
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Numerical Polynomial Algebra
- Numerical root finding via Cox rings
- Numerically solving polynomial systems with Bertini
- On the complexity of computing Gröbner bases for weighted homogeneous systems
- On the complexity of sparse elimination
- Solving \(p\)-adic polynomial systems via iterative eigenvector algorithms
- Solving a sparse system using linear algebra
- Solving polynomial equations. Foundations, algorithms, and applications
- Solving polynomial systems via truncated normal forms
- Stickelberger and the Eigenvalue Theorem
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The regularity of points in multi-projective spaces.
- Toric varieties
- Towards Mixed Gröbner Basis Algorithms
- Truncated normal forms for solving polynomial systems: generalized and efficient algorithms
- Using Algebraic Geometry
- Virtual resolutions for a product of projective spaces
Cited in
(9)- Complexity of sparse polynomial solving: homotopy on toric varieties and the condition metric
- Toric Sylvester forms
- scientific article; zbMATH DE number 2142706 (Why is no real title available?)
- 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
- Solving a sparse system using linear algebra
- Polynomial families of quantum semisimple coajoint orbits via deformed quantum enveloping algebras
This page was built for publication: Toric eigenvalue methods for solving sparse polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097381)
