HLIBpro  2.7
Solver

Classes

class  TAutoSolver
 Implements an iterative solver automatically choosing appropriate algorithm based on matrix criteria. More...
 
class  TBiCGStab
 Implements BiCG-Stab iteration. More...
 
class  TCG
 Implements conjugate gradient iteration. More...
 
class  TCGS
 Implements squared conjugate gradient iteration. More...
 
class  TGMRES
 Implements GMRES iteration with restart. More...
 
class  TLinearIteration
 Implements linear iteration \(x_{i+1} = x_k + N (A x_i - b)\). More...
 
class  TMINRES
 Implements the MINRES iteration. More...
 
class  TTFQMR
 Implements squared conjugate gradient iteration. More...
 

Functions

void solve (const TLinearOperator *A, TVector *x, const TVector *b, const TLinearOperator *W, TSolverInfo *info=nullptr, const TStopCriterion &stop_crit=TStopCriterion())
 Solve A·x = b with optional preconditioner W (functional version).
 
void solve (const TLinearOperator *A, TVector *x, const TVector *b, TSolverInfo *info=nullptr, const TStopCriterion &stop_crit=TStopCriterion())
 Solve A·x = b (functional version).
 
void linear_iteration (const TLinearOperator *A, TVector *x, const TVector *b, const TLinearOperator *W=nullptr, TSolverInfo *info=nullptr, const TStopCriterion &stop_crit=TStopCriterion())
 Solve A·x = b with optional preconditioner W (functional approach)
 
void richardson (const TLinearOperator *A, TVector *x, const TVector *b, const TLinearOperator *W=nullptr, TSolverInfo *info=nullptr, const TStopCriterion &stop_crit=TStopCriterion())
 Solve A·x = b with optional preconditioner W (functional approach)
 

Detailed Description

This modules provides classes for iterative solvers, e.g. CG, BiCG-Stab, GMRES.

#include <hlib-solver.hh>