How to integrate a polynomial over a simplex

Mathematics of Computation

Volumn 80, Issue 273, 2010, Pages 297-325

  Baldoni, Velleda ^a   Berline, Nicole ^b   de Loera, Jesus A ^c   Köppe, Matthias ^c   Vergne, Michèle ^d  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b CENTRE DE MATHÉMATIQUES LAURENT SCHWARTZ   (France)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d INSTITUT DE MATHÉMATIQUES DE JUSSIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78649382949     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-2010-02378-6     Document Type: Article

References (41)

1. J. Alexander and A. Hirschowitz, Polynomial interpolation in several variables, J. Algebraic Geom. 4 (1995), 201-222.
2. V. Baldoni, N. Berline, J. A. De Loera, M. Köppe, and M. Vergne, Maple programs accompanying the manuscript How to integrate a polynomial over a simplex, http://www.math.ucdavis.edu/~mkoeppe/art/pisa-integration-experiments/, 2008.
3. A. I. Barvinok, Computation of exponential integrals, Zap. Nauchn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) Teor. Slozhn. Vychisl. 5 (1991), 149-162, 175-176
4. translation in J. Math. Sci. 70 (1994), no. 4, 1934-1943.
5. A. I. Barvinok, Exponential integrals and sums over convex polyhedra (in Russian), Funktsional. Anal. i Prilozhen. 26 (1992), no. 2, 64-66
6. translated in Funct. Anal. Appl. 26 (1992), no. 2, pp. 127-129.
7. A. I. Barvinok, Partition functions in optimization and computational problems, Algebra i Analiz 4 (1992), 3-53
8. translation in St. Petersburg Math. J. 4 (1993), no. 1, pp. 1-49.
9. N. Berline and M. Vergne, Local Euler-Maclaurin formula for polytopes, Moscow Math. J. 7 (2007), 355-386.
10. N. Berline and M. Vergne Local Euler-Maclaurin expansion of Barvinok valuations and Ehrhart coefficients of rational polytopes, Contemporary Mathematics 452 (2008), 15-33.
11. N. Berline, E. Getzler, and M. Vergne, Heat kernels and Dirac operators, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 298, Springer-Verlag, Berlin, 1992.
12. A. T. Bharucha-Reid and M. Sambandham, Random polynomials, Academic Press, Orlando, Florida, 1986.
13. J. Brachat, P. Comon, B. Mourrain, and E. Tsigaridas, Symmetric tensor decomposition, arXiv: 0901.3706v2 [cs.SC], 2009.
14. M. C. Brambilla and G. Ottaviani, On the Alexander-Hirschowitz theorem, e-print arXiv: math.AG/0701409v2, 2007.
15. G. Brightwell and P. Winkler, Counting linear extensions, Order 8 (1991), no. 3, 225-242.
16. M. Brion, Points entiers dans les polyédres convexes, Ann. Sci. École Norm. Sup. 21 (1988), no. 4, 653-663.
17. M. Brion and M. Vergne, Lattice points in simple polytopes, J. Amer. Math. Soc. 10 (1997), no. 2, 371-392.
18. P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic complexity theory, Grundlehren der mathematischen Wissenschaften, no. 315, Springer, Berlin, 1997.
19. R. Cools and A. Haegemans, Algorithm 824: CUBPACK: a package for automatic cubature; framework description., ACM Trans. Math. Software 29 (2003), no. 3, 287-296.
20. W. Dahmen, On multivariate B-splines, SIAM J. Numer. Anal. 17 (1980), no. 2, 179-191.
21. J. A. De Loera, J. Rambau, and F. Santos, Triangulations: Structures for algorithms and applications, Algorithms and Computation in Mathematics, vol. 25, Springer-Verlag, Berlin 2010.
22. M. E. Dyer and A. M. Frieze, On the complexity of computing the volume of a polyhedron, SIAM J. Comput. 17 (1988), no. 5, 967-974.
23. G. Elekes, A geometric inequality and the complexity of computing volume, Discrete Comput. Geom. 1 (1986), no. 4, 289-292.
24. M. R. Garey and D. S. Johnson, Computers and intractibility: A guide to the theory of NP-completeness, W. H. Freeman and Co., San Francisco, California, 1979.
25. A. Genz and R. Cools, An adaptive numerical cubature algorithm for simplices, ACMTrans. Math. Software 29 (2003), no. 3, 297-308.
26. A. Grundmann and H. M. Möller, Invariant integration formulas for the n-simplex by combinatorial methods, SIAM J. Numer. Anal. 15 (1978), 282-290.
27. R. Kannan and A. Bachem, Polynomial algorithms for integration formulas for the n-simplex by combinatorial methods, Scomputing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput. 8 (1979), no. 4, 499-507.
28. L. Khachiyan, Complexity of polytope volume computation, New trends in discrete and computational geometry, Algorithms Combin., vol. 10, Springer, Berlin, 1993, pp. 91-101.
29. J. B. Lasserre, Integration on a convex polytope, Proceedings of the AMS 126 (1998), no. 8, 2433-2441.
30. J. B. Lasserre and K. Avrachenkov, The multidimensional version of American Mathematical Monthly 108 (2001), no. 2, 151-154.
31. M. Laurent, Sums of squares, moment matrices, and optimization over polynomials, In "Emerging applications of algebraic geometry" (Minneapolis, Minnesota) (M. Putinar and S. Sullivant, eds.), IMA volumes in Mathematics and its Applications, 2008.
32. J. Lawrence, Polytope volume computation, Math. Comp. 57 (1991), no. 195, 259-271.
33. S. Lin, B. Sturmfels, and Z. Xu, Marginal likelihood integrals for mixtures of independence models, J. Mach. Learn. Res. 10 (2009), 1611-1631.
34. G. Matera, Integration of multivariate rational functions given by straight-line programs, Proceedings of the 11th international symposium on applied algebra, algebraic algorithms and error-correcting codes (London), Lecture Notes in Computer Science, vol. 948, Springer, 1995, pp. 347-364.
35. C. A. Micchelli, Mathematical aspects of geometric modeling, CBMS-NSF Regional Conference Series in Applied Mathematics, vol. 65, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1995.
36. T. S. Motzkin and E. G. Straus, Maxima for graphs and a new proof of a theorem of Turán, Canadian Journal of Mathematics 17 (1965), 533-540.
37. L. Rademacher, Approximating the centroid is hard, Proceedings of 23th annual ACM Symposium of Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, 2007, pp. 302-305.
38. M. Schechter, Integration over a polyhedron: An application of the Fourier-Motzkin elimination method, American Mathematical Monthly 105 (1998), no. 3, 246-251.
39. Z. Xu, Multivariate splines and polytopes, arXiv: 0806.1127v3, 2009.
40. G. M. Ziegler, Lectures on polytopes, Graduate texts in Mathematics, no. 152, Springer, New York, 1995.
41. O. C. Zienkiewicz and R. L. Taylor, The finite element method, McGraw-Hill, London, 1988.