aboutsummaryrefslogtreecommitdiffhomepage
path: root/Eigen/src/UmfPackSupport
diff options
context:
space:
mode:
authorGravatar Gael Guennebaud <g.gael@free.fr>2011-11-28 16:36:37 +0100
committerGravatar Gael Guennebaud <g.gael@free.fr>2011-11-28 16:36:37 +0100
commitcda397b11775000a7b6da375728ebb851ebec232 (patch)
tree3faea217a46402c4ecda059ea4db4f83ea44ef2f /Eigen/src/UmfPackSupport
parent2d621d235d67f8cab4f6a77ada9db0087bc82234 (diff)
cleanning pass on the sparse modules:
- remove outdated/deprecated code - improve a bit the documentation
Diffstat (limited to 'Eigen/src/UmfPackSupport')
-rw-r--r--Eigen/src/UmfPackSupport/UmfPackSupport.h4
1 files changed, 3 insertions, 1 deletions
diff --git a/Eigen/src/UmfPackSupport/UmfPackSupport.h b/Eigen/src/UmfPackSupport/UmfPackSupport.h
index e41de8337..1ff20acdd 100644
--- a/Eigen/src/UmfPackSupport/UmfPackSupport.h
+++ b/Eigen/src/UmfPackSupport/UmfPackSupport.h
@@ -120,7 +120,8 @@ inline int umfpack_get_determinant(std::complex<double> *Mx, double *Ex, void *N
return umfpack_zi_get_determinant(&mx_real,0,Ex,NumericHandle,User_Info);
}
-/** \brief A sparse LU factorization and solver based on UmfPack
+/** \ingroup UmfPackSupport_Module
+ * \brief A sparse LU factorization and solver based on UmfPack
*
* This class allows to solve for A.X = B sparse linear problems via a LU factorization
* using the UmfPack library. The sparse matrix A must be column-major, squared and full rank.
@@ -128,6 +129,7 @@ inline int umfpack_get_determinant(std::complex<double> *Mx, double *Ex, void *N
*
* \tparam _MatrixType the type of the sparse matrix A, it must be a SparseMatrix<>
*
+ * \sa \ref TutorialSparseDirectSolvers
*/
template<typename _MatrixType>
class UmfPackLU