The granularity of parallel homotopy algorithms for polynomial systems of equations
In recent years several authors have considered the application of homotopies and numerical continuation methods to the problem of finding all of the finite zeroes in \(C^ n\) of a complex system of polynomial equations. For examples of references we suggest the following papers and the references therein: \textit{S.-N. Chow}, \textit{J. Mallet-Paret} and \textit{J. A. Yorke} [Math. Comp. 32, 887-899 (1978; Zbl 0398.65029)]; \textit{C. B. Garcia} and \textit{W. I. Zangwill} [Math. Oper. Res. 4, 1-14 (1979; Zbl 0408.90086)]; \textit{T. Y. Li}, \textit{T. Sauer} and \textit{J. A. Yorke} [Numer. Math. 51, 481-500 (1987; Zbl 0656.65055)]. One of the drawbacks of the homotopy method in this context is the large number of curves which need to be traversed. Generically, this is the product of the degrees of the component maps. However, the situation lends itself very well to parallelizing. In the present paper the efficacy of parallel computing for this problem is explored. Very interesting data is given concerning a large number of practical problems which were computed on a variety of machines.
- A globally convergent algorithm for computing fixed points of C^2 maps
- A homotopy for solving polynomial systems
- A Nonlinear Parallel Algorithm with Application to the Stefan Problem
- A parallel algorithm for simple roots of polynomials
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- A transformation to avoid solutions at infinity for polynomial systems
- Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5]
- Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C 2 Maps [C5]
- Algorithm 652
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- scientific article; zbMATH DE number 50337 (Why is no real title available?)
- scientific article; zbMATH DE number 3541848 (Why is no real title available?)
- Parallel Algorithms for Nonlinear Problems
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- High-dimensional homotopy curve tracking on a shared-memory multiprocessor
- Computing the optimal partition of variables in multi-homogeneous homotopy methods
- A blackbox polynomial system solver on parallel shared memory computers
- Solving polynomial systems by polyhedral homotopies
- PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
- Homotopy continuation method for solving systems of nonlinear and polynomial equations
- A globally convergent parallel algorithm for zeros of polynomial systems
- Algorithm 857
- Algorithm 801: POLSYS_PLP
- Parallel degree computation for binomial systems
- Monodromy solver. Sequential and parallel
- Parallel Homotopy Algorithms to Solve Polynomial Systems
This page was built for publication: The granularity of parallel homotopy algorithms for polynomial systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733310)