Software for exact integration of polynomials over polyhedra
Authors:
- M. KöppeM. Köppe
- G. PintoGPG. Pinto
- J. WuJWJ. Wu
Open Access
- 23 January 2012
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Communications in Computer Algebra
- Vol. 45 (3/4) , 169-172
Abstract
We are interested in quickly computing the exact value of integrals of polynomial functions over domains that are decomposable into convex polyhedra (e.g., a tetrahedral or cubical mesh decomposition of space). We describe a software implementation, part of the software LattE, and provide benchmark computations.Keywords
This publication has 9 references indexed in Scilit:
- How to integrate a polynomial over a simplexMathematics of Computation, 2010
- (Formulas of Brion, Lawrence, and Varchenko on rational generating functions for cones)The Mathematical Intelligencer, 2008
- On Ehrhart polynomials and probability calculations in voting theorySocial Choice and Welfare, 2007
- A Primal Barvinok Algorithm Based on Irrational DecompositionsSIAM Journal on Discrete Mathematics, 2007
- Algorithm and Software for Integration over a Convex PolyhedronLecture Notes in Computer Science, 2006
- Effective lattice point counting in rational convex polytopesJournal of Symbolic Computation, 2004
- Finding the exact volume of a polyhedronAdvances in Engineering Software, 2003
- Exact Volume Computation for Polytopes: A Practical Study2000
- Polytope volume computationMathematics of Computation, 1991