Finding Mixed Cells in the Mixed Volume Computation
In practice, finding mixed cells in certain polyhedral subdivisions plays a dominating role when a polyhedral homotopy is employed to approximate all isolated zeros of polynomial systems. This paper gives a new algorithm for the mixed cell computation via a new formulation of the underlying linear p...
Uloženo v:
| Vydáno v: | Foundations of computational mathematics Ročník 1; číslo 2; s. 161 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
Springer Nature B.V
01.01.2001
|
| ISSN: | 1615-3375, 1615-3383 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | In practice, finding mixed cells in certain polyhedral subdivisions plays a dominating role when a polyhedral homotopy is employed to approximate all isolated zeros of polynomial systems. This paper gives a new algorithm for the mixed cell computation via a new formulation of the underlying linear programming problems. Numerical results show that the algorithm provides a major advance in the speed of computation with much less memory requirements.[PUBLICATION ABSTRACT] |
|---|---|
| Bibliografie: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 1615-3375 1615-3383 |
| DOI: | 10.1007/s102080010005 |