Description of cgs

cgs		Programmers Guide
		Contents \| Index \| Search

Category:itl,algorithms

Component type:function

Prototype

template <class Matrix, class Vector, class VectorB, class Preconditioner, class Iteration> int cgs(const Matrix& A, Vector& x, const VectorB& b, const Preconditioner& M, Iteration& iter) ;

Description

Solves the unsymmetric linear system Ax = b using the Conjugate Gradient Squared 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: P. Sonneveld, CGS, a fast Lanczos-type solver for nonsymmetric linear, systems, SIAM, J.Sci. Statist. Comput., 10(1989), pp. 36-52

Definition

cgs.h

Preconditions

Complexity

Example

Notes

See also