کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4634805 1340700 2008 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A reliable algorithm for computing the topological degree of a mapping in R2
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
A reliable algorithm for computing the topological degree of a mapping in R2
چکیده انگلیسی

In this paper, we present a method to reliably compute the topological degree of a mapping in the plane, over a simple closed polygon. The method is based on Henrici’s argument principle, and computes the degree using the winding number concept in range arithmetic. The algorithm is then applied to the root computation of a univariate polynomial. The proposed algorithms are demonstrated with examples.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 196, Issue 2, 1 March 2008, Pages 666–678
نویسندگان
, , ,