Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Guillermo Matera / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Walter Zulehner / rank | |||
Normal rank | |||
Revision as of 16:08, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study |
scientific article |
Statements
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (English)
0 references
2 September 2005
0 references
A family of systems of polynomial equations is considered, which arises in the analysis of the stationary solutions of certain discretized semi-linear parabolic differential equations. Only the positive solutions are of interest. A numerical homotopy algorithm for finding all positive solutions is presented with polynomial complexity in the number of unknown. It is shown that any universal symbolic method is likely to have a complexity which is exponential in the number of unknowns.
0 references
polynomial systems
0 references
homotopy methods
0 references
symbolic methods
0 references
complexity
0 references
semi-linear parabolic problems
0 references
positive solutions
0 references
