An adaptive numerical integration algorithm for simplices
A globally adaptive algorithm for numerical multiple integration over an n-dimensional simplex is described. The algorithm is based on a subdivision strategy that chooses for subdivision at each stage the subregion (of the input simplex) with the largest estimated error. This subregion is divided in half by bisecting an edge. The edge is chosen using information about the smoothness of the integrand. The algorithm uses a degree seven-five integration rule pair for approximate integration and error calculation, and a heap for a subregion data structure. Test results are presented and discussed where the algorithm is used to compute approximations to integrals used for estimation of eigenvalues of a random covariance matrix.
KeywordsAdaptive Algorithm Subdivision Strategy Cubature Formula Integration Rule Automatic Integration
Unable to display preview. Download preview PDF.
- J. Berntsen and T. O. Espelid, Degree 13 Symmetric Quadrature Rules for the Triangle, submitted to BIT, 1989.Google Scholar
- J. Berntsen and T. O. Espelid, An Algorithm for Adaptive Cubature over a Collection of Triangles, Dept. of Inf., Univ. of Bergen, 1989.Google Scholar
- J. Berntsen, T. O. Espelid and A. Genz, An Adaptive Algorithm for the Approximate Calculation of Multiple Integrals, to be published in ACM Trans. Math. Soft..Google Scholar
- J. Berntsen, T. O. Espelid and A. Genz, An Adaptive Multiple Integration Routine for a Vector of Integrals, to be published in ACM Trans. Math. Soft..Google Scholar
- V. Luzar and I. Olkin, Comparison of Simulation Methods in the Estimation of Ordered Characteristic Roots of a Random Covariance Matrix, Stanford University Statistics Preprint, 1989.Google Scholar
- D01PAF: An Automatic Integration Subroutine for Integration over an N-Simplex, Numerical Algorithms Group Limited, Wilkinson House, Jordan Hill Road, Oxford, United Kingdom OX2 8DR.Google Scholar