ISSN:
0945-3245
Schlagwort(e):
AMS(MOS): 65H05
;
CR: G1.5
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
Notizen:
Summary The argument principle is a natural and simple method to determine the number of zeros of an analytic functionf(z) in a bounded domainD. N, the number of zeros (counting multiplicities) off(z), is 1/2π times the change in Argf(z) asz moves along the closed contour σD. Since the range of Argf(z) is (−π, π] a critical point in the computational procedure is to assure that the discretization of σD, {z i ,i=1, ...,M}, is such that $$|\Delta _{{\text{[z}}_i {\text{,}} {\text{z}}_{i + 1} {\text{]}}} Arg f(z)| \leqq \pi $$ . Discretization control which may violate this inequality can lead to an unreliable algorithm. Mathematical theorems derived for the discretization of σD lead to a completely reliable algorithm to computeN. This algorithm also treats in an elementary way the case when a zero is on or near the contour σD. Numerical examples are given for the reliable algorithm formulated here and it is pointed out in these examples how inadequate discretization control can lead to failure of other algorithms.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01395882
Permalink