Name
Abstract | ||
|---|---|---|
By modifying and combining algorithms in symbolic and numerical computation, we propose a real-root-counting based method for deciding the feasibility of systems of polynomial equations. Along with this method, we also use a modified Newton operator to efficiently approximate the real solutions when the systems are feasible. The complexity of our method can be measured by a number of arithmetic operations which is singly exponential in the number of variables. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.cam.2010.11.018 | J. Computational Applied Mathematics |
Keywords | Field | DocType |
modified newton operator,singly exponential,complexity estimate,real solution,polynomial equation,polynomial system,arithmetic operation,condition number,numerical computation,operant conditioning,primary | Applied mathematics,Discrete mathematics,Condition number,Mathematical optimization,Transcendental equation,Polynomial,Symbolic computation,System of polynomial equations,Algebraic equation,Operator (computer programming),Numerical analysis,Mathematics | Journal |
Volume | Issue | ISSN |
235 | 8 | 0377-0427 |
Citations | PageRank | References |
4 | 0.45 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| zhikun she | 1 | 242 | 22.74 |
| Bican Xia | 2 | 377 | 34.44 |
| Zhiming Zheng | 3 | 128 | 16.80 |