recursiveMinors -- uses a recursive cofactor algorithm to compute the ideal of minors of a matrix

Synopsis

• Usage:

  I = recursiveMinors(n, M, Threads=>t, MinorsCache=>b)

• Inputs:
  • n, an integer, the size of minors to compute
  • M, a matrix,
  • t, an integer, an optional input, which describes the number of threads to uses
  • b, a Boolean value, an optional input, which says whether to cache in input
• Optional inputs:
  • MinorsCache => ..., default value true
  • Threads => ..., default value 0
  • Verbose => ..., default value false
• Outputs:
  • I, an ideal, the ideal of minors of M

Description

i1 : R = QQ[x,y];

i2 : M = random(R^{5,5,5,5,5,5}, R^7);

             6      7
o2 : Matrix R  <-- R

i3 : time I2 = recursiveMinors(4, M, Threads=>0);
 -- used 0.787466s (cpu); 0.78787s (thread); 0s (gc)

o3 : Ideal of R

i4 : time I1 = minors(4, M, Strategy=>Cofactor);
 -- used 2.38863s (cpu); 2.16812s (thread); 0s (gc)

o4 : Ideal of R

i5 : I1 == I2

o5 = true

See also

• minors -- ideal generated by minors