Parallel Homotopy Algorithms to Solve Polynomial Systems
From MaRDI portal
Continuation methodshigh performance continuationjumpstarting homotopieslinear-product systemsparallel computationpath followingpolyhedral homotopiespolynomial systemssimplex system
Computational aspects in algebraic geometry (14Q99) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)
Recommendations
- The granularity of parallel homotopy algorithms for polynomial systems of equations
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
- Solving polynomial systems by polyhedral homotopies
- scientific article; zbMATH DE number 1121981
- Parallel algorithms for some algebraic operations on polynomial equations
- Computing all solutions to polynomial systems using homotopy continuation
- A homotopy for solving polynomial systems
- Hom4PS-3: a parallel numerical solver for systems of polynomial equations based on polyhedral homotopy continuation methods
- Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
- Massively parallel computations on many-variable polynomials
Cited in
(19)- HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method
- Computing the optimal partition of variables in multi-homogeneous homotopy methods
- A blackbox polynomial system solver on parallel shared memory computers
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
- Parallelization of triangular decompositions: techniques and implementation
- Homotopy continuation method for solving systems of nonlinear and polynomial equations
- Galois groups of Schubert problems via homotopy computation
- Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation
- A globally convergent parallel algorithm for zeros of polynomial systems
- PHClab: a MATLAB/Octave interface to PHCpack
- Algorithm 857
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Algorithm 801: POLSYS_PLP
- Algorithm 795
- The granularity of parallel homotopy algorithms for polynomial systems of equations
- Mixed cell computation in HOM4ps
- Parallel degree computation for binomial systems
- Monodromy solver. Sequential and parallel
- Interfacing with the numerical homotopy algorithms in PHCpack
This page was built for publication: Parallel Homotopy Algorithms to Solve Polynomial Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5747817)