Numerical integration of functions with poles near the interval of integration

Abstract An automatic quadrature scheme is presented for approximating integrals of functions that are analytic in the interval of integration but contain pole (or poles) of order 2, i.e., a double pole on the real axis or a complex conjugate pair of double poles, near the interval of integration. The present scheme is based on product integration rules of interpolatory type, using function values of the abscissae only in the interval of integration. The integral is approximated and evaluated by using recurrence relations and some extrapolation method after the smooth part of the integrand is expanded in terms of the Chebyshev polynomials. The fast Fourier transform (FFT) technique is used to generate efficiently the sequence of the finite Chebyshev series expansions until an approximation of the integral satisfying the required tolerance is obtained with an adequate estimate of the error. Numerical examples are included to illustrate the performance of the method.

[1]  Bernard Bialecki,et al.  A modified sinc quadrature rule for functions with poles near the arc of integration , 1989 .

[2]  Avram Sidi,et al.  An algorithm for a generalization of the Richardson extrapolation process , 1987 .

[3]  David Levin,et al.  Development of non-linear transformations for improving convergence of sequences , 1972 .

[4]  G. Monegato.  Quadrature formulas for functions with poles near the interval of integration , 1986 .

[5]  D. Hunter,et al.  A modified Gaussian quadrature rule for integrals involving poles of any order , 1986 .

[6]  Tatsuo Torii,et al.  An automatic quadrature for Cauchy principal value integrals , 1991 .

[7]  T. J. Rivlin.  Chebyshev polynomials : from approximation theory to algebra and number theory , 1990 .

[8]  Walter Gautschi,et al.  Error Bounds for Gaussian Quadrature of Analytic Functions , 1983 .

[9]  Tatsuo Torii,et al.  Hilbert and Hadamard transforms by generalized Chebyshev expansion , 1994 .

[10]  Walter Van Assche,et al.  Quadrature formulas based on rational interpolation , 1993, math/9307221.

[11]  F. G. Lether.  Subtracting out complex singularities in numerical integration , 1977 .

[12]  David Elliott,et al.  Truncation Errors in Two Chebyshev Series Approximations , 1965 .

[13]  Tatsuo Torii,et al.  Generalized Chebyshev interpolation and its application to automatic quadrature , 1983 .

[14]  R. Piessens,et al.  An extension of Clenshaw-Curtis quadrature , 1975 .

[15]  Avram Sidi,et al.  An algorithm for a special case of a generalization of the Richardson extrapolation process , 1982 .

[16]  W. Morven Gentleman,et al.  Implementing Clenshaw-Curtis quadrature, II computing the cosine transformation , 1972, Commun. ACM.

[17]  C. W. Clenshaw,et al.  A method for numerical integration on an automatic computer , 1960 .

[18]  Tatsuo Torii,et al.  An algorithm based on the FFT for a generalized Chebyshev interpolation , 1990 .

[19]  Philip Rabinowitz,et al.  Methods of Numerical Integration , 1985 .

[20]  David Levin,et al.  Two New Classes of Nonlinear Transformations for Accelerating the Convergence of Infinite Integrals and Series , 1981 .

[21]  F. Lether.  Modified quadrature formulas for functions with nearby poles , 1977 .

[22]  T. Hasegawa,et al.  Numerical Integration of Nearly Singular Functions , 1993 .

[23]  E. Wagner.  International Series of Numerical Mathematics , 1963 .

[24]  T. Hasegawa,et al.  Applications of a modified FFT to product type integration , 1991 .

[25]  Giovanni Monegato,et al.  Product formulas for Fredholm integral equations with rational kernel functions , 1988 .