diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2015-10-08 10:50:39 +0200 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2015-10-08 10:50:39 +0200 |
| commit | 64242b8bf367752df4d28170cbbb6b86037ff988 (patch) | |
| tree | 20d60f6db4211b7af0227058f5b5864b9a8879ec /Eigen/src/IterativeLinearSolvers/IncompleteLUT.h | |
| parent | 131db3c552304e1fa2c9438ec71a99ef32eea54e (diff) | |
Doc: add link to doc of sparse solver concept
Diffstat (limited to 'Eigen/src/IterativeLinearSolvers/IncompleteLUT.h')
| -rw-r--r-- | Eigen/src/IterativeLinearSolvers/IncompleteLUT.h | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h index b644163f1..10b9fcc18 100644 --- a/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h +++ b/Eigen/src/IterativeLinearSolvers/IncompleteLUT.h @@ -67,6 +67,8 @@ Index QuickSplit(VectorV &row, VectorI &ind, Index ncut) * \class IncompleteLUT * \brief Incomplete LU factorization with dual-threshold strategy * + * \implsparsesolverconcept + * * During the numerical factorization, two dropping rules are used : * 1) any element whose magnitude is less than some tolerance is dropped. * This tolerance is obtained by multiplying the input tolerance @p droptol |