| dc.contributor.author |
Ko, KH |
en |
| dc.contributor.author |
Sakkalis, T |
en |
| dc.contributor.author |
Patrikalakis, NM |
en |
| dc.date.accessioned |
2014-06-06T06:48:52Z |
|
| dc.date.available |
2014-06-06T06:48:52Z |
|
| dc.date.issued |
2008 |
en |
| dc.identifier.issn |
0096-3003 |
en |
| dc.identifier.uri |
http://62.217.125.90/xmlui/handle/123456789/4308 |
|
| dc.subject |
Gauss map |
en |
| dc.subject |
topological degree |
en |
| dc.subject |
principle of argument |
en |
| dc.subject |
interval arithmetic |
en |
| dc.subject |
affine arithmetic |
en |
| dc.subject |
univariate polynomials |
en |
| dc.subject.classification |
Mathematics, Applied |
en |
| dc.subject.other |
ANALYTIC-FUNCTIONS |
en |
| dc.subject.other |
ZEROS |
en |
| dc.subject.other |
COMPUTATION |
en |
| dc.subject.other |
COMPLEXITY |
en |
| dc.subject.other |
EFFICIENT |
en |
| dc.title |
A reliable algorithm for computing the topological degree of a mapping in R-2 |
en |
| heal.type |
journalArticle |
en |
| heal.language |
English |
en |
| heal.publicationDate |
2008 |
en |
| heal.abstract |
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. (C) 2007 Elsevier Inc. All rights reserved. |
en |
| heal.publisher |
ELSEVIER SCIENCE INC |
en |
| heal.journalName |
APPLIED MATHEMATICS AND COMPUTATION |
en |
| dc.identifier.issue |
2 |
en |
| dc.identifier.volume |
196 |
en |
| dc.identifier.isi |
ISI:000253631700019 |
en |
| dc.identifier.spage |
666 |
en |
| dc.identifier.epage |
678 |
en |