## Numerical Homotopies to compute generic Points on positive dimensional Algebraic Sets (1999)

### Cached

### Download Links

- [www.math.msu.edu]
- [www.ricam.oeaw.ac.at]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Complexity |

Citations: | 50 - 24 self |

### BibTeX

@ARTICLE{Sommese99numericalhomotopies,

author = {Andrew J. Sommese and Jan Verschelde},

title = {Numerical Homotopies to compute generic Points on positive dimensional Algebraic Sets},

journal = {Journal of Complexity},

year = {1999},

volume = {16},

pages = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A procedure of A. Sommese and C. Wampler consists in slicing the components with linear subspaces in general position to obtain generic points of the components as the isolated solutions of an auxiliary system. Since this requires the solution of a number of larger overdetermined systems, the procedure is computationally expensive and also wasteful because many solution paths diverge. In this article an embedding of the original polynomial system is presented, which leads to a sequence of homotopies, with solution paths leading to generic points of all components as the isolated solutions of an auxiliary system. The new procedure significantly reduces the number of paths to solutions that need to be followed. This approach has been implemented and applied to...