2014/03/05 by Ioannis Z. Emiris, Emiris, Ioannis Z.
Computer Science · Medicine · #Cancer Treatment and Pharmacology #FOS: Computer and information sciences #Formal Methods in Verification #Mathematical Software (cs.MS) #Polynomial and algebraic computation #Symbolic Computation (cs.SC) #cs.MS #cs.SC
paper · pdf · doi:10.48550/arxiv.1403.1140
13 pages. arXiv admin note: text overlap with arXiv:1201.5810
arxiv created 2014/03/05 · openalex publication_date 2014/03/05 · arxiv updated 2014/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We present our public-domain software for the following tasks in sparse (or toric) elimination theory, given a well-constrained polynomial system. First, C code for computing the mixed volume of the system. Second, Maple code for defining an overconstrained system and constructing a Sylvester-type matrix of its sparse resultant. Third, C code for a Sylvester-type matrix of the sparse resultant and a superset of all common roots of the initial well-constrained system by computing the eigen-decomposition of a square matrix obtained from the resultant matrix. We conclude with experiments in computing molecular conformations.