PUBLIC

ConjGradC::ConjGradC(void) ConjGradC::ConjGradC(T &) ConjGradC::ConjGradC(const ConjGradC &) ConjGradC::operator=(const ConjGradC &) ConjGradC::~ConjGradC(void) ConjGradC::operator=(const ConjGradC &)

ConjGradC<class T>
Numerical integration routine
include	"amma/ConjGrad.hh"
User Level:	Default
Library:	diffeq
Example:	exEndPoint.cc
Section:	Numerical Methods
In Scope:	std

Comments:
ConjGradC is a numerical integration routine which solves 1 T T E(x) = - x A x - B x + C 2 Did I write this? Think so... (AJS) I believe that the algorithm comes from and early paper by Terzopoulos or Szeliski and was used to solve a regularisation problem. It is very good when A is sparse because you only ever multiply with A which is fast if you know the structure. ------------------------------------------------------------------------- In order to use this function type T must have T operator=(const T & v); T operator+(const T & v); T operator*(const double & d); double Dot(const T & v); T Copy(void); ------------------------------------------------------------------------- -------------------------------------------------------------------------

int trace;

A trace variable, 0=no trace, 1=trace

T & q;

(handle to) the Vector set to be updated

T resid;

working arrays

T wtemp;

working arrays

T dbasis;

working arrays

ConjGradC()

Constructor, made private to prevent usage. NB t& q!!

ConjGradC(T & q_in)

Constructor

ConjGradC(const ConjGradC<T> & ni)

Copy constructor

ConjGradC & operator=(const ConjGradC<T> & ni)

~ConjGradC()

Destructor General operations ------------------

ConjGradC<T> & operator=(const ConjGradC & ni)

-------------------------------------------------------------------------