Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9501277 | Journal of Complexity | 2005 | 30 Pages |
Abstract
We consider a family of polynomial systems which arises in the analysis of the stationary solutions of a standard discretization of certain semi-linear second-order parabolic partial differential equations. We prove that this family is well-conditioned from the numeric point of view, and ill-conditioned from the symbolic point of view. We exhibit a polynomial-time numeric algorithm solving any member of this family, which significantly contrasts the exponential behavior of all known symbolic algorithms solving a generic instance of this family of systems.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis
Authors
M. De Leo, E. Dratman, G. Matera,