Take the 2-minute tour ×
Computational Science Stack Exchange is a question and answer site for scientists using computers to solve scientific problems. It's 100% free, no registration required.

We currently use PORTA software to find the list of facet-defining inequalities (FDI) for polytopes that we work with. For certain polytopes, PORTA works fine. But because it is a serial algorithm (uses Fourier-Motzkin) we sometimes encounter cases where the analysis simply takes too long and we have to force the program to stop. We are wondering if there exists a parallel algorithm that would allow us to complete these computations faster? Ideally we would prefer to have exact solutions like PORTA gives; but in lieu of such software programs we would be open to trying a method that may not yield exact results. (And if it matters: our input coordinates are almost always discrete, either 0 or 1.)

share|improve this question

migrated from math.stackexchange.com Jan 30 '13 at 8:22

This question came from our site for people studying math at any level and professionals in related fields.

    
There is a parallel version of fourier motzkin: link.springer.com/chapter/10.1007%2FBFb0024686?LI=true –  Paul Jan 30 '13 at 14:47
    
Thanks Paul--now we just need to find someone to help us write the program! –  cez Jan 31 '13 at 0:16
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.