diff options
author | Gael Guennebaud <g.gael@free.fr> | 2013-06-10 12:13:31 +0200 |
---|---|---|
committer | Gael Guennebaud <g.gael@free.fr> | 2013-06-10 12:13:31 +0200 |
commit | a4a575e2a3d87d70c514eaf08e584cca5942608e (patch) | |
tree | 81c72a12759a4ee13f35ceadf0fab17e0f0e7937 /doc/TutorialSparse.dox | |
parent | 26c35b95c782fa1359812acc8e4de507c223e36f (diff) |
fix bug #597: typo in sparse documentation
Diffstat (limited to 'doc/TutorialSparse.dox')
-rw-r--r-- | doc/TutorialSparse.dox | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/doc/TutorialSparse.dox b/doc/TutorialSparse.dox index 98c9997e1..065edbf69 100644 --- a/doc/TutorialSparse.dox +++ b/doc/TutorialSparse.dox @@ -290,9 +290,9 @@ sm3 = 4 * sm1.adjoint() * sm2; \endcode The second algorithm prunes on the fly the explicit zeros, or the values smaller than a given threshold. It is enabled and controlled through the prune() functions: \code -sm3 = (sm1 * sm2).prune(); // removes numerical zeros -sm3 = (sm1 * sm2).prune(ref); // removes elements much smaller than ref -sm3 = (sm1 * sm2).prune(ref,epsilon); // removes elements smaller than ref*epsilon +sm3 = (sm1 * sm2).pruned(); // removes numerical zeros +sm3 = (sm1 * sm2).pruned(ref); // removes elements much smaller than ref +sm3 = (sm1 * sm2).pruned(ref,epsilon); // removes elements smaller than ref*epsilon \endcode - \b permutations. Finally, permutations can be applied to sparse matrices too: |