Top |
NcmNNLS * | ncm_nnls_new () |
NcmNNLS * | ncm_nnls_ref () |
void | ncm_nnls_free () |
void | ncm_nnls_clear () |
void | ncm_nnls_set_umethod () |
NcmNNLSUMethod | ncm_nnls_get_umethod () |
void | ncm_nnls_set_reltol () |
gdouble | ncm_nnls_get_reltol () |
guint | ncm_nnls_get_nrows () |
guint | ncm_nnls_get_ncols () |
gdouble | ncm_nnls_solve () |
gdouble | ncm_nnls_solve_LH () |
gdouble | ncm_nnls_solve_lowrankqp () |
gdouble | ncm_nnls_solve_splx () |
gdouble | ncm_nnls_solve_gsmo () |
NcmVector * | ncm_nnls_get_residuals () |
guint | ncols | Read / Write / Construct Only |
guint | nrows | Read / Write / Construct Only |
double | reltol | Read / Write / Construct |
NcmNNLSUMethod | umethod | Read / Write / Construct |
void
ncm_nnls_clear (NcmNNLS **nnls
);
Decrease the reference count of nnls
by one, and sets the pointer *nnls
to
NULL.
void ncm_nnls_set_umethod (NcmNNLS *nnls
,NcmNNLSUMethod umethod
);
Sets which unconstrained least-squares method to use.
NcmNNLSUMethod
ncm_nnls_get_umethod (NcmNNLS *nnls
);
Gets the unconstrained least-squares method being used.
void ncm_nnls_set_reltol (NcmNNLS *nnls
,const gdouble reltol
);
Sets relative tolerance to reltol
.
gdouble
ncm_nnls_get_reltol (NcmNNLS *nnls
);
Gets the relative tolerance being used.
gdouble ncm_nnls_solve (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
Solves the system $A\vec{x} = \vec{f}$ for $\vec{x}$ imposing the non negativity constraint on $\vec{x}$, i.e., $\vec{x} > 0$.
gdouble ncm_nnls_solve_LH (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
Solves the system $A\vec{x} = \vec{f}$ for $\vec{x}$ imposing the non negativity constraint on $\vec{x}$, i.e., $\vec{x} > 0$. This method solves the system using the original code by Charles L. Lawson and Richard J. Hanson translated to C using f2c.
gdouble ncm_nnls_solve_lowrankqp (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
Solves the system $A\vec{x} = \vec{f}$ for $\vec{x}$ imposing the non negativity constraint on $\vec{x}$, i.e., $\vec{x} > 0$. This method solves the system using the LowRankQP quadratic programming code.
gdouble ncm_nnls_solve_splx (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
Solves the system $A\vec{x} = \vec{f}$ for $\vec{x}$ imposing the non negativity constraint on $\vec{x}$, i.e., $\vec{x} > 0$. This method solves the system using function libqp_splx_solver from libqp.
gdouble ncm_nnls_solve_gsmo (NcmNNLS *nnls
,NcmMatrix *A
,NcmVector *x
,NcmVector *f
);
NcmVector *
ncm_nnls_get_residuals (NcmNNLS *nnls
);
Gets the solution residuals, this method return the last residuals
computed during ncm_nnls_solve()
. If ncm_nnls_solve()
was not
called the return is undefined.
Method used to solve the intermediate unconstrained least-squares.
“ncols”
property “ncols” guint
Number of cols.
Owner: NcmNNLS
Flags: Read / Write / Construct Only
Allowed values: >= 1
Default value: 1
“nrows”
property “nrows” guint
Number of rows.
Owner: NcmNNLS
Flags: Read / Write / Construct Only
Allowed values: >= 1
Default value: 1
“reltol”
property “reltol” double
Relative tolerance.
Owner: NcmNNLS
Flags: Read / Write / Construct
Allowed values: [G_MINDOUBLE,0.1]
Default value: 2.22045e-16
“umethod”
property“umethod” NcmNNLSUMethod
Unconstrained method.
Owner: NcmNNLS
Flags: Read / Write / Construct
Default value: NCM_NNLS_UMETHOD_NORMAL