1 #include "cs_mex.h"
2 /* cs_cholsol: solve A*x=b using a sparse Cholesky factorization */
mexFunction(int nargout,mxArray * pargout[],int nargin,const mxArray * pargin[])3 void mexFunction
4 (
5 int nargout,
6 mxArray *pargout [ ],
7 int nargin,
8 const mxArray *pargin [ ]
9 )
10 {
11 cs *A, Amatrix ;
12 double *x, *b ;
13 csi order ;
14 if (nargout > 1 || nargin < 2 || nargin > 3)
15 {
16 mexErrMsgTxt ("Usage: x = cs_cholsol(A,b,order)") ;
17 }
18 A = cs_mex_get_sparse (&Amatrix, 1, 1, pargin [0]) ; /* get A */
19 b = cs_mex_get_double (A->n, pargin [1]) ; /* get b */
20 x = cs_mex_put_double (A->n, b, &(pargout [0])) ; /* x = b */
21 order = (nargin < 3) ? 1 : mxGetScalar (pargin [2]) ;
22 order = CS_MAX (order, 0) ;
23 order = CS_MIN (order, 3) ;
24 if (!cs_cholsol (order, A, x)) /* x = A\x */
25 {
26 mexErrMsgTxt ("A not positive definite") ;
27 }
28 }
29