Condition number based complexity estimate for solving polynomial systems (Q629539): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.cam.2010.11.018 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.CAM.2010.11.018 / rank | |||
Normal rank | |||
Latest revision as of 22:55, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Condition number based complexity estimate for solving polynomial systems |
scientific article |
Statements
Condition number based complexity estimate for solving polynomial systems (English)
0 references
9 March 2011
0 references
A real-root-counting based method for deciding the feasibility of systems of polynomial equations is proposed. Along with this method, a modified Newton operator is used to efficiently approximate the real solutions when the systems are feasible.
0 references
real-root-counting
0 references
Newton operator
0 references
condition number
0 references
complexity analysis
0 references
systems of polynomial equations
0 references
0 references
