Linsolqr

From ASCEND

NLA
QRSlv
CMSlv
IPSlv
Opt
NLP
CONOPT
IPOPT
TRON
MINOS
NGSlv
OptSQP
DAE/ODE
IDA
LSODE
DOPRI5
LA
linsolqr
linsol
LP
MakeMPS
Logic
LRSlv

This article is a stub. You can help out by expanding it.

The is the ASCEND linear solver with QR decomposition. Functional.

[edit] Methods

RANKI based methods ^[1] with reordering by SPK1 ^[2] are the recommended ones, although several others are implemented. ranki_ba2 is the best.

plain_qr

cond_qr broken

opt_qr ???

[edit] Simple usage

Here is a simple C code example showing how to determine if a given sparse matrix is of full rank:

#include <linear/linsolqr.h>
int rank(mtx_matrix_t M){
    mtx_range_t R;
    R.row.low = R.col.low = 0;
    R.row.high = R.col.high = mtx_order(M) - 1;

    L = linsolqr_create_default();
    linsolqr_set_matrix(L,M);
    linsolqr_set_region(L,R);
    linsolqr_prep(L,linsolqr_fmethod_to_fclass(linsolqr_fmethod(L)));
    linsolqr_reorder(L, &R, linsolqr_rmethod(L));
    linsolqr_factor(L,linsolqr_fmethod(L));
    r = linsolqr_rank(L);
    linsolqr_destroy(L);
    return r;
}