ACM Home Page
Please provide us with feedback. Feedback
Algorithm 720: An algorithm for adaptive cubature over a collection of 3-dimensional simplices
Full text PdfPdf (747 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 19 ,  Issue 3  (September 1993) table of contents
Pages: 320 - 332  
Year of Publication: 1993
ISSN:0098-3500
Authors
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 50,   Citation Count: 3
Additional Information:

appendices and supplements   abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/155743.155785
What is a DOI?

APPENDICES and SUPPLEMENTS
gZip720.gz (38 KB)
adaptive cubature over a collection of 3-dimensional simplices
Gams: h2b2a1


ABSTRACT

An adaptive algorithm for computing an approximation to the integral of each element in a vector of functions over a 3-dimensional region covered by simplices is presented. The algorithm is encoded in FORTRAN 77. Locally, a cubature formula of degree 8 with 43 points is used to approximate an integral. The local error estimate is based on the same evaluation points. The error estimation procedure tries to decide whether the approximation for each function has asymptotic behavior, and different actions are taken depending on that decision. The simplex with the largest error is subdivided into 8 simplices. The local procedure is then applied to each new region. This procedure is repeated until convergence.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
NAG FORTRAN LIBRARY MANUAL, MARK 10, 1983. The Numerical Algorithm Group, Oxford, U.K.
 
2
BECKERS, M., AND HAEGEMANS, A. The construction of cubature formulae for the tetrahedron. Rep. TW 128, Katholleke Umv. Leuven, Belgium, 1990.
 
3
BERNTSEN, J. Cautious adaptive numerical integration over the 3-cube. Reports in Informatics 17, Dept. of Informatics, Univ. of Bergen, 1985.
 
4
BERNTSEN, J., COOLS, R., AND ESPELID, T O. A test of DCUTET. Reports in Informatics 46, Dept. of Informatms, Univ. of Bergen, 1990.
5
6
7
8
 
9
COWELL, W. R., AND GARBOW, S B Users Guide to Toolpack /1 (Release 2) in a Umx Enmronment Tech. Rep. ANL~87-12, Argonne National Laboratories, 1987.
 
10
DE DONCKER, E New Euler-Maclaurin expansions and their application to quadrature over the s-dimensional Simplex. Math Comput. 33 (1979), 1003-1018,
 
11
ESPELID, T.O. Integratmn rules, null rules and error estimation. Reports in Informatics 33, Dept. of Informatics, Univ. of Bergen, 1988.
 
12
GENZ, A. C., AND MALIK, A. A. An adaptive algorithm for numerical integration over an N-dimensional rectangular region J. Comput. Appl. Math. 6 (1980), 295 302.
 
13
GRUNDM~N, A., A~D MOLLER, H.M. Invariant integration formulas for the n-simplex by combinatorial methods. SIAM J. Numer. Anal. 15 (1978), 282 290.
 
14
L~ESS, J.N. Symmetric mtegratmn rules for hypercubes III. Construction of integration rules using null rules. Math. Comput. 19 (1965), 625 637.
15
 
16
LYNESS, J. N., AND tC~GANOVE, J. J. A technique for comparing automatic quadrature routines. Comput. J. 20 (1977), 170-177
 
17
VAN DOOREN, P., AND DE RIDDER, L. An adaptive algorithm for numerical integration over an N-dimensional cube. J. Comput. Appl. Math. 2 (1976), 207-217.


Collaborative Colleagues:
Jarle Berntsen: colleagues
Ronald Cools: colleagues
Terje O. Espelid: colleagues

Peer to Peer - Readers of this Article have also read: