1 #define PETSCMAT_DLL 2 3 /* 4 Factorization code for BAIJ format. 5 */ 6 #include "../src/mat/impls/baij/seq/baij.h" 7 #include "../src/mat/blockinvert.h" 8 9 /* 10 Version for when blocks are 3 by 3 11 */ 12 #undef __FUNCT__ 13 #define __FUNCT__ "MatLUFactorNumeric_SeqBAIJ_3_inplace" 14 PetscErrorCode MatLUFactorNumeric_SeqBAIJ_3_inplace(Mat C,Mat A,const MatFactorInfo *info) 15 { 16 Mat_SeqBAIJ *a = (Mat_SeqBAIJ*)A->data,*b = (Mat_SeqBAIJ *)C->data; 17 IS isrow = b->row,isicol = b->icol; 18 PetscErrorCode ierr; 19 const PetscInt *r,*ic; 20 PetscInt i,j,n = a->mbs,*bi = b->i,*bj = b->j; 21 PetscInt *ajtmpold,*ajtmp,nz,row,*ai=a->i,*aj=a->j; 22 PetscInt *diag_offset = b->diag,idx,*pj; 23 MatScalar *pv,*v,*rtmp,*pc,*w,*x; 24 MatScalar p1,p2,p3,p4,m1,m2,m3,m4,m5,m6,m7,m8,m9,x1,x2,x3,x4; 25 MatScalar p5,p6,p7,p8,p9,x5,x6,x7,x8,x9; 26 MatScalar *ba = b->a,*aa = a->a; 27 PetscReal shift = info->shiftamount; 28 29 PetscFunctionBegin; 30 ierr = ISGetIndices(isrow,&r);CHKERRQ(ierr); 31 ierr = ISGetIndices(isicol,&ic);CHKERRQ(ierr); 32 ierr = PetscMalloc(9*(n+1)*sizeof(MatScalar),&rtmp);CHKERRQ(ierr); 33 34 for (i=0; i<n; i++) { 35 nz = bi[i+1] - bi[i]; 36 ajtmp = bj + bi[i]; 37 for (j=0; j<nz; j++) { 38 x = rtmp + 9*ajtmp[j]; 39 x[0] = x[1] = x[2] = x[3] = x[4] = x[5] = x[6] = x[7] = x[8] = 0.0; 40 } 41 /* load in initial (unfactored row) */ 42 idx = r[i]; 43 nz = ai[idx+1] - ai[idx]; 44 ajtmpold = aj + ai[idx]; 45 v = aa + 9*ai[idx]; 46 for (j=0; j<nz; j++) { 47 x = rtmp + 9*ic[ajtmpold[j]]; 48 x[0] = v[0]; x[1] = v[1]; x[2] = v[2]; x[3] = v[3]; 49 x[4] = v[4]; x[5] = v[5]; x[6] = v[6]; x[7] = v[7]; x[8] = v[8]; 50 v += 9; 51 } 52 row = *ajtmp++; 53 while (row < i) { 54 pc = rtmp + 9*row; 55 p1 = pc[0]; p2 = pc[1]; p3 = pc[2]; p4 = pc[3]; 56 p5 = pc[4]; p6 = pc[5]; p7 = pc[6]; p8 = pc[7]; p9 = pc[8]; 57 if (p1 != 0.0 || p2 != 0.0 || p3 != 0.0 || p4 != 0.0 || p5 != 0.0 || 58 p6 != 0.0 || p7 != 0.0 || p8 != 0.0 || p9 != 0.0) { 59 pv = ba + 9*diag_offset[row]; 60 pj = bj + diag_offset[row] + 1; 61 x1 = pv[0]; x2 = pv[1]; x3 = pv[2]; x4 = pv[3]; 62 x5 = pv[4]; x6 = pv[5]; x7 = pv[6]; x8 = pv[7]; x9 = pv[8]; 63 pc[0] = m1 = p1*x1 + p4*x2 + p7*x3; 64 pc[1] = m2 = p2*x1 + p5*x2 + p8*x3; 65 pc[2] = m3 = p3*x1 + p6*x2 + p9*x3; 66 67 pc[3] = m4 = p1*x4 + p4*x5 + p7*x6; 68 pc[4] = m5 = p2*x4 + p5*x5 + p8*x6; 69 pc[5] = m6 = p3*x4 + p6*x5 + p9*x6; 70 71 pc[6] = m7 = p1*x7 + p4*x8 + p7*x9; 72 pc[7] = m8 = p2*x7 + p5*x8 + p8*x9; 73 pc[8] = m9 = p3*x7 + p6*x8 + p9*x9; 74 nz = bi[row+1] - diag_offset[row] - 1; 75 pv += 9; 76 for (j=0; j<nz; j++) { 77 x1 = pv[0]; x2 = pv[1]; x3 = pv[2]; x4 = pv[3]; 78 x5 = pv[4]; x6 = pv[5]; x7 = pv[6]; x8 = pv[7]; x9 = pv[8]; 79 x = rtmp + 9*pj[j]; 80 x[0] -= m1*x1 + m4*x2 + m7*x3; 81 x[1] -= m2*x1 + m5*x2 + m8*x3; 82 x[2] -= m3*x1 + m6*x2 + m9*x3; 83 84 x[3] -= m1*x4 + m4*x5 + m7*x6; 85 x[4] -= m2*x4 + m5*x5 + m8*x6; 86 x[5] -= m3*x4 + m6*x5 + m9*x6; 87 88 x[6] -= m1*x7 + m4*x8 + m7*x9; 89 x[7] -= m2*x7 + m5*x8 + m8*x9; 90 x[8] -= m3*x7 + m6*x8 + m9*x9; 91 pv += 9; 92 } 93 ierr = PetscLogFlops(54.0*nz+36.0);CHKERRQ(ierr); 94 } 95 row = *ajtmp++; 96 } 97 /* finished row so stick it into b->a */ 98 pv = ba + 9*bi[i]; 99 pj = bj + bi[i]; 100 nz = bi[i+1] - bi[i]; 101 for (j=0; j<nz; j++) { 102 x = rtmp + 9*pj[j]; 103 pv[0] = x[0]; pv[1] = x[1]; pv[2] = x[2]; pv[3] = x[3]; 104 pv[4] = x[4]; pv[5] = x[5]; pv[6] = x[6]; pv[7] = x[7]; pv[8] = x[8]; 105 pv += 9; 106 } 107 /* invert diagonal block */ 108 w = ba + 9*diag_offset[i]; 109 ierr = Kernel_A_gets_inverse_A_3(w,shift);CHKERRQ(ierr); 110 } 111 112 ierr = PetscFree(rtmp);CHKERRQ(ierr); 113 ierr = ISRestoreIndices(isicol,&ic);CHKERRQ(ierr); 114 ierr = ISRestoreIndices(isrow,&r);CHKERRQ(ierr); 115 C->ops->solve = MatSolve_SeqBAIJ_3_inplace; 116 C->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_3_inplace; 117 C->assembled = PETSC_TRUE; 118 ierr = PetscLogFlops(1.333333333333*3*3*3*b->mbs);CHKERRQ(ierr); /* from inverting diagonal blocks */ 119 PetscFunctionReturn(0); 120 } 121 122 /* MatLUFactorNumeric_SeqBAIJ_3 - 123 copied from MatLUFactorNumeric_SeqBAIJ_N_inplace() and manually re-implemented 124 Kernel_A_gets_A_times_B() 125 Kernel_A_gets_A_minus_B_times_C() 126 Kernel_A_gets_inverse_A() 127 */ 128 #undef __FUNCT__ 129 #define __FUNCT__ "MatLUFactorNumeric_SeqBAIJ_3" 130 PetscErrorCode MatLUFactorNumeric_SeqBAIJ_3(Mat B,Mat A,const MatFactorInfo *info) 131 { 132 Mat C=B; 133 Mat_SeqBAIJ *a=(Mat_SeqBAIJ*)A->data,*b=(Mat_SeqBAIJ *)C->data; 134 IS isrow = b->row,isicol = b->icol; 135 PetscErrorCode ierr; 136 const PetscInt *r,*ic; 137 PetscInt i,j,k,nz,nzL,row; 138 const PetscInt n=a->mbs,*ai=a->i,*aj=a->j,*bi=b->i,*bj=b->j; 139 const PetscInt *ajtmp,*bjtmp,*bdiag=b->diag,*pj,bs2=a->bs2; 140 MatScalar *rtmp,*pc,*mwork,*v,*pv,*aa=a->a; 141 PetscInt flg; 142 PetscReal shift = info->shiftamount; 143 144 PetscFunctionBegin; 145 ierr = ISGetIndices(isrow,&r);CHKERRQ(ierr); 146 ierr = ISGetIndices(isicol,&ic);CHKERRQ(ierr); 147 148 /* generate work space needed by the factorization */ 149 ierr = PetscMalloc2(bs2*n,MatScalar,&rtmp,bs2,MatScalar,&mwork);CHKERRQ(ierr); 150 ierr = PetscMemzero(rtmp,bs2*n*sizeof(MatScalar));CHKERRQ(ierr); 151 152 for (i=0; i<n; i++){ 153 /* zero rtmp */ 154 /* L part */ 155 nz = bi[i+1] - bi[i]; 156 bjtmp = bj + bi[i]; 157 for (j=0; j<nz; j++){ 158 ierr = PetscMemzero(rtmp+bs2*bjtmp[j],bs2*sizeof(MatScalar));CHKERRQ(ierr); 159 } 160 161 /* U part */ 162 nz = bdiag[i] - bdiag[i+1]; 163 bjtmp = bj + bdiag[i+1]+1; 164 for (j=0; j<nz; j++){ 165 ierr = PetscMemzero(rtmp+bs2*bjtmp[j],bs2*sizeof(MatScalar));CHKERRQ(ierr); 166 } 167 168 /* load in initial (unfactored row) */ 169 nz = ai[r[i]+1] - ai[r[i]]; 170 ajtmp = aj + ai[r[i]]; 171 v = aa + bs2*ai[r[i]]; 172 for (j=0; j<nz; j++) { 173 ierr = PetscMemcpy(rtmp+bs2*ic[ajtmp[j]],v+bs2*j,bs2*sizeof(MatScalar));CHKERRQ(ierr); 174 } 175 176 /* elimination */ 177 bjtmp = bj + bi[i]; 178 nzL = bi[i+1] - bi[i]; 179 for(k = 0;k < nzL;k++){ 180 row = bjtmp[k]; 181 pc = rtmp + bs2*row; 182 for (flg=0,j=0; j<bs2; j++) { if (pc[j]!=0.0) { flg = 1; break; }} 183 if (flg) { 184 pv = b->a + bs2*bdiag[row]; 185 /* Kernel_A_gets_A_times_B(bs,pc,pv,mwork); *pc = *pc * (*pv); */ 186 ierr = Kernel_A_gets_A_times_B_3(pc,pv,mwork);CHKERRQ(ierr); 187 188 pj = b->j + bdiag[row+1] + 1; /* beginning of U(row,:) */ 189 pv = b->a + bs2*(bdiag[row+1]+1); 190 nz = bdiag[row] - bdiag[row+1] - 1; /* num of entries in U(row,:) excluding diag */ 191 for (j=0; j<nz; j++) { 192 /* Kernel_A_gets_A_minus_B_times_C(bs,rtmp+bs2*pj[j],pc,pv+bs2*j); */ 193 /* rtmp+bs2*pj[j] = rtmp+bs2*pj[j] - (*pc)*(pv+bs2*j) */ 194 v = rtmp + bs2*pj[j]; 195 ierr = Kernel_A_gets_A_minus_B_times_C_3(v,pc,pv);CHKERRQ(ierr); 196 pv += bs2; 197 } 198 ierr = PetscLogFlops(54*nz+45);CHKERRQ(ierr); /* flops = 2*bs^3*nz + 2*bs^3 - bs2) */ 199 } 200 } 201 202 /* finished row so stick it into b->a */ 203 /* L part */ 204 pv = b->a + bs2*bi[i] ; 205 pj = b->j + bi[i] ; 206 nz = bi[i+1] - bi[i]; 207 for (j=0; j<nz; j++) { 208 ierr = PetscMemcpy(pv+bs2*j,rtmp+bs2*pj[j],bs2*sizeof(MatScalar));CHKERRQ(ierr); 209 } 210 211 /* Mark diagonal and invert diagonal for simplier triangular solves */ 212 pv = b->a + bs2*bdiag[i]; 213 pj = b->j + bdiag[i]; 214 ierr = PetscMemcpy(pv,rtmp+bs2*pj[0],bs2*sizeof(MatScalar));CHKERRQ(ierr); 215 /* ierr = Kernel_A_gets_inverse_A(bs,pv,v_pivots,v_work);CHKERRQ(ierr); */ 216 ierr = Kernel_A_gets_inverse_A_3(pv,shift);CHKERRQ(ierr); 217 218 /* U part */ 219 pj = b->j + bdiag[i+1] + 1; 220 pv = b->a + bs2*(bdiag[i+1]+1); 221 nz = bdiag[i] - bdiag[i+1] - 1; 222 for (j=0; j<nz; j++){ 223 ierr = PetscMemcpy(pv+bs2*j,rtmp+bs2*pj[j],bs2*sizeof(MatScalar));CHKERRQ(ierr); 224 } 225 } 226 227 ierr = PetscFree2(rtmp,mwork);CHKERRQ(ierr); 228 ierr = ISRestoreIndices(isicol,&ic);CHKERRQ(ierr); 229 ierr = ISRestoreIndices(isrow,&r);CHKERRQ(ierr); 230 C->ops->solve = MatSolve_SeqBAIJ_3; 231 C->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_3; 232 233 C->assembled = PETSC_TRUE; 234 ierr = PetscLogFlops(1.333333333333*3*3*3*n);CHKERRQ(ierr); /* from inverting diagonal blocks */ 235 PetscFunctionReturn(0); 236 } 237 238 #undef __FUNCT__ 239 #define __FUNCT__ "MatLUFactorNumeric_SeqBAIJ_3_NaturalOrdering_inplace" 240 PetscErrorCode MatLUFactorNumeric_SeqBAIJ_3_NaturalOrdering_inplace(Mat C,Mat A,const MatFactorInfo *info) 241 { 242 Mat_SeqBAIJ *a = (Mat_SeqBAIJ*)A->data,*b = (Mat_SeqBAIJ *)C->data; 243 PetscErrorCode ierr; 244 PetscInt i,j,n = a->mbs,*bi = b->i,*bj = b->j; 245 PetscInt *ajtmpold,*ajtmp,nz,row; 246 PetscInt *diag_offset = b->diag,*ai=a->i,*aj=a->j,*pj; 247 MatScalar *pv,*v,*rtmp,*pc,*w,*x; 248 MatScalar p1,p2,p3,p4,m1,m2,m3,m4,m5,m6,m7,m8,m9,x1,x2,x3,x4; 249 MatScalar p5,p6,p7,p8,p9,x5,x6,x7,x8,x9; 250 MatScalar *ba = b->a,*aa = a->a; 251 PetscReal shift = info->shiftamount; 252 253 PetscFunctionBegin; 254 ierr = PetscMalloc(9*(n+1)*sizeof(MatScalar),&rtmp);CHKERRQ(ierr); 255 256 for (i=0; i<n; i++) { 257 nz = bi[i+1] - bi[i]; 258 ajtmp = bj + bi[i]; 259 for (j=0; j<nz; j++) { 260 x = rtmp+9*ajtmp[j]; 261 x[0] = x[1] = x[2] = x[3] = x[4] = x[5] = x[6] = x[7] = x[8] = 0.0; 262 } 263 /* load in initial (unfactored row) */ 264 nz = ai[i+1] - ai[i]; 265 ajtmpold = aj + ai[i]; 266 v = aa + 9*ai[i]; 267 for (j=0; j<nz; j++) { 268 x = rtmp+9*ajtmpold[j]; 269 x[0] = v[0]; x[1] = v[1]; x[2] = v[2]; x[3] = v[3]; 270 x[4] = v[4]; x[5] = v[5]; x[6] = v[6]; x[7] = v[7]; x[8] = v[8]; 271 v += 9; 272 } 273 row = *ajtmp++; 274 while (row < i) { 275 pc = rtmp + 9*row; 276 p1 = pc[0]; p2 = pc[1]; p3 = pc[2]; p4 = pc[3]; 277 p5 = pc[4]; p6 = pc[5]; p7 = pc[6]; p8 = pc[7]; p9 = pc[8]; 278 if (p1 != 0.0 || p2 != 0.0 || p3 != 0.0 || p4 != 0.0 || p5 != 0.0 || 279 p6 != 0.0 || p7 != 0.0 || p8 != 0.0 || p9 != 0.0) { 280 pv = ba + 9*diag_offset[row]; 281 pj = bj + diag_offset[row] + 1; 282 x1 = pv[0]; x2 = pv[1]; x3 = pv[2]; x4 = pv[3]; 283 x5 = pv[4]; x6 = pv[5]; x7 = pv[6]; x8 = pv[7]; x9 = pv[8]; 284 pc[0] = m1 = p1*x1 + p4*x2 + p7*x3; 285 pc[1] = m2 = p2*x1 + p5*x2 + p8*x3; 286 pc[2] = m3 = p3*x1 + p6*x2 + p9*x3; 287 288 pc[3] = m4 = p1*x4 + p4*x5 + p7*x6; 289 pc[4] = m5 = p2*x4 + p5*x5 + p8*x6; 290 pc[5] = m6 = p3*x4 + p6*x5 + p9*x6; 291 292 pc[6] = m7 = p1*x7 + p4*x8 + p7*x9; 293 pc[7] = m8 = p2*x7 + p5*x8 + p8*x9; 294 pc[8] = m9 = p3*x7 + p6*x8 + p9*x9; 295 296 nz = bi[row+1] - diag_offset[row] - 1; 297 pv += 9; 298 for (j=0; j<nz; j++) { 299 x1 = pv[0]; x2 = pv[1]; x3 = pv[2]; x4 = pv[3]; 300 x5 = pv[4]; x6 = pv[5]; x7 = pv[6]; x8 = pv[7]; x9 = pv[8]; 301 x = rtmp + 9*pj[j]; 302 x[0] -= m1*x1 + m4*x2 + m7*x3; 303 x[1] -= m2*x1 + m5*x2 + m8*x3; 304 x[2] -= m3*x1 + m6*x2 + m9*x3; 305 306 x[3] -= m1*x4 + m4*x5 + m7*x6; 307 x[4] -= m2*x4 + m5*x5 + m8*x6; 308 x[5] -= m3*x4 + m6*x5 + m9*x6; 309 310 x[6] -= m1*x7 + m4*x8 + m7*x9; 311 x[7] -= m2*x7 + m5*x8 + m8*x9; 312 x[8] -= m3*x7 + m6*x8 + m9*x9; 313 pv += 9; 314 } 315 ierr = PetscLogFlops(54.0*nz+36.0);CHKERRQ(ierr); 316 } 317 row = *ajtmp++; 318 } 319 /* finished row so stick it into b->a */ 320 pv = ba + 9*bi[i]; 321 pj = bj + bi[i]; 322 nz = bi[i+1] - bi[i]; 323 for (j=0; j<nz; j++) { 324 x = rtmp+9*pj[j]; 325 pv[0] = x[0]; pv[1] = x[1]; pv[2] = x[2]; pv[3] = x[3]; 326 pv[4] = x[4]; pv[5] = x[5]; pv[6] = x[6]; pv[7] = x[7]; pv[8] = x[8]; 327 pv += 9; 328 } 329 /* invert diagonal block */ 330 w = ba + 9*diag_offset[i]; 331 ierr = Kernel_A_gets_inverse_A_3(w,shift);CHKERRQ(ierr); 332 } 333 334 ierr = PetscFree(rtmp);CHKERRQ(ierr); 335 C->ops->solve = MatSolve_SeqBAIJ_3_NaturalOrdering_inplace; 336 C->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_3_NaturalOrdering_inplace; 337 C->assembled = PETSC_TRUE; 338 ierr = PetscLogFlops(1.333333333333*3*3*3*b->mbs);CHKERRQ(ierr); /* from inverting diagonal blocks */ 339 PetscFunctionReturn(0); 340 } 341 342 /* 343 MatLUFactorNumeric_SeqBAIJ_3_NaturalOrdering - 344 copied from MatLUFactorNumeric_SeqBAIJ_2_NaturalOrdering_inplace() 345 */ 346 #undef __FUNCT__ 347 #define __FUNCT__ "MatLUFactorNumeric_SeqBAIJ_3_NaturalOrdering" 348 PetscErrorCode MatLUFactorNumeric_SeqBAIJ_3_NaturalOrdering(Mat B,Mat A,const MatFactorInfo *info) 349 { 350 Mat C=B; 351 Mat_SeqBAIJ *a=(Mat_SeqBAIJ*)A->data,*b=(Mat_SeqBAIJ *)C->data; 352 PetscErrorCode ierr; 353 PetscInt i,j,k,nz,nzL,row; 354 const PetscInt n=a->mbs,*ai=a->i,*aj=a->j,*bi=b->i,*bj=b->j; 355 const PetscInt *ajtmp,*bjtmp,*bdiag=b->diag,*pj,bs2=a->bs2; 356 MatScalar *rtmp,*pc,*mwork,*v,*pv,*aa=a->a; 357 PetscInt flg; 358 PetscReal shift = info->shiftamount; 359 360 PetscFunctionBegin; 361 /* generate work space needed by the factorization */ 362 ierr = PetscMalloc2(bs2*n,MatScalar,&rtmp,bs2,MatScalar,&mwork);CHKERRQ(ierr); 363 ierr = PetscMemzero(rtmp,bs2*n*sizeof(MatScalar));CHKERRQ(ierr); 364 365 for (i=0; i<n; i++){ 366 /* zero rtmp */ 367 /* L part */ 368 nz = bi[i+1] - bi[i]; 369 bjtmp = bj + bi[i]; 370 for (j=0; j<nz; j++){ 371 ierr = PetscMemzero(rtmp+bs2*bjtmp[j],bs2*sizeof(MatScalar));CHKERRQ(ierr); 372 } 373 374 /* U part */ 375 nz = bdiag[i] - bdiag[i+1]; 376 bjtmp = bj + bdiag[i+1] + 1; 377 for (j=0; j<nz; j++){ 378 ierr = PetscMemzero(rtmp+bs2*bjtmp[j],bs2*sizeof(MatScalar));CHKERRQ(ierr); 379 } 380 381 /* load in initial (unfactored row) */ 382 nz = ai[i+1] - ai[i]; 383 ajtmp = aj + ai[i]; 384 v = aa + bs2*ai[i]; 385 for (j=0; j<nz; j++) { 386 ierr = PetscMemcpy(rtmp+bs2*ajtmp[j],v+bs2*j,bs2*sizeof(MatScalar));CHKERRQ(ierr); 387 } 388 389 /* elimination */ 390 bjtmp = bj + bi[i]; 391 nzL = bi[i+1] - bi[i]; 392 for(k=0;k<nzL;k++){ 393 row = bjtmp[k]; 394 pc = rtmp + bs2*row; 395 for (flg=0,j=0; j<bs2; j++) { if (pc[j]!=0.0) { flg = 1; break; }} 396 if (flg) { 397 pv = b->a + bs2*bdiag[row]; 398 /* Kernel_A_gets_A_times_B(bs,pc,pv,mwork); *pc = *pc * (*pv); */ 399 ierr = Kernel_A_gets_A_times_B_3(pc,pv,mwork);CHKERRQ(ierr); 400 401 pj = b->j + bdiag[row+1]+1; /* beginning of U(row,:) */ 402 pv = b->a + bs2*(bdiag[row+1]+1); 403 nz = bdiag[row] - bdiag[row+1] - 1; /* num of entries in U(row,:) excluding diag */ 404 for (j=0; j<nz; j++) { 405 /* Kernel_A_gets_A_minus_B_times_C(bs,rtmp+bs2*pj[j],pc,pv+bs2*j); */ 406 /* rtmp+bs2*pj[j] = rtmp+bs2*pj[j] - (*pc)*(pv+bs2*j) */ 407 v = rtmp + bs2*pj[j]; 408 ierr = Kernel_A_gets_A_minus_B_times_C_3(v,pc,pv);CHKERRQ(ierr); 409 pv += bs2; 410 } 411 ierr = PetscLogFlops(54*nz+45);CHKERRQ(ierr); /* flops = 2*bs^3*nz + 2*bs^3 - bs2) */ 412 } 413 } 414 415 /* finished row so stick it into b->a */ 416 /* L part */ 417 pv = b->a + bs2*bi[i] ; 418 pj = b->j + bi[i] ; 419 nz = bi[i+1] - bi[i]; 420 for (j=0; j<nz; j++) { 421 ierr = PetscMemcpy(pv+bs2*j,rtmp+bs2*pj[j],bs2*sizeof(MatScalar));CHKERRQ(ierr); 422 } 423 424 /* Mark diagonal and invert diagonal for simplier triangular solves */ 425 pv = b->a + bs2*bdiag[i]; 426 pj = b->j + bdiag[i]; 427 ierr = PetscMemcpy(pv,rtmp+bs2*pj[0],bs2*sizeof(MatScalar));CHKERRQ(ierr); 428 /* ierr = Kernel_A_gets_inverse_A(bs,pv,v_pivots,v_work);CHKERRQ(ierr); */ 429 ierr = Kernel_A_gets_inverse_A_3(pv,shift);CHKERRQ(ierr); 430 431 /* U part */ 432 pv = b->a + bs2*(bdiag[i+1]+1); 433 pj = b->j + bdiag[i+1]+1; 434 nz = bdiag[i] - bdiag[i+1] - 1; 435 for (j=0; j<nz; j++){ 436 ierr = PetscMemcpy(pv+bs2*j,rtmp+bs2*pj[j],bs2*sizeof(MatScalar));CHKERRQ(ierr); 437 } 438 } 439 ierr = PetscFree2(rtmp,mwork);CHKERRQ(ierr); 440 C->ops->solve = MatSolve_SeqBAIJ_3_NaturalOrdering; 441 C->ops->solvetranspose = MatSolveTranspose_SeqBAIJ_3_NaturalOrdering; 442 C->assembled = PETSC_TRUE; 443 ierr = PetscLogFlops(1.333333333333*3*3*3*n);CHKERRQ(ierr); /* from inverting diagonal blocks */ 444 PetscFunctionReturn(0); 445 } 446 447