| |||||||
| |||||||
![]() | |||||||
Prototype | |||||||
template < class Matrix, class Vector, class VectorB, class Preconditioner, class Iteration > int richardson(const Matrix& A, Vector& x, const VectorB& b, const Preconditioner& M, Iteration& iter) ; | |||||||
![]() | |||||||
Description | |||||||
This solves the unsymmetric linear system Ax = b using
Iterative Refinement (preconditioned Richardson iteration).
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.S. Varga, Matrix Iterative Analysis, Automatic Computation Series, Pentice Hall Inc, Englewood Cliffs, New Jersey, 1962 | |||||||
![]() | |||||||
Definition | |||||||
richardson.h | |||||||
![]() | |||||||
Preconditions | |||||||
| |||||||
![]() | |||||||
Complexity | |||||||
![]() | |||||||
Example | |||||||
![]() | |||||||
Notes | |||||||
![]() | |||||||
See also | |||||||
Copyright ©
1998,1999 University of Notre Dame. All Rights Reserved.