Solving a sparse system using linear algebra
From MaRDI portal
Abstract: We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem and Eigenvector theorem to work with a canonical rectangular matrix (the first Koszul map) and prove that these new theorems serve to solve overdetermined sparse systems and to count the expected number of solutions.
Recommendations
Cites work
- scientific article; zbMATH DE number 1639654 (Why is no real title available?)
- scientific article; zbMATH DE number 4076472 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 1263318 (Why is no real title available?)
- scientific article; zbMATH DE number 1263401 (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 714519 (Why is no real title available?)
- scientific article; zbMATH DE number 3205524 (Why is no real title available?)
- A 2002 update of the supplementary bibliography on roots of polynomials
- A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system
- A sparse effective Nullstellensatz
- A subdivision-based algorithm for the sparse resultant
- An algorithm to find a maximum of a multilinear map over a product of spheres
- Asymptotically Fast Triangularization of Matrices over Rings
- Chow polytopes and general resultants
- Computation of a specified root of a polynomial system of equations using eigenvectors
- Computational error bounds for multiple or nearly multiple eigenvalues
- Computing all solutions to polynomial systems using homotopy continuation
- Computing the isolated roots by matrix methods
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Efficient isolation of polynomial's real roots.
- Error bounds for computed eigenvalues and eigenvectors. II
- Fast algorithms for floating-point interval matrix multiplication
- Fast and parallel interval arithmetic
- Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation
- Generalised characteristic polynomials
- Introduction to Toric Varieties. (AM-131)
- Introduction to the solution of polynomial systems
- Le formalisme du résultant. (The formalism of resultant)
- Matrices in elimination theory
- Multihomogeneous resultant formulae by means of complexes
- Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
- Multivariate polynomials, duality, and structured matrices
- On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors
- On eigenvector bounds
- On the complexity of sparse elimination
- Product formulas for resultants and Chow forms
- Résolution des systèmes d'équations algébriques
- Solving polynomial equations. Foundations, algorithms, and applications
- The many aspects of counting lattice points in polytopes
- Toric varieties
Cited in
(9)- Solving systems of linear algebraic equations of a special kind with sparse polynomial and numerical coefficients
- scientific article; zbMATH DE number 2065130 (Why is no real title available?)
- On degree bounds for the sparse Nullstellensatz
- Toric eigenvalue methods for solving sparse polynomial systems
- Finding sparse systems of parameters
- Solving sparse rational linear systems
- Solution of Sparse Underdetermined Systems of Linear Equations
- Numerical root finding via Cox rings
- Application of the Cramer rule in the solution of sparse systems of linear algebraic equations
This page was built for publication: Solving a sparse system using linear algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q491257)
