A quick aside about matrices. Every dense matrix algorithm is measured by the number of rows (n). LU factorization is O(n^3), as is QR. If memory serves, Eigenvalues are usually O(n^2). Determinants are O(n^3), too. These estimates change if the matrix is banded, they usually become O(n).
The point is, mathematicians care about the number of rows. I'd recommend that. Sean On Nov 17, 10:09 am, Stuart Sierra <the.stuart.sie...@gmail.com> wrote: > On Nov 16, 11:57 am, Jonas Enlund <jonas.enl...@gmail.com> wrote: > > > I made count return the number of rows because that way (count > > a-matrix) == (count (seq a-matrix)). I don't know if it's the right > > thing to do, maybe rows*cols would make more sense. > > Good point. I don't know which is better. > -SS -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
