A subdivision-based algorithm for the sparse resultant

DOI10.1145/337244.337247zbMath1094.65508OpenAlexW2043606168MaRDI QIDQ5487877

Ioannis Z. Emiris, John F. Canny

Publication date: 12 September 2006

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/337244.337247

zbMATH Keywords

determinantal formula for sparse resultantmixed polyhedral subdivision of Minkowski sum of Newton polytopes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10)

Related Items (31)

A package for computations with sparse resultants ⋮ Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation ⋮ Constructing Sylvester-type resultant matrices using the Dixon formulation ⋮ Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation ⋮ Implicitization of curves and (hyper)surfaces using predicted support ⋮ Linear sparse differential resultant formulas ⋮ A polyhedral homotopy algorithm for real zeros ⋮ Separation bounds for polynomial systems ⋮ Sparse resultants and straight-line programs ⋮ The Canny-Emiris conjecture for the sparse resultant ⋮ Differential elimination by differential specialization of Sylvester style matrices ⋮ Sparse resultant under vanishing coefficients ⋮ Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D ⋮ Dense resultant of composed polynomials: mixed-mixed case ⋮ Resultants of partially composed polynomials ⋮ Computing multihomogeneous resultants using straight-line programs ⋮ Solving a sparse system using linear algebra ⋮ Elimination for generic sparse polynomial systems ⋮ Hybrid sparse resultant matrices for bivariate polynomials ⋮ Improved algorithms for computing determinants and resultants ⋮ Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants ⋮ New bounds and an efficient algorithm for sparse difference resultants ⋮ Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials ⋮ Rational formulas for traces in zero-dimensional algebras ⋮ Rational univariate reduction via toric resultants ⋮ Hyperdeterminants from the \(E_8\) discriminant ⋮ On degree bounds for the sparse Nullstellensatz ⋮ A Poisson formula for the sparse resultant ⋮ Symbolic and numeric methods for exploiting structure in constructing resultant matrices ⋮ Sparse resultant of composed polynomials. II: Unmixed-mixed case. ⋮ Enumerating a subset of the integer points inside a Minkowski sum

This page was built for publication: A subdivision-based algorithm for the sparse resultant