CG or the conjugate gradient method is an iterative type Krylov subspace method which is suitable for symmetric positive definite methods.
More...
|
| 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 Cg< 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::Cg< ValueType >
CG or the conjugate gradient method is an iterative type Krylov subspace method which is suitable for symmetric positive definite methods.
Though this method performs very well for symmetric positive definite matrices, it is in general not suitable for general matrices.
The implementation in Ginkgo makes use of the merged kernel to make the best use of data locality. The inner operations in one iteration of CG are merged into 2 separate steps.
- Template Parameters
-
| ValueType | precision of matrix elements |