Difference between revisions of "ApCoCoA-1:PGBC.ParallelGBC"
From ApCoCoAWiki
| Line 1: | Line 1: | ||
| − | + | Computes a Gröbner Bases over a prime field using the degree reverse lexicographic term ordering in parallel. | |
| + | |||
| + | ==Syntax== | ||
| + | <pre> | ||
| + | $apcocoa/pgbc.ParallelGBC(Polys:LIST,Threads:INT):LIST; | ||
| + | </pre> | ||
| + | |||
| + | ==Description== | ||
| + | This command computed the Gröbner Basis of the ideal generated by <tt>Polys</tt> using the degree reverse lexicographic term ordering. | ||
| + | The computation can be performed in parallel using <tt>Threads</tt> threads, at which the number of threads should be less or equal the | ||
| + | number of processors/cores which are available on the used system. | ||
| + | |||
[[Category:Package_pgbc|{{PAGENAME}}]] | [[Category:Package_pgbc|{{PAGENAME}}]] | ||
Revision as of 16:25, 11 June 2012
Computes a Gröbner Bases over a prime field using the degree reverse lexicographic term ordering in parallel.
Syntax
$apcocoa/pgbc.ParallelGBC(Polys:LIST,Threads:INT):LIST;
Description
This command computed the Gröbner Basis of the ideal generated by Polys using the degree reverse lexicographic term ordering. The computation can be performed in parallel using Threads threads, at which the number of threads should be less or equal the number of processors/cores which are available on the used system.
