A Laplace transform algorithm for the volume of a convex polytope.

We provide two algorithms for computing the volume of the convex polytope Ω : = {x ∈ ℝn+ | Ax ≤ b}, for A, ∈ ℝm×n, b ∈ ℝn. The computational complexity of both algorithms is essentially described by nm, which makes them especially attractive for large n and relatively small m, when the other methods...

Full description

Bibliographic Details

Published in:	Journal of the ACM 48, 6 (2001).
Main Author:	Lasserre, Jean B.
Format:	Article
Language:	English
Subjects:	Theory of computation. Analysis of algorithms and problem complexity. Numerical algorithms and problems. Computation of transforms (e.g., fast Fourier transform). Mathematics of computing. Numerical analysis. Numerical algorithms. Algorithms.