Decomposing solution sets of polynomial systems: a new parallel monodromy breakup algorithm
by Anton Leykin, Jan Verschelde
International Journal of Computational Science and Engineering (IJCSE), Vol. 4, No. 2, 2009

Abstract: Our problem is to decompose a positive dimensional solution set of a polynomial system into irreducible components. This solution set is represented by a witness set, which can be partitioned into irreducible subsets according to the action of monodromy. Our straightforward parallel version of the original monodromy breakup algorithm suffers from synchronisation issues. The new approach not only resolves these issues, but also, according to accumulated statistics, reduces the expected number of homotopy continuation paths tracked. The latter property gives a faster serial algorithm.

Online publication date: Sun, 12-Jul-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com