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 transpose free quasi minimal residual iteration. More...

Functions
template<typename value_t , typename value_pre_t >
void	solve (const TLinearOperator< value_t > A, TVector< value_t > x, const TVector< value_t > b, const TLinearOperator< value_pre_t > W, TSolverInfo *info=nullptr, const TStopCriterion &stop_crit=TStopCriterion())
	Solve A·x = b with optional preconditioner W (functional version).

template<typename value_t >
void	solve (const TLinearOperator< value_t > A, TVector< value_t > x, const TVector< value_t > b, TSolverInfo info=nullptr, const TStopCriterion &stop_crit=TStopCriterion())
	Solve A·x = b (functional version).

template<typename value_t , typename value_pre_t >
void	linear_iteration (const TLinearOperator< value_t > A, TVector< value_t > x, const TVector< value_t > b, const TLinearOperator< value_pre_t > W=nullptr, TSolverInfo *info=nullptr, const TStopCriterion &stop_crit=TStopCriterion())
	Solve A·x = b with optional preconditioner W (functional approach)

template<typename value_t >
void	richardson (const TLinearOperator< value_t > A, TVector< value_t > x, const TVector< value_t > b, const TLinearOperator< value_t > 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>

Classes