diff options
author | leochanj105 <leochanj@live.unc.edu> | 2020-10-19 23:09:30 -0400 |
---|---|---|
committer | leochanj105 <leochanj@live.unc.edu> | 2020-10-20 02:40:39 -0400 |
commit | f618466c25d43f3bae9e40920273bf77de1e1149 (patch) | |
tree | 460e739e2165b8a9c37a9c7ab1b60f5874903543 /SD-VBS/common/toolbox/MultiNcut/mex_projection_QR.c | |
parent | 47ced4e96bbb782b9e780e8f2cfc637b2c21ff44 (diff) |
initial sd-vbs
initial sd-vbs
add sd-vbs
sd-vbs
Diffstat (limited to 'SD-VBS/common/toolbox/MultiNcut/mex_projection_QR.c')
-rwxr-xr-x | SD-VBS/common/toolbox/MultiNcut/mex_projection_QR.c | 82 |
1 files changed, 82 insertions, 0 deletions
diff --git a/SD-VBS/common/toolbox/MultiNcut/mex_projection_QR.c b/SD-VBS/common/toolbox/MultiNcut/mex_projection_QR.c new file mode 100755 index 0000000..5ac4820 --- /dev/null +++ b/SD-VBS/common/toolbox/MultiNcut/mex_projection_QR.c | |||
@@ -0,0 +1,82 @@ | |||
1 | /*================================================================ | ||
2 | * mex_projection_QR.c = used by quickNcutHardBiais.m in eigensolver. | ||
3 | * mex_projection_QR(X,P,Ubar,R) == (eye(length(P))-Ubar*(R'*R)^{-1}*Ubar') * P * (eye(length(P))-Ubar*(R'*R)^{-1}*Ubar') * X ; | ||
4 | * (R'*R)^{-1} is solved by solving a triangular system | ||
5 | |||
6 | * P, Ubar, R are sparse, but X is full | ||
7 | |||
8 | * R is upper triangular | ||
9 | |||
10 | % test sequence: | ||
11 | |||
12 | *=================================================================*/ | ||
13 | |||
14 | # include "math.h" | ||
15 | # include "mex.h" | ||
16 | # include "a_times_b_cmplx.c" | ||
17 | /*# include "a_times_b.c"*/ | ||
18 | |||
19 | void mexFunction( | ||
20 | int nargout, | ||
21 | mxArray *out[], | ||
22 | int nargin, | ||
23 | const mxArray *in[] | ||
24 | ) | ||
25 | { | ||
26 | int *ir[4], *jc[4], m[4], n[4]; | ||
27 | double *y, *y1,*y2,*y3,*y4,*y5,*y6, *pr[4]; | ||
28 | double *y2bis, *y5bis; | ||
29 | int k; | ||
30 | |||
31 | for (k=0; k<4; k++) { | ||
32 | m[k] = mxGetM(in[k]); | ||
33 | n[k] = mxGetN(in[k]); | ||
34 | pr[k] = mxGetPr(in[k]); | ||
35 | if (k>0) { | ||
36 | ir[k] = mxGetIr(in[k]); | ||
37 | jc[k] = mxGetJc(in[k]); | ||
38 | } | ||
39 | } | ||
40 | |||
41 | out[0] = mxCreateDoubleMatrix(m[1],1,mxREAL); | ||
42 | y = mxGetPr(out[0]); | ||
43 | |||
44 | |||
45 | y1 = mxCalloc(n[2], sizeof(double)); | ||
46 | y2 = mxCalloc(m[3], sizeof(double)); | ||
47 | y2bis = mxCalloc(m[3], sizeof(double)); | ||
48 | y3 = mxCalloc(m[1], sizeof(double)); | ||
49 | y4 = mxCalloc(m[1], sizeof(double)); | ||
50 | y5 = mxCalloc(n[2], sizeof(double)); | ||
51 | y5bis = mxCalloc(n[2], sizeof(double)); | ||
52 | y6 = mxCalloc(n[2], sizeof(double)); | ||
53 | |||
54 | CSR_VecMult_CAB_double(m[2],n[2],pr[2],ir[2],jc[2],pr[0],y1); | ||
55 | CSR_VecTriangSlvLD_CAB_double(m[3],pr[3],ir[3],jc[3],y1,y2bis); | ||
56 | CSC_VecTriangSlvUD_CAB_double(m[3],pr[3],ir[3],jc[3],y2bis,y2); | ||
57 | for(k=0;k<m[1];k++) { | ||
58 | y3[k]=pr[0][k]; | ||
59 | } | ||
60 | CSC_VecMult_CaABC_double(m[2],n[2],-1,pr[2],ir[2],jc[2],y2,y3); | ||
61 | |||
62 | CSR_VecMult_CAB_double(m[1],n[1],pr[1],ir[1],jc[1],y3,y4); | ||
63 | |||
64 | CSR_VecMult_CAB_double(m[2],n[2],pr[2],ir[2],jc[2],y4,y5); | ||
65 | |||
66 | CSR_VecTriangSlvLD_CAB_double(m[3],pr[3],ir[3],jc[3],y5,y5bis); | ||
67 | CSC_VecTriangSlvUD_CAB_double(m[3],pr[3],ir[3],jc[3],y5bis,y6); | ||
68 | for(k=0;k<m[1];k++) { | ||
69 | y[k]=y4[k]; | ||
70 | } | ||
71 | CSC_VecMult_CaABC_double(m[2],n[2],-1,pr[2],ir[2],jc[2],y6,y); | ||
72 | |||
73 | |||
74 | mxFree(y1); | ||
75 | mxFree(y2); | ||
76 | mxFree(y2bis); | ||
77 | mxFree(y3); | ||
78 | mxFree(y4); | ||
79 | mxFree(y5); | ||
80 | mxFree(y5bis); | ||
81 | mxFree(y6); | ||
82 | } | ||