diff options
| author |  Jan Blechta <blechta@karlin.mff.cuni.cz> | 2015-02-10 14:24:39 +0100 |
|---|---|---|
| committer | Jan Blechta <blechta@karlin.mff.cuni.cz> | 2015-02-10 14:24:39 +0100 |
| commit | c3f3580b8f7e4af89f4c7cdbe036ac1cac750128 (patch) | |
| tree | db9f2d437f101f33e1535cc479b136df25836aec /Eigen/src/IterativeLinearSolvers/BiCGSTAB.h | |
| parent | deecff97edfb6f75e7613e1db97a1e3e5504e971 (diff) | |
Fix bug #733: step by step solving is not a good example for solveWithGuess
Diffstat (limited to 'Eigen/src/IterativeLinearSolvers/BiCGSTAB.h')
| -rw-r--r-- | Eigen/src/IterativeLinearSolvers/BiCGSTAB.h | 6 |
1 files changed, 1 insertions, 5 deletions
diff --git a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h index a50680133..31a43cb56 100644 --- a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h +++ b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h @@ -139,11 +139,7 @@ struct traits<BiCGSTAB<_MatrixType,_Preconditioner> > * \include BiCGSTAB_simple.cpp * * By default the iterations start with x=0 as an initial guess of the solution. - * One can control the start using the solveWithGuess() method. Here is a step by - * step execution example starting with a random guess and printing the evolution - * of the estimated error: - * \include BiCGSTAB_step_by_step.cpp - * Note that such a step by step execution is slightly slower. + * One can control the start using the solveWithGuess() method. * * \sa class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner */ |