Techniques for exploiting structure in matrix formulae of the sparse resultant

DOI10.1007/BF02576009zbMath0904.65049OpenAlexW2008603328MaRDI QIDQ1127958

Ioannis Z. Emiris, Pan, Victor Y.

Publication date: 10 August 1998

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02576009

zbMATH Keywords

computational complexitysystems of polynomial equationsNewton polytopessparse resultantMacaulay's matrix

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Real polynomials: location of zeros (26C10) Complexity and performance of numerical algorithms (65Y20)

Related Items

Symbolic and numeric methods for exploiting structure in constructing resultant matrices

Cites Work

• Constructing roadmaps of semi-algebraic sets. I: Completeness
• The number of roots of a system of equations
• Product formulas for resultants and Chow forms
• Parallel computation of polynomial GCD and some related parallel computations over abstract fields
• Hyperdeterminants
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• On the complexity of sparse elimination
• Solving sparse linear equations over finite fields
• Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item