Ask Your Question

How to solve inequalities with parallel processing?

asked 2022-09-17 13:29:06 +0200

george26 gravatar image

I have a set of inequalities (around 15) and solve_ineq() function is taking very long to solve it. Are there any other functions which can use multiprocessing to compute them faster?

edit retag flag offensive close merge delete

1 Answer

Sort by ยป oldest newest most voted

answered 2022-09-17 22:00:03 +0200

tmonteil gravatar image

updated 2022-09-18 10:15:08 +0200

You can try defining the polytope of the set of points satisfying all inequalities. For this, you can have a look at the Polyhedron constructor as follows:

sage: Polyhedron?

If P is the polyhedron you constructed, you can try to find an element with the .an_element() method.

You can have a look at the backend option for the Polyhedron constructor, there is cdd, normaliz, polymake, ppl, so perhaps one of them implements parallel algorithms (however, it is likely that without parallelism, those backends will be faster than the symbolic solver behind solve_ineq).

Do not hesitate to ask from more details by explaining what you tried so far.

edit flag offensive delete link more


Normaliz does support multithreading.

Max Alekseyev gravatar imageMax Alekseyev ( 2022-09-18 14:55:38 +0200 )edit

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools


Asked: 2022-09-17 13:29:06 +0200

Seen: 118 times

Last updated: Sep 18 '22