a linear operator class
LinearForward ( Matrix <double>* A) construct a LinearForward with a matrix A | |
LinearForward ( Matrix <double>* A, int verb) construct a LinearForward with a matrix A | |
int | modelSize () const dimension of the Model space |
int | dataSize () const dimension of Data space, number of observed data |
Vector <double> | oneOperator (int i) the ith row of the linear operator |
const char* | className () const returns the class name for this the object |
List <double> | dataList (const Model <double>& m) list of the calculated data when applied the operator to Model m |
List <double> | dataList (const Model <long>& m) list of the calculated data when applied the operator to Model m |
Vector <double> | adjointOp (const Vector <double>& v) apply adjoint of the linear operator to data Vector v |
Vector <double> | adjointOp (const Vector <long>& v) apply adjoint of the linear operator to data Vector v |
double | forwardOp (int i, const Vector <double>& v) apply the ith row of linear operator to data Vector v |
double | forwardOp (int i, const Vector <long>& v) apply the ith row of linear operator to data Vector v |
Vector <double> | forwardOp (const Vector <double>& v) apply the linear operator to data Vector v |
Vector <double> | forwardOp (const Vector <long>& v) apply the linear operator to data Vector v |
LinForward is a class for linear forward operators in optimization. It is, in fact, no more than a Matrix. For a quadratic optimization problem, this Matrix is the Hessian of the objective function.LinForward currently only takes Models either double or long integer. It is mostly because I tried to avoid using templates, due to the guliness of template features in G++. Hopefully, this could be changed soon.
this page has been generated automatically by doc++
(c)opyright by Malte Zöckler, Roland Wunderling