Title: An adaptive numerical cubature algorithm for simplices
Authors: Genz, Alan *
Cools, Ronald * # ×
Issue Date: Sep-2003
Publisher: Association for Computing Machinery
Series Title: ACM transactions on mathematical software vol:29 issue:3 pages:297-308
Abstract: A globally adaptive algorithm for numerical cubature of a vector of functions over a collection of n-dimensional simplices is described. The algorithm is based on a subdivision strategy that chooses for subdivision at each stage the subregion ( of the input simplices) with the largest estimated error. This subregion is divided into two, three or four equal volume subregions by cutting selected edges. These edges are selected using information about the smoothness of the integrands in the edge directions. The algorithm allows a choice from several embedded cubature rule sequences for approximate integration and error estimation. A Fortran 95 implementation as a part of CUBPACK is also discussed. Testing of the algorithm is described.
ISSN: 0098-3500
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Numerical Analysis and Applied Mathematics Section
* (joint) first author
× corresponding author
# (joint) last author

Files in This Item:

There are no files associated with this item.

Request a copy


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science