I = recursiveMinors(n, M, Threads=>t, MinorsCache=>b)
Given a matrix $M$, this computes the ideal of determinants of size $n \times n$ submatrices. The recursiveMinors function uses a recursive strategy, keeping track of the smaller minors computed so far, unlike the built-in Cofactor strategy for minors
|
|
|
|
|
The object recursiveMinors is a method function with options.