Locating all the zeros of an analytic function in one complex variable

Based on the argument principle, we propose an adaptive multilevel subdivision algorithm for the computation of all the zeros of an analytic function f : C→ C within a bounded domain. We illustrate the reliability of this method by several numerical examples.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of computational and applied mathematics Ročník 138; číslo 2; s. 325 - 333
Hlavní autoři:	Dellnitz, Michael, Schütze, Oliver, Zheng, Qinghua
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 2002 Elsevier
Témata:	Argument principle Exact sciences and technology Functions of a complex variable Global zero finding Mathematical analysis Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical approximation Sciences and techniques of general use Global zero finding 65E05 Argument principle 30C15 Complex function Complex variable Zero of function Approximation Holomorphic function Numerical method Algorithm Domain decomposition Adaptive method Analytical function
ISSN:	0377-0427, 1879-1778
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Based on the argument principle, we propose an adaptive multilevel subdivision algorithm for the computation of all the zeros of an analytic function f : C→ C within a bounded domain. We illustrate the reliability of this method by several numerical examples.
Bibliografie:	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0377-0427 1879-1778
DOI:	10.1016/S0377-0427(01)00371-5