Polynomial Homotopies for Dense, Sparse and Determinantal Systems
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
1999
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911217763745792 |
|---|---|
| author | Verschelde, Jan |
| author_facet | Verschelde, Jan |
| contents | Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution of a generic system that is used to start up the deformations. Software and applications are discussed. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_math_9907060 |
| institution | arXiv |
| publishDate | 1999 |
| record_format | arxiv |
| spellingShingle | Polynomial Homotopies for Dense, Sparse and Determinantal Systems Verschelde, Jan Numerical Analysis Algebraic Geometry Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution of a generic system that is used to start up the deformations. Software and applications are discussed. |
| title | Polynomial Homotopies for Dense, Sparse and Determinantal Systems |
| topic | Numerical Analysis Algebraic Geometry |
| url | https://arxiv.org/abs/math/9907060 |