کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
9501277 1338396 2005 30 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات آنالیز ریاضی
پیش نمایش صفحه اول مقاله
Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Complexity - Volume 21, Issue 4, August 2005, Pages 502-531
نویسندگان
, , ,