aboutsummaryrefslogtreecommitdiffhomepage
path: root/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h
diff options
context:
space:
mode:
authorGravatar Gael Guennebaud <g.gael@free.fr>2011-12-27 16:38:05 +0100
committerGravatar Gael Guennebaud <g.gael@free.fr>2011-12-27 16:38:05 +0100
commitbdee0c9baa6a6b48ea4dee803152d5568bcefb58 (patch)
tree16084158bf1b7342eb4a4bf06b4aba0f2ed8299a /Eigen/src/IterativeLinearSolvers/BiCGSTAB.h
parent15ea999f84f65e7664fc9b662f79d37e2fb5fd4d (diff)
set the default number of iteration to the size of the problem
Diffstat (limited to 'Eigen/src/IterativeLinearSolvers/BiCGSTAB.h')
-rw-r--r--Eigen/src/IterativeLinearSolvers/BiCGSTAB.h6
1 files changed, 3 insertions, 3 deletions
diff --git a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h
index 574b47384..b8073915e 100644
--- a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h
+++ b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h
@@ -125,8 +125,8 @@ struct traits<BiCGSTAB<_MatrixType,_Preconditioner> >
* \tparam _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner
*
* The maximal number of iterations and tolerance value can be controlled via the setMaxIterations()
- * and setTolerance() methods. The default are 1000 max iterations and NumTraits<Scalar>::epsilon()
- * for the tolerance.
+ * and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations
+ * and NumTraits<Scalar>::epsilon() for the tolerance.
*
* This class can be used as the direct solver classes. Here is a typical usage example:
* \code
@@ -218,7 +218,7 @@ public:
{
for(int j=0; j<b.cols(); ++j)
{
- m_iterations = Base::m_maxIterations;
+ m_iterations = Base::maxIterations();
m_error = Base::m_tolerance;
typename Dest::ColXpr xj(x,j);