Mixed-volume computation by dynamic lifting applied to polynomial system solving
type: Item
instance of: scholarly article
title: Mixed-volume computation by dynamic lifting applied to polynomial system solving
zbMATH Open document ID: 0854.68111
DOI: 10.1007/BF02711134
author: J. Verschelde
author: Karin Gatermann
author: Ronald Cools
published in: Discrete \& Computational Geometry
publication date: 1996-08-25T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 919857
zbMATH Keywords: polyhedral homotopy methods
zbMATH Keywords: polynomial systems
describes a project that uses: Hull
MaRDI profile type: Publication
Wikidata QID: Q57778995
cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
cites work: Q4237377
cites work: The number of roots of a system of equations
cites work: Geometric algorithms and combinatorial optimization
cites work: Randomized incremental construction of Delaunay and Voronoi diagrams
cites work: A Polyhedral Method for Solving Sparse Polynomial Systems
cites work: Chow polytopes and general resultants
cites work: Newton polyhedra and the genus of complete intersections
cites work: Newton polytopes and the Bezout theorem
cites work: Q3954445
cites work: Q3974985
cites work: Q4000024
cites work: Box-bisection for solving second-degree systems and the problem of clustering
cites work: Coefficient-parameter polynomial continuation
cites work: A Product-Decomposition Bound for Bezout Numbers
cites work: Mathematical reduction of a heart dipole model
cites work: Q3992847
cites work: A convex geometric approach to counting the roots of a polynomial system
cites work: Q3818127
cites work: Complexity of Bezout's Theorem I: Geometric Aspects
cites work: On the Newton polytope of the resultant
cites work: Symbolic homotopy construction
cites work: Symmetric Newton polytopes for solving sparse polynomial systems
cites work: Homotopies for solving polynomial systems within a bounded domain
cites work: Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
cites work: Bézout number calculations for multi-homogeneous polynomial systems
cites work: Mixed volumes of polytopes
cites work: Fiber polytopes
cites work: A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
cites work: Q4307515
cites work: Q3974625
cites work: Q4039749
cites work: Q4279509
cites work: Q4237376
cites work: Four results on randomized incremental constructions
cites work: On the Complexity of Computing the Volume of a Polyhedron
cites work: On The Complexity of Computing Mixed Volumes
cites work: Q3772828
cites work: Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions
cites work: Q4198056
cites work: Generalized Euler integrals and \(A\)-hypergeometric functions
cites work: Q4293510
cites work: Q4274015
cites work: Q4309969
cites work: Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
cites work: Lectures on Polytopes
full work available at URL: https://doi.org/10.1007/bf02711134
OpenAlex ID: W2088758224
DBLP publication ID: journals/dcg/VerscheldeGC96
description: scientific article; zbMATH DE number 919857