1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
|
// CXSparse/MATLAB/CSparse/cs_sqr_mex: symbolic sparse QR factorization
// CXSparse, Copyright (c) 2006-2022, Timothy A. Davis. All Rights Reserved.
// SPDX-License-Identifier: LGPL-2.1+
#include "cs_mex.h"
/* cs_sqr: symbolic sparse QR factorization */
void mexFunction
(
int nargout,
mxArray *pargout [ ],
int nargin,
const mxArray *pargin [ ]
)
{
double s ;
cs_dls *S ;
cs_dl Amatrix, *A ;
int64_t m, n, order, *p ;
if (nargout > 7 || nargin != 1)
{
mexErrMsgTxt ("Usage: [vnz,rnz,parent,c,leftmost,p,q] = cs_sqr(A)") ;
}
A = cs_dl_mex_get_sparse (&Amatrix, 0, 1, pargin [0]) ; /* get A */
m = A->m ;
n = A->n ;
if (m < n) mexErrMsgTxt ("A must have # rows >= # columns") ;
order = (nargout == 7) ? 3 : 0 ; /* determine ordering */
S = cs_dl_sqr (order, A, 1) ; /* symbolic QR ordering & analysis*/
if (!S) mexErrMsgTxt ("cs_sqr failed") ;
s = S->lnz ;
cs_dl_mex_put_double (1, &s, &(pargout [0])) ; /* return nnz(V) */
s = S->unz ;
cs_dl_mex_put_double (1, &s, &(pargout [1])) ; /* return nnz(R) */
pargout [2] = cs_dl_mex_put_int (S->parent, n, 1, 0) ; /* return parent */
pargout [3] = cs_dl_mex_put_int (S->cp, n, 0, 0) ; /* return c */
pargout [4] = cs_dl_mex_put_int (S->leftmost, m, 1, 0) ;/* return leftmost*/
p = cs_dl_pinv (S->pinv, S->m2) ; /* p = pinv' */
pargout [5] = cs_dl_mex_put_int (p, S->m2, 1, 1) ; /* return p */
if (nargout > 6)
{
pargout [6] = cs_dl_mex_put_int (S->q, n, 1, 0) ; /* return q */
}
cs_dl_sfree (S) ;
}
|
