Solving a sparse system using linear algebra
From MaRDI portal
Publication:491257
DOI10.1016/j.jsc.2015.06.003zbMath1322.14077arXiv1211.3715OpenAlexW1586660875MaRDI QIDQ491257
Publication date: 24 August 2015
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.3715
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Determinantal varieties (14M12) Eigenvalues, singular values, and eigenvectors (15A18) Syzygies, resolutions, complexes and commutative rings (13D02) Solving polynomial systems; resultants (13P15)
Related Items
Numerical root finding via Cox rings, Toric eigenvalue methods for solving sparse polynomial systems, On degree bounds for the sparse Nullstellensatz
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
- Introduction to the solution of polynomial systems
- Generalised characteristic polynomials
- Computing all solutions to polynomial systems using homotopy continuation
- Résolution des systèmes d'équations algébriques
- Error bounds for computed eigenvalues and eigenvectors. II
- Le formalisme du résultant. (The formalism of resultant)
- Chow polytopes and general resultants
- Computing the isolated roots by matrix methods
- A sparse effective Nullstellensatz
- Fast and parallel interval arithmetic
- Product formulas for resultants and Chow forms
- Efficient isolation of polynomial's real roots.
- On eigenvector bounds
- A 2002 update of the supplementary bibliography on roots of polynomials
- Solving polynomial equations. Foundations, algorithms, and applications
- Matrices in elimination theory
- Multihomogeneous resultant formulae by means of complexes
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- An algorithm to find a maximum of a multilinear map over a product of spheres
- Multivariate polynomials, duality, and structured matrices
- On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors
- Fast algorithms for floating-point interval matrix multiplication
- The many aspects of counting lattice points in polytopes
- On the complexity of sparse elimination
- A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
- Introduction to Toric Varieties. (AM-131)
- Asymptotically Fast Triangularization of Matrices over Rings
- A subdivision-based algorithm for the sparse resultant
- Computation of a specified root of a polynomial system of equations using eigenvectors
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Computational error bounds for multiple or nearly multiple eigenvalues
