Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: Parallel computation

Sortuj według:

Ogranicz wyniki do:

An algorithm for primary decomposition in polynomial rings over the integers

100%

Pfister G., Sadiq A., Steidel S.

Open Mathematics

2011

tom 9

nr 4

897-904

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals, resp. over finite fields, and the idea of Shimoyama-Yokoyama, resp. Eisenbud-Hunecke-Vasconcelos, to extract primary ideals from pseudo-primary ideals. A parallelized version of the algorithm is implemented in Singular. Examples and timings are given at the end of the article.

Ograniczanie wyników

1 Open Mathematics

1 Pfister G.

1 Sadiq A.

1 Steidel S.

1 2011

Wyniki wyszukiwania

An algorithm for primary decomposition in polynomial rings over the integers