Consider a large sparse rectangular integer matrix. Is there a way to compute its exact rank that is better in terms of speed and/or memory usage compared to a dense matrix?
$\begingroup$
$\endgroup$
1
-
$\begingroup$ I think there are techniques using the so-called block Wiedemann approach. This paper may be relevant and/or contain relevant references. I do not know the literature on this subject very well, so this may also not be the most relevant paper. $\endgroup$– BrunoApr 13, 2021 at 16:44
Add a comment
|