ACM Home Page
Please provide us with feedback. Feedback
Algorithm 706: DCUTRI: an algorithm for adaptive cubature over a collection of triangles
Full text PdfPdf (782 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 18 ,  Issue 3  (September 1992) table of contents
Pages: 329 - 342  
Year of Publication: 1992
ISSN:0098-3500
Authors
Jarle Berntsen  Institute of Marine Research, Bergen-Nordnes
Terje O. Espelid  University of Bergen
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 56,   Citation Count: 6
Additional Information:

appendices and supplements   abstract   references   cited by   index terms   collaborative colleagues  

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/131766.131772
What is a DOI?

APPENDICES and SUPPLEMENTS
two-dimensional integral over triangulated region
Gams: h2b2a


ABSTRACT

An adaptive algorithm for computing an approximation to the integral of each element in a vector function f(x,y) over a two-dimensional region made up of triangles is presented. A FORTRAN implementation of the algorithm is included. The basic cubature rule used over each triangle is a 37-point symmetric rule of degree 13. Based on the same evaluation points the local error for each element in the approximation vector and for each triangle is computed using a sequence of null rule evaluations. A sophisticated error-estimation procedure tries, in a cautious manner, to decide whether we have asymptotic behavior locally for each function. Different actions are taken depending on that decision, and the procedure takes advantage of the basic rule's polynomial degree when computing the error estimate in the asymptotic case.


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
BERNTSEN, J. Cautious adaptive numerical integration over the 3-cube. Reports in Informatics 17, Dept. of inf., Univ. of Bergen, 1985.
 
2
BERNTSEN, J. TR1TST: A subroutine for evaluating the performance of subroutines for automatic integratmn over triangles. Reports in Informatics 34, Dept of Inf, Univ of Bergen, 1989.
 
3
BERNTSEN, J., AND ESPELID, T.O. A Test of DCUTRI and TWODQD. Reports in Informatics 40, Dept. of Inf., Univ. of Bergen, 1989.
 
4
BERNTSEN, J., AND ESPEL1D, T.O. Degree 13 symmetric quadrature rules for the triangle. Reports in Informatics 44, Dept. of Inf., Univ. of Bergen, 1990.
5
6
7
 
8
COWELL, W. R., AND GARBOW, S B. Users Guide to TooIpack/1 (Release 2) m a Unix Environment. Tech. Rep. ANL-87-12, Argonne National Labs., 1987.
9
 
10
ESPELID. T.O. Integration rules, null rules and error estimation. Reports in Informatics 33, Dept. of Informatics, Univ. of Bergen, 1988.
 
11
HAEGEMANS, A. An algorithm for the automatic integration over a triangle. Cornp~t~lzg 19 (1977), 179 187.
 
12
13
 
14
LYNESS, J.N. Symmetric integration rules for hypercubes III. Construction of integration rules using null rules. Math. Comput. 19 (1965), 625-637.
 
15
LYNESS, J. N., AND JESPERSEN, D. Moderate degree symmetric quadrature rules for the triangle, d. Inst. Math. Appl. 15 (1975), 19-32.
16
 
17
LSXNESS, J. N., AND KAGANOVE, J. J. A technique for comparing automatic quadrature routines. Cornput. d. 20 (1977), 170-177.
 
18
PIESSENS, R., DE DONCKER-KAPENGA E., UBERHUBER, C W., AND KAHANER, D. K. QUAD- PACK, A subroutine package for automatic integration. Series in Computational Math., 1, Springer-Verlag, New York, 1983.
19


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