diff options
| author |  Jitse Niesen <jitse@maths.leeds.ac.uk> | 2013-07-02 14:08:12 +0100 |
|---|---|---|
| committer | Jitse Niesen <jitse@maths.leeds.ac.uk> | 2013-07-02 14:08:12 +0100 |
| commit | 4e458d309c843dbeb91505a2c75f75494512ed47 (patch) | |
| tree | 33e61c9d0fd681e55a115a26a17df9b22cf4cad5 /doc/TutorialSparse.dox | |
| parent | 419b5cff44a6d2cdd3872a809f9dfdfa283f0dc3 (diff) | |
Fix some doxygen errors and warnings.
Diffstat (limited to 'doc/TutorialSparse.dox')
| -rw-r--r-- | doc/TutorialSparse.dox | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/TutorialSparse.dox b/doc/TutorialSparse.dox index 065edbf69..41bae6b5c 100644 --- a/doc/TutorialSparse.dox +++ b/doc/TutorialSparse.dox @@ -2,7 +2,7 @@ namespace Eigen { /** \eigenManualPage TutorialSparse Sparse matrix manipulations -\eigeneigenAutoToc +\eigenAutoToc Manipulating and solving sparse problems involves various modules which are summarized below: @@ -14,7 +14,7 @@ Manipulating and solving sparse problems involves various modules which are summ <td>%Sparse LU factorization to solve general square sparse systems</td></tr> <tr><td>\link SparseQR_Module SparseQR \endlink</td><td>\code #include<Eigen/SparseQR>\endcode </td><td>%Sparse QR factorization for solving sparse linear least-squares problems</td></tr> <tr><td>\link IterativeLinearSolvers_Module IterativeLinearSolvers \endlink</td><td>\code#include <Eigen/IterativeLinearSolvers>\endcode</td><td>Iterative solvers to solve large general linear square problems (including self-adjoint positive definite problems)</td></tr> -<tr><td>\link Sparse_modules Sparse \endlink</td><td>\code#include <Eigen/Sparse>\endcode</td><td>Includes all the above modules</td></tr> +<tr><td>\link Sparse_Module Sparse \endlink</td><td>\code#include <Eigen/Sparse>\endcode</td><td>Includes all the above modules</td></tr> </table> \section TutorialSparseIntro Sparse matrix format |