Name
Abstract | ||
|---|---|---|
A Newton homotopy is a homotopy that involves changing only the constant terms. They arise naturally, for example, when performing monodromy loops, moving end effectors of robots, and simply when trying to compute a solution to a square system of equations. Previous certified path tracking techniques have focused on using an a priori certified tracking scheme which means that the stepsize is constructed so that the result automatically satisfies some conditions. These schemes use pessimistic stepsizes that can be much smaller than those used by heuristic tracking methods. This article designs an a posteriori certification scheme that uses the result of a heuristic tracking scheme as input to produce a certificate that the path was indeed tracked correctly, e.g., no path jumpings occurred. By using an a posteriori approach, each step can be certified independently and thus certification of the path can be performed in parallel. Examples are presented demonstrating the efficiency of this a posteriori certification approach. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1145/2608628.2608651 | ISSAC |
Keywords | Field | DocType |
alpha theory,algorithms,certified tracking,verification,newton homotopy,alphacertified,homotopy continuation,mathematical software | Heuristic,Mathematical optimization,System of linear equations,Computer science,Monodromy,A priori and a posteriori,Algorithm,Homotopy,Certification,Robot,Certificate | Conference |
Citations | PageRank | References |
7 | 0.51 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jonathan D. Hauenstein | 1 | 269 | 37.65 |
| Ian Haywood | 2 | 8 | 0.88 |
| Alan C. Liddell Jr. | 3 | 18 | 2.88 |