Quadrature methods based on complex function values

Author:
J. N. Lyness

Journal:
Math. Comp. **23** (1969), 601-619

MSC:
Primary 65.55

DOI:
https://doi.org/10.1090/S0025-5718-1969-0247771-6

MathSciNet review:
0247771

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: A method of numerical quadrature over a finite interval is described. This method is applicable if the integrand is an analytic function, regular within the circle in the complex plane having the integration interval as diameter. The method is iterative in nature and relies on function values at equally spaced points on this circle. It is flexible enough to take into account certain simple nonanalytic singularities in the integrand lying on the interval of integration or its extension.

Numerical examples are given which illustrate various advantages and disadvantages of this method when compared with standard quadrature procedures.

**[1]**F. L. Bauer, "Algorithm 60; Romberg Integration,"*Comm. Assoc. Comput. Mach.*, v. 4, 1961, p. 255; ibid., v. 5, 1962, p. 168.**[2]**F. L. Bauer, H. Rutishauser, and E. Stiefel,*New aspects in numerical quadrature*, Proc. Sympos. Appl. Math., Vol. XV, Amer. Math. Soc., Providence, R.I., 1963, pp. 199–218. MR**0174177****[3]**Garrett Birkhoff and David Young,*Numerical quadrature of analytic and harmonic functions*, J. Math. Physics**29**(1950), 217–221. MR**0038728****[4]**E. Eisner,*Numerical integration of a function that has a pole*, Comm. ACM**10**(1967), 239–243. MR**0246509**, https://doi.org/10.1145/363242.363271**[5]**E. Eisner,*Numerical integration of a function that has a pole*, Comm. ACM**10**(1967), 239–243. MR**0246509**, https://doi.org/10.1145/363242.363271**[6]**T. Håvie, "On a modification of Romberg's algorithm,"*Nordisk Tidskr. Informations-Behandling*, v. 6, 1966, pp. 24-30. MR**33**#3460.**[7]**W. M. McKeeman, "Algorithm 145; adaptive numerical integration by Simpson's rule,"*Comm. Assoc. Comput. Mach.*, v. 5, 1962, p. 604.**[8]**W. M. McKeeman, "Certification of algorithm 145; adaptive numerical integration by Simpson's rule,"*Comm. Assoc. Comput. Mach.*, v. 6, 1963, pp. 167-168.**[9]**John McNamee,*Error-bounds for the evaluation of integrals by the Euler-Maclaurin formula and by Gauss-type formulae*, Math. Comp.**18**(1964), 368–381. MR**0185804**, https://doi.org/10.1090/S0025-5718-1964-0185804-1**[10]**E. Eisner,*Numerical integration of a function that has a pole*, Comm. ACM**10**(1967), 239–243. MR**0246509**, https://doi.org/10.1145/363242.363271**[11]**A. H. Stroud,*Error estimates for Romberg quadrature*, J. Soc. Indust. Appl. Math. Ser. B Numer. Anal.**2**(1965), 480–488. MR**0201072****[12]**Philip J. Davis and Philip Rabinowitz,*Numerical integration*, Blaisdell Publishing Co. Ginn and Co., Waltham, Mass.-Toronto, Ont.-London, 1967. MR**0211604****[13]**Vladimir Ivanovich Krylov,*Approximate calculation of integrals*, Translated by Arthur H. Stroud, The Macmillan Co., New York-London, 1962, 1962. MR**0144464**

Retrieve articles in *Mathematics of Computation*
with MSC:
65.55

Retrieve articles in all journals with MSC: 65.55

Additional Information

DOI:
https://doi.org/10.1090/S0025-5718-1969-0247771-6

Article copyright:
© Copyright 1969
American Mathematical Society