next | previous | forward | backward | up | top | index | toc | Macaulay2 website
MinimalPrimes :: Hybrid

Hybrid -- the class of lists encapsulating hybrid strategies

Description

This class is used to encapsulate hybrid strategies for certain method functions.

This example demonstrates an example of what is meant by a hybrid strategy.

i1 : debug MinimalPrimes
i2 : R = ZZ/101[w..z];
i3 : I = ideal(w*x^2-42*y*z, x^6+12*w*y+x^3*z, w^2-47*x^4*z-47*x*z^2);

o3 : Ideal of R
i4 : elapsedTime minimalPrimes(ideal I_*, Strategy => Hybrid{Linear,Birational,Factorization,DecomposeMonomials}, Verbosity => 2);
  Strategy: Linear            (time .00154501)  #primes = 0 #prunedViaCodim = 0
  Strategy: Birational        (time .0157737)  #primes = 0 #prunedViaCodim = 0
  Strategy: Factorization     (time .000871605)  #primes = 0 #prunedViaCodim = 0
  Strategy: DecomposeMonomials -- Converting annotated ideals to ideals and selecting minimal primes...
 --  Time taken : .00111551
 -- 0.0319433 seconds elapsed
(time .000024247)  #primes = 1 #prunedViaCodim = 0

See also

For the programmer

The object Hybrid is a self initializing type, with ancestor classes List < VisibleList < BasicList < Thing.