[Haskell-cafe] low-cost matrix rank?
aruiz at um.es
Fri Apr 24 08:13:54 UTC 2015
If you need a robust numerical computation you can try "rcond" or "rank"
from hmatrix. (It is based on the singular values, I don't know if the
cost is low enough for your application.)
On 24/04/15 00:34, Mike Meyer wrote:
> Noticing that diagrams 1.3 has moved from vector-space to linear, I
> decided to check them both for a function to compute the rank of a
> matrix. Neither seems to have it.
> While I'm doing quite a bit of work with 2 and 3-element vectors, the
> only thing I do with matrices is take their rank, as part of verifying
> that the faces of a polyhedron actually make a polyhedron.
> So I'm looking for a relatively light-weight way of doing so that will
> work with a recent (7.8 or 7.10) ghc release. Or maybe getting such a
> function added to an existing library. Anyone have any suggestions?
More information about the Haskell-Cafe