HCL_PCG_d implements the preconditioned conjugate gradients algorithm for solving a linear operator equation with a symmetric positive definite operator
![]() | HCL_PCG_d ( char *fname, HCL_LinearOp_d * minv ) Alternate constructor |
![]() | HCL_PCG_d ( char *fname, HCL_LinearOp_d * m, HCL_LinearSolver_d * ls ) Constructor |
![]() | Parameters () Access to parameter table |
![]() | Solve ( const HCL_LinearOp_d & A, const HCL_Vector_d & b, HCL_Vector_d & x ) Solve (approximately) the equation Ax=b for x |
HCL_PCG_d implements the preconditioned conjugate gradients algorithm for solving a linear operator equation with a symmetric positive definite operator
Default = 2
HCL_PCG_d( char *fname, HCL_LinearOp_d * minv )
minv - Inverse of the preconditioner or NULL Table& Parameters()
virtual int Solve( const HCL_LinearOp_d & A, const HCL_Vector_d & b, HCL_Vector_d & x )
b - RHS vector
x - Initially, this must be a starting vector for the
iteration. On exit, this contains the approximate solution
Input Parameters
int MaxItn
Default = 100
double Tol
Default = 1.0e-3
int DispFlag
0 - No output
1 - One-line summary output
2 - Detailed header and footer with timing information
3 - Per-iteration information Output parameters
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling
contact: doc++@zib.de