Error Estimates for the Clenshaw-Curtis Quadrature

Similar documents
Asymptotic Error Estimates for the Gauss Quadrature Formula

A quadrature rule of interpolatory type for Cauchy integrals

SOME IDENTITIES INVOLVING THE FIBONACCI POLYNOMIALS*

On the convergence of interpolatory-type quadrature rules for evaluating Cauchy integrals

w = X ^ = ^ ^, (i*i < ix

Quadrature Formulas for Infinite Integrals

The Evaluation and Estimation of the Coefficients in the Chebyshev Series Expansion of a Function]

27r---./p. IR.(f)l<=,, l(o) max If(z)l. (1.2) o={z" z= 1/2(u + u-1), u p ei, O<- O <-- 2.a }

1. Partial Fraction Expansion All the polynomials in this note are assumed to be complex polynomials.

Ma 530 Power Series II

Numerical Integration (Quadrature) Another application for our interpolation tools!

Scientific Computing

Error estimation in the Clenshaw-Curtis quadrature formula

Comparison of Clenshaw-Curtis and Gauss Quadrature

FINAL EXAM { SOLUTION

INTEGRAL FORMULAS FOR CHEBYSHEV POLYNOMIALS AND THE ERROR TERM OF INTERPOLATORY QUADRATURE FORMULAE FOR ANALYTIC FUNCTIONS

EXTENSIONS OF THE BLOCH PÓLYA THEOREM ON THE NUMBER OF REAL ZEROS OF POLYNOMIALS

By Philip J. Davis. (1.1) // < >jdxdy = w y(pí), i =1,2,...,N.

In numerical analysis quadrature refers to the computation of definite integrals.

ON THE OSCILLATION OF THE DERIVATIVES OF A PERIODIC FUNCTION

Chapter 6: Residue Theory. Introduction. The Residue Theorem. 6.1 The Residue Theorem. 6.2 Trigonometric Integrals Over (0, 2π) Li, Yongzhao

ON A WEIGHTED INTERPOLATION OF FUNCTIONS WITH CIRCULAR MAJORANT

Series methods for integration

Part 3.3 Differentiation Taylor Polynomials

Review of Power Series

THE RAYLEIGH FUNCTION NAND KISHORE

Math 185 Fall 2015, Sample Final Exam Solutions

1 Discussion on multi-valued functions

COURSE Numerical integration of functions

Mathematics of Physics and Engineering II: Homework problems

Physics 307. Mathematical Physics. Luis Anchordoqui. Wednesday, August 31, 16

you expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form

Gegenbauer Matrix Polynomials and Second Order Matrix. differential equations.

III. Consequences of Cauchy s Theorem

Contents. I Basic Methods 13

e x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form

Simultaneous Gaussian quadrature for Angelesco systems

12.0 Properties of orthogonal polynomials

On the Chebyshev quadrature rule of finite part integrals

Exit Criteria for Simpson's Compound Rule*

Department of Mathematics Indian Institute of Technology Hauz Khas, New Delhi India

Some Applications of the Euler-Maclaurin Summation Formula

Numerical Quadrature Rules for Some Infinite Range Integrals

A GENERALIZATION OF STIRLING NUMBERS

Exam TMA4120 MATHEMATICS 4K. Monday , Time:

MATH. 4548, Autumn 15, MWF 12:40 p.m. QUIZ 1 September 4, 2015 PRINT NAME A. Derdzinski Show all work. No calculators. The problem is worth 10 points.

A CHARACTERIZATION OF INNER PRODUCT SPACES

THE FIXED POINT PROPERTY FOR CONTINUA APPROXIMATED FROM WITHIN BY PEANO CONTINUA WITH THIS PROPERTY

Bessel s Equation. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Fall Department of Mathematics

Math 234. What you should know on day one. August 28, You should be able to use general principles like. x = cos t, y = sin t, 0 t π.

Fourth Order RK-Method

Math 421 Midterm 2 review questions

Quantum Field Theory Homework 3 Solution

Math Spring 2014 Solutions to Assignment # 12 Completion Date: Thursday June 12, 2014

Here, logx denotes the natural logarithm of x. Mrsky [7], and later Cheo and Yien [2], proved that iz;.(»)=^io 8 "0(i).

ETNA Kent State University

MATH COMPLEX ANALYSIS. Contents

MA2501 Numerical Methods Spring 2015

FOURIER COEFFICIENTS OF BOUNDED FUNCTIONS 1

13 Maximum Modulus Principle

Math 411, Complex Analysis Definitions, Formulas and Theorems Winter y = sinα

Numerical Quadrature over a Rectangular Domain in Two or More Dimensions

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

Assignment 6, Math 575A

MATH 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.

(1-2) fx\-*f(x)dx = ^^ Z f(x[n)) + R (f), a > - 1,

Math Spring 2014 Solutions to Assignment # 8 Completion Date: Friday May 30, 2014

A note on a construction of J. F. Feinstein

1. DO NOT LIFT THIS COVER PAGE UNTIL INSTRUCTED TO DO SO. Write your student number and name at the top of this page. This test has SIX pages.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

RESEARCH ARTICLE. Spectral Method for Solving The General Form Linear Fredholm Volterra Integro Differential Equations Based on Chebyshev Polynomials

Part II FINAL PART -B

4 Uniform convergence

GAUSS-LAGUERRE AND GAUSS-HERMITE QUADRATURE ON 64, 96 AND 128 NODES

Certain Properties of Pyramidal and. Figúrate Numbers. By M. Wunderlich. It is well known that despite some extensive computation [1], the only two

Error Analysis of the Algorithm for Shifting the Zeros of a Polynomial by Synthetic Division

(4) cn = f f(x)ux)dx (n = 0, 1, 2, ).

A Note on Multiplicity Weight of Nodes of Two Point Taylor Expansion

Second Midterm Exam Name: Practice Problems March 10, 2015

A GENERALIZATION OF A THEOREM OF FENCHEL

Complex Analysis Math 205A, Winter 2014 Final: Solutions

Fourth Week: Lectures 10-12

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Spring Semester 2015

Poles, Residues, and All That

Introduction to Lucas Sequences

Complex Analysis. Travis Dirle. December 4, 2016

AN EXTENSION OF A THEOREM OF NAGANO ON TRANSITIVE LIE ALGEBRAS

ELLIPTIC CURVES AND CRYPTOGRAPHY

ETNA Kent State University

Approximation theory

A Note on Extended Gaussian Quadrature

Numerical integration and differentiation. Unit IV. Numerical Integration and Differentiation. Plan of attack. Numerical integration.

Approximate Integration Formulas for Ellipses

Definitions & Theorems

MATHEMATICS OF COMPUTATION, VOLUME 26, NUMBER 118, APRIL An Algorithm for Computing Logarithms. and Arctangents. By B. C.

Upper Bounds for Partitions into k-th Powers Elementary Methods

AxiOM F. If P is a point of a region R and X is a point distinct from P. THEOREM 2. If, in a space satisfying Axioms 0, 1 and 2, the boundary

2 Complex Functions and the Cauchy-Riemann Equations

Proofs Not Based On POMI

MATH 5640: Fourier Series

Transcription:

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 and they have also discussed the estimation of error of the quadrature formula. Elliott [2] has discussed the estimation of truncation errors in the two Chebyshev series approximations for a function, one based on the practical abscissas and the other on the "classical" abscissas x{ = cos (2i 4- l)ir/(2n + 2), i = 0(l)n. Elliott also obtains asymptotic error estimates for the Lagrangian quadrature formulas based on these two sets of points. Recently, Fraser and Wilson [3] have discussed the estimation of error of the Clenshaw-Curtis quadrature and they give a simple formula for the calculation of the error in terms of the function-values. In the present note we obtain error estimates for the Clenshaw-Curtis quadrature applied to functions analytic on the interval of integration [ 1, 1], We also obtain error estimates for the quadrature formula based on the classical abscissas. 2. The Clenshaw-Curtis Quadrature Formula. Let ^n(x) denote the Lagrangian interpolation polynomial for f(x) at the practical abscissas xt = cos (irr/n), i = 0(l)n, and let ip (x) denote the error of interpolation (1) Ux) = fix) - *n(x). If CO *«(a0 = Bk,nTk(x) k=0 Tk(x) = cos (k arc cos x), Chebyshev polynomial of the first kind of degree k, and the double prime on the summation sign indicates that the first and the last terms are to be halved, then the coefficients Bk,n are given by 2 n " Bk,n = Z-l f\.xp)tk(xif 3) n, r>» II = ~zz f\xi)ti(xp), It ;_o since Tk(xp) = T%(xP), and xt = cos (iir/ri), i = 0(l)n. An elegant method for the evaluation of the coefficients Bk, is described by Clenshaw [4]. Let C be a closed contour enclosing the interval [ 1, 1] in its interior and let f(z) be regular within C. Since the practical abscissas are the zeros of the polynomial Tn+i(x) Tn-i(x), the error \pn(x) of the Lagrange interpolation for f(x) at these abscissas can be expressed by a contour integral (Davis [5, Theorem 3.6.1]) as Received September 29, 1967. 651

652 M. M. CHAWLA U) j, (x) _ IT^iix) - Tn-i(x)] f_/( z)dz {) *nw~ 2«Jc(z-x)[Tn+i 'a - x)[tn+i(z) - Tn-i(z)] for x G [ 1, 1]. If n is even, the integration of (2) gives (5) f f(x)dx ~ f *n(x)dx = " " (~f 2y-. J -i '-i,-o 4/ 1 Substituting for B2j,n from the first of the relations (3), the Clenshaw-Curtis approximate integration formula can be rewritten as (6) /l n i, f(x)dx~ *</(**), _1,_n the weights X, are given by (7) X<*-L 71-7 for 1 = 0(1,n. n «0 4j 1 The error of the Clenshaw-Curtis quadrature formula is given by 1 f \Qt+i(z)- Q*-iiz)] (8) w) = i ux)dx = 1 irijc[tn+i(z) ( j^g - : Tn-i(z)] ff-ffj /«* we have put (9) Qn*iz) = \j[j~rpr- Equation (9) defines Qn*(z) as a single-valued analytic function in the 2-plane with the interval [ 1, 1] deleted. 2.1. The Quadrature Formula Based on the Classical Abscissas. Let $n(x) denote the Lagrange interpolation polynomial for the abscissas x, = cos (2i 4- l)ir/(2n 4-2), i = 0(l)n which are the zeros of Tn+i(x). The computation of the polynomial &n(x) has been discussed in detail by Elliott [2]. To describe the corresponding quadrature formula, let (10) $ (x) = Ak,nTk(x), k=0 the prime on the summation The coefficients Ak n are given by sign indicates that the first term is to be halved. (11) Ak,n = f-7 f(xi)tk(xp) for i = 0(l)n, n -\- 1,-o Xi = cos (2i + l)ir/(2n + 2) for i = 0(l)n. Now, the integration of (10) gives the quadrature formula based on these abscissas as / f(x)dx~ J $n(x)dx a2) "l Z (r \ =* g AkAJ_x T«ix)dx) But

ERROR ESTIMATES FOR CLENSHAW-CURTIS QUADRATURE 653 / Tk(x)dx = 2, if 1 - /eis '-i 1 - A;2 Since n is even, putting k = 2m, we get as) = 0 if 1 fc is even. f mdx^j:^-2^. J-i m-o 4m 1 Substituting for Aim,n from (11), the above approximate integration formula can be put in the alternative form, (14) / fix)dx^jzßifixi), J 1 i=0 the weights ii are given by odd a-\ 2 -r-> ( 2jTij(xi). zw.-, 5) w"îtî5 4/-1 ' î = 0(1)w- Let 4> (x) = f(x) $n(x) denote the error of interpolation for f(x) at the classical abscissas. Then, <t>n(x) may be expressed in terms of a contour integral as na\ a. (,.\ Tn+iix) f fiz)dz (16) ^^-^rt-jciz-x)^^)- The error -/? ($) for the quadrature formula (14) is given by (17) ($) = f 4>n(x)dx =ZL( $Mß- f(z)dz. J-1 TTl > C In+l{Z) 3. A Lemma for Qn*(z). Introduce the ellipse S in the z-plane by z = *({ + r1),? - peie, 0 ^ 0 ^ 27T with foci at 2 = ±1 and whose sum of semiaxes is p (p > 1). We establish the following lemma. Lemma. For z Sp, (is) Qn*(z) = rn~1 Z ^±p, k [n/2] J w/iere < +2a+i = 2(n 4-27c 4- l)/(2n + 2k 4- l)(2k 4-1), [k] = greatest integer S k. Proof. In (9), setting x = cos 6 and transforming (19) Qn*(z) = r1 f _2«Í2 «5ML_ yo i - 2 cos er + r since Tn(cos 6) cos n6. Now, (20) ^[i-2coser14-r2r1=í:^. Ç m-l to the -plane, we get

654 M. M. CHAWLA The last series converges uniformly and absolutely for 0 ^ 6 ^ x and for all ^ P > 1. Substituting (20) in (19), m=l ffím = / 'o cos nd sin möciö 2 2 m n if m n is odd = 0 if m ft is even. The result follows by putting m n = 2k 4-1 and observing that k 3: [ft/2] for n,m = 1,2,3,. From the above lemma we deduce Corollary 1. For z Sp, (2i) Qt+i(z) = r zz ^ r-k k=-[(n-l)/2] p and ast-i»ta = 2(ft 4-2fc)/(2ft 4-2fc + l)(2fc - 1) Corollary 2. iv 2 G SP, 0-Z+l,n+2k ^ 2ft/(2ft + 1) (22) Q*+1(2) - Q*_i(2) = F" Z, and X** = 8ft(ft 4-2fc)/[4(ft 4- k)2 - l][4fc2-1] X*i g 8ft2/(4ft2-1). Proof. Subtracting (18) with n replaced by ft 1 from (21), q*+i(2) - q*_i(2) = r, -3 t C(n-l)/2] Also, _8ft (ft 4-2fc)_ [4(n + k)2 - l](4fc2-1)

ERROR ESTIMATES FOR CLENSHAW-CURTIS QUADRATURE 655 \* < \\ I - 8n hnk = A,o 4ft2-1 4. Error Estimates. We now obtain error estimates for the Clenshaw-Curtis quadrature formula for all functions analytic on [ 1, 1]. Simultaneously, we shall obtain estimates for?»($). Let f(x) be analytic on [ 1, 1]. Then, for some p > 1, f can be continued analytically so as to be single valued and regular in the closure of 8P. In (8), taking the contour to be an ellipse &, we have (9*\ IP <M>M < l Í lq*+l(2) - Q*-l(z)\ /(2)1 \dz\ Now, for ft even, from (22) we have IT % \ln+l(z) ln-l(z)\ (8ft2 Zp~~J \ S p~ik in 1/ k=-(n/2) + l / 8n2 \, and t +1(2) - r,_i(«) -UP (p - p ) all Making use of these results, from (23) we obtain the following theorem. Theorem 1. Let f(x) be analytic on [ 1, 1] and be continuable analytically so as to be single valued and regular in the closure of an ellipse Sp with foci at z = ±1 and whose sum of semiaxes is p (p > 1). Then, for n even, ( 16ft2 \ M(p) ^ ^^Kw^iJ^-w-p-») M(p) = max & \f(z)\ (or equivalently on = p). 4.1. We next obtain an estimate for En(<t>). From (21), we obtain for n even, (25) Now, taking the contour to be an ellipse Sp in (17), we have (26) \Enmè±fmMnmm, K Jzf \In+l\Z)\ Employing (25), we obtain the following theorem from (26). Theorem 2. Let f(x) satisfy the regularity conditions of Theorem 1. Then, for ft eyew,

656 M. M. CHAWLA Remarks, (i) From (24) and (27) it would appear that the estimate for ' ($) is nearly half of that for En(^) for large n and p^> 1. For small values of n and p near 1, the estimate (27) is still less than the estimate (24). (ii) The estimates (24) and (27) obtained for the ellipse will be reasonably reliable for large p, while these estimates are poor if p is near 1. (hi) For fixed n and varying p, a "least conservative" upper bound can be established for these estimates for some p* (1 < p* ;S p). However, observe that if f(z) is entire, p* will be a value of p for which the right side of (24) or (27) is a minimum. 5. Example. We illustrate the error estimate (24) for the Clenshaw-Curtis quadrature for the function f(x) = l/(x 4-4), and compare the estimates obtained with those given by Fraser and Wilson [3]. We select p = 7 for which f(z) = l/(z + 4) is regular within the closed ellipse 87. Now, on 8p, 1/(2)1 S M0 = <4+<l»V-,)fr-<4-<l»"»»- Thus, M (7) = 2.33333347. The estimate (24) for the error of the Clenshaw-Curtis quadrature applied to this function is given by, / w2 \ M(7) The exact value of /ii dx/(4 + x) = 0.5108 2562. Table estimates of ri estimated error actual error Fraser-Wilson 2 0.0042 3456 0.0002 8549 0.0166 6667 4 0.0000 8230 0.0000 0125 0.0002 6882 8 0.0000 00027 0.0000 0000 0.0000 0007 The error estimated by (28) is compared in Table I with the actual error and the estimates given by Fraser and Wilson [3]. Department oí Mathematics Indian Institute of Technology Hauz Khas, New Delhi-29 India 1. C. W. Clenshaw & A. R. Curtis, "A method for numerical integration on an automatic computer," Numer. Math., v. 2, 1960, pp. 197-205. MR 22 #8659. 2. D. Elliott, "Truncation errors in two Chebyshev series approximations," Math. Comp., v. 19, 1965, pp. 234-248. MR 31 #5313. 3. W. Fraser & M. W. Wilson, "Remarks on the Clenshaw-Curtis quadrature scheme," SI AM Rev., v. 8, 1966, pp. 322-327. MR 34 #3784. 4. C. W. Clenshaw, Chebyshev Series for Mathematical Functions, National Physical Laboratory Mathematical Tables, Vol. 5, Department of Scientific and Industrial Research, H. M. S. O., London, 1962. MR 26 #362. 5. P. J. Davis, Interpolation and Approximation, Blaisdell, New York, 1963, pp. 67-68, 311-312. MR 28 #393. I