|
| std::unique_ptr< LinOp > | transpose () const override |
| | Returns a LinOp representing the transpose of the Transposable object.
|
| std::unique_ptr< LinOp > | conj_transpose () const override |
| | Returns a LinOp representing the conjugate transpose of the Transposable object.
|
| bool | apply_uses_initial_guess () const override |
| | Return true as iterative solvers use the data in x as an initial guess.
|
|
const parameters_type & | get_parameters () const |
|
const Bicg< default_precision > * | apply (ptr_param< const LinOp > b, ptr_param< LinOp > x) const |
|
void | convert_to (result_type *result) const override |
|
void | move_to (result_type *result) override |
|
EnableSolverBase & | operator= (const EnableSolverBase &other) |
| | Creates a shallow copy of the provided system matrix, clones it onto this executor if executors don't match.
|
|
int | get_num_workspace_ops () const override |
|
std::vector< std::string > | get_workspace_op_names () const override |
|
std::vector< int > | get_workspace_scalars () const override |
| | Returns the IDs of all scalars (workspace vectors with system dimension-independent size, usually 1 x num_rhs).
|
|
std::vector< int > | get_workspace_vectors () const override |
| | Returns the IDs of all vectors (workspace vectors with system dimension-dependent size, usually system_matrix_size x num_rhs).
|
| std::shared_ptr< const LinOp > | get_system_matrix () const |
| | Returns the system matrix, with its concrete type, used by the solver.
|
|
EnableIterativeBase & | operator= (const EnableIterativeBase &other) |
| | Creates a shallow copy of the provided stopping criterion, clones it onto this executor if executors don't match.
|
| void | set_stop_criterion_factory (std::shared_ptr< const stop::CriterionFactory > new_stop_factory) override |
| | Sets the stopping criterion of the solver.
|
| std::shared_ptr< const stop::CriterionFactory > | get_stop_criterion_factory () const |
| | Gets the stopping criterion factory of the solver.
|
| void | set_preconditioner (std::shared_ptr< const LinOp > new_precond) override |
| | Sets the preconditioner operator used by the Preconditionable.
|
|
EnablePreconditionable & | operator= (const EnablePreconditionable &other) |
| | Creates a shallow copy of the provided preconditioner, clones it onto this executor if executors don't match.
|
| virtual std::shared_ptr< const LinOp > | get_preconditioner () const |
| | Returns the preconditioner operator used by the Preconditionable.
|
template<typename ValueType = default_precision>
class gko::solver::Bicg< ValueType >
BICG or the Biconjugate gradient method is a Krylov subspace solver.
Being a generic solver, it is capable of solving general matrices, including non-s.p.d matrices. Though, the memory and the computational requirement of the BiCG solver are higher than of its s.p.d solver counterpart, it has the capability to solve generic systems.
BiCG is based on the bi-Lanczos tridiagonalization method and in exact arithmetic should terminate in at most N iterations (2N MV's, with A and A^H). It forms the basis of many of the cheaper methods such as BiCGSTAB and CGS.
Reference: R.Fletcher, Conjugate gradient methods for indefinite systems, doi: 10.1007/BFb0080116
- Template Parameters
-
| ValueType | precision of matrix elements |