[SciPy-Dev] ENH: Add structural rank to sparse.csgraph

[Ralf Gommers]

On Fri, Oct 14, 2016 at 6:56 AM, Paul Nation <nonhermitian at gmail.com> wrote:

> Greetings,
>
> I was recently looking for a quick way to find out if a given sparse
> matrix is singular.  As it turns out the solution is to calculate the
> structural rank (an upper bound on the numerical rank) of the sparsity
> pattern associated with the matrix:
>
> http://www.mathworks.com/help/matlab/ref/sprank.html
>
> http://www.cise.ufl.edu/research/sparse/matrices/legend.html
>
>

> Since this calculation is done via the maximum bipartite matching
> algorithm that I added to sparse.csgraph some time ago, I thought it would
> be a nice addition to include this straightforward structural rank
> calculation.
>
> The Pull for this feature is here: https://github.com/
> scipy/scipy/pull/6680
>

Thanks Paul. It looks like a nice addition. There's a reasonable amount of
use in the literature, and the implementation is straightforward. So +1
from me.

Cheers,
Ralf
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/scipy-dev/attachments/20161023/07da72fa/attachment.html>