Multidimensional quadrature algorithms

33Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper provides an overview of some basic concepts behind multidimensional quadrature algorithm. They are illustrated with two selected algorithms, together with some specific examples. For certain application this algorithm provides a powerful alternative to costly product rules and slowly convergent Monte-Carlo methods. These rules are based upon intergrands that can be approximated as a series of low-order polynomials.

Cite

CITATION STYLE

APA

Keister, B. D. (1996). Multidimensional quadrature algorithms. Computers in Physics, 10(2), 119–122. https://doi.org/10.1063/1.168565

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