Efficient integration over polytopes
The integral of a multinomial P(\(\vec x)\) over an N-dimensional polytope is, in principle, an elementary but tedious task. The authors have constructed an algorithm for this. The input comprises the \(K\times (N+1)\) coefficients of K linear constraints, which define the polytope together with the coefficients and corresponding exponent sets which define P(\(\vec x)\). An elegant derivation, using a classical generating function of the recursion on which their algorithm is based, is presented. The authors also show how to reformulate problems in which the constraints are multinomial in such a way that their algorithm may be used. A detailed description of the algorithm is given, together with an analysis of its complexity and an empirical comparison of its efficiency with others. Implementations in FORTRAN and PASCAL are available from the first author.
- An efficient method to integrate polynomials over polytopes and curved solids
- Efficient integration on the hypersphere
- Integration on a convex polytope
- Integration of polynomials over \(n\)-dimensional polyhedra
- Integration of polynomials over n-dimensional linear polyhedra
- Numerical integration using integrals over hyperplane sections of simplices in a triangulation of a polytope
- Algorithm and Software for Integration over a Convex Polyhedron
- Integration of polynomials over linear polyhedra in Euclidean three-dimensional space
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- scientific article; zbMATH DE number 3879192
- Integration of polynomials over \(n\)-dimensional polyhedra
- Integration and optimization of multivariate polynomials by restriction onto a random subspace
- How to integrate a polynomial over a simplex
- scientific article; zbMATH DE number 3879192 (Why is no real title available?)
- Integration over a Polyhedron: An Application of the Fourier-Motzkin Elimination Method
- Algorithm and Software for Integration over a Convex Polyhedron
This page was built for publication: Efficient integration over polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079329)