Computing all solutions to polynomial systems using homotopy continuation (Q1097645)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing all solutions to polynomial systems using homotopy continuation |
scientific article; zbMATH DE number 4035009
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing all solutions to polynomial systems using homotopy continuation |
scientific article; zbMATH DE number 4035009 |
Statements
Computing all solutions to polynomial systems using homotopy continuation (English)
0 references
1987
0 references
The authors establish the principles of implementation and report on the performance of computer programs that use the homotopies described in their previous paper [ibid. 24, 101-113 (1987; reviewed above)]. Numerical results are presented on three typical problems from geometric modeling, chemical equilibrium studies and kinematics of mechanisms. Generally the new approach is faster and more reliable.
0 references
zeros of polynomial functions
0 references
homotopy
0 references
continuation
0 references
computer programs
0 references
Numerical results
0 references
geometric modeling
0 references
chemical equilibrium
0 references
kinematics
0 references
0 references
0 references
0.94231206
0 references
0.9413994
0 references
0.9388524
0 references
0 references
0.9289238
0 references
0.9276942
0 references
0.92438227
0 references
