arXiv · 1211.3715
Solving a sparse systems using linear algebra
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.
Explore related subjects
Keep this discovery
César Massri. 2012-11-15. Solving a sparse systems using linear algebra. https://arxiv.org/abs/1211.3715
Cite the original work for its findings. Save a collection to share your selection of sources.