On iterated numerical integration

8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We revisit the iterated numerical integration method and show that it is extremely efficient in solving certain classes of problems. A multidimensional integral can be approximated by a combination of lower-dimensional or one-dimensional adaptive methods iteratively. When an integrand contains sharp ridges which are not parallel with any axis, iterated methods often outperform adaptive cubature methods in low dimensions. We use examples to support our analysis. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Li, S., De Doncker, E., & Kaugars, K. (2005). On iterated numerical integration. In Lecture Notes in Computer Science (Vol. 3514, pp. 123–130). Springer Verlag. https://doi.org/10.1007/11428831_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free