• 검색 결과가 없습니다.

The main-square error bounds for the gaussian quadrature of analytic functions

N/A
N/A
Protected

Academic year: 2022

Share "The main-square error bounds for the gaussian quadrature of analytic functions"

Copied!
15
0
0

로드 중.... (전체 텍스트 보기)

전체 글

(1)

(1.1)

THE MEAN-SQUARE ERROR BOUNDS FOR THE GAUSSIAN QUADRATURE

OF ANALYTIC FUNCTIONS Kw

AN PYO

Ko

AND

U

JIN CHOI*

ABSTRACT. Inthis paper we present the L2-estimation for the ker- nelKn of the remaider term for the Gaussian quadrature with re- spect to one of four Chebyshev weight functions and the error bound of the type on the contour

where Z(r) denotes the length of the contour

r.

1.

Introduction

Consider the Gaussian quadrature with respect to the nonnegative weight function w(x) defined on the interval [-1,1] such that the mo- ments J2

1

xkw(x) dx exist for

k

= 0,1,2,···. If we apply the residue theorem to the contour integral

1 [

f(z)1r

n

(x)

d

21ri Jr (z - x)1r

n

(z)

Z,

where r is the closed contour which contains the simple zeros of or- thogonal polynomial1r

n

(z), and integrate with respect to the w(x) on [-1,1], we get the formula

[ . f(t)w(t) dt = ~ Akf(n,) + R,. (I),

Received October24, 1994.

1991 Mathematics Subject Classification: Primary 65D32.

Key words and phrases: Gaussian quadrature, Chebyshev polynomial.

*This work was partially supported by the KOSEF, under grant NO.91-08-00- 01,1993.

(2)

where

Tk

are the zeros of the nth degree orthogonal polynomial

11"n (. :

w) on [-1,1] and Ak are the corresponding Christoffel numbers which are defined by

1

1

1I"n(t)

Ak

= ( ) '( )

wet) dt.

-1

t -

Tk

1I"n

Tk

If f is a single-valued analytic function in a domain D which contains [-1,1] and if r is a closed contour in D surrounding [-1,1], then the remainder term Rn (.) can be represented as a contour integral

(1.2) Rn(f) = -2 1

. [ Kn(z)f(z)dz, 11"~ Jr

where the kernel K

n

is given by

(1.3)

or, alternatively, by

(1.4) K ( )

=

Pn(z)

n

z 1I"n Z ( ).

Here, 1I"n(z) is the orthogonal polynomial1l"n(' : w) evaluated at z, while Pn(z) is known as the function of the second kind which is defined by

(1.5) 1

1

1I"n(t)

Pn(Z)

=

--wet) dt.

-1

z-t See, e.g.,[3].

Gautschi and Varga [5] have shown the error estimates in the following form on the circle and ellipse

(1.6) IRn(f) I ~ Z2(r)

11"

max

zEr

IKn(z) I max

zEr

If(z)l,

where Z(r) denotes the length of r. And they [5] have given an explicit

representation for the kernel K

n

on r, and from these determinl:!d the

maximum points on the circle and ellipse for a Jacobi measure wet) =

(3)

(1- t)a(l + t)f3 for arbitrary

et

> -1,{3 > -1. Martin and Stamp [8]

have shown an explicit expression for kernel Kn(z) by the method of the Laurent series expansion. They have given methods for computing the coefficients (in terms of the moments) for the Laurent series of Kn(z). Our goal is to get the other estimate with the following form

(1.7)

that

is ,

for a Jacobi measure wet) = (1 - t)a(1 + t)f3 to find the L

2

norm for the kernel and to determine error bound on the ellipse. In section 2 we find the L

2

norm of the kernel Kn(z) and obtain error bound on the elliptic contour with respect to one of four Chebyshev weight functions. In section 3 we give an example.

2. Main results

In this section we consider contour r as an elliptic contour which is defined by

2.1 Chebyshev measures of the first kind

