Exit criteria for Simpson’s compound rule
HTML articles powered by AMS MathViewer
- by J. H. Rowland and Y. L. Varol PDF
- Math. Comp. 26 (1972), 699-703 Request permission
Abstract:
In many automated numerical algorithms, the calculations are stopped when the difference between two successive approximations is less than a preassigned tolerance. The dependability of this procedure for Simpson’s compound rule has been investigated. Classes of functions have been determined for which the above criterion is (a) always valid, and (b) asymptotically valid. A new exit rule is proposed which appears to be less conservative than the standard technique.References
- Milton Abramowitz and Irene A. Stegun, Handbook of mathematical functions with formulas, graphs, and mathematical tables, National Bureau of Standards Applied Mathematics Series, No. 55, U. S. Government Printing Office, Washington, D.C., 1964. For sale by the Superintendent of Documents. MR 0167642
- C. W. Clenshaw and A. R. Curtis, A method for numerical integration on an automatic computer, Numer. Math. 2 (1960), 197–205. MR 117885, DOI 10.1007/BF01386223
- Philip J. Davis and Philip Rabinowitz, Numerical integration, Blaisdell Publishing Co. [Ginn and Co.], Waltham, Mass.-Toronto, Ont.-London, 1967. MR 0211604 K. Knopp, Theory and Application of Infinite Series, Blackie, London, 1947.
- J. N. Lyness, Notes on the adaptive Simpson quadrature routine, J. Assoc. Comput. Mach. 16 (1969), 483–495. MR 240981, DOI 10.1145/321526.321537 J. N. Lyness, “The effect of inadequate convergence criteria in automatic routines,” Comput. J., v. 12, 1969, pp. 179-281. Y. L. Varol, Exit Criteria for Some Numerical Algorithms, Ph.D. Thesis, University of Wyoming, Laramie, 1971.
Additional Information
- © Copyright 1972 American Mathematical Society
- Journal: Math. Comp. 26 (1972), 699-703
- MSC: Primary 65D30
- DOI: https://doi.org/10.1090/S0025-5718-1972-0341823-8
- MathSciNet review: 0341823