SVD(...,DivideConquer=>...) -- whether to use the LAPACK divide and conquer SVD algorithm

Description

For large matrices, this algorithm is often much faster.

i1 : M = random(RR^200, RR^200);

                200         200
o1 : Matrix RR      <-- RR
              53          53

i2 : time SVD(M);
 -- used 0.0513891s (cpu); 0.0134989s (thread); 0s (gc)

i3 : time SVD(M, DivideConquer=>true);
 -- used 0.0515717s (cpu); 0.0128936s (thread); 0s (gc)

SVD(...,DivideConquer=>...) -- whether to use the LAPACK divide and conquer SVD algorithm

The source of this document is in /__w/M2/M2/macaulay2-1.26.05+ds/M2/Macaulay2/packages/Macaulay2Doc/functions/SVD-doc.m2:66:0.