For the weight function wet) = (1-t

2

)-!, we know that the orthog- anal polynomial is the Chebyshev polynomial T

n

of the first kind, (2.1.1)

Furthermore, one finds (2.1.2)

1

1 - -

Tn(t) (1

- t2)_12 dt -

-1

7r cosnO dO -- 1r (

z- J z - l

2

)n

-1

z - t

0

z - cos 0 vz

2 -1 '

(4)

hence we have the functions of the second kind

(2.1.3)

It follows that

Pn(Z) 411"

(2.1.4) Kn(z) = -(-) = ( 1I"n

Z

U-U- Un Un+U-n ) 1) ( , 1 -1)

Z

= 2(u+u .

(2.1.5)

We know that

K ()12 411"2 1

I n

Z

= p2n [a2(p) -cos20][a2n(P) +cos2nO]' where

(2.1.6) aj(p)

= 1 ·

2(P' +p-J),

. j

= 1,2,3,···, p> 1.

For the detail, we refer to [5].

THEOREM

1. Ifw(t)

=

(1- t

2

)-! on (-1,1), then (2.1.7)

Proof Since

Z

= !(pe

i6

+ p-1e

-i6),

we get Idzl

$

!(p + p-1) dO,

and the

£2

bound for the kernel K

n

Setting t

=

e

i6,

we see that dt

=

itdO and

(5)

where C is the unit circle, and applying the residue theorem, we get

where Res(J, x) denotes the residue value of f at x.

To calculate the value 2:;:'1 Res(J, _p-1 Wj ), let t2n + (;)2n

=

(t-

zd(t - Z2)··· (t - Z2n), then we have

1 1

Res(J - -w .)

=

g(z·) -;---:----:---:-:;----;----;---;- , p

J J

(Zj - Zl) ... (Zj - Zj-1)(Zj - zi+d ... (Zj - Z2n) ,

LEMMA

1. It holds that

IT (Zj - Zi) = 2nz;n-1.

1<i<2n

i=/;j

Proof Let w;n = -1 and Zj = ;Wj, since

t2n + ('!)2n

p =

t2n _ ('!w

p o

)2n

=

t2n _ z~n

J J

=

(t - Zj)(t2n- 1 + t2n- 2zj + ... + z;n-1),

it follows that

(t - Zl)(t - Z2)··· (t - Zj)··. (t - Z2n)

=

(t - Zj)(t2n- 1 + t2n- 2zj + ... + z;n-1).

Cancelling (t - Zj) on both sides, one gets

(t - Zl)'" (t - Zj-1)(t - zi+d ... (t - Z2n)

= (t2n- 1 + t2n- 2zj + ... + z;n-1),

o

(6)

and inserting t into

Zj,

we have

Therefore we calculate the residue of fat -;Wj in the form

We have the residue by elementary calculation;

1 1 1 1

Res(f, -) = Res(f, --) = -4 (p2 _

1

)(p2n

1 ) '

P P

ps +prn-

Now we have to calculate summation;

1 2n z?

2n(p2n - pk) ~ (z; - p2)(z; - ~) ,

LEMMA

2. It holds that

L

2n 1 _2nx2n- 1

w3~n =-l.

-x - 1+x2n '

j=1 3

Proof. We can write in the form

IT we differentiate both sides with respect to x, we have

o

2nx2n- 1 = (x -

w~...

(x - W2n) + (x - Wl)(X - W3) ... (x - W2n) + ...

+ (x - wJ ... (x - W2n-l).

Dividing by the first equation, we have

2nx2n-1 2n 1

1+x2n =L x - w .·

j=1 3

(7)

It follows that

2n 1 2n 1 1 1 -2nx2n- 2

" , , ( ) wJ~n

=

-1.

L....J w~

-

x 2 = L....J 2x

w· -

x - w· + x = 1 + x 2n '

j=l 3 j=l 3 3

Therefore for

Zj = ~Wj

and w;n

=

-1, we have

2n

z~

2n

w~

" 3 2 " 3

~ (z~ - p2)(z~ -~)

=

p ~ (w~ - p4)(w~ -1)

3=1 J J P 3=1 J J

2n b

4

1

_ 22:

a _ _

p _

- p

j=l

(w~ - p4 + , W~ -

1)

a - p4 -

1,b - 1 _

p4

.

3 J

We use Lemma 2, then it follows that

2n Z; np2 (p2n _ pk)

~ (zJ - p2)(zJ - ~) = - (p4 - 1)(p2n + pk)'

So we have the residue;

1 1 2n 1 1

Res(j, -) + Res(j, --) + 2: Res(j,

- - W j ) = -

(2 1 )(p2 1 )"

P P

j=l

P P -

fj2 n

+

"""jj2R

We have proved the £2 bound for the kernel K

n

p> 1.

o

Now we have to estimate error bound

Since the ellipse r has the length l(r)

=

4c

1

E(E), where

2

E - - - = -

- p+p-1'

(8)

we have the error bound for the analytic function on the elliptic contour

(2.1.8)

2.2 Chebyshev measures of the Second Kind

For the Chebyshev measure ofthe second kind, Le., wet) = (1-t

2

)!,

the nth degree orthogonal polynomial is

(2.2.1)

while

(2.2.2)

We know that

(2.2.3)

where

(2.2.4)

K z

2

= ~ a2(p) -cos28

I n()1 p2n

+2

a2n+2(P) - cos2(n + 1)8'

For the detail, we refer to [5].

THEOREM

2. Ifw(t) = (1-t

2

)l on (-1,1), then

(2.2.5)

(9)

Proof For z

E

r, we get Idzl

~ ~(p+

p-l )dO, and the £2 bound for the kernel K

n

Setting t = e

iO,

we see that dt = itdO and

where C is the unit circle, and applying the residue theorem, we get

where Res(j, x) denotes the residue value of f at x.

To calculate the value

,,~n+2L...J=1

Res(f

'p!w·).J ,

let t

2n+2 - (!)2n+2p =

(t- zI)(t -

Z2)'"

(t -

Z2n+2),

then we have

and

(10)

Therefore for

Zj

=

*Wj

and wJn+2 = 1, we have

2n+2 1 1 1

L [z; - (p 2 + p2) - z~] = -(2n + 2)(p2 + p2),

j=1 J

since E;:t 2 wJ

=

E;:t 2 ~

=

O. We have proved the L

2

bound for

3

the kernel K

n

o

2.3 Chebyshev Measures of the Type a

=

-{3 =-!

Let a = -/3 = -!. The orthogonal polynomial in this case is given by

(2.3.1)

Furthermore

1

-1 Z -1

Pn(t)

t

.)1 1 - +

tt

dt = Jo. (1r cos(n

Z -

+ 1)0 cos +

0

cosnf) dO

21r(u+l)

1 - 1

(2.3.2) -(u-u-

1

)u

n

+1' z=2(u+u).

We know that (2.3.3)

K 2 47r2 (al(p) + cos"O)2

I n(z)1

=

p2n+1 [a2(p) - cos20][a2n+1(P) +cos(2n + 1)0]' where

zEr

(2.3.4)

For the detail, we refer to [5].

(11)

THEOREM

3. Hw(t)

=

J~ on (-1,1), then

(2.3.5)

[IKn(z)1 2

I

dz

l

[

87r3(p + p-l)2 47r3(p + p-l )]

:::; (p - p-l ) (p4n+2 + 1) - (p4n+2 - 1) , p> 1.

Proof For Z E r, we get Idzl :::; Hp + p-l) dB, and the L2 bound for the kernel K

n

Setting

t

= e

iO,

we see that dt = itdB and

where C

is

the unit circle, and applying the residue theorem, we get

where Res(j, x) denotes the residue value of f at x.

To calculate the value

",~n+lLJ=l

Res(f

' _p-1w·)J ,

let

t

2n+

1

+ (1)2n+l

p =

(t - Zl)(t - Z2)'" (t - z2n+d, then we have Res(j,

--Wj)

1

p

1

=

g(Zj) ( Zj -

Zl

)

. . .

( Zj - Zj-l) Zj - Zj+l ... Zj - Z2n+l ( ) ( )'

(12)

o

t2n(t+p)(t+~

) where get) = (t_p)(t_~)(t2n+l+p2n+l)'

Since IT. (Zj - Zi) = (2n +

l)zJ~n,

we calculate residue of f at 1<t<2n+1

- ¥j

_!w·p J

in the form

1 1 [(Zj + p)(Zj + ~)]

Res(f, --Wj) =

1 1 .

P (2n + l)(p2nH - p2n+l) (Zj - p)(Zj - p) We have the residue by elementary calculation;

1 (p+~)

Res(f, p)

= -

(p _ ~)(p2nH + p4n-)'

For Zj

= ~Wj

and w;nH = -1, it follows that

2f1 (Zj + p)(Zj + ~)

=

2f1 (Wj + p2)(Wj + 1)

j=1 (Zj - p)(Zj - p) j=1 (Wj - (2)(Wj -1) _ 2L: n

+ 1

[1 a b ] _ 2p2(p2 + 1) b _ 2(1 + p2)

- + W·_p ,.2+ w·-l , a - , . 2 p--l , - I - ,.2'

j=1

J J p

Therefore we get

1 2nH (Zj + p)(Zj +

~)

(2n + 1)(p2nH - p4n-) ~ (Zj - p)(Zj - ~)

1 (p + ~)

- (p2nH - p2!+l) (p -

~)(p2n+1

+ p2!+1) ,

h .

,,2n+l 1

_(2n+1)x2n 2n+1 1

"t'lT

h

ed

were usmg f-Jj=1

Wj-X

=

1+x2n+1

,wj = - . ne ave prov the L2 bound for the kernel K

n

[I K n(z)1 2 I dz l

< 21r2(p+p-1) {27r (al(p) + cos 0)2 dO

- p2nH 10 (a2(p) - cos20)(a2nH(P) + cos(2n + 1)0)

[

81r3(p + p-1)2 41r3(p + p-1 )]

=

(p - p-1 )(p4n+2 + 1) - (p4n+2 - 1) .

(13)

REMARK.

The well-known identity for Jacobi polynomials, 1r$f,a) (z)

= (_l)n1r~a,.B)(z), implies IK,<!,a)(z)1 = IK~a,.B)( -z)1 = IK~a,.B)( -z)l.

Thus for the case a

=

-f3

=

!, we have the same £2 bound (2.3.5) for the kernel K

n .

3. Example

In this section we apply the results in section 2 to obtain the £2 error estimate for Gaussian quadrature.

EXAMPLE.

1)1

-11 2 -

1

t

V [1=t l+t

d

t, II) 1

-11

vT=t2 2-t

dt.

I) We consider wet)

=

J~+: as the Jacobi weight with parameter a = - f3 = !. To bound f on the elliptic contour r, note that

1 1 1

If(z)1

=

12 - zl

S;

2 - Izl

S;

2 - Hp + p-1)"

Therefore we get the error bound in the form

(3.1)

(p _ p-1 )(p4n+2 + 1)

1r(p + p-1) (p4n+2 -1)

where

E=

p+~-l' 1 <

P

< 2 + y'3.

II) We consider w( t)

=

(1-t

2

)! as the Jacobi weight with parameter a = f3 = l and we get the error bound in the form

(3.2) IRn(J) I

S;

.jc

1

E(E)

h -

1

were

E - p+p-l'

1 <

p

< 2 + y'3.

(14)

Table 3.1 (On the ellipse) f(x)

=

2~x' wet)

=

(1- t)! (1 + t)!

n bound rho True error supremum norm

5 5.2100( -5) 3.3984 1.4906( -6) 5.4156( -5) 10 1.9254(-10) 3.5558 2.8436(-12)

15 5.4507(-16) 3.6123 -1.1102(-16) 5.6433(-16)

Table 3.2 (On the ellipse) f(x) = 2~x' wet) = (1- t)!(l + t)-!

n bound rho True error supremum norm

5 1.2187( -4) 3.4066 1.8543( -6) 1.8257( -4) 10 4.4492(-10) 3.5579 3.5374(-12) 6.5903(-10) 15 1.2544(-15) 3.6133 -6.6613(-16) 1.8507(-15)

We have expressed the error bound as a parameter of

p.

Number in parentheses of Table 3.1 and Table 3.2 indicate decimal exponents.

As n incresses, the number

p

approaches to 2 + J3. This

is

due to the nature of weak singularity of denominator factor. And we have compared with the supremum norm(Gautschi and Varga [5]).

References

[1] P. J. Davis, Interpolation and Approximation, Blasidell, New York, 1963.

[2] P. J. Davis and P. Rabinowitz, Methods of numerical integration, Academic Press, New York, 1975.

[3] W. Gautschi, A survey of Gauss-Christoffel quadrature formulae, in E. B.

Christoffel, The Influence of his Work on Mathematics and Physical Sciences, P. L., Butzer and F. Feher, eds., Birkhauser, Basel, 1975, p. 72-147.

[4] W. Gautschi andE.Tychopoulos, A note on the contour integral representation of the remainderterm for a Gauss-Chebyshev quadrature, SIAM. J. Numer.

Anal. 27 (1990), 219-224.

[5] W. Gautschi and R. S. Varga, Error bounds for Gaussian quadrature of analytic functions, SIAM. J. Numer. Anal.20 (1983), 1170-1186.

[6] W. Gautschi and Shikang Li, The remainder term for analytic functions of Gauss-Radau and Gauss-Lobatto quadrature rules with multiple end points, Journal of Computation and Applied Mathematics 33 (1990),315-329.

[7J - - , Gauss-Radau and Gauss-Lobatto quadratures with double end points, Journal of Computation and Applied Mathematics 34 (1991), 343-360.

(15)

[8] C. Martin and M. Stamp, A Note on the Error in Gaussian Quardature, Ap- plied Mathematics And Computation42 (1992), 25-35.

[9] G. Szego, Orthogonal Polynomials, Amer. Math. Soc. Colloq. Pub!., Amer.

Math. Soc., Providence, R. 1., 1975.

Kwan Pyo Ko

Department of Computer Engineering Dongseo University

Pusan 617-716, Korea

E-mail: [email protected] U Jin Choi

Department of Mathematics

Korea Advanced Institute of Science and Technology 373-1 Kusungdong, Yusonggu

Taejon 305-701, Korea

참조

관련 문서

For Practical determination of the inverse A -1 of a nonsingular nxn matrix A, Gauss elimination can be used.. : This method is

For Practical determination of the inverse A -1 of a nonsingular nxn matrix A, Gauss elimination can be used.. : This method is

As long as our deforming path (a continuous deformation of the path of an integral, keeping the end fixed) always contains only points at which f (z) is analytic, the

3 An Analytic Function of Constant Absolute Value Is Constant The Cauchy-Riemann equations also help in deriving general. properties

• The sequences of Gaussian functions play a special role in connection with transforms in the limit.. • The properties which make the Gaussian functions

• Functions of the moral order: facilitates social cohesion, provides a form of social control, offers a set of rules of behavior for which persons are held

1 John Owen, Justification by Faith Alone, in The Works of John Owen, ed. John Bolt, trans. Scott Clark, &#34;Do This and Live: Christ's Active Obedience as the

For the analytic solution, define the subdomain vector in the same way, namely the summation of the fluxes obtained at the same discretized points as the numerical solution.. Do