Efficient incremental algorithms for the sparse resultant and the mixed volume
From MaRDI portal
Publication:1911937
DOI10.1006/JSCO.1995.1041zbMath0843.68036DBLPjournals/jsc/EmirisC95OpenAlexW2066130115WikidataQ57908794 ScholiaQ57908794MaRDI QIDQ1911937
Ioannis Z. Emiris, John F. Canny
Publication date: 28 April 1996
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1995.1041
Related Items (52)
Finiteness of relative equilibria of the four-body problem ⋮ Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods ⋮ Multihomogeneous resultant formulae by means of complexes ⋮ Mixed multiplicities of ideals versus mixed volumes of polytopes ⋮ Certified approximate univariate GCDs ⋮ Lower bounds for diophantine approximations ⋮ Generalized polar varieties: geometry and algorithms ⋮ Constructing Sylvester-type resultant matrices using the Dixon formulation ⋮ Polar varieties, real equation solving, and data structures: the hypersurface case ⋮ Techniques for exploiting structure in matrix formulae of the sparse resultant ⋮ Computing mixed volume and all mixed cells in quermassintegral time ⋮ Using Symbolic Computation to Analyze Zero-Hopf Bifurcations of Polynomial Differential Systems ⋮ Unmixing the mixed volume computation ⋮ Computing isolated roots of sparse polynomial systems in affine space ⋮ Sparse difference resultant ⋮ Elimination theory in differential and difference algebra ⋮ Solving a sparse system using linear algebra ⋮ Mixed cell computation in HOM4ps ⋮ Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums ⋮ Elimination for generic sparse polynomial systems ⋮ A systematic framework for solving geometric constraints analytically ⋮ Balancing the lifting values to improve the numerical stability of polyhedral homotopy continuation methods ⋮ Heuristics to accelerate the Dixon resultant ⋮ Improved algorithms for computing determinants and resultants ⋮ Comparing acceleration techniques for the Dixon and Macaulay resultants ⋮ Explicit factors of some iterated resultants and discriminants ⋮ An effective algorithm of computing symbolic determinants with multivariate polynomial entries ⋮ New bounds and an efficient algorithm for sparse difference resultants ⋮ Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials ⋮ Zero-Hopf bifurcation of limit cycles in certain differential systems ⋮ Sparse discriminants and applications ⋮ Rational univariate reduction via toric resultants ⋮ Mixed subdivisions suitable for the greedy Canny-Emiris formula ⋮ Advances in elimination theory for algebraic differential and difference equations ⋮ Matrices in elimination theory ⋮ Solving degenerate sparse polynomial systems faster ⋮ A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor ⋮ Exploiting Chordal Structure in Polynomial Ideals: A Gröbner Bases Approach ⋮ Computing zeros of analytic mappings: A logarithmic residue approach ⋮ Pruning Algorithms for Pretropisms of Newton Polytopes ⋮ Deformation techniques for sparse systems ⋮ Unnamed Item ⋮ Mixed volume techniques for embeddings of Laman graphs ⋮ How to count efficiently all affine roots of a polynomial system ⋮ Toric intersection theory for affine root counting ⋮ Some aspects of studying an optimization or decision problem in different computational models ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets ⋮ Symbolic and numeric methods for exploiting structure in constructing resultant matrices ⋮ Sparse resultant of composed polynomials. I: Mixed-unmixed case. ⋮ Enumerating a subset of the integer points inside a Minkowski sum ⋮ Sparse differential resultant for Laurent differential polynomials ⋮ A Complete Implementation for Computing General Dimensional Convex Hulls
This page was built for publication: Efficient incremental algorithms for the sparse resultant and the mixed volume
