Robust certified numerical homotopy tracking (Q1955526): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: NAG4M2 / rank | |||
Normal rank | |||
Revision as of 07:53, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Robust certified numerical homotopy tracking |
scientific article |
Statements
Robust certified numerical homotopy tracking (English)
0 references
14 June 2013
0 references
The authors describe an algorithmic scheme for the linear homotopy method in solving systems of polynomial equations. The linear bit length complexity of the algorithm is established. Two computational experimental results of the algorithm are presented. One of them involves a small family of equations, and the other comes from an application in enumerative geometry.
0 references
symbolic-numeric methods
0 references
polynomial systems
0 references
complexity
0 references
condition metric
0 references
homotopy method
0 references
rational computation
0 references
computer proof
0 references
