Techniques for exploiting structure in matrix formulae of the sparse resultant

DOI10.1007/BF02576009MaRDI QIDQ1127958zbMATH OpenOpenAlexFDO

Authors Ioannis Z. Emiris, Victor Y. Pan

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 complexityNewton polytopessparse resultantsystems of polynomial equationsMacaulay's matrix

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) 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)

Recommendations

• scientific article; zbMATH DE number 1253983
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• A subdivision-based algorithm for the sparse resultant
• On the complexity of sparse elimination
• scientific article; zbMATH DE number 1263319

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 3671573 (Why is no real title available?)
• scientific article; zbMATH DE number 177858 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1253983 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 503188 (Why is no real title available?)
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• scientific article; zbMATH DE number 1008369 (Why is no real title available?)
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Hyperdeterminants
• On the complexity of sparse elimination
• Parallel computation of polynomial GCD and some related parallel computations over abstract fields
• Product formulas for resultants and Chow forms
• Solving sparse linear equations over finite fields
• Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
• The number of roots of a system of equations

Cited in

(7)

• Matrices in elimination theory
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• Computing the block triangular form of a sparse matrix
• Macaulay style formulas for sparse resultants
• Sparse resultants and straight-line programs
• The Canny-Emiris conjecture for the sparse resultant
• Compact formulae in sparse elimination (extended abstract)

This page was built for publication: Techniques for exploiting structure in matrix formulae of the sparse resultant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127958)