template < class Matrix, class Vector, class VectorB, class Preconditioner, class Iteration >
int cheby(const Matrix &A, Vector &x, const VectorB &b, const Preconditioner &M, Iteration& iter, typename Vector::value_type eigmin, typename Vector::value_type eigmax) ;
|
|
This solves the symmetric positive definite linear system Ax = b using
the Preconditioned Chebyshev 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: T. Manteuffel, The Chebyshev iteration for nonsysmmetric linear systems
Numer. Math. 28(1977), pp. 307-327
G. H. Golub and C. F. Van Loan, Matrix Computations, The Johns Hopkins
University Press, Baltimore, Maryland, 1996
|
![[MTL Home]](./glossy-mtl-logo.jpg){kind=logo}
![[MTL Home]](./ndtoclogo.gif)