A new algorithm for the volume of a convex polytope
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2001
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911217254137856 |
|---|---|
| author | Lasserre, J. B. Zeron, E. S. |
| author_facet | Lasserre, J. B. Zeron, E. S. |
| contents | We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them especially attractive for large n and relatively small m when the other methods with O(m^n) complexity fail. The methodology which differs from previous existing methods uses a Laplace transform technique that is well-suited to the half-space representation of the polytope. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_math_0106168 |
| institution | arXiv |
| publishDate | 2001 |
| record_format | arxiv |
| spellingShingle | A new algorithm for the volume of a convex polytope Lasserre, J. B. Zeron, E. S. Numerical Analysis 51M20, 26B15 (Primary) 51M25, 52B11 (Secondary) We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them especially attractive for large n and relatively small m when the other methods with O(m^n) complexity fail. The methodology which differs from previous existing methods uses a Laplace transform technique that is well-suited to the half-space representation of the polytope. |
| title | A new algorithm for the volume of a convex polytope |
| topic | Numerical Analysis 51M20, 26B15 (Primary) 51M25, 52B11 (Secondary) |
| url | https://arxiv.org/abs/math/0106168 |