کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
422165 685035 2008 18 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra
چکیده انگلیسی

Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the numerical Newton iteration to yield fast root-approximation methods together with a constructive proof of the fundamental theorem of algebra. The existence of the inverse near a simple zero may be used globally to convert topological methods like path-following via Newton's method to numerical schemes with probabilistic convergence. Finally, fast factoring methods which yield root-approximations are constructed using some algebraic Newton iteration for initial factor approximations.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Theoretical Computer Science - Volume 202, 21 March 2008, Pages 201-218