2020-08-13 18:45:20 +0200 | received badge | ● Popular Question (source) |

2017-03-09 17:33:59 +0200 | commented question | Parallelizing Polyhedral volume computation Does latte integrale scale to 300 dimensions? |

2017-03-08 23:46:02 +0200 | received badge | ● Student (source) |

2017-03-08 13:47:39 +0200 | asked a question | Parallelizing Polyhedral volume computation For an application, I need to compute volumes of convex polytopes of dimension of about 300. The polytopes of interest have a restricted form: $$ P:={ (x_1,x_2,\ldots,x_n) } ~\text{with} \ 0\leq x_i\leq x_{i+1} \leq L,\ l\leq x_i - x_{i+1} \leq u $$ where $L,u,l$ are known positive constants. On my laptop, the polytope volume computation routine takes about 3 hours to compute for $n=9$, and freezes for larger $n$, making it useless for most interesting cases of my application.
Perhaps by a straightforward use of the [multiprocessing] module, when running on a cluster ? A more advanced use case, which also arises in my application, lies in computing integrals over the polytope: $\int_{P} f(\mathbf{x}) d\mathbf{x}$, where $f$ is a symmetric function of its arguments. I would greatly be interested in techniques that extend to this case as well. |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.