Abstract
The fundamental theorem of calculus suggests the following approach to the calculation of definite integrals: one determines an antiderivative F of the integrand f and computes from that the value of the integral. In practice, however, it is difficult and often even impossible to find an antiderivative F as a combination of elementary functions. Apart from that, antiderivatives can also be fairly complex, as the example ∫x 100sin x dx shows. Finally, in concrete applications the integrand is often given numerically and not by an explicit formula. In all these cases one reverts to numerical methods. In this chapter the basic concepts of numerical integration (quadrature formulae and their order) are introduced and explained. By means of instructive examples we analyse the achievable accuracy for the Gaussian quadrature formulae and the required computational effort.
Notes
- 1.
T. Simpson, 1710–1761.
References
Further Reading
A. Quarteroni, R. Sacco, F. Saleri: Numerical Mathematics. Springer, New York 2000.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag London Limited
About this chapter
Cite this chapter
Oberguggenberger, M., Ostermann, A. (2011). Numerical Integration. In: Analysis for Computer Scientists. Undergraduate Topics in Computer Science. Springer, London. https://doi.org/10.1007/978-0-85729-446-3_13
Download citation
DOI: https://doi.org/10.1007/978-0-85729-446-3_13
Publisher Name: Springer, London
Print ISBN: 978-0-85729-445-6
Online ISBN: 978-0-85729-446-3
eBook Packages: Computer ScienceComputer Science (R0)