HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
From MaRDI portal
Publication:1006435
DOI10.1007/S00607-008-0015-6zbMATH Open1167.65366OpenAlexW2158358539MaRDI QIDQ1006435FDOQ1006435
Authors: J. Martínez 
Publication date: 24 March 2009
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-008-0015-6
Recommendations
- Hom4PS-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods
- PHoM -- a polyhedral homotopy continuation method for polynomial systems
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
- scientific article; zbMATH DE number 1069614
- scientific article; zbMATH DE number 2109418
- Algorithm 795
- Computing all solutions to polynomial systems using homotopy continuation
- Homotopy continuation method for solving systems of nonlinear and polynomial equations
- Parallel Homotopy Algorithms to Solve Polynomial Systems
- A special homotopy continuation method for a class of polynomial systems
Cites Work
- PHoM -- a polyhedral homotopy continuation method for polynomial systems
- Algorithm 846
- Algorithm 795
- Coefficient-parameter polynomial continuation
- Newton's method with deflation for isolated singularities of polynomial systems
- Title not available (Why is that?)
- A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots
- Solving polynomial systems by polyhedral homotopies
- Numerical decomposition of the solution sets of polynomial systems into irreducible components
- The Cheater’s Homotopy: An Efficient Procedure for Solving Systems of Polynomial Equations
- 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
- Title not available (Why is that?)
- Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods
- A power series method for computing singular solutions to nonlinear analytic systems
- Adaptive Multiprecision Path Tracking
- Polyhedral end games for polynomial continuation
- Title not available (Why is that?)
- Evaluation of Jacobian matrices for Newton's method with deflation to approximate isolated singular solutions of polynomial systems
- A Rank-Revealing Method with Updating, Downdating, and Applications
- Mixed volume computation for semi-mixed systems
- Finding mixed cells in the mixed volume computation
- Dynamic enumeration of all mixed cells
- Determining dimension of the solution component that contains a computed zero of a polynomial system
- Mixed volume computation via linear programming
- A Neural Network Modeled by an Adaptive Lotka-Volterra System
- Numerical stability of path tracing in polyhedral homotopy continuation methods
- Some examples for solving systems of algebraic equations by calculating Gröbner bases
- An Explicit Modular Equation in Two Variables and Hilbert's Twelfth Problem
Cited In (84)
- Implementing real polyhedral homotopy
- A numerical realization of the conditions of Max Nöther's residual intersection theorem
- Identifying the number of components in Gaussian mixture models using numerical algebraic geometry
- Symmetric homotopy method for discretized elliptic equations with cubic and quintic nonlinearities
- Beyond polyhedral homotopies
- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling
- Kronecker-Based Infinite Level-Dependent QBD Processes
- A geometric approach for analyzing parametric biological systems by exploiting block triangular structure
- An adaptive homotopy method for computing bifurcations of nonlinear parametric systems
- Finding multiple solutions to elliptic systems with polynomial nonlinearity
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Epsilon local rigidity and numerical algebraic geometry
- Continuation Newton methods with the residual trust-region time-stepping scheme for nonlinear equations
- Nine equilibrium points of four point charges on the plane
- Numerical roadmap of smooth bounded real algebraic surface
- Algebraic compressed sensing
- Computing singular points of projective plane algebraic curves by homotopy continuation methods
- Polynomial homotopy continuation on GPUs
- Exploring collision-free path planning by using homotopy continuation methods
- The steady-state degree and mixed volume of a chemical reaction network
- The classification of homogeneous Einstein metrics on flag manifolds with \(b_2(M) = 1\)
- Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
- Unification and extension of intersection algorithms in numerical algebraic geometry
- Hom4PS-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods
- Computing tensor eigenvalues via homotopy methods
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Galois groups of Schubert problems via homotopy computation
- Eigenfunction expansion method for multiple solutions of fourth-order ordinary differential equations with cubic polynomial nonlinearity
- Algebraic \(\mathbb C^*\)-actions and the inverse kinematics of a general 6R manipulator
- Numerical elimination and moduli space of vacua
- Visualizing planar and space implicit real algebraic curves with singularities
- Seven mutually touching infinite cylinders
- Numerical algebraic geometry and algebraic kinematics
- Algorithm 857
- Bounding the equilibrium distribution of Markov population models.
- Cell decomposition of almost smooth real algebraic surfaces
- Stability verification for monotone systems using homotopy algorithms
- Perturbed homotopies for finding all isolated solutions of polynomial systems
- On a radiative origin of the standard model from trinification
- Central configurations of the five-body problem with equal masses
- Euclidean distance degree and mixed volume
- Exploring the potential energy landscape over a large parameter-space
- Unmixing the mixed volume computation
- Polynomial homotopy continuation with PHCpack
- Algorithm 801: POLSYS_PLP
- Regenerative cascade homotopies for solving polynomial systems
- Algorithm 795
- The Maximum Likelihood Degree of Sparse Polynomial Systems
- Numerical algebraic geometry: a new perspective on gauge and string theories
- Numerical polynomial homotopy continuation method and string vacua
- MultiRegeneration for polynomial system solving
- Fast linear homotopy to find approximate zeros of polynomial systems
- Khovanskii-Rolle continuation for real solutions
- HOM4PS
- Title not available (Why is that?)
- Title not available (Why is that?)
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems
- SARAH 4: a tool for (not only SUSY) model builders
- Using monodromy to avoid high precision in homotopy continuation
- Mixed cell computation in HOM4ps
- Chern numbers of smooth varieties via homotopy continuation and intersection theory
- A complex solution framework for the kinetostatic synthesis of a compliant four-bar mechanism
- A certified numerical algorithm for the topology of resultant and discriminant curves
- BertiniLab: a MATLAB interface for solving systems of polynomial equations
- Bifurcations of central configurations in the four-body problem with some equal masses
- A constrained homotopy technique for excluding unwanted solutions from polynomial equations arising in kinematics problems
- Verified error bounds for singular solutions of nonlinear systems
- The nearest complex polynomial with a zero in a given complex domain
- Computing curve intersection by homotopy methods
- Multiprojective witness sets and a trace test
- Decoupling highly structured polynomial systems
- Foreword. What is numerical algebraic geometry?
- Parallel degree computation for binomial systems
- PHoM -- a polyhedral homotopy continuation method for polynomial systems
- Computation analysis of buckling loads of thin-walled members with open sections
- Toward a salmon conjecture
- HomotopyContinuation.jl: a package for homotopy continuation in Julia
- Exploring new models in all detail with \texttt{SARAH}
- Robust certified numerical homotopy tracking
- Early Ending in Homotopy Path-Tracking for Real Roots
- Regeneration homotopies for solving systems of polynomials
- Certified predictor-corrector tracking for Newton homotopies
- A robust and efficient method for solving point distance problems by homotopy
Uses Software
This page was built for publication: HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006435)
