void mexFunction
(
int nargout,
mxArray *pargout [ ],
int nargin,
const mxArray *pargin [ ]
)
{
cs_dl *A, Amatrix ;
double *x ;
CS_INT i, m, n, *parent, *post, *rowcount ;
if (nargout > 1 || nargin != 3)
{
mexErrMsgTxt ("Usage: r = cs_rowcnt(A,parent,post)") ;
}
/* get inputs */
A = cs_dl_mex_get_sparse (&Amatrix, 1, 0, pargin [0]) ;
n = A->n ;
parent = cs_dl_mex_get_int (n, pargin [1], &i, 0) ;
post = cs_dl_mex_get_int (n, pargin [2], &i, 1) ;
rowcount = rowcnt (A, parent, post) ;
pargout [0] = mxCreateDoubleMatrix (1, n, mxREAL) ;
x = mxGetPr (pargout [0]) ;
for (i = 0 ; i < n ; i++) x [i] = rowcount [i] ;
cs_dl_free (rowcount) ;
}
/* cs_sparse: convert triplet form into compress-column form sparse matrix */
void mexFunction
(
int nargout,
mxArray *pargout [ ],
int nargin,
const mxArray *pargin [ ]
)
{
if (nargout > 1 || nargin != 3)
{
mexErrMsgTxt ("Usage: A = cs_sparse(i,j,x)") ;
}
if (mxIsComplex (pargin [2]))
{
#ifndef NCOMPLEX
cs_cl *A, *C, *T, Tmatrix ;
T = &Tmatrix ; /* get i,j,x and copy to triplet form */
T->nz = mxGetM (pargin [0]) ;
T->p = cs_dl_mex_get_int (T->nz, pargin [0], &(T->n), 1) ;
T->i = cs_dl_mex_get_int (T->nz, pargin [1], &(T->m), 1) ;
cs_mex_check (1, T->nz, 1, 0, 0, 1, pargin [2]) ;
T->x = cs_cl_mex_get_double (T->nz, pargin [2]) ;
T->nzmax = T->nz ;
C = cs_cl_compress (T) ; /* create sparse matrix C */
cs_cl_dupl (C) ; /* remove duplicates from C */
cs_cl_dropzeros (C) ; /* remove zeros from C */
A = cs_cl_transpose (C, -1) ; /* A=C.' */
cs_cl_spfree (C) ;
pargout [0] = cs_cl_mex_put_sparse (&A) ; /* return A */
cs_free (T->p) ;
cs_free (T->i) ;
cs_free (T->x) ; /* free copy of complex values*/
#else
mexErrMsgTxt ("complex matrices not supported") ;
#endif
}
else
{
cs_dl *A, *C, *T, Tmatrix ;
T = &Tmatrix ; /* get i,j,x and copy to triplet form */
T->nz = mxGetM (pargin [0]) ;
T->p = cs_dl_mex_get_int (T->nz, pargin [0], &(T->n), 1) ;
T->i = cs_dl_mex_get_int (T->nz, pargin [1], &(T->m), 1) ;
cs_mex_check (1, T->nz, 1, 0, 0, 1, pargin [2]) ;
T->x = mxGetPr (pargin [2]) ;
T->nzmax = T->nz ;
C = cs_dl_compress (T) ; /* create sparse matrix C */
cs_dl_dupl (C) ; /* remove duplicates from C */
cs_dl_dropzeros (C) ; /* remove zeros from C */
A = cs_dl_transpose (C, 1) ; /* A=C' */
cs_dl_spfree (C) ;
pargout [0] = cs_dl_mex_put_sparse (&A) ; /* return A */
cs_free (T->p) ;
cs_free (T->i) ;
}
}
/* cs_updown: sparse Cholesky update/downdate (rank-1 or multiple rank) */
void mexFunction
(
int nargout,
mxArray *pargout [ ],
int nargin,
const mxArray *pargin [ ]
)
{
CS_INT ignore, j, k, n, lnz, *parent, sigma = 1, cp [2], ok ;
char sigma_string [20] ;
if (nargout > 1 || nargin < 3 || nargin > 4)
{
mexErrMsgTxt ("Usage: L = cs_updown(L,C,parent,sigma)") ;
}
if (nargin > 3 && mxIsChar (pargin [3]))
{
mxGetString (pargin [3], sigma_string, 8) ;
sigma = (sigma_string [0] == '-') ? (-1) : 1 ;
}
n = mxGetN (pargin [0]) ;
parent = cs_dl_mex_get_int (n, pargin [2], &ignore, 0) ; /* get parent*/
if (mxIsComplex (pargin [0]) || mxIsComplex (pargin [1]))
{
#ifndef NCOMPLEX
cs_cl Lmatrix, *Lin, Cmatrix, *C, *L, Cvector, *Cvec ;
/* get input L, and copy MATLAB complex to C complex type */
Lin = cs_cl_mex_get_sparse (&Lmatrix, 1, pargin [0]) ;
/* make a copy of L (this can take more work than updating L itself) */
lnz = Lin->p [n] ;
L = cs_cl_spalloc (n, n, lnz, 0, 0) ;
for (j = 0 ; j <= n ; j++) L->p [j] = Lin->p [j] ;
for (k = 0 ; k < lnz ; k++) L->i [k] = Lin->i [k] ;
/* complex values already copied into Lin->x, use shallow copy for L */
L->x = Lin->x ;
cs_mex_check (0, n, -1, 0, 1, 1, pargin [1]) ; /* get C */
C = cs_cl_mex_get_sparse (&Cmatrix, 0, pargin [1]) ;
/* do the update one column at a time */
Cvec = &Cvector ;
Cvec->m = n ;
Cvec->n = 1 ;
Cvec->p = cp ;
Cvec->nz = -1 ;
cp [0] = 0 ;
for (k = 0 ; k < C->n ; k++)
{
/* extract C(:,k) */
cp [1] = C->p [k+1] - C->p [k] ;
Cvec->nzmax = cp [1] ;
Cvec->i = C->i + C->p [k] ;
Cvec->x = C->x + C->p [k] ;
/* update/downdate */
ok = cs_cl_updown (L, sigma, Cvec, parent) ;
if (!ok) mexErrMsgTxt ("matrix is not positive definite") ;
}
/* return new L */
pargout [0] = cs_cl_mex_put_sparse (&L) ;
cs_free (C->x) ; /* free complex copy of C */
#else
mexErrMsgTxt ("complex matrices not supported") ;
#endif
}
else
{
cs_dl Lmatrix, *Lin, Cmatrix, *C, *L, Cvector, *Cvec ;
/* get input L */
Lin = cs_dl_mex_get_sparse (&Lmatrix, 1, 1, pargin [0]) ;
/* make a copy of L (this can take more work than updating L itself) */
lnz = Lin->p [n] ;
L = cs_dl_spalloc (n, n, lnz, 1, 0) ;
for (j = 0 ; j <= n ; j++) L->p [j] = Lin->p [j] ;
for (k = 0 ; k < lnz ; k++) L->i [k] = Lin->i [k] ;
for (k = 0 ; k < lnz ; k++) L->x [k] = Lin->x [k] ;
cs_mex_check (0, n, -1, 0, 1, 1, pargin [1]) ; /* get C */
C = cs_dl_mex_get_sparse (&Cmatrix, 0, 1, pargin [1]) ;
/* do the update one column at a time */
Cvec = &Cvector ;
Cvec->m = n ;
Cvec->n = 1 ;
Cvec->p = cp ;
Cvec->nz = -1 ;
cp [0] = 0 ;
for (k = 0 ; k < C->n ; k++)
{
/* extract C(:,k) */
cp [1] = C->p [k+1] - C->p [k] ;
Cvec->nzmax = cp [1] ;
Cvec->i = C->i + C->p [k] ;
Cvec->x = C->x + C->p [k] ;
/* update/downdate */
ok = cs_dl_updown (L, sigma, Cvec, parent) ;
if (!ok) mexErrMsgTxt ("matrix is not positive definite") ;
}
/* return new L */
pargout [0] = cs_dl_mex_put_sparse (&L) ;
}
}
