Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Cubatures of precision $ 2k$ and $ 2k+1$ for hyperrectangles


Author: Dalton R. Hunkins
Journal: Math. Comp. 29 (1975), 1098-1104
MSC: Primary 65D30
MathSciNet review: 0388738
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: It is well known that integration formulas of precision $ 2k\;(2k + 1)$ for a region in n-space which is a Cartesian product of intervals can be obtained from one-dimensional Radau (Gauss) rules. The number of function evaluations in these product cubatures is $ {(k + 1)^n}$. In this paper, an algorithm is given for obtaining cubatures for hyperrectangles in n-space of precision 2k, in many instances $ 2k + 1$, which uses $ (k + 1){(k)^{n - 1}}$ nodes. The weights and nodes of these new formulas are derived from one-dimensional generalized Radau rules.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65D30

Retrieve articles in all journals with MSC: 65D30


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1975-0388738-X
Keywords: Approximate integration, cubature, hyperrectangles, n-cube, orthogonal polynomials, polynomial precision
Article copyright: © Copyright 1975 American Mathematical Society