Pre-conditioned Conjugate Gradient for Least Squares
PreconditionedCGLS ( int n , LinearForward * p , Vector <double>* data, int it, double tol , int verb) a constructor
| |||||||||||||
PreconditionedCGLS (int n , LinearForward * p , Vector <double>* data, int it, double tol ) a constructor | |||||||||||||
void | assignWeight ( DiagMatrix <double>& d) assign the pre-conditioning diagonal matrix | ||||||||||||
Model <double> | optimizer ( Model <double>& m0) Preconditioned LS Conjugate gradient starting from m0, returns an optimum Model | ||||||||||||
Model <long> | optimizer ( Model <long>& m0) Preconditioned LS Conjugate gradient starting from m0, returns an optimum Model |
PreconditionedCGLS() This is a class almost identical to that of CGLS, but it handles some preconditioned algorithms. Currently, PreconditionedCGLS is actually used as the front-end of CGLS for Irls, since Irls reduces to a sequence of conditioned CGLS.
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling