| |||||||
| |||||||
| Prototype | |||||||
|
template < class Matrix, class Vector, class VectorB, class Preconditioner, class Iteration > int gcr(const Matrix& A, Vector& x, const VectorB& b, const Preconditioner& M, int m, Iteration& outer) ; | |||||||
| Description | |||||||
|
This solve the linear system Ax = b with restarted Preconditioned
Generalized Conjugate Residual Algorithm.
A return value of 0 indicates convergence within the maximum number of iterations (determined by the iter object). A return value of 1 indicates a failure to converge.
See: Y. Saad, Iterative Methods for Sparse Linear System, PWS Publishing Company, 1996 | |||||||
| Definition | |||||||
| gcr.h | |||||||
| Preconditions | |||||||
|
| |||||||
| Complexity | |||||||
| Example | |||||||
| Notes | |||||||
| See also | |||||||

Copyright ©
1998,1999 University of Notre Dame. All Rights Reserved.