
An explicit formula for the zero of the Szegö kernel for an annulus region is well-known. There exists a transformation formula for the Szegö kernel from a doubly connected region onto an annulus. Based on conformal mapping, we derive an analytical formula for the zeros of the Szegö kernel for a general doubly connected region with smooth boundaries. Special cases are the explicit formulas for the zeros of the Szegö kernel for doubly connected regions bounded by circles, limacons, ellipses, and ovals of Cassini. For a general doubly connected region with smooth boundaries, the zero of the Szegö kernel must be computed numerically. This paper describes the application of conformal mapping via integral equation with the generalized Neumann kernel for computing the zeros of the Szegö kernel for smooth doubly connected regions. Some numerical examples and comparisons are also presented. It is shown that the conformal mapping approach also yields good accuracy for a narrow region or region with boundaries that are close to each other.
Citation: Nuraddeen S. Gafai, Ali H. M. Murid, Samir Naqos, Nur H. A. A. Wahid. Computing the zeros of the Szegö kernel for doubly connected regions using conformal mapping[J]. AIMS Mathematics, 2023, 8(5): 12040-12061. doi: 10.3934/math.2023607
[1] | Dongyi Li, Yibin Lu . A method of numerical conformal mapping of bounded regions with a rectilinear slit. AIMS Mathematics, 2025, 10(4): 8422-8445. doi: 10.3934/math.2025388 |
[2] | Sharifah E. Alhazmi, M. A. Abdou, M. Basseem . The stresses components in position and time of weakened plate with two holes conformally mapped into a unit circle by a conformal mapping with complex constant coefficients. AIMS Mathematics, 2023, 8(5): 11095-11112. doi: 10.3934/math.2023562 |
[3] | N. E. Cho, G. Murugusundaramoorthy, K. R. Karthikeyan, S. Sivasubramanian . Properties of λ-pseudo-starlike functions with respect to a boundary point. AIMS Mathematics, 2022, 7(5): 8701-8714. doi: 10.3934/math.2022486 |
[4] | Shuhong Yu, Tingsong Du . Certain inequalities in frame of the left-sided fractional integral operators having exponential kernels. AIMS Mathematics, 2022, 7(3): 4094-4114. doi: 10.3934/math.2022226 |
[5] | Jia-Bao Liu, Saad Ihsan Butt, Jamshed Nasir, Adnan Aslam, Asfand Fahad, Jarunee Soontharanon . Jensen-Mercer variant of Hermite-Hadamard type inequalities via Atangana-Baleanu fractional operator. AIMS Mathematics, 2022, 7(2): 2123-2141. doi: 10.3934/math.2022121 |
[6] | Shahid Mubeen, Rana Safdar Ali, Iqra Nayab, Gauhar Rahman, Kottakkaran Sooppy Nisar, Dumitru Baleanu . Some generalized fractional integral inequalities with nonsingular function as a kernel. AIMS Mathematics, 2021, 6(4): 3352-3377. doi: 10.3934/math.2021201 |
[7] | Adil Owaid Jhaily, Saeed Sohrabi, Hamid Ranjbar . On the numerical solution of highly oscillatory Fredholm integral equations using a generalized quadrature method. AIMS Mathematics, 2025, 10(3): 5631-5650. doi: 10.3934/math.2025260 |
[8] | Miguel Vivas-Cortez, Muhammad Aamir Ali, Artion Kashuri, Hüseyin Budak . Generalizations of fractional Hermite-Hadamard-Mercer like inequalities for convex functions. AIMS Mathematics, 2021, 6(9): 9397-9421. doi: 10.3934/math.2021546 |
[9] | Erhan Deniz, Ahmet Ocak Akdemir, Ebru Yüksel . New extensions of Chebyshev-Pólya-Szegö type inequalities via conformable integrals. AIMS Mathematics, 2020, 5(2): 956-965. doi: 10.3934/math.2020066 |
[10] | Mohsan Raza, Khalida Inayat Noor . Subclass of Bazilevič functions of complex order. AIMS Mathematics, 2020, 5(3): 2448-2460. doi: 10.3934/math.2020162 |
An explicit formula for the zero of the Szegö kernel for an annulus region is well-known. There exists a transformation formula for the Szegö kernel from a doubly connected region onto an annulus. Based on conformal mapping, we derive an analytical formula for the zeros of the Szegö kernel for a general doubly connected region with smooth boundaries. Special cases are the explicit formulas for the zeros of the Szegö kernel for doubly connected regions bounded by circles, limacons, ellipses, and ovals of Cassini. For a general doubly connected region with smooth boundaries, the zero of the Szegö kernel must be computed numerically. This paper describes the application of conformal mapping via integral equation with the generalized Neumann kernel for computing the zeros of the Szegö kernel for smooth doubly connected regions. Some numerical examples and comparisons are also presented. It is shown that the conformal mapping approach also yields good accuracy for a narrow region or region with boundaries that are close to each other.
Univalent functions are analytic functions that are one-to-one. Conformal mapping functions are analytic functions that are one-to-one with the angle preserving property. Thus, conformal mapping functions are univalent.
Many conformal mapping problems can be solved using the Szegö kernel, which also satisfies the Kerzman-Stein integral equation [1,2]. The Szegö kernel for an annulus has both bilateral series and infinite product representations [3,4,5]. The Szegö kernel is closely related to the Ahlfors map. The Ahlfors map of a doubly connected region Ω is a branching two-to-one map onto the disk. From the boundary values of the Szegö kernel, the boundary values of the Ahlfors map are completely determined [6,7,8]. The Ahlfors map of Ω has two zeros, one zero is predetermined which is mapped to zero, the other zero comes from the unique zero of the Szegö kernel. The zero of the Szegö kernel for an annulus has a nice closed formula [3]. Computing the zero of the Szegö kernel for Ω is an interesting problem in computational complex analysis. A system of nonlinear equations with integrals involving the Szegö kernel and its derivative, satisfied by the zeros of the Szegö kernel for a multiply connected region has been presented by Tegtmeyer [8], but did not show any numerical computations of the zeros. In [9] the zero of the Szegö kernel of Ω has been computed numerically by extending the approach of [10]. However, the numerical methods in [9] are iterative and require good initial approximation of the zero for convergence. This approximation is obtained by plotting the graph of the absolute value of the Ahlfors map. Additional numerical methods for computing the zeros of the Szegö kernel for doubly connected regions are shown in [11]. Since there exists a transformation formula for the Szegö kernel from Ω onto an annulus [3], the possibility of applying conformal mapping for computing the zero of the Szegö kernel arises, thus, avoiding iterative, and graphing procedures.
There exist many numerical conformal mapping methods in the literature. An introduction to numerical methods for conformal mapping can be found in the books [12,13]. For some recent numerical conformal mapping methods, see [14,15,16,17,18].
In this paper, by means of conformal mapping, we derive an analytical formula for the zero of the Szegö kernel for Ω. The conformal mapping of Ω onto an annulus is computed numerically based on the boundary integral equation with the generalized Neumann kernel [15]. The integral equation is uniquely solvable Fredholm integral equation of the second kind.
The plan of the paper is as follows: In Section 2, some known techniques for calculating the zero of the Szegö kernel for Ω are given. In Section 3, the conformal mapping method for computing the zero of the Szegö kernel for Ω via integral equation with the generalized Neumann kernel are shown. In Section 4, the numerical implementations of the techniques in Sections 2 and 3 are discussed. In Section 5, seven numerical examples for computing the zeros of the Szegö kernel for various Ω are given based on conformal mapping, some comparisons with other techniques of Section 2 are also made. The last Section 6 presents some concluding remarks.
Let Ω be a bounded doubly connected region with the boundary Γ=Γ0∪Γ1 consists of two smooth Jordan curves with the inner curve Γ1 oriented clockwise and outer curve Γ0 oriented counterclockwise. Further, we assume α and a (α≠a) are auxiliary given distinct points in the region Ω and z0 is an auxiliary given point in the simply connected region bounded by Γ1.
The curve Γj, j=0,1 is parametrized by a 2π-periodic triply continuously differentiable complex-valued functions zj(s) with z′j(s)≠0,s∈Jj=[0,2π]. The total parameter domain J=J0∪J1 is the disjoint union of two intervals Jj=[0,2π]. Define a parametrization of the whole boundary Γ as the complex function z(s) define on J by
z(s)={z0(s),s∈J0=[0,2π],z1(s),s∈J1=[0,2π]. | (2.1) |
For the special case where Ω is an annulus D={z:ρ<|z|<1} bounded by C=C0∪C1, 0<ρ<1, there exists a bilateral series representation for the Szegö kernel for D given by [3]
SD(z,a)=12π∞∑n=−∞(z¯a)n1+ρ2n+1,a∈D,z∈D∪C. | (2.2) |
It has a unique zero at z=−ρ/¯a [3]. The Szegö kernel for D has another bilateral series representation [4] (in an equivalent form)
SD(z,a)=12π∞∑n=−∞(−1)nρnρ2n−z¯a,z∈D∪C, a∈D. | (2.3) |
The bilateral series (2.2) is actually a basic bilateral series and can be expressed as an infinite product. For a∈D, z∈D∪C, the Szegö kernel for D can be represented by the infinite product [5]
SD(z,a)=12π∞∏n=0(1+¯azρ2n+1)(¯az+ρ2n+1)(1−ρ2n+2)2(1−¯azρ2n)(¯az−ρ2n+2)(1+ρ2n+1)2. | (2.4) |
The infinite product in (2.4) is convergent for ρ<1 and ρ2<|az|<1. The zero of SD(z,a) in D is equal to z=−ρ/¯a, which is the zero of the factor ¯az+ρ.
For the doubly connected region Ω, the Szegö kernel SΩ(z,a) satisfies the Kerzman-Stein integral equation on Γ [3,6,7]
SΩ(z,a)+∫ΓA(z,w)SΩ(w,a)|dw|=r(z),z∈Γ, | (2.5) |
where
A(z,w)={12π(T(w)z−w−¯T(z)¯z−¯w),z≠w∈Γ,0,z=w∈Γ, | (2.6) |
r(z)=−12πi¯T(z)¯z−¯a,z∈Γ, | (2.7) |
and
T(z)=z′(t)|z′(t)|,z∈Γ. | (2.8) |
The Kerzman-Stein kernel A(z,w) is continuous on Γ. In fact the integral equation (2.5) is also valid for an n-connected region for n≥3 [6,7]. Using the Cauchy integral formula, the interior values of the Szegö kernel for every z∈Ω can be determined by
SΩ(z,a)=12πi∫ΓSΩ(w,a)w−zdw,z∈Ω. | (2.9) |
The derivative of the Szegö kernel on Γ is computed by [9]
S′Ω(z(t),a)z′(t)=−∫Jddt[A(z(t),z(s))]SΩ(z(s),a)|z′(s)|ds+r′(z(t))z′(t), | (2.10) |
where
r′(z(t))z′(t)=−12πi[¯T′(z(t))z′(t)¯z(t)−a−¯T(z(t))z′(t)¯(z(t)−a)2], |
T′(z(t))z′(t)=z″(t)2|z′(t)|−(z′(t))2¯z″(t)2|z′(t)|3, |
and
ddtA(z(t),z(s))={12πi[−T(z(s))z′(t)(z(t)−z(s))2−¯T′(z(t))z′(t)(¯z(t)−¯z(s))+¯T(z(t))z′(t)(¯z(t)−¯z(s))2],z(t)≠z(s)∈Γ,14π|z′(t)|[13Im(z‴(t)z′(t))−Re(z″(t)z′(t))Im(z″(t)z′(t))],z(t)=z(s)∈Γ. |
The zero of the Szegö kernel z∗ for the doubly connected region Ω has the explicit formula [8]
z∗=12πi∫ΓzS′Ω(z,a)SΩ(z,a)dz,z∈Γ. | (2.11) |
The boundary values of SΩ(z,a) and S′Ω(z,a) can be computed by solving the integral equation (2.5) and applying (2.10) respectively. The zero z∗ has been computed numerically in [11] based on (2.5), (2.10), and (2.11).
The Szegö kernel is closely connected to the Ahlfors function. The Ahlfors function g(z) is a connected two-to-one analytic function mapping Ω onto the unit disk E={w:|w|<1}, satisfying g(a)=0, g′(a)>0. The function g(z) has another zero from the unique solution of SΩ(z,a) = 0. Further, g(z) maps each component of the boundary of Ω one-to-one onto the unit circle. Thus the boundary values of g(z) are given by
g(zj(t))=eiθj(t), | (2.12) |
where θj(t), j=0,1, are the boundary correspondence functions. It can be shown that [9]
θ′(t)=2Im(S′Ω(z(t),a)z′(t)SΩ(z(t),a))+Im(z″(t)z′(t)),z(t)∈Γ,a0∈Ω, | (2.13) |
where SΩ(z(t),a0) and S′Ω(z(t),a0)z′(t) are computed by solving the integral equations (2.5) and (2.10) respectively.
For all z∈Γ, the function θ′(t) and the zero z∗ for the Szegö kernel for Ω are related by the nonlinear algebraic equation (by treating z∗ as unknown) [19]
iθ′(t)+1πPV∫Jz′(t)z(t)−z(s)θ′(s)ds=2z′(t)[1z(t)−a+1z(t)−z∗], | (2.14) |
where θ′(t) can be computed using (2.13). Murid et al. [11] calculated z∗ as follows
z∗=z(t)−1G(t), | (2.15) |
where
G(t)=q(t)2z′(t)−1z(t)−a |
and
q(t)=iθ′(t)+1πPV∫Jz′(t)z(t)−z(s)θ′(s)ds. | (2.16) |
Again θ′(t) can be computed using (2.13). By taking imaginary part on both sides of (2.14), it reduces to the equation derived in [10], i.e.,
θ′(t)+∫JN(t,s)θ′(s)ds=2Im[z′(t)z(t)−a+z′(t)z(t)−z∗],z∈Γ, | (2.17) |
where
N(t,s)={1πIm[z′(t)z(t)−z(s)],t≠s,12πIm[z″(t)z′(t)],t=s, | (2.18) |
is the Neumann kernel. The Newton iterative method and the trapezoidal rule has been used to solve z∗ from the nonlinear algebraic equation (2.17) in [9].
Theoretically, the Szegö kernel SΩ(z,a) for Ω can be found using a transformation formula under conformal mapping. If Ω is any doubly connected region with smooth boundary Γ and f(z) is a conformal map of Ω onto D, then [6]
SΩ(z,a)=√f′(z)SD(f(z),f(a))¯√f′(a),a∈Ω,z∈Ω∪Γ, | (2.19) |
where SD is represented by (2.2). Note that (2.2) contains the inner radius ρ which needs to be computed.
In the next section, we give another explicit formula for computing zero z∗ of SΩ(z,a) based on (2.19).
Consider the doubly connected region Ω with boundary denoted by Γ as described in Section 2. Let f(z) be a conformal map from Ω to the annulus D={w:ρ<|w|<1}, where the modulus (or the inner radius) ρ can be computed by a special method which will be explained later. Consequently f−1 is an inverse map of D onto Ω.
Theorem 1. The Szegö kernel for Ω can be represented by the bilateral series as
SΩ(z,a)=√f′(z)¯√f′(a)2π∞∑n=−∞(f(z)¯f(a))n1+ρ2n+1. |
The zero of SΩ(z,a) in Ω is
z∗=f−1(−ρ/¯f(a)). | (3.1) |
Proof. Applying (2.2) to the transformation formula (2.19), yields
SΩ(z,a)=√f′(z)SD(f(z),f(a))¯√f′(a)=√f′(z)¯√f′(a)2π∞∑n=−∞(f(z)¯f(a))n1+ρ2n+1. | (3.2) |
Using the fact that SD(z,a) has a zero at z=−ρ/¯a in D, the zero z∗ of SΩ(z,a) for Ω satisfies f(z∗)¯f(a)=−ρ, or f(z∗)=−ρ/¯f(a) which implies z∗=f−1(−ρ/¯f(a)).
Formula (3.1) is an explicit formula for the zero of SΩ(z,a) in terms of f and f−1. Thus formula (3.1) is applicable provided the mapping functions f and f−1 are known. These functions are known only for very few special regions. For general region Ω we must resort to numerical conformal mapping.
The following theory from [16,20] shows an integral equation method with the generalized Neumann kernel to compute the conformal map w=f(z) from Ω onto the annulus D with normalization
f(α)>0, |
where α is an auxiliary given point in Ω.
Denote by H the space of all functions of the form
μ(s)={μ0(s),s∈J0,μ1(s),s∈J1, | (3.3) |
where μ0(s) and μ1(s) are 2π-periodic Hölder continuously real functions on J0 and J1, respectively. Define a complex function B on Γ as [16,20]
B(s)=z(s)−α={B0(s)=z0(s)−α,s∈J0,B1(s)=z1(s)−α,s∈J1. | (3.4) |
For μ and γ in H, consider the following integral equation [16,20]
(I−N)μ=−Mγ, | (3.5) |
where the integral operators N and M are defined respectively by
Nμ(s)=∫JN(s,t)μ(t)dt,s∈J, |
and
Mμ(s)=∫JM(s,t)μ(t)dt,s∈J, |
with the kernels N(s,t) and M(s,t) defined respectively as
N(s,t)=1πIm(B(s)B(t)z′(t)z(t)−z(s)),(s,t)∈J×J | (3.6) |
and
M(s,t)=1πRe(B(s)B(t)z′(t)z(t)−z(s)),(s,t)∈J×J. | (3.7) |
The kernel N(s,t) is known as the generalized Neumann kernel.
The integral equation (3.5) is uniquely solvable for any real Hölder continuous function γ∈H. Additionally, if μ is the unique solution of the boundary integral equation (3.5), then the real function h defined by
h=[Mμ−(I−Nγ)]/2, | (3.8) |
is a piecewise constant function on the boundary Γ, where hj are real constants j=0,1 and h(t)=hj for z(t)∈Γj. Moreover,
F(z(t))=γ(t)+h(t)+iμ(t)B(t),z(t)∈Γ, | (3.9) |
are the boundary values of an analytic function F in the doubly connected region Ω. For z∈Ω the function F(z) is calculated by the Cauchy integral formula
F(z)=12πi∫ΓF(ξ)ξ−zdξ. | (3.10) |
For more details on the generalized Neumann kernel, see [21].
Theorem 2. [20] Let the function B be defined by (3.4), and the function γ be defined by
γ(t)=−log|z(t)−z0α−z0|,t∈J. | (3.11) |
If μ is the unique solution of the boundary integral equation (3.5), and the piecewise constant function h is given by (3.8), then the function F with the boundary values (3.9) is analytic in the region Ω, and the conformal mapping f is given by
f(z)=e−h0(z−z0α−z0)e(z−α)F(z),z∈Ω∪Γ, | (3.12) |
and the modulus ρ is given by
ρ=e(h1−h0). | (3.13) |
The inverse mapping function f−1 is analytic and one-to one in the annulus region. If the boundary C of D is parametrized by ξ(t), t∈J, the value of z=f−1(w) at interior point w∈D can be computed using the Cauchy integral formula [22]
z=f−1(w)=12πi∫Cf−1(ξ)ξ−wdξ=12πi∫Jf−1(ξ(t))ξ(t)−wξ′(t)dt, | (3.14) |
where f−1(ξ(t))=z(t) and ξ′(t)=f′(z(t))z′(t).
In this section, we first review some numerical implementations for computing z∗, the zero of SΩ(z,a), using the formulas (2.11), (2.14), and (2.15). The n equidistant collocation ti is defined by
ti=2π(i−1)n,i=1,2,…,n. |
The integral in (2.11) is discretized using the trapezoidal rule with n equidistant nodes in each interval Jj,j=0,1. Since all relevant functions are 2π-periodic, the trapezoidal rule is the most accurate method to numerically integrate the periodic functions [23,24]. Let z∗1,n represents the zero z∗ approximated using (2.11), i.e.,
z∗≈z∗1,n=2πn12πi[n∑i=1z0(ti)S′Ω,n(z0(ti),a)z′0(ti)SΩ,n(z0(ti),a)+n∑i=1z1(ti)S′Ω,n(z1(ti),a)z′1(ti)SΩ,n(z1(ti),a)], | (4.1) |
where the integral equation (2.5) is solved numerically to get the approximate values SΩ,n(z(ti),a) of SΩ(z(ti),a), while the approximate values S′Ω,n(z(ti),a) of S′Ω(z(ti),a) are computed using (2.10) (for more details see [11]).
The Newton iterative technique with trapezoidal rule can be used to solve for the zero z∗ from the nonlinear algebraic equation (2.17), where θ′(t) is calculated using Eq (2.13). It is shown that the zero z∗ has two unknowns because it is divided into real and imaginary parts (for more details, see [9]). Let z∗2,n represents the zero z∗ approximated using (2.17).
To evaluate (2.15) for z∗ at t∈J0, the trapezoidal rule is used to discretize the integral (2.16). The approximation of the zero z∗ using (2.15) is denoted by z∗3,n, i.e.,
z∗≈z∗3,n=z0(ti)−1G0,n(ti), | (4.2) |
where
G0,n(ti)=q0,n(ti)2z′0(ti)−1z0(ti)−a, |
where q0,n(ti) is the approximation of q0(ti) computed numerically using (2.16) (see [11] for details).
We next describe a numerical method for computing z∗ via conformal mapping using (3.1) and Theorem 2. We use the following algorithm for the computation of z∗:
(1) Solve the integral equation (3.5) with γ given by (3.11) for μ.
(2) Calculate the boundary values F(z(t)) using (3.9).
(3) Calculate F(a),a∈Ω, using (3.10).
(4) Compute f(a) in (3.1) using (3.12) and ρ using (3.13).
(5) Calculate f−1 in (3.1) using (3.14) to compute z∗.
The MATLAB function fbie in [18] provides us an efficient method for solving the boundary integral equation (3.5). The function fbie is based on discretizing the boundary integral (3.5) using the Nyström method with the trapezoidal rule [20,23]. This discretization leads to a non-symmetric linear system. Then, the MATLAB function gmres is used to solve the linear system. The matrix-vector multiplication in the GMRES method is computed using the MATLAB function zfmm2dpart in the toolbox FMMLIB2D [25]. The function fbie also provides us with approximations to the piecewise constant function h in (3.8). The computational cost for the overall method is O(nlogn) operations where n (an even positive1 integer) is the number of nodes in each of the intervals J0 and J1.
To use the MATLAB function fbie, the vectors z, zp, B, and gam that contain the discretization of the functions z(t), z′(t), B(t), and γ(t), respectively, are stored in MATLAB. Then we call the function
[mu,h]=fbie(z,zp,B,gam,n,iprec,restart,gmrestol,maxit). |
Once the discretization of the two functions μ(t) and h(t) are computed, we use
Fz=(gam+h+i×mu)/B |
to find approximations Fn to the boundary values of the function F. Then approximations Fn(z) to the values of the function F(z) for any vector of points z∈Ω can be obtained using the Cauchy integral formula (3.10). Numerically we carry out this computation by applying the MATLAB function fcau [18] by calling
fz=fcau(z,zp,Fz,z). |
In this way, the approximate value of fn(a) for f(a) in (3.1) is computed.
The approximate value of f−1n for f−1 in (3.1) is computed with the help of (3.14). For numerically computing the inverse mapping function f−1(w), we apply the MATLAB function fcau [18] by calling
wz=fcau(w,wp,wplus,ww), |
where
wplus = z,wp = [w0p;w1p],ww = mappingfunction(a), |
w0p = derfft(real(w(1:n)))+i derfft(imag(w(1:n))), |
and
w1p = derfft(real(w(n+1:2n)))+i derfft(imag(w(n+1:2n))). |
The approximation of zero z∗ using (3.1) and Theorem 2 is represented by z∗4,n.
The computations presented in this paper were performed on ASUS Laptop with Intel(R) Core(TM) i7-3537H CPU @ 2.00 GHz, 2.50 GHz, 6 Core(s), and 4 GB RAM. We have used Mathematica for computing z∗1,n, z∗2,n, z∗3,n, and MATLAB R2022a for computing z∗4,n.
In this section, we show some examples of conformal mapping using the integral equation with the generalized Neumann kernel to calculate the zero z∗ of the Szegö kernel for Ω based on (3.1). Numerical comparisons for z∗ using (2.11), (2.14), and (2.15) are also given.
Example 1. Region bounded by circles.
Consider a region Ω bounded by the circles
Γ0:z0(t)=eit, |
Γ1:z1(t)=0.5+0.25e−it, |
as shown in Figure 1. The exact mapping function that maps Ω onto D={w:ρ<|w|<1} is [26, p. A-21]
w=f(z)=z−λλz−1, |
where
λ=c+d1+cd+√(1−c2)(1−d2), |
and the exact inner radius is
ρ=d−c1−cd+√(1−c2)(1−d2). |
The inverse mapping function is
z=f−1(w)=w−λλw−1. |
Using (3.1) the exact zero of the Szegö kernel SΩ(z,a), with a∈Ω, is
z∗=f−1(−ρ/¯f(a))=ρ(¯a−1)+λ(¯a−λ)ρλ(λ¯a−1)+(¯a−λ). |
For numerical implementation we have selected c=0.25, d=0.75, a=−0.5−0.5i, z0=0.5, and α=−0.5. The computed exact inner radius ρ and the exact zero z∗ are
ρ=0.344131154255050, |
and
z∗=0.767241379310345−0.043103448275862i. |
Table 1 shows that the absolute errors |z∗−z∗1,n|, |z∗−z∗2,n|, |z∗−z∗3,n|, |z∗−z∗4,n|, and |ρ−ρn| are decreasing to zero with increasing number of nodes n. The computation of the zero z∗ using (3.1) together with Theorem 2 produces better accuracy than that of the other methods using (2.11), (2.14), and (2.15).
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
32 | 6.2373(−02) | 6.9171(−02) | 1.3283(−02) | 9.0387(−06) | 1.4279(−09) |
64 | 4.7118(−03) | 4.4510(−02) | 1.8761(−03) | 3.7816(−10) | 1.1102(−16) |
128 | 2.9136(−05) | 1.0796(−05) | 1.4338(−06) | 3.4170(−16) |
Example 2. Region bounded by limacons.
Consider a region Ω bounded by limacons
Γ0:z0(t)=a0cost+b0cos2t+i(a0sint+b0sin2t), |
Γ1:z1(t)=a1cost+b1cos2t+i(a1sint+b1sin2t), |
with a0=10,a1=5,b0=2, and b1=0.25b0, such that
b1/b0=(a1/a0)2, |
as shown in Figure 2. The exact mapping function that maps Ω onto D={w:ρ<|w|<1} and the exact radius are [14]
w=f(z)=−a0+(a20+4b0z)1/22b0, |
ρ=a1/a0. |
The inverse mapping function is
z=f−1(w)=b0w2+a0w. |
Using (3.1), the exact zero of the Szegö kernel SΩ(z,a), with a∈Ω, is
z∗=f−1(−ρ/¯f(a))=2ρb0(a20+2ρb20−a0√a20+4¯ab0)(a0−√a02+4¯ab0)2. |
For our numerical work, we have chosen a=8+2i, α=10, and z0=0. The computed exact inner radius ρ and exact zero z∗ are
ρ=0.5, |
and
z∗=−5.889310225331653−1.090525292189129i. |
Table 2 shows that the absolute errors |z∗−z∗1,n|, |z∗−z∗2,n|, |z∗−z∗3,n|, |z∗−z∗4,n|, and |ρ−ρn| are decreasing to zero with increasing number of nodes n. The computation of the zero z∗ using (3.1) together with Theorem 2 produces better accuracy than that of the other methods using (2.11), (2.14), and (2.15).
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 5.5025(−08) | 3.7778(−07) | 3.0006(−03) | 1.9725(−08) | 1.4336(−05) |
128 | 1.8957(−14) | 2.4612(−12) | 8.9337(−08) | 1.4888(−14) | 5.9298(−10) |
256 | 9.7725(−15) | 2.6062(−12) | 4.9651(−14) | 5.4208(−15) | 5.5511(−17) |
Example 3. Region bounded by ellipses.
Consider a region Ω bounded by the ellipses
Γ0:z0(t)=a0cost+ib0sint, |
Γ1:z1(t)=a1cost+ib1sint, |
with a0=7,a1=1,b0=5,b1=5, such that
a20−b20=a21−b21, |
as shown in Figure 3. The exact mapping function that maps Ω onto D={w:ρ<|w|<1} and the exact radius are [14]
w=f(z)=z+(z2−(a20−b20))1/2a0+b0 |
ρ=a1+b1a0+b0. |
The inverse mapping function is
z=f−1(w)=w2(a0+b0)+a0−b02w. |
Using (3.1), the exact zero of the Szegö kernel SΩ(z,a) is
z∗=f−1(−ρ/¯f(a))=[¯a+(¯a2−a20+b20)1/2]2(−a0+b0)−ρ2(a0+b0)32ρ(a0+b0)[¯a+(¯a2−a20+b20)1/2]. |
For our numerical work, we have chosen a=5−2i, α=6, and z0=0. The computed exact inner radius ρ and the exact zero z∗ are
ρ=0.344131154255050, |
and
z∗=−4.420534003935095+1.210160028109222i. |
Table 3 shows that the absolute errors |z∗−z∗1,n|, |z∗−z∗2,n|, |z∗−z∗3,n|, |z∗−z∗4,n|, and |ρ−ρn| are decreasing to zero with increasing number of nodes n. The computation of the zero z∗ using (3.1) together with Theorem 2 produces better accuracy than that of the other methods using (2.11), (2.14), and (2.15).
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 2.8344(−05) | 1.1895(−04) | 4.5738(−04) | 1.5805(−06) | 5.1137(−08) |
128 | 1.8038(−11) | 4.3040(−11) | 2.3000(−07) | 4.9647(−10) | 5.9298(−10) |
256 | 2.3093(−14) | 5.8284(−15) | 3.6680(−14) | 4.8035(−15) | 5.5511(−17) |
Example 4. Region bounded by ovals of Cassini.
Consider a region Ω bounded by the ovals of Cassini
Γ0:z0(t)=r0(t)(cost+isint), |
Γ1:z1(t)=r1(t)(cost−isint), |
with
r0(t)=b0√(cos2t+√(a0/b0)4−sin22t), |
r1(t)=b1√(cos2t+√(a1/b1)4−sin22t), |
and a0=8.5488 (up to 4 decimal places),a1=4,b0=7,b1=2, such that
(a40−b40)b21=(a41−b41)b20, |
as shown in Figure 4. The exact mapping function that maps Ω onto D={w:ρ<|w|<1} and the exact radius are [14]
w=f(z)=a0z(b0z2+a40−b40)1/2, |
and
ρ=a0b1a1b0. |
The inverse mapping function is
z=f−1(w)=−√w2b40−w2a40√w2b20−a20. |
Using (3.1), the exact zero of the Szegö kernel SΩ(z,a) is
z∗=f−1(−ρ/¯f(a))=−√ρ2(b40−a40)(a40+¯a2b20−b40)√ρ2b20(¯a2b20−b40)+a20(ρ2b20a20−¯a2a20). |
For our numerical work, we have chosen a=−8−2i, α=−9, and z0=0. The computed exact radius ρ and the exact zero z∗ are
ρ=0.610629257081536, |
and
z∗=5.034600845346161+0.833658538455800i. |
Table 4 shows that the absolute errors |z∗−z∗1,n|, |z∗−z∗2,n|, |z∗−z∗3,n|, |z∗−z∗4,n|, and |ρ−ρn| are decreasing to zero with increasing number of nodes n. The computation of the zero z∗ using (3.1) together with Theorem 2 produces better accuracy than that of the other methods using (2.11), (2.14), and (2.15).
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 8.5045(−04) | 4.4473(00) | 2.7495(−03) | 1.1486(−06) | 7.4455(−08) |
128 | 1.9189(−07) | 2.3109(−07) | 3.0427(−07) | 1.6884(−13) | 1.1213(−14) |
256 | 2.1081(−12) | 1.6586(−12) | 1.3563(−11) | 6.0576(−15) | 1.1102(−16) |
Example 5. Narrow region bounded by ovals of Cassini.
Consider a similar region as in Example 4 with a0=10.7703(up to 4 decimal places), a1=8,b0=9,b1=6, such that
(a40−b40)b21=(a41−b41)b20, |
as shown in Figure 5. The region is much narrower than the region shown in Example 4.
For our numerical work, we have chosen a=−12−2i, α=−12.5, and z0=0. The computed exact radius ρ and the exact zero z∗ are
ρ=0.897527467855751, |
and
z∗=11.363858728989024+1.790685260129058i. |
Table 5 shows that the absolute errors |z∗−z∗1,n|, |z∗−z∗2,n|, |z∗−z∗3,n| using (2.11), (2.14) and (2.15) respectively produce poor accuracies, while |z∗−z∗4,n| and |ρ−ρn| are decreasing to zero with increasing number of nodes n. Table 5 shows the superiority of conformal mapping approach.
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 4.4428(00) | 2.8534(01) | 1.9380(00) | 1.4242(−01) | 2.3787(−03) |
128 | 2.9301(00) | 3.5825(01) | 3.2135(00) | 1.1725(−03) | 2.0576(−05) |
256 | 3.7657(00) | 9.3503(00) | 3.0514(00) | 9.3258(−08) | 1.6414(−09) |
512 | 1.2996(01) | 6.0062(14) | 4.0772(00) | 1.6969(−14) | 6.6613(−16) |
Example 6. Consider a region Ω bounded by
Γ0:z0(t)=cost+0.45cos2t+i(sint+0.45sin2t), |
Γ1:z1(t)=(0.3+0.1cos3t)e−it, |
with 0≤t≤2π, a0=0.5−0.5i, and α=−0.50−0.5i. The region is shown in Figure 6. The exact zero z∗, the exact mapping function f(z), and the inner radius ρ for this region are unknown.
Since SΩ(z∗,a) has zero as theoretical value, the accuracy is determined by calculating |SΩ(z∗1,n,a)|, |SΩ(z∗2,n,a)|, |SΩ(z∗3,n,a)|, and |SΩ(z∗4,n,a)| using (2.9) along with trapezoidal rule. Table 6 shows the numerical results and the conformal mapping approach yields high accuracy.
n | |SΩ(z∗1,n,a)| | |SΩ(z∗2,n,a)| | |SΩ(z∗3,n,a)| | |SΩ(z∗4,n,a)| |
64 | 2.28182(−05) | 2.93287(−07) | 1.18440(−07) | 6.29401(−08) |
128 | 2.69091(−08) | 2.19028(−11) | 1.04818(−11) | 2.54814(−11) |
256 | 3.74744(−14) | 1.39858(−15) | 8.47000(−16) | 1.95062(−16) |
Example 7. We consider an annulus Ω bounded by
Γ0:z0(t)=c+0.5cost−isint, |
Γ1:z1(t)=ρe−it, |
with 0≤t≤2π, c=−0.1−0.1i, ρ=0.3, a0=−0.4+0.5i, and α=−0.3−0.5i. The test region is shown in Figure 7. The exact zero z∗, the exact mapping function f(z), and the inner radius ρ for this region are unknown.
Since SΩ(z∗,a) has zero as theoretical value, the accuracy is determined by calculating |SΩ(z∗1,n,a)|, |SΩ(z∗2,n,a)|, |SΩ(z∗3,n,a)|, and |SΩ(z∗4,n,a)| using (2.9) based on trapezoidal rule with modification [27]. Table 7 shows the numerical results and superiority of conformal mapping approach.
n | |SΩ(z∗1,n,a)| | |SΩ(z∗2,n,a)| | |SΩ(z∗3,n,a)| | |SΩ(z∗4,n,a)| |
64 | 7.5944(−06) | 1.60932(−05) | 3.61678(−06) | 5.34997(−08) |
128 | 1.27105(−08) | 8.78021(−07) | 4.07031(−09) | 1.79584(−14) |
256 | 3.56166(−14) | 3.18398(−13) | 1.20319(−14) | 3.10317(−17) |
The computations above show that the approximations z∗1,n in (4.1) involves trapezoidal rule and approximations SΩ,n(z0(ti),a), SΩ,n(z1(ti),a), S′Ω,n(z0(ti),a), and S′Ω,n(z1(ti),a). The approximation z∗2,n involves trapezoidal rule, Newton iterative method and approximations θ′n(ti) based on approximations SΩ,n(z(t),a) and S′Ω,n(z(t),a). The approximation z∗3,n involved approximations q0,n(ti) based on trapezoidal rule and approximation θ′n(ti) which is further based on approximations SΩ,n and S′Ω,n. However, the approximation z∗4,n does not rely on approximations SΩ,n, S′Ω,n, and θ′n as in previous three methods. This explains why the conformal mapping approach yields better accuracy, even for a narrow region.
Based on conformal mapping, we derived an analytical formula for the zero of the Szegö kernel for a doubly connected region with smooth boundaries. Special cases are the explicit formulas for the zeros of the Szegö kernel for doubly connected regions bounded by circles, limacons, ellipses, and ovals of Cassini. Some MATLAB functions have been used for fast and efficient numerical conformal mapping via the integral equation with the generalized Neumann kernel. The performance and accuracy of the presented conformal mapping method for computing the zeros of the Szegö kernel are compared to analytic solutions or to previous results whenever analytic solutions or previous results are available. Comparisons with previous results show that the conformal mapping approach always yields better accuracy, even for a narrow region. Furthermore, the conformal mapping approach requires only the first and second derivatives of the parametrization of the boundary, while previous methods require up to the third derivative.
The conformal mapping approach presented in this paper can also be extended to doubly connected region with piecewise smooth boundaries with corners. The integral equation (3.5) is valid only at off-corner points [22,28]. By means of singularity subtraction [29], (3.5) can be written in an alternative form for which the trapezoidal rule with a graded mesh [30] can be applied wherein the derivative of the new integrand vanishes at the corner points. See [18,22,28,29,30] for more details.
Another competitive approach for numerical conformal mapping of doubly connected region with corners is the conjugate function method with the hp-FEM algorithm [31,32]. In [21, Example 3.4, p.8], for a square in square region it is found that the computations of the conformal capacity of a condenser, using the integral equation with the generalized Neumann kernel with the trapezoidal rule and graded mesh are not as accurate as the results obtained by the hp-FEM algorithm in [32]. Thus, we think computing the zero of the Szegö kernel for a doubly connected region with piecewise smooth boundaries with corners constitutes a good problem for future research.
This work was supported by the Ministry of Higher Education Malaysia under Fundamental Research Grant Scheme (FRGS/1/2019/STG06/UTM/02/20). This support is gratefully acknowledged. The first author would also like to acknowledge the Tertiary Education TrustFund (TETFund) Nigeria for overseas scholarship award. The authors thank the referees for their valuable comments and suggestions which improved the presentation of this paper.
The authors declare that they have no competing interests.
[1] |
N. Kerzman, E. M. Stein, The Cauchy kernel, the Szegö kernel, and the Riemann mapping function, Math. Ann., 236 (1978), 85–93. https://doi.org/10.1007/BF01420257 doi: 10.1007/BF01420257
![]() |
[2] |
N. Kerzman, M. R. Trummer, Numerical conformal mapping via the Szegö kernel, J. Comput. Appl. Math., 14 (1986), 111–123. https://doi.org/10.1016/0377-0427(86)90133-0 doi: 10.1016/0377-0427(86)90133-0
![]() |
[3] | T. J. Tegtmeyer, A. D. Thomas, The Ahlfors map and Szegö kernel for an annulus, Rocky Mt. J. Math., 29 (1999), 709–723. |
[4] |
N. H. A. A. Wahid, A. H. M. Murid, M. I. Muminov, Convergence of the series for the Szegö kernel for an annulus region, AIP Conf. Proc., 1974 (2018), 1–8. http://doi.org/10.1063/1.5041669 doi: 10.1063/1.5041669
![]() |
[5] |
N. S. Gafai, A. H. M. Murid, N. H. A. A. Wahid, Infinite product representation for the Szegö kernel for an annulus, J. Funct. Spaces, 2022 (2022), 1–9. http://doi.org/10.1155/2022/3763450 doi: 10.1155/2022/3763450
![]() |
[6] | S. R. Bell, The Cauchy transform, potential theory, and conformal mapping, Boca Raton: CRC Press, 1992. |
[7] |
S. R. Bell, Numerical computation of the Ahlfors map of a multiply connected planar domain, J. Math. Anal. Appl., 120 (1986), 211–217. https://doi.org/10.1016/0022-247X(86)90211-8 doi: 10.1016/0022-247X(86)90211-8
![]() |
[8] | T. J. Tegtmeyer, The Ahlfors map and Szegö kernel in multiply connected domains, PhD thesis, Purdue University, 1998. |
[9] |
K. Nazar, A. W. K. Sangawi, A. H. M. Murid, Y. S. Hoe, The computation of zeros of Ahlfors map for doubly connected regions, AIP Conf. Proc., 1750 (2016), 020007. https://doi.org/10.1063/1.4954520 doi: 10.1063/1.4954520
![]() |
[10] | K. Nazar, A. H. M. Murid, A. W. K. Sangawi, Integral equation for the Ahlfors map on multiply connected regions, J. Teknol., 73 (2015), 1–9. |
[11] |
A. H. M. Murid, N. H. A. A. Wahid, M. I. Muminov, Methods and comparisons for computing the zeros of the Ahlfors map for doubly connected regions, AIP Conf. Proc., 2423 (2021), 020026. https://doi.org/10.1063/5.0075348 doi: 10.1063/5.0075348
![]() |
[12] | P. Henrici, Applied and computational complex analysis, Vol. 3, New York: John Wiley, 1986. |
[13] | P. K. Kythe, Computational conformal mapping, Boston: Birkhauser, 1998. |
[14] |
G. T. Symm, Conformal mapping of doubly-connected domains, Numer. Math., 13 (1969), 448–457. https://doi.org/10.1007/BF02163272 doi: 10.1007/BF02163272
![]() |
[15] |
M. M. S. Nasser, A boundary integral equation for conformal mapping of bounded multiply connected regions, Comput. Methods Funct. Theory, 9 (2009), 127–143. https://doi.org/10.1007/BF03321718 doi: 10.1007/BF03321718
![]() |
[16] |
M. M. S. Nasser, Numerical conformal mapping via a boundary integral equation with the generalized Neumann kernel, SIAM J. Sci. Comput., 31 (2009), 1695–1715. https://doi.org/10.1137/070711438 doi: 10.1137/070711438
![]() |
[17] |
M. M. S. Nasser, F. A. A. Al-Shihri, A fast boundary integral equation method for conformal mapping of multiply connected regions, SIAM J. Sci. Comput., 35 (2013), A1736–A1760. https://doi.org/10.1137/120901933 doi: 10.1137/120901933
![]() |
[18] | M. M. S. Nasser, Fast solution of boundary integral equations with the generalized Neumann kernel, Electroin. Trans. Numer. Anal., 44 (2015), 189–229. |
[19] |
N. H. A. A. Wahid, A. H. M. Murid, M. I. Muminov, Analytical solution for finding the second zero of the Ahlfors map for an annulus region, J. Math., 2019 (2019), 1–11. https://doi.org/10.1155/2019/6961476 doi: 10.1155/2019/6961476
![]() |
[20] |
M. M. S. Nasser, M. Vuorinen, Computation of conformal invariants, Appl. Math. Comput., 389 (2021), 125617. https://doi.org/10.1016/j.amc.2020.125617 doi: 10.1016/j.amc.2020.125617
![]() |
[21] |
R. Wegmann, M. M. S. Nasser, The Riemann-Hilbert problem and the generalized Neumann kernel on multiply connected regions, J. Comput. Appl. Math., 214 (2008), 36–57. https://doi.org/10.1016/j.cam.2007.01.021 doi: 10.1016/j.cam.2007.01.021
![]() |
[22] |
M. M. S. Nasser, Fast computation of the circular map, Comput. Methods Funct. Theory, 15 (2014) 189–223. https://doi.org/10.1007/s40315-014-0098-3 doi: 10.1007/s40315-014-0098-3
![]() |
[23] | K. E. Atkinson, The Numerical solution of integral equations of the second kind, Cambridge: Cambridge University Press, 1997. |
[24] |
L. N. Trefethen, J. A. C. Weideman, The exponentially convergent trapezoidal rule, SIAM Rev., 56 (2014), 385–458. https://doi.org/10.1137/130932132 doi: 10.1137/130932132
![]() |
[25] | L. Greengard, Z. Gimbutas, FMMLIB2D: A MATLAB toolbox for fast multipole method in two dimensions, Version 1.2. Edition, 2012. Available from: http://www.cims.nyu.edu/cmcl/fmm2dlib/fmm2dlib.html. |
[26] | E. B. Saff, A. D. Snider, Fundamentals of complex analysis with applications to engineering and science, 3 Eds., Pearson, 2014. |
[27] |
J. Helsing, R. Ojala, On the evaluation of layer potentials close to their sources, J. Comput. Phys., 227 (2008), 2899–2921. https://doi.org/10.1016/j.jcp.2007.11.024 doi: 10.1016/j.jcp.2007.11.024
![]() |
[28] |
M. M. S. Nasser, A. H. M. Murid, Z. Zamzamir, A boundary integral method for the Riemann-Hilbert problem in domains with corners, Complex Var. Elliptic Equ., 53 (2008), 989–1008. https://doi.org/10.1080/17476930802335080 doi: 10.1080/17476930802335080
![]() |
[29] |
A. Rathsfeld, Iterative solution of linear systems arising from the Nyström method for doubly-layer potential equation over curves with corners, Math. Methods Appl. Sci., 16 (1993), 443–455. https://doi.org/10.1002/mma.1670160604 doi: 10.1002/mma.1670160604
![]() |
[30] |
R. Kress, A Nyström method for boundary integral equations in domains with corners, Numer. Math., 58 (1990), 145–161. https://doi.org/10.1007/BF01385616 doi: 10.1007/BF01385616
![]() |
[31] |
H. Hakula, T. Quash, A. Rasila, Conjugate function method for numerical conformal mapping, J. Comput. Appl. Math., 237 (2013), 340–353. https://doi.org/10.1016/j.cam.2012.06.003 doi: 10.1016/j.cam.2012.06.003
![]() |
[32] |
H. Hakula, A. Rasila, M. Vuorinen, On moduli of rings and quadrilateral algorithms and experiment, SIAM J. Sci. Comput., 33 (2011), 279–302. https://doi.org/10.1137/090763603 doi: 10.1137/090763603
![]() |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
32 | 6.2373(−02) | 6.9171(−02) | 1.3283(−02) | 9.0387(−06) | 1.4279(−09) |
64 | 4.7118(−03) | 4.4510(−02) | 1.8761(−03) | 3.7816(−10) | 1.1102(−16) |
128 | 2.9136(−05) | 1.0796(−05) | 1.4338(−06) | 3.4170(−16) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 5.5025(−08) | 3.7778(−07) | 3.0006(−03) | 1.9725(−08) | 1.4336(−05) |
128 | 1.8957(−14) | 2.4612(−12) | 8.9337(−08) | 1.4888(−14) | 5.9298(−10) |
256 | 9.7725(−15) | 2.6062(−12) | 4.9651(−14) | 5.4208(−15) | 5.5511(−17) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 2.8344(−05) | 1.1895(−04) | 4.5738(−04) | 1.5805(−06) | 5.1137(−08) |
128 | 1.8038(−11) | 4.3040(−11) | 2.3000(−07) | 4.9647(−10) | 5.9298(−10) |
256 | 2.3093(−14) | 5.8284(−15) | 3.6680(−14) | 4.8035(−15) | 5.5511(−17) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 8.5045(−04) | 4.4473(00) | 2.7495(−03) | 1.1486(−06) | 7.4455(−08) |
128 | 1.9189(−07) | 2.3109(−07) | 3.0427(−07) | 1.6884(−13) | 1.1213(−14) |
256 | 2.1081(−12) | 1.6586(−12) | 1.3563(−11) | 6.0576(−15) | 1.1102(−16) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 4.4428(00) | 2.8534(01) | 1.9380(00) | 1.4242(−01) | 2.3787(−03) |
128 | 2.9301(00) | 3.5825(01) | 3.2135(00) | 1.1725(−03) | 2.0576(−05) |
256 | 3.7657(00) | 9.3503(00) | 3.0514(00) | 9.3258(−08) | 1.6414(−09) |
512 | 1.2996(01) | 6.0062(14) | 4.0772(00) | 1.6969(−14) | 6.6613(−16) |
n | |SΩ(z∗1,n,a)| | |SΩ(z∗2,n,a)| | |SΩ(z∗3,n,a)| | |SΩ(z∗4,n,a)| |
64 | 2.28182(−05) | 2.93287(−07) | 1.18440(−07) | 6.29401(−08) |
128 | 2.69091(−08) | 2.19028(−11) | 1.04818(−11) | 2.54814(−11) |
256 | 3.74744(−14) | 1.39858(−15) | 8.47000(−16) | 1.95062(−16) |
n | |SΩ(z∗1,n,a)| | |SΩ(z∗2,n,a)| | |SΩ(z∗3,n,a)| | |SΩ(z∗4,n,a)| |
64 | 7.5944(−06) | 1.60932(−05) | 3.61678(−06) | 5.34997(−08) |
128 | 1.27105(−08) | 8.78021(−07) | 4.07031(−09) | 1.79584(−14) |
256 | 3.56166(−14) | 3.18398(−13) | 1.20319(−14) | 3.10317(−17) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
32 | 6.2373(−02) | 6.9171(−02) | 1.3283(−02) | 9.0387(−06) | 1.4279(−09) |
64 | 4.7118(−03) | 4.4510(−02) | 1.8761(−03) | 3.7816(−10) | 1.1102(−16) |
128 | 2.9136(−05) | 1.0796(−05) | 1.4338(−06) | 3.4170(−16) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 5.5025(−08) | 3.7778(−07) | 3.0006(−03) | 1.9725(−08) | 1.4336(−05) |
128 | 1.8957(−14) | 2.4612(−12) | 8.9337(−08) | 1.4888(−14) | 5.9298(−10) |
256 | 9.7725(−15) | 2.6062(−12) | 4.9651(−14) | 5.4208(−15) | 5.5511(−17) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 2.8344(−05) | 1.1895(−04) | 4.5738(−04) | 1.5805(−06) | 5.1137(−08) |
128 | 1.8038(−11) | 4.3040(−11) | 2.3000(−07) | 4.9647(−10) | 5.9298(−10) |
256 | 2.3093(−14) | 5.8284(−15) | 3.6680(−14) | 4.8035(−15) | 5.5511(−17) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 8.5045(−04) | 4.4473(00) | 2.7495(−03) | 1.1486(−06) | 7.4455(−08) |
128 | 1.9189(−07) | 2.3109(−07) | 3.0427(−07) | 1.6884(−13) | 1.1213(−14) |
256 | 2.1081(−12) | 1.6586(−12) | 1.3563(−11) | 6.0576(−15) | 1.1102(−16) |
n | |z∗−z∗1,n| | |z∗−z∗2,n| | |z∗−z∗3,n| | |z∗−z∗4,n| | |ρ−ρn| |
64 | 4.4428(00) | 2.8534(01) | 1.9380(00) | 1.4242(−01) | 2.3787(−03) |
128 | 2.9301(00) | 3.5825(01) | 3.2135(00) | 1.1725(−03) | 2.0576(−05) |
256 | 3.7657(00) | 9.3503(00) | 3.0514(00) | 9.3258(−08) | 1.6414(−09) |
512 | 1.2996(01) | 6.0062(14) | 4.0772(00) | 1.6969(−14) | 6.6613(−16) |
n | |SΩ(z∗1,n,a)| | |SΩ(z∗2,n,a)| | |SΩ(z∗3,n,a)| | |SΩ(z∗4,n,a)| |
64 | 2.28182(−05) | 2.93287(−07) | 1.18440(−07) | 6.29401(−08) |
128 | 2.69091(−08) | 2.19028(−11) | 1.04818(−11) | 2.54814(−11) |
256 | 3.74744(−14) | 1.39858(−15) | 8.47000(−16) | 1.95062(−16) |
n | |SΩ(z∗1,n,a)| | |SΩ(z∗2,n,a)| | |SΩ(z∗3,n,a)| | |SΩ(z∗4,n,a)| |
64 | 7.5944(−06) | 1.60932(−05) | 3.61678(−06) | 5.34997(−08) |
128 | 1.27105(−08) | 8.78021(−07) | 4.07031(−09) | 1.79584(−14) |
256 | 3.56166(−14) | 3.18398(−13) | 1.20319(−14) | 3.10317(−17) |