Condition number based complexity estimate for solving polynomial systems (Q629539): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cam.2010.11.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074519436 / rank | |||
Normal rank | |||
Revision as of 00:41, 20 March 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
