| |||||||
| |||||||
| Prototype | |||||||
|
template <class Matrix, class Vector, class VectorB, class Preconditioner, class Iteration> int bicg(const Matrix& A, Vector& x, const VectorB& b, const Preconditioner& M, Iteration& iter) ; | |||||||
| Description | |||||||
|
This solves the unsymmetric linear system Ax = b
using the Preconditioned BiConjugate Gradient method.
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: R. Fletcher, Conjugate gradient methods for indefinite systems, In Numerical Analysis Dundee 1975, G. Watson, ed., Springer Verlag, Berlin, New York, 1976 pp. 73-89 | |||||||
| Definition | |||||||
| bicg.h | |||||||
| Preconditions | |||||||
|
| |||||||
| Complexity | |||||||
| Example | |||||||
| Notes | |||||||
| See also | |||||||

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