1988
DOI: 10.1007/bf01395882
|View full text |Cite
|
Sign up to set email alerts
|

A reliable argument principle algorithm to find the number of zeros of an analytic function in a bounded domain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

1989
1989
2015
2015

Publication Types

Select...
6
3
1

Relationship

0
10

Authors

Journals

citations
Cited by 47 publications
(21 citation statements)
references
References 5 publications
0
21
0
Order By: Relevance
“…The number of zeros is then the change of the argument divided by 2π. The segments in which the contour is divided have to be chosen small enough that the change of the argument over each segment is smaller than π. Adaptive procedures to achieve this have been proposed by, amongst others, Ying and Katz [31], but for simplicity we determined the partition of the contour by trial and error.…”
Section: Global Eigenvalue Search Methodsmentioning
confidence: 99%
“…The number of zeros is then the change of the argument divided by 2π. The segments in which the contour is divided have to be chosen small enough that the change of the argument over each segment is smaller than π. Adaptive procedures to achieve this have been proposed by, amongst others, Ying and Katz [31], but for simplicity we determined the partition of the contour by trial and error.…”
Section: Global Eigenvalue Search Methodsmentioning
confidence: 99%
“…19 To avoid any missing complex-valued roots, application of the Principle of the Argument is commonly favoured. [20][21][22] A numerical algorithm for obtaining the eigenvalues k p at each excitation frequency in the acousto-elastic layered system was written in the programming language Fortran (Intel Visual Fortran Compiler Release V11.0.062) by the authors. A detailed discussion of the algorithm falls outside the scope of the present paper.…”
Section: B the Complete Wave Spectrum Of An Acousto-elastic Waveguidementioning
confidence: 99%
“…The localization of several roots closest to the origin using the argument principle followed by several Newton iterations can be faster than the localization of all the roots by some general-purpose method. Moreover for more general boundary conditions, e.g., involving multiplication by an analytic function of λ, the approximate characteristic function may not be a polynomial, and the argument principle becomes even more useful (see, e.g., [6,14,53]). The argument principle consists in the following, see, e.g., [10].…”
Section: 3mentioning
confidence: 99%