Computing all solutions to polynomial systems using homotopy continuation (Q1097645): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: HOMPACK / rank | |||
Normal rank | |||
Revision as of 23:50, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing all solutions to polynomial systems using homotopy continuation |
scientific article |
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
