How to integrate a polynomial over a simplex

DOI10.1090/S0025-5718-2010-02378-6zbMath1216.68120arXiv0809.2083OpenAlexW3104134886MaRDI QIDQ3081285

Michèle Vergne, Matthias Köppe, Jesús A. De Loera, Nicole Berline, M. Welleda Baldoni Silva

Publication date: 7 March 2011

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.2083

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Computational aspects related to convexity (52B55)

Related Items

Numerical reconstruction of convex polytopes from directional moments, Polyhedral omega: a new algorithm for solving linear Diophantine systems, Learning Probabilistic Logic Programs over Continuous Data, Polyhedral star-shaped distributions, On the score sheets of a round-robin football tournament, On moments of a polytope, Symmetric tensor decomposition, Optimization on the Euclidean Unit Sphere, Dense classes of multivariate extreme value distributions, Stable parameterization of continuous and piecewise-linear functions, Multi-collinear splitting kernels for track function evolution, Three Ehrhart quasi-polynomials, Numerical integration of homogeneous functions on convex and nonconvex polygons and polyhedra, Sampling and change of measure for Monte Carlo integration on simplices, On fundamental domains and volumes of hyperbolic Coxeter-Weyl groups, Exploiting polyhedral symmetries in social choice, The computation of generalized Ehrhart series in normaliz, Combinatorial excess intersection, Volume of slices and sections of the simplex in closed form, Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures, INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, Numerical integration of polynomials and discontinuous functions on irregular convex polygons and polyhedrons, Nearly optimal simple explicit MPC controllers with stability and feasibility guarantees, Strange expectations and simultaneous cores, Average weights and power in weighted voting games, The inverse moment problem for convex polytopes, Simple formula for integration of polynomials on a simplex, Computations of volumes and Ehrhart series in four candidates elections, Advanced SMT techniques for weighted model integration, Exploiting Symmetries in Polyhedral Computations, Multiplicities of classical varieties, Moment varieties of measures on polytopes

Uses Software

• CUBPACK
• Maple
• Sums over integral points of a polygon
• adsimp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetric tensor decomposition
• Multivariate splines and polytopes
• Triangulations. Structures for algorithms and applications
• A geometric inequality and the complexity of computing volume
• Counting linear extensions
• Computation of exponential integrals
• Exponential sums and integrals over convex polytopes
• On the Alexander-Hirschowitz theorem
• [https://portal.mardi4nfdi.de/wiki/Publication:3146552 The Multi-Dimensional Version of � b a x p dx]
• Polytope Volume Computation
• Points entiers dans les polyèdres convexes
• On the Complexity of Computing the Volume of a Polyhedron
• On Multivariate B-Splines
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
• Integration over a Polyhedron: An Application of the Fourier-Motzkin Elimination Method
• Lectures on Polytopes
• Lattice points in simple polytopes
• Integration on a convex polytope
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Algorithm 824
• An adaptive numerical cubature algorithm for simplices