Skip to content

Fix svd's docstring #51

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
harrigan wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Fix svd's docstring #51

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/clatrix/core.clj
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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.
Expand Down