Fast Auxiliary Space Preconditioning  1.8.4 Feb/15/2016
pgcg_mf.c File Reference

Krylov subspace methods – Preconditioned Generalized CG (matrix free) More...

#include <math.h>
#include "fasp.h"
#include "fasp_functs.h"
#include "itsolver_util.inl"

Go to the source code of this file.

Functions

INT fasp_solver_pgcg (mxv_matfree *mf, dvector *b, dvector *u, precond *pc, const REAL tol, const INT MaxIt, const SHORT stop_type, const SHORT prtlvl)
 Preconditioned generilzed conjugate gradient (GCG) method for solving Au=b. More...
 

Detailed Description

Krylov subspace methods – Preconditioned Generalized CG (matrix free)

Note
Refer to Concus, P. and Golub, G.H. and O'Leary, D.P. A Generalized Conjugate Gradient Method for the Numerical: Solution of Elliptic Partial Differential Equations, Computer Science Department, Stanford University, 1976

Definition in file pgcg_mf.c.

Function Documentation

INT fasp_solver_pgcg ( mxv_matfree mf,
dvector b,
dvector u,
precond pc,
const REAL  tol,
const INT  MaxIt,
const SHORT  stop_type,
const SHORT  prtlvl 
)

Preconditioned generilzed conjugate gradient (GCG) method for solving Au=b.

Parameters
mfPointer to mxv_matfree: the spmv operation
bPointer to dvector: the right hand side
uPointer to dvector: the unknowns
pcPointer to precond: the structure of precondition
tolTolerance for stopping
MaxItMaximal number of iterations
stop_typeStopping criteria type – Not implemented
prtlvlHow much information to print out
Returns
Iteration number if converges; ERROR otherwise.
Author
Xiaozhe Hu
Date
01/01/2012
Note
Not completely implemented yet! –Chensong

Modified by Chensong Zhang on 05/01/2012 Modified by Feiteng Huang on 09/26/2012: matrix free

Definition at line 47 of file pgcg_mf.c.