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.

Saved in:
Bibliographic Details
Published in:Journal of computational and applied mathematics Vol. 138; no. 2; pp. 325 - 333
Main Authors: Dellnitz, Michael, Schütze, Oliver, Zheng, Qinghua
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 2002
Elsevier
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography: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