Skip to main content

An adaptive numerical integration algorithm for simplices

  • Track 8: Numerical Analysis
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 507))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berntsen and T. O. Espelid, Degree 13 Symmetric Quadrature Rules for the Triangle, submitted to BIT, 1989.

    Google Scholar 

  2. 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 

  3. 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 

  4. 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 

  5. P. J. Davis and P. Rabinowitz, Methods of Numerical Integration, Academic Press, New York, 1984.

    MATH  Google Scholar 

  6. E. de Doncker and I. Robinson, An Algorithm for Automatic Integration over a Triangle Using Nonlinear Extrapolation, ACM Trans. Math. Soft., 10(1984), pp. 1–16.

    Article  MATH  Google Scholar 

  7. P. van Dooren and L. de Ridder, An Adaptive Algorithm for Numerical Integration over an N-Dimensional Rectangular Region, J. Comp. Appl. Math. 2(1976), pp. 207–217.

    Article  MATH  Google Scholar 

  8. H. Engels, Numerical Quadrature and Cubature, Academic Press, New York, 1980.

    MATH  Google Scholar 

  9. A. C. Genz and A. A. Malik, An Adaptive Algorithm for Numerical Integration over an N-Dimensional Rectangular Region, J. Comp. Appl. Math., 6(1980), pp. 295–302.

    Article  MATH  Google Scholar 

  10. A. Grundmann and H. M. Möller, Invariant Integration Formulas for the N-Simplex by Combinatorial Methods, SIAM J. Numer. Anal. 15(1978), pp. 282–290.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Haegemans, An Algorithm for Automatic Integration over a Triangle, Computing, 19(1977), pp. 179–187.

    Article  MATH  MathSciNet  Google Scholar 

  12. D. K. Kahaner and O. W. Rechard, TWODQD: An Adaptive Routine for Two-Dimensional Integration, J. Comp. Appl. Math. 17(1987), pp. 215–234.

    Article  MATH  MathSciNet  Google Scholar 

  13. D. K. Kahaner and M. B. Wells, An Experimental Algorithm for N-Dimensional Adaptive Quadrature, ACM Trans. Math. Soft., 5(1979), pp. 86–96.

    Article  MATH  Google Scholar 

  14. P. Keast, Cubature Formulas for the Sphere and Simplex, Department of Computer Science Technical Report 1985CS-2, Univ. of Toronto. J. Inst. Maths. Applics. 23(1979), pp. 251–264.

    MATH  MathSciNet  Google Scholar 

  15. D. P. Laurie, CUBTRI: Automatic Integration over a Triangle, ACM Trans. Math. Soft., 8(1982), pp. 210–218.

    Article  MATH  Google Scholar 

  16. 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 

  17. J. N. Lyness and A. C. Genz, On Simplex Trapezoidal Rule Families, SIAM J. Numer. Anal., 17(1980), pp. 126–147.

    Article  MATH  MathSciNet  Google Scholar 

  18. J. N. Lyness and D. Jesperson, Moderate Degree Symmetric Quadratue Rules for the Triangle J. Inst. Maths. Applics. 15(1975), pp. 19–32.

    MATH  Google Scholar 

  19. 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 

  20. P. Silvester, Symmetric Quadrature Formulas for Simplices, Math. Comp., 24(1970), pp. 95–100.

    Article  MATH  MathSciNet  Google Scholar 

  21. A. H. Stroud, Approximate Calculation of Multiple Integrals, Prentice-Hall, Englewood Cliffs, New Jersey, 1971.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Genz, A. (1991). An adaptive numerical integration algorithm for simplices. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038504

Download citation

  • DOI: https://doi.org/10.1007/BFb0038504

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics