A quadrature rule of interpolatory type for Cauchy integrals
|
|
- Jasmin Ward
- 5 years ago
- Views:
Transcription
1 Journal of Computational and Applied Mathematics 126 (2000) A quadrature rule of interpolatory type for Cauchy integrals Philsu Kim, U. Jin Choi 1 Department of Mathematics, KAIST, Kusong-dong, Yousong-gu, Taejon , South Korea Received 2 March 1999; received in revised form 2 September 1999 Abstract We construct a quadrature rule of interpolatory-type based on a trigonometric interpolation for Cauchy integrals. We obtain the same error bound O( a N N ) as Hasegawa and Torii (Math. Comp. 56 (1991) ). Numerical examples are included to substantiate the performance of the present method. c 2000 Elsevier Science B.V. All rights reserved. Keywords: Cauchy integrals; Quadrature rule; Trigonometric interpolation 1. Introduction We present an interpolatory quadrature scheme for approximating Cauchy principal value integrals 1 f() Q(f; t)= -- 1 t d ( t ) 1 f() = lim + d; t 1: (1.1) 0 1 t+ t There are a lot of numerical methods to approximate the integrals of (1.1); we mention the papers [4,7,8,13,14,16 18]. However, there are only a little literature on the automatic quadrature for (1.1) (see [1,2,11,15]). The quadrature rules in [1,2,11,15] are extensions of the Clenshaw Curtis method [3] for the integral 1 1 f()d. Clenshaw Curtis [3] approximated the function f() by a sum of Chebyshev polynomials T k (), p N ()= a N k T k (); 1661; (1.2) Corresponding author. addresses: kimps@numer.kaist.ac.kr (P. Kim), ujinchoi@math.kaist.ac.kr (U.J. Choi) 1 This work was partially supported by KOSEF under the grant No /00/$ - see front matter c 2000 Elsevier Science B.V. All rights reserved. PII: S (99)
2 208 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) interpolating f() at the abscissae N j =cos(j=n )(06j6N ), which are the zeros of the polynomial! N +1 () dened by! N +1 ()=T N +1 () T N 1 ()=2( 2 1)U N 1 (); N 1; (1.3) where U k () = sin((k + 1)cos 1 )=sin(cos 1 ). In (1.2), the double prime denotes the summation whose rst and last terms are halved. Chawla and Kumar [2] proposed a quadrature rule of interpolatory type by substituting p N () of (1.2) for f() of (1.1). However, their error estimate is dependent on the values of poles t s [2]. Hasegawa and Torii [11] used the subtraction out the singularity, that is Q(f; t)= 1 1 f() f(t) t d + f(t)log 1 t 1+t and approximated f() and f(t) byp N () and p N (t) of (1.2), respectively. Then they obtained the quadrature rule Q HT N (f; t)=2 N=2 1 d 2k 1 4k 2 + f(t)log1 t 1+t ; (1.4) where the prime denotes the summation whose rst term is halved and d k s are computed by the three-term recurrence relation [11]. The quadrature rule (1.4) yields an error bound independent of the values of poles t s. Furthermore, it is numerically stable at node points near the poles t s. Method (1.4), however, needs the extra evaluation f(t) s for the set of values of poles t s. In this paper, we propose a new quadrature rule based on the trigonometric interpolation. The proposed rule yields a stable algorithm and a similar error bounds as [11], which does not need any extra evaluation f(t) s for the set of values of poles t. The outline of this paper is as follows. In Section 2, we present a new quadrature rule of interpolatory type (see below (2.7)). In Section 3, we discuss the estimate of truncated errors and prove that the error can be bounded independently of the values of poles t s. In Section 4, we show numerical examples. 2. Interpolatory-type quadrature rule To get a new quadrature rule, we rst make use of the change of variable = cosy and t = cos x in (1.1). Then we have the following lemma. Lemma 2.1. For the Cauchy integral Q(f; t) dened in (1:1); we have f(cosy)siny Q(f(cos ); cos x) = -- 0 cosy cos x dy h(y)siny h(x)sin x = dy 0 cosy cos x := Q(h; x) say; (2.1) where h(y)=f(cosy).
3 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) Proof. Let = cosy and t = cos x. Substituting these into (1.1) gives ( (x; ) ) f(cosy)siny Q(f(cos ); cos x) = lim (x; ) cosy cos x dy; where (x; ) = cos 1 (cos x + ). Applying the Taylor theorem to (x; ) with respect to, wesee that (x; )=x sin x +O(2 ): By using this fact and taking = =sin x, we then get the required rst identity of (2.1). Since 1 cosy cos x dy = 1 sin x log sin(x + y)=2 sin(x y)=2 ; we have The second identity of (2.1) follows directly from the fact cosy cos x dy = 1 x sin x lim 0 log sin(x + y)=2 sin(x y)=2 + log sin(x + y)=2 sin(x y)=2 = 1 sin x lim log sin(x (=2)) 0 sin(x +(=2)) =0: The second identity of (2.1) now follows from the fact (2.2). In the following, we now introduce a new quadrature rule for the standard integral (2.1). To approximate the function h(y) of (2.1), we use the cosine function instead of the Chebyshev polynomial. We approximate h(y) by the sum of cosine polynomials cos ky, q N (y)= 0 x+ (2.2) b N k cos ky; 06y6; (2.3) where coecients b N k are determined to satisfy the conditions h( j=n)=q N ( j=n); 06j6N (2.4) and given as follows [3]: b N k = 2 N h(j=n)cos(jk=n ); 06k6N: (2.5) Here the coecients b N k can be computed by using the fast cosine transform (FCT) [6]. It must be noted that the coecients b N k of (2.5) are same as the coecients a N k of the Chebyshev series given in (1.2). In fact, if we let j = cos(j=n), then we have b N k = 2 N f( j )cos(k cos 1 j )
4 210 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) = 2 N = a N k : f( j )T k ( j ) Here and henceforth we thus rewrite the coecients b N k s as a N k if there were no confusion. We now approximate h(y) and h(x) in (2.1) by q N (y) and q N (x) in (2.3), respectively, and dene the quadrature scheme q N (y)siny q N (x)sin x Q N (h; x)= dy: (2.6) 0 cosy cos x Using the relation cos ky siny cos kx sin x = 1 (sin(k +1)y sin(k +1)x sin(k 1)y + sin(k 1)x); 2 we get a new quadrature algorithm of interpolatory type Q N (h; x)= 1 2 a N k (I k+1 (x) I k 1 (x)); (2.7) where I k (x) are dened by sin ky sin kx I k (x)= dy: (2.8) 0 cosy cos x The relation sin(k +2)y sin(k +2)x cosy cos x yields the following recurrence relation: I 1 (x)= I 1 (x); I 0 (x)=0; I 1 (x) = log 1 cos x 1 + cos x ; I k+2 (x) 2 cos xi k+1 (x)+i k (x)=2 ( 1)k +1 ; k 0; k +1 or equivalently, I k+2 (x)= sin(k +2)x I 1 (x)+2 sin x sin(k +1)y sin(k +1)x sin ky sin kx = 2 cos x + 2 sin(k +1)y; cosy cos x cosy cos x k ( 1) j +1 j +1 where formula (2.10) is derived in the next section. (2.9) sin(k j +1)x ; k 0; (2.10) sin x Remark 2.2. (1) The present quadrature rule (2.7) is exact when the density function h(y) is a trigonometric polynomial of degree N. That is, the new quadrature rule of (2.7) needs not the extra evaluation of the density function for the set of values of poles t = cos x.
5 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) Here and henceforth we assume that N is of the form 2 n ; n =2; 3;:::: Following the procedure in [10], we will outline the algorithm for computing the sequence of the truncated cosine series {q N ;q 5N=4 ;q 3N=2 }. For =2; 4, let ( 8 j + 3 )/ N if =4; 16 v N= j = ( 4 j + 3 )/ N if =2: 8 Then we see that {v N= j }; 06j N=, is a set consisting of the N= zeros of cos((n=)y) cos(3=(2)). We now represent the polynomials q N +N= ;=2; 4, interpolating h(y) at the nodes v N= j ; 06j N=, =2; 4, as well as at the nodes j=n,06j6n in the form N= q N +N= (y) q N (y)= k=1 c N= k (cos((n k)y) cos((n + k)y)); (2.11) where coecients {c N= k } are determined to satisfy the condition h(v N= j )=q N +N= (v N= j ); 06j N ; =2; 4: (2.12) It must be noted that the interpolating conditions (2.12) are the same as those of the scheme of Hasegawa and Torii [11], and hence we can use the FFT [10] for eciently evaluating the coecients c N= k (see [11,10] for details). 3. Error estimates Dene a N +N= k, =2; 4, by a N k ; 06k N N=; a N +N= k = a N k + c N= N k; N N=6k N; a N N 2 ; k = N; c N= k N ; N k6n + N=: Then q N +N= (y) of (2.11) can be written as q N +N= (y)= N +N= (3.1) a N +N= k cos ky (3.2) and the corresponding quadrature rules Q N +N= (h; x), =2; 4, based on the polynomial q N +N= (y) of (3.2) are given as follows: Q N +N= (h; x)= 1 N +N= a n+n= K (I k+1 (x) I k 1 (x)); (3.3) 2 where I k (x) s are given by (2.9).
6 212 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) Here, we will give error estimates for the approximations Q N (h; x), Q 5N=4 (h; x) and Q 3N=2 (h; x), especially for the analytic function f and h(y)=f(cos y). Let denote the ellipse in the complex z = x +iy with foci (x; y)=( 1; 0); (1; 0) and semimajor axis a = 1( ) and semiminor axis b = 1( 2 1 ) for a constant 1. Assume that f(z) is single-valued and analytic inside and on. Then the Cauchy s formula gives that h(y)= 1 2i Thus, Eq. (2.5) can be written as a N k = 1 cos(jk=n ) Ni f(z)dz ; y [0; ]: (3.4) z cos y Lemma 3.1. Let z and let 06k6N. Then we have f(z) dz; 06k6N: (3.5) z cos j=n cos jk=n z cos j=n = 2NT N k (z) T N +1 (z) T N 1 (z) : (3.6) Proof. Let j = cos j=n. Then the left-hand side of (3.6) can be written as cos jk=n N z cos j=n = T k( j ) ; z j where T k () is the Chebyshev polynomial of the rst kind and j s are the zeros of T N +1 () T N 1 (). Elliott [5] shows that T k( j ) = N(U N k(z) U N k 2 (z)) ; (3.7) z j T N +1 (z) T N 1 (z) where U k (z) is the Chebyshev polynomial of second kind. Since U N k (z) U N k 2 (z)=2t N k (z), Eq. (3.7) gives the desired identity (3.6). Using (3.6), Eq. (3.5) can be written as a N k = 2 f(z)t N k(z)dz i T N +1 (z) T N 1 (z) : (3.8) Substituting (3.8) into (2.3), we have q N (y)= 2 f(z) cos kyt N k (z)dz: (3.9) i T N +1 (z) T N 1 (z) Now since 2 cos kyt N k (z)= 1 [T N +1 (z) T N 1 (z)] [cos(n +1)y cos(n 1)y] ; 2 z cos y
7 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) Eqs. (3.4) and (3.9) yield sin y sin Ny f(z)dz q N (y)=h(y)+ i (z cos y)! N +1 (z) : (3.10) The contour integral of (3.10) can be expanded in a cosine series [9]: sin y sin Ny f(z)dz i (z cos y)! N +1 (z) = 2 sin y sin Ny V N k (f)cos ky; (3.11) where V N k (f)= 1 f(z) i! N +1 (z) z 2 1(z + dz; k 0: (3.12) z 2 1) k Substituting (3.11) into (3.10) yields h(y) q N (y)= 2 sin y sin Ny cos kyv N k (f); y [0; ]: (3.13) Multiplying both sides of (3.13) with 1=(cos y cos x) and then integrating it over [0; ], we have the error for the approximate integral Q N (f; x) given by E N (h; x)=q(h; x) Q N (h; x) = 2 V N k (f) N k (x); (3.14) where h(y) = f(cos y) and N sin 2 y sin Ny cos ky sin 2 x sin Nx cos kx k (x)= dy: (3.15) 0 cos y cos x Then we have the following lemma. Lemma 3.2. (1) Let N k (x) be dened by (3:15). Then N k (x) can be rewritten as N k (x)= (cos y + cos x)(sin(n + k)y + sin(n k)y)dy + sin2 x 2 (I N +k(x) + sgn(n k)i N k (x)); (3.16) where I k (x); k 0; are given by (2:9). (2) Let I n (x); n 1; be dened by (2:9). Then I n (x) can be rewritten as I 1 (x)= I 1 (x); I 0 (x)=0; I 1 (x) = log 1 cos x 1 + cos x ; (3.17) I n+2 (x)= sin(n +2)x I 1 (x)+2 sin x n ( 1) j +1 j +1 sin(n j +1)x ; n 0: sin x
8 214 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) (3) Further; we have N k (x) 62 +6: (3.18) Proof. The rst identity (3.16) is obtained by the denition of I k (x) of (2.8) and the relation 2(sin 2 y sin Ny cos ky sin 2 x sin Nx cos kx) = sin 2 y sin(n + k)y sin 2 x sin(n + k)x + sin 2 y sin(n k)y sin 2 x sin(n k)x = (cos y cos x)(cos y + cos x)sin(n + k)y + sin 2 x(sin(n + k)y sin(n + k)x) (cos y cos x)(cos y + cos x)sin(n k)y + sin 2 x(sin(n k)y sin(n k)x): Using the relation 2 cos x =e ix +e ix, the three-term recurrence relation (2.9) for I k (x) can be written as (I k+2 (x) e ix I k+1 (x)) e ix (I k+1 (x) e ix I k (x)) = 2(( 1)k +1) ; (3.19) k +1 where k 0. Putting c k+1 =e i(k+2)x (I k+2 (x) e ix I k+1 (x)) with c 0 =e ix I 1 (x), the above relation (3.19) can be simplied as c k+1 c k =2e i(k+2)x (( 1)k +1) : k +1 Thus, we obtain c k+1 = c 0 +2 or equivalently, k =e ix I 1 (x)+2 (( 1) j +1) e i(j+2)x j +1 k (( 1) j +1) e i(j+2)x ; j +1 e i(k+2)x (I k+2 (x) e ix I k+1 (x))=e ix I 1 (x)+2 Multiplying both sides of (3.20) by e 2i(k+2)x yields e i(k+2)x I k+2 (x) e i(k+1)x I k+1 (x)=e i(2k+3)x I 1 (x)+2e i(2k+4)x k Summing up the above from k =0 to n, we have I n+2 (x)=e i(n+1)x I 1 (x)+i 1 (x)e i(n 1)x = I 1 (x) n e 2ijx +2e i(n 2)x ( ) e i(n+1)x i(n 1)x 1 e i2(n+1)x +e 1 e 2ix (( 1) j +1) e i(j+2)x : (3.20) j +1 n k e 2ijx +2e i(n 2)x n (( 1) j +1) e i(j+2)x : j +1 j e 2ijx ( 1) k +1 e i(k+2)x k +1 j ( 1) k +1 e i(k+2)x : k +1 (3.21)
9 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) It must be noted that we can easily check the following relation: e i(n+1)x i(n 1)x 1 e i2(n+1)x +e = 1 e 2ix sin(n +2)x : (3.22) sin x Substituting (3.22) into (3.21) and exchanging the order of the summation in the double sum of (3.21), we get I n+2 (x)= = sin(n +2)x I 1 (x)+2e inx sin x sin(n +2)x I 1 (x)+2e inx sin x n n ( 1) k +1 e ikx k +1 ( 1) k +1 k +1 For each k =0;:::;n, we observe the following relation: n j=k e 2ijx 1 e 2i(n k+1)x : (3.23) (1 e 2ix )eikx i(n k)x 1 e 2i(n k+1)x sin(n k +1)x e = : (3.24) 1 e 2ix sin x Substituting (3.24) into (3.23), we obtain the second relation (3.17). Finally, to obtain bound (3.18), we note that cos x sin x log1 1 + cos x 61:5; x [0; ] (3.25) and n ( 1) j +1 j +1 sin(n j +1)xsin x 62; n; x [0; ] : (3.26) Comparing (3.16), (3.17), (3.25), and (3.26), we have the required bound (3.18). From (3.14), (3.15) and (3.18), we have the following theorem. Theorem 3.3. Let N =2 n, n =2; 3;:::; and assume that f(z) is single valued and analytic inside and on. Let h(y)=f(cos y). Then the error E N (h; x) given in (3:14) is bounded independently ofxby E N (h; x) 6(4 + 12) V N k (f) ; (3.27) where V N k (f); k 0; are given in (3:12). Dene E N +N= (h; x):=q(h; x) Q N +N= (h; x); =2; 4 (3.28) Then, we also get the following error bounds for E N +N= (h; x).
10 216 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) Theorem 3.4. Let N =2 n ;n=2; 3;:::; and assume that f(z) is single valued and analytic inside and on. Let h(y)=f(cos y). Further; let V N +N= k (f); = 2; 4 denote a contour integral dened by V N +N= k (f)= 1 f(z)dz i! N +1 (z){t N= (z) cos 2 } z 2 1w ; (3.29) k where w = z + z 2 1. Then; we have E N +N= (h; x) 6(8 + 12)(1 + cos 2 ) where 4 = 3 16 and 2 = 3 8. V N +N= k (f) ; (3.30) Proof. The error of the trigonometric interpolation q N +N= (y), =2; 4, has a similar contour expression to (3.10) h(y) q N +N= (y)= 1 sin y sin Ny{cos ((N=)y) cos 2 }f(z)dz : (3.31) i (z cos y)! N +1 (z){t N= (z) cos 2 } Comparing (3.11) and (3.31), we have h(y) q N +N= (y)= V N +N= k (f) (sin y sin(n + N=)y cos ky + sin y sin(n N=)y cos ky 2 cos 2 sin y sin Ny cos ky); (3.32) where V N +N= k (f) is given by (3.29). From relations (3.13) and (3.32), we have E N +N= (h; x)= V N +N= k (f)( N +N= k (x)+ N N= k (x) 2 cos 2 N k (x)): By using Lemma 3.2, we get the desired result (3.30). Finally, to estimate the bounds of Vk N (f) and V N +N= k (f) in (3.12) and (3.29), respectively, we follow the procedure of [11]. Suppose that f(z) is a meromorphic function which has M simple poles at the points z m ;m=1; 2;:::;M; outside with residues Resf(z m ). Then, performing the contour integral of (3.12) gives V N k (f)= 2 M m=1 Resf(z m ) z 2 m 1(z m + ; k 0: (3.33) zm 2 1) k! N +1 (z m ) Since T k (z)=((z + z 2 1) k +(z z 2 1) k )=2, relation (1.3) gives Dening! N +1 (z m )= wn +1 m N wm wn m + w 2 2 w m = z m + zm 2 1; w m 1: r = min z m + 16m6M N +1 m ; (3.34) z 2 m 1 1 (3.35)
11 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) and substituting (3.35) and (3.34) into (3.33), we see that V N k (f) 6r k V N 0 (f) =O(r k N ): (3.36) Performing a similar procedure for V N +N= k (f); =2; 4, given in (3.29), we have V N +N= k (f) 6r k V N +N= 0 (f) =O(r k N N= ): (3.37) Further, from [11, (3.17) and (3.20)], we can see that V N 0 (f) r r 2 1 an N and V N +N= 0 (f) a N +N= N +N= (3.38) 4r r 2 1 ; (3.39) where a N N =2 and a N +N= N +N= are the coecients of the last term in the truncated cosine series (2.3) and (2.11), respectively. By using (3.36) (3.39) and the Theorems 3:2 and 3:3, we obtain the following error estimations. Theorem 3.5. Let N =2 n ;n=2; 3;:::; and suppose that f(z) is a meromorphic function which has M simple poles at the points z m ;m=1; 2;:::;M outside with residues Resf(z m ). Let h(y)= f(cos y) and r = min 16m6M z m + zm Then the errors E N (h; x) and E N +N= (h; x); =2; 4; dened in (3:14) and (3:28); respectively, can be bounded independently of x by r E N (h; x) 6 (4 +6) (r 1) 2 an N =O( a N N ) (3.40) and E N +N= (h; x) 6 r(1 + cos 2 ) (r 1) 2 (1 + cos 2 ) a N +N= N +N= =O( a N +N= N +N= ); (3.41) where a N N =2 and a N +N= N +N= (2:11); respectively. are the coecients of the last term in the truncated cosine series (2:3) and We remark that the error estimates (3.40) and (3.41) for the quadrature rules Q N (h; x) and Q N +N= (h; x), respectively, are independent of the values of poles t = cos x. This fact enables us to use the approximate polynomials q N (y) and q N +N= (y) common to the set of the integrals Q(h; x) for a set of x-values if a stopping criterion is satised. If a N k decreases slowly as k increases, that is, r 1+, we prefer a rather cautious error estimation similar to that given in the stopping criterion of [10] in place of (3.40) and (3.41). For detailed discussion, we refer the paper of [10].
12 218 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) Table 1 Comparison of the performance of the present method with [11] for I 1 (t) with a =1; 1 4 ; 1 8 a t a =10 5 a =10 10 Present method Ref. [11] Present method Ref. [11] N Error N Error N Error N Error 0.2 6:3e 07 6:3e 07 4:7e 13 4:8e :8e (3) 2:3e :3e (3) 7:0e :9e 07 7:6e 07 2:9e 13 2:7e :9e 06 6:1e 06 5:7e 13 6:4e :2e (3) 8:8e :3e (3) 6:1e :6e 08 1:1e 06 3:9e 13 39e :5e 07 3:8e 07 1:8e 12 2:0e :3e (3) 1:0e :8e (3) 7:0e :2e 07 2:7e 07 3:3e 13 1:0e Numerical examples In this section, we compare numerical results of the present automatic quadrature scheme with the one s of [11] for the following test integrals with the parameter a: I 1 (t)= 1 1 ( 2 + a 2 ) 1 d; a =1; 1 4 t ; 1; (4.1) 8 1 I 2 1 a 2 1 (t)= d; a =0:8; 0:9; 0:95: (4.2) 1 1 2a + a 2 t The integrals I 1 and I 2 are analytically integrated, respectively, as follows: I 1 (t)= 1 { log 1 t t 2 + a 2 1+t 2t 1 } a tan 1 ; a I 2 1 a 2 { (t)= log 1 t 1 2at + a 2 1+t 2 log1 a } : 1+a In Tables 1 3, we compare the results of the present scheme with those of [11] for each problem (4.1) and (4.2). We list the number of function evaluations N required to satisfy the required accuracy a for each integral and the actual errors. We remark that the present method achieve the error tolerance a with the data f(cos j=n), j =0; 1;:::;N. On the contrary, the rule of [12] needs both the data f(cos j=n) s and the extra evaluation f(t) s for the set of values of poles t s to obtain the same tolerance a of the present method. Table 3 lists the errors obtained by the proposed method and the one of [11] to approximate I 1 (t) for a variety of t-values to the required tolerance of a =10 5. If we estimate the terms a N N (or a N +N= N +N= ) of (3.40) and(3.41), one nds that : =2:0543e 06 a 64 64
13 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) Table 2 Comparison of the performance of the present method with [11] for I 2 (t) with a =0:8; 0:9; 0:95 a t a =10 6 a =10 10 Present method Ref. [11] Present method Ref. [11] N Error N Error N Error N Error :3e 07 1:4e 07 2:6e 12 2:7e :8e (3) 5:8e :8e (3) 3:9e :9e 08 2:0e 07 1:0e 11 1:2e :8e 09 1:0e 08 9:3e 12 1:0e :7e (3) 3:8e :9e (3) 2:0e :1e 08 8:7e 08 6:3e 11 9:3e :3e 08 5:9e 08 3:2e 14 4:0e :8e (3) 1:9e :7e (3) 3:6e :0e 08 8:9e 08 7:2e 13 2:0e 12 Table 3 Comparison of the performance of the present method with [11] for I 1 (t) with a =0:25 kept xed and with t allowed varied a =10 5 Present method Ref. [11] N t Error N Error 0.0 3:31e 14 9:07e :39e 06 4:43e :86e 06 6:11e :82e 06 5:54e :91e 06 3:24e :24e (10) 8:82e :45e 06 4:00e :34e 06 1:38e :08e 06 1:56e :20e 06 4:46e 07 Max error 5:86e 06 6:11e 06 for the case f()= a 2 ; a= 1 4 : Hence we see that the estimated errors (3.30) and (3.31) substantiate the actual errors presented in Table 3.
14 220 P. Kim, U.J. Choi / Journal of Computational and Applied Mathematics 126 (2000) References [1] M.M. Chawla, N. Jayarajan, Quadrature formulas for cauchy principal value integrals, Computing 15 (1975) [2] M.M. Chawla, S. Kumar, Convergence of quadratures for cauchy principal value integrals, Computing 23 (1979) [3] C.W. Clenshaw, A.R. Curtis, A method for numerical integration on an automatic computer, Numer. Math. 2 (1960) [4] C. Dagnino, E. Santi, On the convergence of spline product quadratures for cauchy principal value integrals, J. Comput. Appl. Math. 36 (1991) [5] D. Elliott, Truncation errors in two Chebyshev series approximations, Math. Comp. 19 (1965) [6] W.H. Press et al., Numerical Recipes in C, 2nd Edition, Cambridge University press, Cambridge, [7] R.D. Kurtz et al., The numerical solution of cauchy singular integral equations with application to fracture, Internal J. Fracture 66 (1994) [8] A. Gerasoulis, Piecewise-polynomial quadratures for cauchy singular integrals, SIAM J. Numer. Anal. 23 (1986) [9] T. Hasegawa, T. Torii, I. Ninomiya, Generalized Chebyshev interpolation and its application to automatic quadrature, Math. Compt. 41 (1983) [10] T. Hasegawa, T. Torii, H. Sugiura, An algorithm based on the FFT for a generalized Chebyshev interpolation, Math. Comp. 54 (1990) [11] T. Hasegawa, T. Torii, An automatic quadrature for cauchy principal value integrals, Math. Comp. 56 (1991) [12] T. Hasegawa, T. Torii, Hilbert and Hadamard transforms by generalized Chebyshev expansion, J. Comput. Appl. Math. 51 (1994) [13] N.I. Ioakimidis, A new interpretation of cauchy type singular integrals with an application to singular integral equations, J. Comput. Appl. Math. 14 (1986) [14] P. Kim, S. Lee, A piecewise linear quadrature of cauchy singular integrals, J. Comput. Appl. Math. 95 (1998) [15] S. Kumar, A note on quadrature formulae for cauchy principal value integrals, J. Inst. Math. Appl. 26 (1980) [16] A.P. Orsi, Spline approximation for cauchy principal value integrals, J. Comput. Appl. Math. 30 (1990) [17] F.A. Potra, E. Venturino, Low-order methods for cauchy principal value integrals with endpoint singularities, IMA Numer. Anal. 14 (1994) [18] P. Rabinowitz, Numerical integration based on approximating spline, J. Comput. Appl. Math. 33 (1990)
On the convergence of interpolatory-type quadrature rules for evaluating Cauchy integrals
Journal of Computational and Applied Mathematics 49 () 38 395 www.elsevier.com/locate/cam On the convergence of interpolatory-type quadrature rules for evaluating Cauchy integrals Philsu Kim a;, Beong
More informationOn the Chebyshev quadrature rule of finite part integrals
Journal of Computational and Applied Mathematics 18 25) 147 159 www.elsevier.com/locate/cam On the Chebyshev quadrature rule of finite part integrals Philsu Kim a,,1, Soyoung Ahn b, U. Jin Choi b a Major
More informationError Estimates for the Clenshaw-Curtis Quadrature
Error Estimates for the Clenshaw-Curtis Quadrature By M. M. Chawla 1. Introduction. Clenshaw and Curtis [1] have proposed a quadrature scheme based on the "practical" abscissas x cos (iir/n), i = 0(l)n
More informationMath Final Exam.
Math 106 - Final Exam. This is a closed book exam. No calculators are allowed. The exam consists of 8 questions worth 100 points. Good luck! Name: Acknowledgment and acceptance of honor code: Signature:
More informationBivariate Lagrange interpolation at the Padua points: The generating curve approach
Journal of Approximation Theory 43 (6) 5 5 www.elsevier.com/locate/jat Bivariate Lagrange interpolation at the Padua points: The generating curve approach Len Bos a, Marco Caliari b, Stefano De Marchi
More informationComplex Variables & Integral Transforms
Complex Variables & Integral Transforms Notes taken by J.Pearson, from a S4 course at the U.Manchester. Lecture delivered by Dr.W.Parnell July 9, 007 Contents 1 Complex Variables 3 1.1 General Relations
More informationMONOTONICITY OF THE ERROR TERM IN GAUSS TURÁN QUADRATURES FOR ANALYTIC FUNCTIONS
ANZIAM J. 48(27), 567 581 MONOTONICITY OF THE ERROR TERM IN GAUSS TURÁN QUADRATURES FOR ANALYTIC FUNCTIONS GRADIMIR V. MILOVANOVIĆ 1 and MIODRAG M. SPALEVIĆ 2 (Received March 19, 26) Abstract For Gauss
More informationNumerische Mathematik
Numer. Math. (28) 9:43 65 DOI.7/s2-7-25-7 Numerische Mathematik The superconvergence of Newton Cotes rules for the Hadamard finite-part integral on an interval Jiming Wu Weiwei Sun Received: 2 May 27 /
More informationON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT
ON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT Received: 31 July, 2008 Accepted: 06 February, 2009 Communicated by: SIMON J SMITH Department of Mathematics and Statistics La Trobe University,
More informationChapter 6: Residue Theory. Introduction. The Residue Theorem. 6.1 The Residue Theorem. 6.2 Trigonometric Integrals Over (0, 2π) Li, Yongzhao
Outline Chapter 6: Residue Theory Li, Yongzhao State Key Laboratory of Integrated Services Networks, Xidian University June 7, 2009 Introduction The Residue Theorem In the previous chapters, we have seen
More informationINTEGRAL FORMULAS FOR CHEBYSHEV POLYNOMIALS AND THE ERROR TERM OF INTERPOLATORY QUADRATURE FORMULAE FOR ANALYTIC FUNCTIONS
MATHEMATICS OF COMPUTATION Volume 75 Number 255 July 2006 Pages 27 23 S 0025-578(06)0859-X Article electronically published on May 2006 INTEGRAL FORMULAS FOR CHEBYSHEV POLYNOMIALS AND THE ERROR TERM OF
More informationOn the remainder term of Gauss Radau quadratures for analytic functions
Journal of Computational and Applied Mathematics 218 2008) 281 289 www.elsevier.com/locate/cam On the remainder term of Gauss Radau quadratures for analytic functions Gradimir V. Milovanović a,1, Miodrag
More informationComparison of Clenshaw-Curtis and Gauss Quadrature
WDS'11 Proceedings of Contributed Papers, Part I, 67 71, 211. ISB 978-8-7378-184-2 MATFYZPRESS Comparison of Clenshaw-Curtis and Gauss Quadrature M. ovelinková Charles University, Faculty of Mathematics
More informationDavid A. Stephens Department of Mathematics and Statistics McGill University. October 28, 2006
556: MATHEMATICAL STATISTICS I COMPUTING THE HYPEBOLIC SECANT DISTIBUTION CHAACTEISTIC FUNCTION David A. Stephens Department of Mathematics and Statistics McGill University October 8, 6 Abstract We give
More informationMath 185 Fall 2015, Sample Final Exam Solutions
Math 185 Fall 2015, Sample Final Exam Solutions Nikhil Srivastava December 12, 2015 1. True or false: (a) If f is analytic in the annulus A = {z : 1 < z < 2} then there exist functions g and h such that
More informationExamples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.
s of the Fourier Theorem (Sect. 1.3. The Fourier Theorem: Continuous case. : Using the Fourier Theorem. The Fourier Theorem: Piecewise continuous case. : Using the Fourier Theorem. The Fourier Theorem:
More information256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim.
56 Summary High order FD Finite-order finite differences: Points per Wavelength: Number of passes: D n f(x j ) = f j+n f j n n x df xj = m α m dx n D n f j j n= α m n = ( ) n (m!) (m n)!(m + n)!. PPW =
More informationPoles, Residues, and All That
hapter Ten Poles, Residues, and All That 0.. Residues. A point z 0 is a singular point of a function f if f not analytic at z 0, but is analytic at some point of each neighborhood of z 0. A singular point
More informationComplex Analysis Math 205A, Winter 2014 Final: Solutions
Part I: Short Questions Complex Analysis Math 205A, Winter 2014 Final: Solutions I.1 [5%] State the Cauchy-Riemann equations for a holomorphic function f(z) = u(x,y)+iv(x,y). The Cauchy-Riemann equations
More informationA fourth-order nite-dierence method based on non-uniform mesh for a class of singular two-point boundary value problems
Journal of Computational and Applied Mathematics 136 (2001) 337 342 www.elsevier.com/locate/cam A fourth-order nite-dierence method based on non-uniform mesh for a class of singular two-point boundary
More informationSome applications of the Hermite matrix polynomials series expansions 1
Journal of Computational and Applied Mathematics 99 (1998) 105 117 Some applications of the Hermite matrix polynomials series expansions 1 Emilio Defez, Lucas Jodar Departamento de Matematica Aplicada,
More informationINTRODUCTION TO REAL ANALYSIS II MATH 4332 BLECHER NOTES
INTRODUCTION TO REAL ANALYSIS II MATH 433 BLECHER NOTES. As in earlier classnotes. As in earlier classnotes (Fourier series) 3. Fourier series (continued) (NOTE: UNDERGRADS IN THE CLASS ARE NOT RESPONSIBLE
More informationApproximation theory
Approximation theory Xiaojing Ye, Math & Stat, Georgia State University Spring 2019 Numerical Analysis II Xiaojing Ye, Math & Stat, Georgia State University 1 1 1.3 6 8.8 2 3.5 7 10.1 Least 3squares 4.2
More informationMath 489AB A Very Brief Intro to Fourier Series Fall 2008
Math 489AB A Very Brief Intro to Fourier Series Fall 8 Contents Fourier Series. The coefficients........................................ Convergence......................................... 4.3 Convergence
More informationMATH 220 solution to homework 4
MATH 22 solution to homework 4 Problem. Define v(t, x) = u(t, x + bt), then v t (t, x) a(x + u bt) 2 (t, x) =, t >, x R, x2 v(, x) = f(x). It suffices to show that v(t, x) F = max y R f(y). We consider
More informationPhysics 307. Mathematical Physics. Luis Anchordoqui. Wednesday, August 31, 16
Physics 307 Mathematical Physics Luis Anchordoqui 1 Bibliography L. A. Anchordoqui and T. C. Paul, ``Mathematical Models of Physics Problems (Nova Publishers, 2013) G. F. D. Duff and D. Naylor, ``Differential
More informationConvergence of sequences and series
Convergence of sequences and series A sequence f is a map from N the positive integers to a set. We often write the map outputs as f n rather than f(n). Often we just list the outputs in order and leave
More informationQualifying Exams I, 2014 Spring
Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = F q be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that
More informationAutomatica, 33(9): , September 1997.
A Parallel Algorithm for Principal nth Roots of Matrices C. K. Koc and M. _ Inceoglu Abstract An iterative algorithm for computing the principal nth root of a positive denite matrix is presented. The algorithm
More information. Then g is holomorphic and bounded in U. So z 0 is a removable singularity of g. Since f(z) = w 0 + 1
Now we describe the behavior of f near an isolated singularity of each kind. We will always assume that z 0 is a singularity of f, and f is holomorphic on D(z 0, r) \ {z 0 }. Theorem 4.2.. z 0 is a removable
More informationA Nodal Spline Collocation Method for the Solution of Cauchy Singular Integral Equations 1
European Society of Computational Methods in Sciences and Engineering (ESCMSE) Journal of Numerical Analysis, Industrial and Applied Mathematics (JNAIAM) vol. 3, no. 3-4, 2008, pp. 211-220 ISSN 1790 8140
More informationPade approximants and noise: rational functions
Journal of Computational and Applied Mathematics 105 (1999) 285 297 Pade approximants and noise: rational functions Jacek Gilewicz a; a; b;1, Maciej Pindor a Centre de Physique Theorique, Unite Propre
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More informationCS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation
Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80
More informationComplex variables lecture 6: Taylor and Laurent series
Complex variables lecture 6: Taylor and Laurent series Hyo-Sung Ahn School of Mechatronics Gwangju Institute of Science and Technology (GIST) 1 Oryong-dong, Buk-gu, Gwangju, Korea Advanced Engineering
More informationAdvanced Computational Fluid Dynamics AA215A Lecture 2 Approximation Theory. Antony Jameson
Advanced Computational Fluid Dynamics AA5A Lecture Approximation Theory Antony Jameson Winter Quarter, 6, Stanford, CA Last revised on January 7, 6 Contents Approximation Theory. Least Squares Approximation
More information2
1 Notes for Numerical Analysis Math 54 by S. Adjerid Virginia Polytechnic Institute and State University (A Rough Draft) 2 Contents 1 Polynomial Interpolation 5 1.1 Review...............................
More informationMath 411, Complex Analysis Definitions, Formulas and Theorems Winter y = sinα
Math 411, Complex Analysis Definitions, Formulas and Theorems Winter 014 Trigonometric Functions of Special Angles α, degrees α, radians sin α cos α tan α 0 0 0 1 0 30 π 6 45 π 4 1 3 1 3 1 y = sinα π 90,
More informationA NEW COLLOCATION METHOD FOR SOLVING CERTAIN HADAMARD FINITE-PART INTEGRAL EQUATION
INTERNATIONAL JOURNAL OF NUMERICAL ANALYSIS AND MODELING Volume 6, Number, Pages 4 54 c 9 Institute for Scientific Computing and Information A NEW COLLOCATION METHOD FOR SOLVING CERTAIN HADAMARD FINITE-PART
More informationTen things you should know about quadrature. Nick Trefethen, Vanderbilt, Wed. 28 May 8:35 PM
Ten things you should know about quadrature Nick Trefethen, Vanderbilt, Wed. 28 May 2014 @ 8:35 PM 1. If the integrand is analytic, Gauss quadrature converges geometrically. f is analytic and bounded by
More informationTaylor series based nite dierence approximations of higher-degree derivatives
Journal of Computational and Applied Mathematics 54 (3) 5 4 www.elsevier.com/locate/cam Taylor series based nite dierence approximations of higher-degree derivatives Ishtiaq Rasool Khan a;b;, Ryoji Ohba
More informationHandout 1 - Contour Integration
Handout 1 - Contour Integration Will Matern September 19, 214 Abstract The purpose of this handout is to summarize what you need to know to solve the contour integration problems you will see in SBE 3.
More informationMonte Carlo Methods for Statistical Inference: Variance Reduction Techniques
Monte Carlo Methods for Statistical Inference: Variance Reduction Techniques Hung Chen hchen@math.ntu.edu.tw Department of Mathematics National Taiwan University 3rd March 2004 Meet at NS 104 On Wednesday
More informationAsymptotic Error Estimates for the Gauss Quadrature Formula
Asymptotic Error Estimates for the Gauss Quadrature Formula By M. M. Chawla and M. K. Jain 1. Introduction. Classical error estimates for the Gauss quadrature formula using derivatives can be used, but
More informationConvergence of Fourier Series
MATH 454: Analysis Two James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University April, 8 MATH 454: Analysis Two Outline The Cos Family MATH 454: Analysis
More informationOn some properties of elementary derivations in dimension six
Journal of Pure and Applied Algebra 56 (200) 69 79 www.elsevier.com/locate/jpaa On some properties of elementary derivations in dimension six Joseph Khoury Department of Mathematics, University of Ottawa,
More informationMATH 5640: Fourier Series
MATH 564: Fourier Series Hung Phan, UMass Lowell September, 8 Power Series A power series in the variable x is a series of the form a + a x + a x + = where the coefficients a, a,... are real or complex
More informationExercises for Part 1
MATH200 Complex Analysis. Exercises for Part Exercises for Part The following exercises are provided for you to revise complex numbers. Exercise. Write the following expressions in the form x + iy, x,y
More informationPositive Denite Matrix. Ya Yan Lu 1. Department of Mathematics. City University of Hong Kong. Kowloon, Hong Kong. Abstract
Computing the Logarithm of a Symmetric Positive Denite Matrix Ya Yan Lu Department of Mathematics City University of Hong Kong Kowloon, Hong Kong Abstract A numerical method for computing the logarithm
More information1. Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials.
Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials A rational function / is a quotient of two polynomials P, Q with 0 By Fundamental Theorem of algebra, =
More informationAnalyse 3 NA, FINAL EXAM. * Monday, January 8, 2018, *
Analyse 3 NA, FINAL EXAM * Monday, January 8, 08, 4.00 7.00 * Motivate each answer with a computation or explanation. The maximum amount of points for this exam is 00. No calculators!. (Holomorphic functions)
More informationQ You mentioned that in complex analysis we study analytic functions, or, in another name, holomorphic functions. Pray tell me, what are they?
COMPLEX ANALYSIS PART 2: ANALYTIC FUNCTIONS Q You mentioned that in complex analysis we study analytic functions, or, in another name, holomorphic functions. Pray tell me, what are they? A There are many
More informationThe Dirac δ-function
The Dirac δ-function Elias Kiritsis Contents 1 Definition 2 2 δ as a limit of functions 3 3 Relation to plane waves 5 4 Fourier integrals 8 5 Fourier series on the half-line 9 6 Gaussian integrals 11 Bibliography
More informationA scale-free goodness-of-t statistic for the exponential distribution based on maximum correlations
Journal of Statistical Planning and Inference 18 (22) 85 97 www.elsevier.com/locate/jspi A scale-free goodness-of-t statistic for the exponential distribution based on maximum correlations J. Fortiana,
More informationA MULTIGRID ALGORITHM FOR. Richard E. Ewing and Jian Shen. Institute for Scientic Computation. Texas A&M University. College Station, Texas SUMMARY
A MULTIGRID ALGORITHM FOR THE CELL-CENTERED FINITE DIFFERENCE SCHEME Richard E. Ewing and Jian Shen Institute for Scientic Computation Texas A&M University College Station, Texas SUMMARY In this article,
More informationRealization of set functions as cut functions of graphs and hypergraphs
Discrete Mathematics 226 (2001) 199 210 www.elsevier.com/locate/disc Realization of set functions as cut functions of graphs and hypergraphs Satoru Fujishige a;, Sachin B. Patkar b a Division of Systems
More informationComplex Variables...Review Problems (Residue Calculus Comments)...Fall Initial Draft
Complex Variables........Review Problems Residue Calculus Comments)........Fall 22 Initial Draft ) Show that the singular point of fz) is a pole; determine its order m and its residue B: a) e 2z )/z 4,
More informationError Estimates for Trigonometric Interpolation. of Periodic Functions in Lip 1. Knut Petras
Error Estimates for Trigonometric Interpolation of Periodic Functions in Lip Knut Petras Abstract. The Peano kernel method is used in order to calculate the best possible constants c, independent of M,
More information1 Ordinary points and singular points
Math 70 honors, Fall, 008 Notes 8 More on series solutions, and an introduction to \orthogonal polynomials" Homework at end Revised, /4. Some changes and additions starting on page 7. Ordinary points and
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationMath Exam II Review
Math 114 - Exam II Review Peter A. Perry University of Kentucky March 6, 2017 Bill of Fare 1. It s All About Series 2. Convergence Tests I 3. Convergence Tests II 4. The Gold Standards (Geometric Series)
More informationThis practice exam is intended to help you prepare for the final exam for MTH 142 Calculus II.
MTH 142 Practice Exam Chapters 9-11 Calculus II With Analytic Geometry Fall 2011 - University of Rhode Island This practice exam is intended to help you prepare for the final exam for MTH 142 Calculus
More informationMax-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig H 2 -matrix approximation of integral operators by interpolation by Wolfgang Hackbusch and Steen Borm Preprint no.: 04 200 H 2 -Matrix
More informationSOLUTIONS MANUAL FOR. Advanced Engineering Mathematics with MATLAB Third Edition. Dean G. Duffy
SOLUTIONS MANUAL FOR Advanced Engineering Mathematics with MATLAB Third Edition by Dean G. Duffy SOLUTIONS MANUAL FOR Advanced Engineering Mathematics with MATLAB Third Edition by Dean G. Duffy Taylor
More informationNumerical integration formulas of degree two
Applied Numerical Mathematics 58 (2008) 1515 1520 www.elsevier.com/locate/apnum Numerical integration formulas of degree two ongbin Xiu epartment of Mathematics, Purdue University, West Lafayette, IN 47907,
More informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More informationMath 113 (Calculus 2) Exam 4
Math 3 (Calculus ) Exam 4 November 0 November, 009 Sections 0, 3 7 Name Student ID Section Instructor In some cases a series may be seen to converge or diverge for more than one reason. For such problems
More informationMath 121A: Homework 6 solutions
Math A: Homework 6 solutions. (a) The coefficients of the Fourier sine series are given by b n = π f (x) sin nx dx = x(π x) sin nx dx π = (π x) cos nx dx nπ nπ [x(π x) cos nx]π = n ( )(sin nx) dx + π n
More informationThe 70th William Lowell Putnam Mathematical Competition Saturday, December 5, 2009
The 7th William Lowell Putnam Mathematical Competition Saturday, December 5, 9 A1 Let f be a real-valued function on the plane such that for every square ABCD in the plane, f(a) + f(b) + f(c) + f(d) =.
More informationMATH 6322, COMPLEX ANALYSIS
Complex numbers: MATH 6322, COMPLEX ANALYSIS Motivating problem: you can write down equations which don t have solutions, like x 2 + = 0. Introduce a (formal) solution i, where i 2 =. Define the set C
More information1. The COMPLEX PLANE AND ELEMENTARY FUNCTIONS: Complex numbers; stereographic projection; simple and multiple connectivity, elementary functions.
Complex Analysis Qualifying Examination 1 The COMPLEX PLANE AND ELEMENTARY FUNCTIONS: Complex numbers; stereographic projection; simple and multiple connectivity, elementary functions 2 ANALYTIC FUNCTIONS:
More informationContents. I Basic Methods 13
Preface xiii 1 Introduction 1 I Basic Methods 13 2 Convergent and Divergent Series 15 2.1 Introduction... 15 2.1.1 Power series: First steps... 15 2.1.2 Further practical aspects... 17 2.2 Differential
More information1 Solutions to selected problems
Solutions to selected problems Section., #a,c,d. a. p x = n for i = n : 0 p x = xp x + i end b. z = x, y = x for i = : n y = y + x i z = zy end c. y = (t x ), p t = a for i = : n y = y(t x i ) p t = p
More informationOn the solution of integral equations of the first kind with singular kernels of Cauchy-type
International Journal of Mathematics and Computer Science, 7(202), no. 2, 29 40 M CS On the solution of integral equations of the first kind with singular kernels of Cauchy-type G. E. Okecha, C. E. Onwukwe
More informationSequences and Summations
COMP 182 Algorithmic Thinking Sequences and Summations Luay Nakhleh Computer Science Rice University Chapter 2, Section 4 Reading Material Sequences A sequence is a function from a subset of the set of
More informationCore Mathematics 3 Differentiation
http://kumarmaths.weebly.com/ Core Mathematics Differentiation C differentiation Page Differentiation C Specifications. By the end of this unit you should be able to : Use chain rule to find the derivative
More informationReview of Power Series
Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power
More informationRecurrence Relations and Fast Algorithms
Recurrence Relations and Fast Algorithms Mark Tygert Research Report YALEU/DCS/RR-343 December 29, 2005 Abstract We construct fast algorithms for decomposing into and reconstructing from linear combinations
More informationNumerische Mathematik
Numer. Math. (1998) 80: 39 59 Numerische Mathematik c Springer-Verlag 1998 Electronic Edition Numerical integration over a disc. A new Gaussian quadrature formula Borislav Bojanov 1,, Guergana Petrova,
More informationSimultaneous Gaussian quadrature for Angelesco systems
for Angelesco systems 1 KU Leuven, Belgium SANUM March 22, 2016 1 Joint work with Doron Lubinsky Introduced by C.F. Borges in 1994 Introduced by C.F. Borges in 1994 (goes back to Angelesco 1918). Introduced
More informationNumerical Methods in Physics and Astrophysics
Kostas Kokkotas 2 October 17, 2017 2 http://www.tat.physik.uni-tuebingen.de/ kokkotas Kostas Kokkotas 3 TOPICS 1. Solving nonlinear equations 2. Solving linear systems of equations 3. Interpolation, approximation
More informationarxiv: v1 [math.cv] 18 Aug 2015
arxiv:508.04376v [math.cv] 8 Aug 205 Saddle-point integration of C bump functions Steven G. Johnson, MIT Applied Mathematics Created November 23, 2006; updated August 9, 205 Abstract This technical note
More informationThe generalized Euler-Maclaurin formula for the numerical solution of Abel-type integral equations.
The generalized Euler-Maclaurin formula for the numerical solution of Abel-type integral equations. Johannes Tausch Abstract An extension of the Euler-Maclaurin formula to singular integrals was introduced
More informationChapter 8: Taylor s theorem and L Hospital s rule
Chapter 8: Taylor s theorem and L Hospital s rule Theorem: [Inverse Mapping Theorem] Suppose that a < b and f : [a, b] R. Given that f (x) > 0 for all x (a, b) then f 1 is differentiable on (f(a), f(b))
More informationMATH 452. SAMPLE 3 SOLUTIONS May 3, (10 pts) Let f(x + iy) = u(x, y) + iv(x, y) be an analytic function. Show that u(x, y) is harmonic.
MATH 45 SAMPLE 3 SOLUTIONS May 3, 06. (0 pts) Let f(x + iy) = u(x, y) + iv(x, y) be an analytic function. Show that u(x, y) is harmonic. Because f is holomorphic, u and v satisfy the Cauchy-Riemann equations:
More informationQualification Exam: Mathematical Methods
Qualification Exam: Mathematical Methods Name:, QEID#41534189: August, 218 Qualification Exam QEID#41534189 2 1 Mathematical Methods I Problem 1. ID:MM-1-2 Solve the differential equation dy + y = sin
More informationFINAL EXAM Math 25 Temple-F06
FINAL EXAM Math 25 Temple-F06 Write solutions on the paper provided. Put your name on this exam sheet, and staple it to the front of your finished exam. Do Not Write On This Exam Sheet. Problem 1. (Short
More informationThe Residue Theorem. Integration Methods over Closed Curves for Functions with Singularities
The Residue Theorem Integration Methods over losed urves for Functions with Singularities We have shown that if f(z) is analytic inside and on a closed curve, then f(z)dz = 0. We have also seen examples
More informationPolyGamma Functions of Negative Order
Carnegie Mellon University Research Showcase @ CMU Computer Science Department School of Computer Science -998 PolyGamma Functions of Negative Order Victor S. Adamchik Carnegie Mellon University Follow
More informationMath Homework 2
Math 73 Homework Due: September 8, 6 Suppose that f is holomorphic in a region Ω, ie an open connected set Prove that in any of the following cases (a) R(f) is constant; (b) I(f) is constant; (c) f is
More informationConstrained Leja points and the numerical solution of the constrained energy problem
Journal of Computational and Applied Mathematics 131 (2001) 427 444 www.elsevier.nl/locate/cam Constrained Leja points and the numerical solution of the constrained energy problem Dan I. Coroian, Peter
More informationExam TMA4120 MATHEMATICS 4K. Monday , Time:
Exam TMA4 MATHEMATICS 4K Monday 9.., Time: 9 3 English Hjelpemidler (Kode C): Bestemt kalkulator (HP 3S eller Citizen SR-7X), Rottmann: Matematisk formelsamling Problem. a. Determine the value ( + i) 6
More informationTaylor Series. Math114. March 1, Department of Mathematics, University of Kentucky. Math114 Lecture 18 1/ 13
Taylor Series Math114 Department of Mathematics, University of Kentucky March 1, 2017 Math114 Lecture 18 1/ 13 Given a function, can we find a power series representation? Math114 Lecture 18 2/ 13 Given
More informationMath 421 Midterm 2 review questions
Math 42 Midterm 2 review questions Paul Hacking November 7, 205 () Let U be an open set and f : U a continuous function. Let be a smooth curve contained in U, with endpoints α and β, oriented from α to
More informationThe Hardy-Littlewood Function: An Exercise in Slowly Convergent Series
The Hardy-Littlewood Function: An Exercise in Slowly Convergent Series Walter Gautschi Department of Computer Sciences Purdue University West Lafayette, IN 4797-66 U.S.A. Dedicated to Olav Njåstad on the
More informationSynopsis of Complex Analysis. Ryan D. Reece
Synopsis of Complex Analysis Ryan D. Reece December 7, 2006 Chapter Complex Numbers. The Parts of a Complex Number A complex number, z, is an ordered pair of real numbers similar to the points in the real
More informationMA3111S COMPLEX ANALYSIS I
MA3111S COMPLEX ANALYSIS I 1. The Algebra of Complex Numbers A complex number is an expression of the form a + ib, where a and b are real numbers. a is called the real part of a + ib and b the imaginary
More informationMTH 3102 Complex Variables Final Exam May 1, :30pm-5:30pm, Skurla Hall, Room 106
Name (Last name, First name): MTH 02 omplex Variables Final Exam May, 207 :0pm-5:0pm, Skurla Hall, Room 06 Exam Instructions: You have hour & 50 minutes to complete the exam. There are a total of problems.
More informationAssignment 11 Assigned Mon Sept 27
Assignment Assigned Mon Sept 7 Section 7., Problem 4. x sin x dx = x cos x + x cos x dx ( = x cos x + x sin x ) sin x dx u = x dv = sin x dx du = x dx v = cos x u = x dv = cos x dx du = dx v = sin x =
More informationEquations (3) and (6) form a complete solution as long as the set of functions fy n (x)g exist that satisfy the Properties One and Two given by equati
PHYS/GEOL/APS 661 Earth and Planetary Physics I Eigenfunction Expansions, Sturm-Liouville Problems, and Green's Functions 1. Eigenfunction Expansions In seismology in general, as in the simple oscillating
More information