Parallel degree computation for binomial systems

DOI10.1016/J.JSC.2016.07.018zbMATH Open1357.65063OpenAlexW2506241836MaRDI QIDQ507161FDOQ507161

Authors: Tianran Chen, Dhagash Mehta 

Publication date: 3 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.07.018

Recommendations

• Parallel Homotopy Algorithms to Solve Polynomial Systems
• The granularity of parallel homotopy algorithms for polynomial systems of equations
• Mixed cell computation in HOM4ps
• A blackbox polynomial system solver on parallel shared memory computers
• Towards massively parallel computations in algebraic geometry

zbMATH Keywords

algebraic geometrysupersymmetric gauge theorieshomotopy continuationGPU computingbinomial systemsBKK root-count

Mathematics Subject Classification ID

Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Solving polynomial systems; resultants (13P15) Numerical algorithms for specific classes of architectures (65Y10)

Cites Work

• HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
• DEMiCs: a software package for computing the mixed volume via dynamic enumeration of all mixed cells
• Title not available (Why is that?)
• STRINGVACUA. A Mathematica package for studying vacuum configurations in string phenomenology
• Introduction to Toric Varieties. (AM-131)
• Title not available (Why is that?)
• Triangulations. Structures for algorithms and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Toric varieties
• Title not available (Why is that?)
• Mastering the master space
• Finding all flux vacua in an explicit example
• Equations Defining Toric Varieties
• Numerical elimination and moduli space of vacua
• Binomial ideals
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Polyhedral Method for Solving Sparse Polynomial Systems
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• The number of roots of a system of equations
• Exploring the potential energy landscape over a large parameter-space
• A simple introduction to Gröbner basis methods in string phenomenology
• Numerical polynomial homotopy continuation method and string vacua
• Mixed volume computation for semi-mixed systems
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• Decompositions of commutative monoid congruences and binomial ideals.
• Title not available (Why is that?)
• Finding mixed cells in the mixed volume computation
• Dynamic enumeration of all mixed cells
• Mixed cell computation in HOM4ps
• Computing the volume is difficult
• Hom4PS-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods
• Mixed volume computation in parallel
• Solutions to systems of binomial equations
• Mixed volume computation via linear programming

Cited In (5)

• Combinatorial mutations and block diagonal polytopes
• Realizing Degree Sequences in Parallel
• Parallel enumeration of degree sequences
• GPU-based parallel solver via the Kantorovich theorem for the nonlinear Bernstein polynomial systems
• Foreword. What is numerical algebraic geometry?

Uses Software

• DEMiCs
• HOM4PS
• Mathematica
• MixedVol
• STRINGVACUA
• CUDA
• Stony Brook
• Binomials.m2
• Hom4PS-3

This page was built for publication: Parallel degree computation for binomial systems

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