diff options
| author |  Gael Guennebaud <g.gael@free.fr> | 2015-12-07 12:33:38 +0100 |
|---|---|---|
| committer | Gael Guennebaud <g.gael@free.fr> | 2015-12-07 12:33:38 +0100 |
| commit | ad3d68400e361e53bd13ddc0e8ea187883a04f12 (patch) | |
| tree | ecce37fa8749550e0eafb3aeea5306e3bfaf5e6a /Eigen/src/IterativeLinearSolvers/BiCGSTAB.h | |
| parent | b37036afce20e902cd5191a2a985f39b1f7e22e3 (diff) | |
Add matrix-free solver example
Diffstat (limited to 'Eigen/src/IterativeLinearSolvers/BiCGSTAB.h')
| -rw-r--r-- | Eigen/src/IterativeLinearSolvers/BiCGSTAB.h | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h index 191202138..454f46814 100644 --- a/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h +++ b/Eigen/src/IterativeLinearSolvers/BiCGSTAB.h @@ -150,6 +150,8 @@ struct traits<BiCGSTAB<_MatrixType,_Preconditioner> > * By default the iterations start with x=0 as an initial guess of the solution. * One can control the start using the solveWithGuess() method. * + * BiCGSTAB can also be used in a matrix-free context, see the following \link MatrixfreeSolverExample example \endlink. + * * \sa class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner */ template< typename _MatrixType, typename _Preconditioner> |