From e2a1eef70a200a83f4a1d8198d06fa027c1ac394 Mon Sep 17 00:00:00 2001
From: Martin Harrigan <martinharrigan@gmail.com>
Date: Fri, 16 May 2014 13:42:00 +0100
Subject: [PATCH] Fix svd's docstring

---
 src/clatrix/core.clj | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/clatrix/core.clj b/src/clatrix/core.clj
index 37b4e6c..ceb3622 100644
--- a/src/clatrix/core.clj
+++ b/src/clatrix/core.clj
@@ -1163,7 +1163,7 @@ Uses the same algorithm as java's default Random constructor."
 (defn svd
   "`(svd A)` computes the sparse singular value decomposition of `A`
   returning a map with keys `{:values L :left U :right V}` such that
-  `A = U (diag L) V`. If `(size A)` is `[n m]` and k is (size L),
+  `A = U (diag L) (t V)`. If `(size A)` is `[n m]` and k is (size L),
   we have the size of `U` as `[n k]`, `(diag L)` as `[k k]`, and `(t V)`
   as `[k m]`. Rank is calculated as number of non-zero values in L.
   *eps* constant is used to check if value is zero.