Please, help us to better know about our user community by answering the following short survey: https://forms.gle/wpyrxWi18ox9Z5ae9
 Eigen  3.3.9
Eigen::BiCGSTAB< _MatrixType, _Preconditioner > Class Template Reference

## Detailed Description

### template<typename _MatrixType, typename _Preconditioner> class Eigen::BiCGSTAB< _MatrixType, _Preconditioner >

A bi conjugate gradient stabilized solver for sparse square problems.

This class allows to solve for A.x = b sparse linear problems using a bi conjugate gradient stabilized algorithm. The vectors x and b can be either dense or sparse.

Template Parameters
 _MatrixType the type of the sparse matrix A, can be a dense or a sparse matrix. _Preconditioner the type of the preconditioner. Default is DiagonalPreconditioner

This class follows the sparse solver concept .

The maximal number of iterations and tolerance value can be controlled via the setMaxIterations() and setTolerance() methods. The defaults are the size of the problem for the maximal number of iterations and NumTraits<Scalar>::epsilon() for the tolerance.

The tolerance corresponds to the relative residual error: |Ax-b|/|b|

Performance: when using sparse matrices, best performance is achied for a row-major sparse matrix format. Moreover, in this case multi-threading can be exploited if the user code is compiled with OpenMP enabled. See Eigen and multi-threading for details.

This class can be used as the direct solver classes. Here is a typical usage example:

int n = 10000;
VectorXd x(n), b(n);
SparseMatrix<double> A(n,n);
/* ... fill A and b ... */
BiCGSTAB<SparseMatrix<double> > solver;
solver.compute(A);
x = solver.solve(b);
std::cout << "#iterations: " << solver.iterations() << std::endl;
std::cout << "estimated error: " << solver.error() << std::endl;
/* ... update b ... */
x = solver.solve(b); // solve again

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 example .

class SimplicialCholesky, DiagonalPreconditioner, IdentityPreconditioner

## Public Member Functions

BiCGSTAB ()

template<typename MatrixDerived >
BiCGSTAB (const EigenBase< MatrixDerived > &A)

## ◆ BiCGSTAB() [1/2]

template<typename _MatrixType , typename _Preconditioner >
 Eigen::BiCGSTAB< _MatrixType, _Preconditioner >::BiCGSTAB ( )
inline

Default constructor.

## ◆ BiCGSTAB() [2/2]

template<typename _MatrixType , typename _Preconditioner >
template<typename MatrixDerived >
 Eigen::BiCGSTAB< _MatrixType, _Preconditioner >::BiCGSTAB ( const EigenBase< MatrixDerived > & A )
inlineexplicit

Initialize the solver with matrix A for further Ax=b solving.

This constructor is a shortcut for the default constructor followed by a call to compute().

Warning
this class stores a reference to the matrix A as well as some precomputed values that depend on it. Therefore, if A is changed this class becomes invalid. Call compute() to update it with the new matrix A, or modify a copy of A.

The documentation for this class was generated from the following file: