I have a huge matrix that I suspect is not invertible.

What is the fastest function in mathematica to test it ?

I have remarked that MatrixRank is faster than NullSpace and Det, but is there an even faster method ?

Some precisions : it is a symbolic ~ 700*700 matrix full of number (not variables) that can be rationals.

  • $\begingroup$ I think this may depend on the complexity of your rationals (e.g. size of the denominator). $\endgroup$ – mikado Jul 6 '17 at 19:13
  • 1
    $\begingroup$ Why can't answers given in fast-method-to-check-if-a-matrix-is-singular or in what-is-the-most-efficient-way-to-determine-if-a-matrix-is-invertible be used? $\endgroup$ – Nasser Jul 6 '17 at 19:31
  • $\begingroup$ @Nasser - these don't really deal with finding the rank of an exact matrix using Mathematica $\endgroup$ – mikado Jul 6 '17 at 21:17
  • 1
    $\begingroup$ (The term usually used to describe such matrices is "exact numeric". (2) One can usually safely rule out rank deficiency with approximate methods, e.g. checking that the smallest singular value is not close to zero ("close" being relative to the precision used for the computation). (3) Using exact Det may well be generally the fastest direct method in Mathematica. $\endgroup$ – Daniel Lichtblau Jul 7 '17 at 0:31

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.