1 #ifdef PETSC_RCS_HEADER 2 static char vcid[] = "$Id: baij2.c,v 1.26 1998/04/13 17:39:42 bsmith Exp bsmith $"; 3 #endif 4 5 #include "pinclude/pviewer.h" 6 #include "sys.h" 7 #include "src/mat/impls/baij/seq/baij.h" 8 #include "src/vec/vecimpl.h" 9 #include "src/inline/spops.h" 10 #include "petsc.h" 11 #include "src/inline/bitarray.h" 12 13 14 #undef __FUNC__ 15 #define __FUNC__ "MatIncreaseOverlap_SeqBAIJ" 16 int MatIncreaseOverlap_SeqBAIJ(Mat A,int is_max,IS *is,int ov) 17 { 18 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 19 int row, i,j,k,l,m,n, *idx,ierr, *nidx, isz, val, ival; 20 int start, end, *ai, *aj,bs,*nidx2; 21 BT table; 22 23 PetscFunctionBegin; 24 m = a->mbs; 25 ai = a->i; 26 aj = a->j; 27 bs = a->bs; 28 29 if (ov < 0) SETERRQ(PETSC_ERR_ARG_OUTOFRANGE,0,"Negative overlap specified"); 30 31 ierr = BTCreate(m,table); CHKERRQ(ierr); 32 nidx = (int *) PetscMalloc((m+1)*sizeof(int)); CHKPTRQ(nidx); 33 nidx2 = (int *)PetscMalloc((a->m+1)*sizeof(int)); CHKPTRQ(nidx2); 34 35 for ( i=0; i<is_max; i++ ) { 36 /* Initialise the two local arrays */ 37 isz = 0; 38 BTMemzero(m,table); 39 40 /* Extract the indices, assume there can be duplicate entries */ 41 ierr = ISGetIndices(is[i],&idx); CHKERRQ(ierr); 42 ierr = ISGetSize(is[i],&n); CHKERRQ(ierr); 43 44 /* Enter these into the temp arrays i.e mark table[row], enter row into new index */ 45 for ( j=0; j<n ; ++j){ 46 ival = idx[j]/bs; /* convert the indices into block indices */ 47 if (ival>m) SETERRQ(PETSC_ERR_ARG_OUTOFRANGE,0,"index greater than mat-dim"); 48 if(!BTLookupSet(table, ival)) { nidx[isz++] = ival;} 49 } 50 ierr = ISRestoreIndices(is[i],&idx); CHKERRQ(ierr); 51 ierr = ISDestroy(is[i]); CHKERRQ(ierr); 52 53 k = 0; 54 for ( j=0; j<ov; j++){ /* for each overlap*/ 55 n = isz; 56 for ( ; k<n ; k++){ /* do only those rows in nidx[k], which are not done yet */ 57 row = nidx[k]; 58 start = ai[row]; 59 end = ai[row+1]; 60 for ( l = start; l<end ; l++){ 61 val = aj[l]; 62 if (!BTLookupSet(table,val)) {nidx[isz++] = val;} 63 } 64 } 65 } 66 /* expand the Index Set */ 67 for (j=0; j<isz; j++ ) { 68 for (k=0; k<bs; k++ ) 69 nidx2[j*bs+k] = nidx[j]*bs+k; 70 } 71 ierr = ISCreateGeneral(PETSC_COMM_SELF, isz*bs, nidx2, (is+i)); CHKERRQ(ierr); 72 } 73 BTDestroy(table); 74 PetscFree(nidx); 75 PetscFree(nidx2); 76 PetscFunctionReturn(0); 77 } 78 79 #undef __FUNC__ 80 #define __FUNC__ "MatGetSubMatrix_SeqBAIJ_Private" 81 int MatGetSubMatrix_SeqBAIJ_Private(Mat A,IS isrow,IS iscol,int cs,MatGetSubMatrixCall scall,Mat *B) 82 { 83 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data,*c; 84 int *smap, i, k, kstart, kend, ierr, oldcols = a->nbs,*lens; 85 int row,mat_i,*mat_j,tcol,*mat_ilen; 86 int *irow, *icol, nrows, ncols,*ssmap,bs=a->bs, bs2=a->bs2; 87 int *aj = a->j, *ai = a->i; 88 Scalar *mat_a; 89 Mat C; 90 91 PetscFunctionBegin; 92 ierr = ISSorted(iscol,(PetscTruth*)&i); 93 if (!i) SETERRQ(PETSC_ERR_ARG_WRONGSTATE,0,"IS is not sorted"); 94 95 ierr = ISGetIndices(isrow,&irow); CHKERRQ(ierr); 96 ierr = ISGetIndices(iscol,&icol); CHKERRQ(ierr); 97 ierr = ISGetSize(isrow,&nrows); CHKERRQ(ierr); 98 ierr = ISGetSize(iscol,&ncols); CHKERRQ(ierr); 99 100 smap = (int *) PetscMalloc((1+oldcols)*sizeof(int)); CHKPTRQ(smap); 101 ssmap = smap; 102 lens = (int *) PetscMalloc((1+nrows)*sizeof(int)); CHKPTRQ(lens); 103 PetscMemzero(smap,oldcols*sizeof(int)); 104 for ( i=0; i<ncols; i++ ) smap[icol[i]] = i+1; 105 /* determine lens of each row */ 106 for (i=0; i<nrows; i++) { 107 kstart = ai[irow[i]]; 108 kend = kstart + a->ilen[irow[i]]; 109 lens[i] = 0; 110 for ( k=kstart; k<kend; k++ ) { 111 if (ssmap[aj[k]]) { 112 lens[i]++; 113 } 114 } 115 } 116 /* Create and fill new matrix */ 117 if (scall == MAT_REUSE_MATRIX) { 118 c = (Mat_SeqBAIJ *)((*B)->data); 119 120 if (c->mbs!=nrows || c->nbs!=ncols || c->bs!=bs) SETERRQ(PETSC_ERR_ARG_SIZ,0,"Submatrix wrong size"); 121 if (PetscMemcmp(c->ilen,lens, c->mbs *sizeof(int))) { 122 SETERRQ(PETSC_ERR_ARG_SIZ,0,"Cannot reuse matrix. wrong no of nonzeros"); 123 } 124 PetscMemzero(c->ilen,c->mbs*sizeof(int)); 125 C = *B; 126 } else { 127 ierr = MatCreateSeqBAIJ(A->comm,bs,nrows*bs,ncols*bs,0,lens,&C);CHKERRQ(ierr); 128 } 129 c = (Mat_SeqBAIJ *)(C->data); 130 for (i=0; i<nrows; i++) { 131 row = irow[i]; 132 kstart = ai[row]; 133 kend = kstart + a->ilen[row]; 134 mat_i = c->i[i]; 135 mat_j = c->j + mat_i; 136 mat_a = c->a + mat_i*bs2; 137 mat_ilen = c->ilen + i; 138 for ( k=kstart; k<kend; k++ ) { 139 if ((tcol=ssmap[a->j[k]])) { 140 *mat_j++ = tcol - 1; 141 PetscMemcpy(mat_a,a->a+k*bs2,bs2*sizeof(Scalar)); mat_a+=bs2; 142 (*mat_ilen)++; 143 } 144 } 145 } 146 147 /* Free work space */ 148 ierr = ISRestoreIndices(iscol,&icol); CHKERRQ(ierr); 149 PetscFree(smap); PetscFree(lens); 150 ierr = MatAssemblyBegin(C,MAT_FINAL_ASSEMBLY); CHKERRQ(ierr); 151 ierr = MatAssemblyEnd(C,MAT_FINAL_ASSEMBLY); CHKERRQ(ierr); 152 153 ierr = ISRestoreIndices(isrow,&irow); CHKERRQ(ierr); 154 *B = C; 155 PetscFunctionReturn(0); 156 } 157 158 #undef __FUNC__ 159 #define __FUNC__ "MatGetSubMatrix_SeqBAIJ" 160 int MatGetSubMatrix_SeqBAIJ(Mat A,IS isrow,IS iscol,int cs,MatGetSubMatrixCall scall,Mat *B) 161 { 162 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 163 IS is1,is2; 164 int *vary,*iary,*irow,*icol,nrows,ncols,i,ierr,bs=a->bs,count; 165 166 PetscFunctionBegin; 167 ierr = ISGetIndices(isrow,&irow); CHKERRQ(ierr); 168 ierr = ISGetIndices(iscol,&icol); CHKERRQ(ierr); 169 ierr = ISGetSize(isrow,&nrows); CHKERRQ(ierr); 170 ierr = ISGetSize(iscol,&ncols); CHKERRQ(ierr); 171 172 /* Verify if the indices corespond to each element in a block 173 and form the IS with compressed IS */ 174 vary = (int *) PetscMalloc(2*(a->mbs+1)*sizeof(int)); CHKPTRQ(vary); 175 iary = vary + a->mbs; 176 PetscMemzero(vary,(a->mbs)*sizeof(int)); 177 for ( i=0; i<nrows; i++) vary[irow[i]/bs]++; 178 count = 0; 179 for (i=0; i<a->mbs; i++) { 180 if (vary[i]!=0 && vary[i]!=bs) SETERRA(1,0,"Index set does not match blocks"); 181 if (vary[i]==bs) iary[count++] = i; 182 } 183 ierr = ISCreateGeneral(PETSC_COMM_SELF, count, iary,&is1); CHKERRQ(ierr); 184 185 PetscMemzero(vary,(a->mbs)*sizeof(int)); 186 for ( i=0; i<ncols; i++) vary[icol[i]/bs]++; 187 count = 0; 188 for (i=0; i<a->mbs; i++) { 189 if (vary[i]!=0 && vary[i]!=bs) SETERRA(1,0,"MatGetSubmatrices_SeqBAIJ:"); 190 if (vary[i]==bs) iary[count++] = i; 191 } 192 ierr = ISCreateGeneral(PETSC_COMM_SELF, count, iary,&is2); CHKERRQ(ierr); 193 ierr = ISRestoreIndices(isrow,&irow); CHKERRQ(ierr); 194 ierr = ISRestoreIndices(iscol,&icol); CHKERRQ(ierr); 195 PetscFree(vary); 196 197 ierr = MatGetSubMatrix_SeqBAIJ_Private(A,is1,is2,cs,scall,B); CHKERRQ(ierr); 198 ISDestroy(is1); 199 ISDestroy(is2); 200 PetscFunctionReturn(0); 201 } 202 203 #undef __FUNC__ 204 #define __FUNC__ "MatGetSubMatrices_SeqBAIJ" 205 int MatGetSubMatrices_SeqBAIJ(Mat A,int n, IS *irow,IS *icol,MatGetSubMatrixCall scall,Mat **B) 206 { 207 int ierr,i; 208 209 PetscFunctionBegin; 210 if (scall == MAT_INITIAL_MATRIX) { 211 *B = (Mat *) PetscMalloc( (n+1)*sizeof(Mat) ); CHKPTRQ(*B); 212 } 213 214 for ( i=0; i<n; i++ ) { 215 ierr = MatGetSubMatrix_SeqBAIJ(A,irow[i],icol[i],PETSC_DECIDE,scall,&(*B)[i]);CHKERRQ(ierr); 216 } 217 PetscFunctionReturn(0); 218 } 219 220 221 /* -------------------------------------------------------*/ 222 /* Should check that shapes of vectors and matrices match */ 223 /* -------------------------------------------------------*/ 224 #include "pinclude/blaslapack.h" 225 226 #undef __FUNC__ 227 #define __FUNC__ "MatMult_SeqBAIJ_1" 228 int MatMult_SeqBAIJ_1(Mat A,Vec xx,Vec zz) 229 { 230 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 231 Scalar *x,*z,*v,sum; 232 int mbs=a->mbs,i,*idx,*ii,n,ierr; 233 234 PetscFunctionBegin; 235 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 236 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 237 238 idx = a->j; 239 v = a->a; 240 ii = a->i; 241 242 for ( i=0; i<mbs; i++ ) { 243 n = ii[1] - ii[0]; ii++; 244 sum = 0.0; 245 while (n--) sum += *v++ * x[*idx++]; 246 z[i] = sum; 247 } 248 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 249 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 250 PLogFlops(2*a->nz - a->m); 251 PetscFunctionReturn(0); 252 } 253 254 #undef __FUNC__ 255 #define __FUNC__ "MatMult_SeqBAIJ_2" 256 int MatMult_SeqBAIJ_2(Mat A,Vec xx,Vec zz) 257 { 258 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 259 Scalar *x,*z,*v,*xb,sum1,sum2; 260 Scalar x1,x2; 261 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 262 263 PetscFunctionBegin; 264 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 265 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 266 267 idx = a->j; 268 v = a->a; 269 ii = a->i; 270 271 for ( i=0; i<mbs; i++ ) { 272 n = ii[1] - ii[0]; ii++; 273 sum1 = 0.0; sum2 = 0.0; 274 for ( j=0; j<n; j++ ) { 275 xb = x + 2*(*idx++); x1 = xb[0]; x2 = xb[1]; 276 sum1 += v[0]*x1 + v[2]*x2; 277 sum2 += v[1]*x1 + v[3]*x2; 278 v += 4; 279 } 280 z[0] = sum1; z[1] = sum2; 281 z += 2; 282 } 283 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 284 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 285 PLogFlops(4*a->nz - a->m); 286 PetscFunctionReturn(0); 287 } 288 289 #undef __FUNC__ 290 #define __FUNC__ "MatMult_SeqBAIJ_3" 291 int MatMult_SeqBAIJ_3(Mat A,Vec xx,Vec zz) 292 { 293 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 294 Scalar *x,*z,*v,*xb,sum1,sum2,sum3,x1,x2,x3; 295 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 296 297 #if defined(HAVE_PRAGMA_DISJOINT) 298 #pragma disjoint(*v,*z,*xb) 299 #endif 300 301 PetscFunctionBegin; 302 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 303 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 304 305 idx = a->j; 306 v = a->a; 307 ii = a->i; 308 309 for ( i=0; i<mbs; i++ ) { 310 n = ii[1] - ii[0]; ii++; 311 sum1 = 0.0; sum2 = 0.0; sum3 = 0.0; 312 for ( j=0; j<n; j++ ) { 313 xb = x + 3*(*idx++); x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; 314 sum1 += v[0]*x1 + v[3]*x2 + v[6]*x3; 315 sum2 += v[1]*x1 + v[4]*x2 + v[7]*x3; 316 sum3 += v[2]*x1 + v[5]*x2 + v[8]*x3; 317 v += 9; 318 } 319 z[0] = sum1; z[1] = sum2; z[2] = sum3; 320 z += 3; 321 } 322 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 323 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 324 PLogFlops(18*a->nz - a->m); 325 PetscFunctionReturn(0); 326 } 327 328 #undef __FUNC__ 329 #define __FUNC__ "MatMult_SeqBAIJ_4" 330 int MatMult_SeqBAIJ_4(Mat A,Vec xx,Vec zz) 331 { 332 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 333 Scalar *x,*z,*v,*xb,sum1,sum2,sum3,sum4,x1,x2,x3,x4; 334 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 335 336 PetscFunctionBegin; 337 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 338 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 339 340 idx = a->j; 341 v = a->a; 342 ii = a->i; 343 344 for ( i=0; i<mbs; i++ ) { 345 n = ii[1] - ii[0]; ii++; 346 sum1 = 0.0; sum2 = 0.0; sum3 = 0.0; sum4 = 0.0; 347 for ( j=0; j<n; j++ ) { 348 xb = x + 4*(*idx++); 349 x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; x4 = xb[3]; 350 sum1 += v[0]*x1 + v[4]*x2 + v[8]*x3 + v[12]*x4; 351 sum2 += v[1]*x1 + v[5]*x2 + v[9]*x3 + v[13]*x4; 352 sum3 += v[2]*x1 + v[6]*x2 + v[10]*x3 + v[14]*x4; 353 sum4 += v[3]*x1 + v[7]*x2 + v[11]*x3 + v[15]*x4; 354 v += 16; 355 } 356 z[0] = sum1; z[1] = sum2; z[2] = sum3; z[3] = sum4; 357 z += 4; 358 } 359 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 360 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 361 PLogFlops(32*a->nz - a->m); 362 PetscFunctionReturn(0); 363 } 364 365 #undef __FUNC__ 366 #define __FUNC__ "MatMult_SeqBAIJ_5" 367 int MatMult_SeqBAIJ_5(Mat A,Vec xx,Vec zz) 368 { 369 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 370 Scalar sum1,sum2,sum3,sum4,sum5,x1,x2,x3,x4,x5; 371 Scalar * v,* xb,* z, * x; 372 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 373 374 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 375 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 376 377 idx = a->j; 378 v = a->a; 379 ii = a->i; 380 381 for ( i=0; i<mbs; i++ ) { 382 n = ii[1] - ii[0]; ii++; 383 sum1 = 0.0; sum2 = 0.0; sum3 = 0.0; sum4 = 0.0; sum5 = 0.0; 384 for ( j=0; j<n; j++ ) { 385 xb = x + 5*(*idx++); 386 x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; x4 = xb[3]; x5 = xb[4]; 387 sum1 += v[0]*x1 + v[5]*x2 + v[10]*x3 + v[15]*x4 + v[20]*x5; 388 sum2 += v[1]*x1 + v[6]*x2 + v[11]*x3 + v[16]*x4 + v[21]*x5; 389 sum3 += v[2]*x1 + v[7]*x2 + v[12]*x3 + v[17]*x4 + v[22]*x5; 390 sum4 += v[3]*x1 + v[8]*x2 + v[13]*x3 + v[18]*x4 + v[23]*x5; 391 sum5 += v[4]*x1 + v[9]*x2 + v[14]*x3 + v[19]*x4 + v[24]*x5; 392 v += 25; 393 } 394 z[0] = sum1; z[1] = sum2; z[2] = sum3; z[3] = sum4; z[4] = sum5; 395 z += 5; 396 } 397 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 398 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 399 PLogFlops(50*a->nz - a->m); 400 PetscFunctionReturn(0); 401 } 402 403 #undef __FUNC__ 404 #define __FUNC__ "MatMult_SeqBAIJ_7" 405 int MatMult_SeqBAIJ_7(Mat A,Vec xx,Vec zz) 406 { 407 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 408 Scalar *x,*z,*v,*xb,sum1,sum2,sum3,sum4,sum5,sum6,sum7; 409 Scalar x1,x2,x3,x4,x5,x6,x7; 410 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 411 412 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 413 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 414 415 idx = a->j; 416 v = a->a; 417 ii = a->i; 418 419 for ( i=0; i<mbs; i++ ) { 420 n = ii[1] - ii[0]; ii++; 421 sum1 = 0.0; sum2 = 0.0; sum3 = 0.0; sum4 = 0.0; sum5 = 0.0; sum6 = 0.0; sum7 = 0.0; 422 for ( j=0; j<n; j++ ) { 423 xb = x + 7*(*idx++); 424 x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; x4 = xb[3]; x5 = xb[4]; x6 = xb[5]; x7 = xb[6]; 425 sum1 += v[0]*x1 + v[7]*x2 + v[14]*x3 + v[21]*x4 + v[28]*x5 + v[35]*x6 + v[42]*x7; 426 sum2 += v[1]*x1 + v[8]*x2 + v[15]*x3 + v[22]*x4 + v[29]*x5 + v[36]*x6 + v[43]*x7; 427 sum3 += v[2]*x1 + v[9]*x2 + v[16]*x3 + v[23]*x4 + v[30]*x5 + v[37]*x6 + v[44]*x7; 428 sum4 += v[3]*x1 + v[10]*x2 + v[17]*x3 + v[24]*x4 + v[31]*x5 + v[38]*x6 + v[45]*x7; 429 sum5 += v[4]*x1 + v[11]*x2 + v[18]*x3 + v[25]*x4 + v[32]*x5 + v[39]*x6 + v[46]*x7; 430 sum6 += v[5]*x1 + v[12]*x2 + v[19]*x3 + v[26]*x4 + v[33]*x5 + v[40]*x6 + v[47]*x7; 431 sum7 += v[6]*x1 + v[13]*x2 + v[20]*x3 + v[27]*x4 + v[34]*x5 + v[41]*x6 + v[48]*x7; 432 v += 49; 433 } 434 z[0] = sum1; z[1] = sum2; z[2] = sum3; z[3] = sum4; z[4] = sum5; z[5] = sum6; z[6] = sum7; 435 z += 7; 436 } 437 438 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 439 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 440 PLogFlops(98*a->nz - a->m); 441 PetscFunctionReturn(0); 442 } 443 444 #undef __FUNC__ 445 #define __FUNC__ "MatMult_SeqBAIJ_N" 446 int MatMult_SeqBAIJ_N(Mat A,Vec xx,Vec zz) 447 { 448 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 449 Scalar *x,*z,*v,*xb; 450 Scalar _DOne = 1.0,*work,*workt,_DZero = 0.0; 451 int ierr,mbs=a->mbs,i,*idx,*ii,bs=a->bs,j,n,bs2=a->bs2; 452 int _One = 1,ncols,k; 453 454 PetscFunctionBegin; 455 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 456 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 457 458 idx = a->j; 459 v = a->a; 460 ii = a->i; 461 462 463 if (!a->mult_work) { 464 k = PetscMax(a->m,a->n); 465 a->mult_work = (Scalar *) PetscMalloc((k+1)*sizeof(Scalar));CHKPTRQ(a->mult_work); 466 } 467 work = a->mult_work; 468 for ( i=0; i<mbs; i++ ) { 469 n = ii[1] - ii[0]; ii++; 470 ncols = n*bs; 471 workt = work; 472 for ( j=0; j<n; j++ ) { 473 xb = x + bs*(*idx++); 474 for ( k=0; k<bs; k++ ) workt[k] = xb[k]; 475 workt += bs; 476 } 477 LAgemv_("N",&bs,&ncols,&_DOne,v,&bs,work,&_One,&_DZero,z,&_One); 478 v += n*bs2; 479 z += bs; 480 } 481 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 482 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 483 PLogFlops(2*a->nz*bs2 - a->m); 484 PetscFunctionReturn(0); 485 } 486 487 #undef __FUNC__ 488 #define __FUNC__ "MatMultAdd_SeqBAIJ_1" 489 int MatMultAdd_SeqBAIJ_1(Mat A,Vec xx,Vec yy,Vec zz) 490 { 491 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 492 Scalar *x,*y,*z,*v,sum; 493 int ierr,mbs=a->mbs,i,*idx,*ii,n; 494 495 PetscFunctionBegin; 496 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 497 ierr = VecGetArray(yy,&y);CHKERRQ(ierr); 498 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 499 500 idx = a->j; 501 v = a->a; 502 ii = a->i; 503 504 for ( i=0; i<mbs; i++ ) { 505 n = ii[1] - ii[0]; ii++; 506 sum = y[i]; 507 while (n--) sum += *v++ * x[*idx++]; 508 z[i] = sum; 509 } 510 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 511 ierr = VecRestoreArray(yy,&y);CHKERRQ(ierr); 512 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 513 PLogFlops(2*a->nz); 514 PetscFunctionReturn(0); 515 } 516 517 #undef __FUNC__ 518 #define __FUNC__ "MatMultAdd_SeqBAIJ_2" 519 int MatMultAdd_SeqBAIJ_2(Mat A,Vec xx,Vec yy,Vec zz) 520 { 521 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 522 Scalar *x,*y,*z,*v,*xb,sum1,sum2; 523 Scalar x1,x2; 524 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 525 526 PetscFunctionBegin; 527 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 528 ierr = VecGetArray(yy,&y);CHKERRQ(ierr); 529 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 530 531 idx = a->j; 532 v = a->a; 533 ii = a->i; 534 535 for ( i=0; i<mbs; i++ ) { 536 n = ii[1] - ii[0]; ii++; 537 sum1 = y[0]; sum2 = y[1]; 538 for ( j=0; j<n; j++ ) { 539 xb = x + 2*(*idx++); x1 = xb[0]; x2 = xb[1]; 540 sum1 += v[0]*x1 + v[2]*x2; 541 sum2 += v[1]*x1 + v[3]*x2; 542 v += 4; 543 } 544 z[0] = sum1; z[1] = sum2; 545 z += 2; y += 2; 546 } 547 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 548 ierr = VecRestoreArray(yy,&y);CHKERRQ(ierr); 549 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 550 PLogFlops(4*a->nz); 551 PetscFunctionReturn(0); 552 } 553 554 #undef __FUNC__ 555 #define __FUNC__ "MatMultAdd_SeqBAIJ_3" 556 int MatMultAdd_SeqBAIJ_3(Mat A,Vec xx,Vec yy,Vec zz) 557 { 558 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 559 Scalar *x,*y,*z,*v,*xb,sum1,sum2,sum3,x1,x2,x3; 560 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 561 562 PetscFunctionBegin; 563 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 564 ierr = VecGetArray(yy,&y);CHKERRQ(ierr); 565 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 566 567 idx = a->j; 568 v = a->a; 569 ii = a->i; 570 571 for ( i=0; i<mbs; i++ ) { 572 n = ii[1] - ii[0]; ii++; 573 sum1 = y[0]; sum2 = y[1]; sum3 = y[2]; 574 for ( j=0; j<n; j++ ) { 575 xb = x + 3*(*idx++); x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; 576 sum1 += v[0]*x1 + v[3]*x2 + v[6]*x3; 577 sum2 += v[1]*x1 + v[4]*x2 + v[7]*x3; 578 sum3 += v[2]*x1 + v[5]*x2 + v[8]*x3; 579 v += 9; 580 } 581 z[0] = sum1; z[1] = sum2; z[2] = sum3; 582 z += 3; y += 3; 583 } 584 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 585 ierr = VecRestoreArray(yy,&y);CHKERRQ(ierr); 586 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 587 PLogFlops(18*a->nz); 588 PetscFunctionReturn(0); 589 } 590 591 #undef __FUNC__ 592 #define __FUNC__ "MatMultAdd_SeqBAIJ_4" 593 int MatMultAdd_SeqBAIJ_4(Mat A,Vec xx,Vec yy,Vec zz) 594 { 595 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 596 Scalar *x,*y,*z,*v,*xb,sum1,sum2,sum3,sum4,x1,x2,x3,x4; 597 int ierr,mbs=a->mbs,i,*idx,*ii; 598 int j,n; 599 600 PetscFunctionBegin; 601 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 602 ierr = VecGetArray(yy,&y);CHKERRQ(ierr); 603 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 604 605 idx = a->j; 606 v = a->a; 607 ii = a->i; 608 609 for ( i=0; i<mbs; i++ ) { 610 n = ii[1] - ii[0]; ii++; 611 sum1 = y[0]; sum2 = y[1]; sum3 = y[2]; sum4 = y[3]; 612 for ( j=0; j<n; j++ ) { 613 xb = x + 4*(*idx++); 614 x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; x4 = xb[3]; 615 sum1 += v[0]*x1 + v[4]*x2 + v[8]*x3 + v[12]*x4; 616 sum2 += v[1]*x1 + v[5]*x2 + v[9]*x3 + v[13]*x4; 617 sum3 += v[2]*x1 + v[6]*x2 + v[10]*x3 + v[14]*x4; 618 sum4 += v[3]*x1 + v[7]*x2 + v[11]*x3 + v[15]*x4; 619 v += 16; 620 } 621 z[0] = sum1; z[1] = sum2; z[2] = sum3; z[3] = sum4; 622 z += 4; y += 4; 623 } 624 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 625 ierr = VecRestoreArray(yy,&y);CHKERRQ(ierr); 626 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 627 PLogFlops(32*a->nz); 628 PetscFunctionReturn(0); 629 } 630 631 #undef __FUNC__ 632 #define __FUNC__ "MatMultAdd_SeqBAIJ_5" 633 int MatMultAdd_SeqBAIJ_5(Mat A,Vec xx,Vec yy,Vec zz) 634 { 635 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 636 Scalar *x,*y,*z,*v,*xb,sum1,sum2,sum3,sum4,sum5,x1,x2,x3,x4,x5; 637 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 638 639 PetscFunctionBegin; 640 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 641 ierr = VecGetArray(yy,&y);CHKERRQ(ierr); 642 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 643 644 idx = a->j; 645 v = a->a; 646 ii = a->i; 647 648 for ( i=0; i<mbs; i++ ) { 649 n = ii[1] - ii[0]; ii++; 650 sum1 = y[0]; sum2 = y[1]; sum3 = y[2]; sum4 = y[3]; sum5 = y[4]; 651 for ( j=0; j<n; j++ ) { 652 xb = x + 5*(*idx++); 653 x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; x4 = xb[3]; x5 = xb[4]; 654 sum1 += v[0]*x1 + v[5]*x2 + v[10]*x3 + v[15]*x4 + v[20]*x5; 655 sum2 += v[1]*x1 + v[6]*x2 + v[11]*x3 + v[16]*x4 + v[21]*x5; 656 sum3 += v[2]*x1 + v[7]*x2 + v[12]*x3 + v[17]*x4 + v[22]*x5; 657 sum4 += v[3]*x1 + v[8]*x2 + v[13]*x3 + v[18]*x4 + v[23]*x5; 658 sum5 += v[4]*x1 + v[9]*x2 + v[14]*x3 + v[19]*x4 + v[24]*x5; 659 v += 25; 660 } 661 z[0] = sum1; z[1] = sum2; z[2] = sum3; z[3] = sum4; z[4] = sum5; 662 z += 5; y += 5; 663 } 664 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 665 ierr = VecRestoreArray(yy,&y);CHKERRQ(ierr); 666 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 667 PLogFlops(50*a->nz); 668 PetscFunctionReturn(0); 669 } 670 671 #undef __FUNC__ 672 #define __FUNC__ "MatMultAdd_SeqBAIJ_7" 673 int MatMultAdd_SeqBAIJ_7(Mat A,Vec xx,Vec yy,Vec zz) 674 { 675 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 676 Scalar *x,*y,*z,*v,*xb,sum1,sum2,sum3,sum4,sum5,sum6,sum7; 677 Scalar x1,x2,x3,x4,x5,x6,x7; 678 int ierr,mbs=a->mbs,i,*idx,*ii,j,n; 679 680 PetscFunctionBegin; 681 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 682 ierr = VecGetArray(yy,&y);CHKERRQ(ierr); 683 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 684 685 idx = a->j; 686 v = a->a; 687 ii = a->i; 688 689 for ( i=0; i<mbs; i++ ) { 690 n = ii[1] - ii[0]; ii++; 691 sum1 = y[0]; sum2 = y[1]; sum3 = y[2]; sum4 = y[3]; sum5 = y[4]; sum6 = y[5]; sum7 = y[6]; 692 for ( j=0; j<n; j++ ) { 693 xb = x + 7*(*idx++); 694 x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; x4 = xb[3]; x5 = xb[4]; x6 = xb[5]; x7 = xb[6]; 695 sum1 += v[0]*x1 + v[7]*x2 + v[14]*x3 + v[21]*x4 + v[28]*x5 + v[35]*x6 + v[42]*x7; 696 sum2 += v[1]*x1 + v[8]*x2 + v[15]*x3 + v[22]*x4 + v[29]*x5 + v[36]*x6 + v[43]*x7; 697 sum3 += v[2]*x1 + v[9]*x2 + v[16]*x3 + v[23]*x4 + v[30]*x5 + v[37]*x6 + v[44]*x7; 698 sum4 += v[3]*x1 + v[10]*x2 + v[17]*x3 + v[24]*x4 + v[31]*x5 + v[38]*x6 + v[45]*x7; 699 sum5 += v[4]*x1 + v[11]*x2 + v[18]*x3 + v[25]*x4 + v[32]*x5 + v[39]*x6 + v[46]*x7; 700 sum6 += v[5]*x1 + v[12]*x2 + v[19]*x3 + v[26]*x4 + v[33]*x5 + v[40]*x6 + v[47]*x7; 701 sum7 += v[6]*x1 + v[13]*x2 + v[20]*x3 + v[27]*x4 + v[34]*x5 + v[41]*x6 + v[48]*x7; 702 v += 49; 703 } 704 z[0] = sum1; z[1] = sum2; z[2] = sum3; z[3] = sum4; z[4] = sum5; z[5] = sum6; z[6] = sum7; 705 z += 7; y += 7; 706 } 707 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 708 ierr = VecRestoreArray(yy,&y);CHKERRQ(ierr); 709 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 710 PLogFlops(98*a->nz); 711 PetscFunctionReturn(0); 712 } 713 714 715 #undef __FUNC__ 716 #define __FUNC__ "MatMultAdd_SeqBAIJ_N" 717 int MatMultAdd_SeqBAIJ_N(Mat A,Vec xx,Vec yy,Vec zz) 718 { 719 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 720 Scalar *x,*z,*v,*xb; 721 int mbs=a->mbs,i,*idx,*ii,bs=a->bs,j,n,bs2=a->bs2,ierr; 722 int _One = 1,ncols,k; Scalar _DOne = 1.0, *work,*workt; 723 724 PetscFunctionBegin; 725 if ( xx != yy) { ierr = VecCopy(yy,zz); CHKERRQ(ierr); } 726 727 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 728 ierr = VecGetArray(zz,&z);CHKERRQ(ierr); 729 730 idx = a->j; 731 v = a->a; 732 ii = a->i; 733 734 735 if (!a->mult_work) { 736 k = PetscMax(a->m,a->n); 737 a->mult_work = (Scalar *) PetscMalloc(k*sizeof(Scalar));CHKPTRQ(a->mult_work); 738 } 739 work = a->mult_work; 740 for ( i=0; i<mbs; i++ ) { 741 n = ii[1] - ii[0]; ii++; 742 ncols = n*bs; 743 workt = work; 744 for ( j=0; j<n; j++ ) { 745 xb = x + bs*(*idx++); 746 for ( k=0; k<bs; k++ ) workt[k] = xb[k]; 747 workt += bs; 748 } 749 LAgemv_("N",&bs,&ncols,&_DOne,v,&bs,work,&_One,&_DOne,z,&_One); 750 v += n*bs2; 751 z += bs; 752 } 753 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 754 ierr = VecRestoreArray(zz,&z);CHKERRQ(ierr); 755 PLogFlops(2*a->nz*bs2 ); 756 PetscFunctionReturn(0); 757 } 758 759 #undef __FUNC__ 760 #define __FUNC__ "MatMultTrans_SeqBAIJ" 761 int MatMultTrans_SeqBAIJ(Mat A,Vec xx,Vec zz) 762 { 763 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 764 Scalar *xg,*zg,*zb; 765 Scalar *x,*z,*v,*xb,x1,x2,x3,x4,x5; 766 int mbs=a->mbs,i,*idx,*ii,*ai=a->i,rval,N=a->n; 767 int bs=a->bs,j,n,bs2=a->bs2,*ib,ierr; 768 769 770 PetscFunctionBegin; 771 ierr = VecGetArray(xx,&xg);CHKERRQ(ierr); x = xg; 772 ierr = VecGetArray(zz,&zg);CHKERRQ(ierr); z = zg; 773 PetscMemzero(z,N*sizeof(Scalar)); 774 775 idx = a->j; 776 v = a->a; 777 ii = a->i; 778 779 switch (bs) { 780 case 1: 781 for ( i=0; i<mbs; i++ ) { 782 n = ii[1] - ii[0]; ii++; 783 xb = x + i; x1 = xb[0]; 784 ib = idx + ai[i]; 785 for ( j=0; j<n; j++ ) { 786 rval = ib[j]; 787 z[rval] += *v++ * x1; 788 } 789 } 790 break; 791 case 2: 792 for ( i=0; i<mbs; i++ ) { 793 n = ii[1] - ii[0]; ii++; 794 xb = x + 2*i; x1 = xb[0]; x2 = xb[1]; 795 ib = idx + ai[i]; 796 for ( j=0; j<n; j++ ) { 797 rval = ib[j]*2; 798 z[rval++] += v[0]*x1 + v[1]*x2; 799 z[rval++] += v[2]*x1 + v[3]*x2; 800 v += 4; 801 } 802 } 803 break; 804 case 3: 805 for ( i=0; i<mbs; i++ ) { 806 n = ii[1] - ii[0]; ii++; 807 xb = x + 3*i; x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; 808 ib = idx + ai[i]; 809 for ( j=0; j<n; j++ ) { 810 rval = ib[j]*3; 811 z[rval++] += v[0]*x1 + v[1]*x2 + v[2]*x3; 812 z[rval++] += v[3]*x1 + v[4]*x2 + v[5]*x3; 813 z[rval++] += v[6]*x1 + v[7]*x2 + v[8]*x3; 814 v += 9; 815 } 816 } 817 break; 818 case 4: 819 for ( i=0; i<mbs; i++ ) { 820 n = ii[1] - ii[0]; ii++; 821 xb = x + 4*i; x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; x4 = xb[3]; 822 ib = idx + ai[i]; 823 for ( j=0; j<n; j++ ) { 824 rval = ib[j]*4; 825 z[rval++] += v[0]*x1 + v[1]*x2 + v[2]*x3 + v[3]*x4; 826 z[rval++] += v[4]*x1 + v[5]*x2 + v[6]*x3 + v[7]*x4; 827 z[rval++] += v[8]*x1 + v[9]*x2 + v[10]*x3 + v[11]*x4; 828 z[rval++] += v[12]*x1 + v[13]*x2 + v[14]*x3 + v[15]*x4; 829 v += 16; 830 } 831 } 832 break; 833 case 5: 834 for ( i=0; i<mbs; i++ ) { 835 n = ii[1] - ii[0]; ii++; 836 xb = x + 5*i; x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; 837 x4 = xb[3]; x5 = xb[4]; 838 ib = idx + ai[i]; 839 for ( j=0; j<n; j++ ) { 840 rval = ib[j]*5; 841 z[rval++] += v[0]*x1 + v[1]*x2 + v[2]*x3 + v[3]*x4 + v[4]*x5; 842 z[rval++] += v[5]*x1 + v[6]*x2 + v[7]*x3 + v[8]*x4 + v[9]*x5; 843 z[rval++] += v[10]*x1 + v[11]*x2 + v[12]*x3 + v[13]*x4 + v[14]*x5; 844 z[rval++] += v[15]*x1 + v[16]*x2 + v[17]*x3 + v[18]*x4 + v[19]*x5; 845 z[rval++] += v[20]*x1 + v[21]*x2 + v[22]*x3 + v[23]*x4 + v[24]*x5; 846 v += 25; 847 } 848 } 849 break; 850 /* block sizes larger then 5 by 5 are handled by BLAS */ 851 default: { 852 int _One = 1,ncols,k; Scalar _DOne = 1.0, *work,*workt; 853 if (!a->mult_work) { 854 k = PetscMax(a->m,a->n); 855 a->mult_work = (Scalar *) PetscMalloc(k*sizeof(Scalar)); 856 CHKPTRQ(a->mult_work); 857 } 858 work = a->mult_work; 859 for ( i=0; i<mbs; i++ ) { 860 n = ii[1] - ii[0]; ii++; 861 ncols = n*bs; 862 PetscMemzero(work,ncols*sizeof(Scalar)); 863 LAgemv_("T",&bs,&ncols,&_DOne,v,&bs,x,&_One,&_DOne,work,&_One); 864 v += n*bs2; 865 x += bs; 866 workt = work; 867 for ( j=0; j<n; j++ ) { 868 zb = z + bs*(*idx++); 869 for ( k=0; k<bs; k++ ) zb[k] += workt[k] ; 870 workt += bs; 871 } 872 } 873 } 874 } 875 ierr = VecRestoreArray(xx,&xg); CHKERRQ(ierr); 876 ierr = VecRestoreArray(zz,&zg); CHKERRQ(ierr); 877 PLogFlops(2*a->nz*a->bs2 - a->n); 878 PetscFunctionReturn(0); 879 } 880 881 #undef __FUNC__ 882 #define __FUNC__ "MatMultTransAdd_SeqBAIJ" 883 int MatMultTransAdd_SeqBAIJ(Mat A,Vec xx,Vec yy,Vec zz) 884 885 { 886 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 887 Scalar *xg,*zg,*zb; 888 Scalar *x,*z,*v,*xb,x1,x2,x3,x4,x5; 889 int mbs=a->mbs,i,*idx,*ii,*ai=a->i,rval,N=a->n; 890 int bs=a->bs,j,n,bs2=a->bs2,*ib,ierr; 891 892 PetscFunctionBegin; 893 ierr = VecGetArray(xx,&xg);CHKERRQ(ierr); x = xg; 894 ierr = VecGetArray(zz,&zg);CHKERRQ(ierr); z = zg; 895 896 if ( yy != zz ) { ierr = VecCopy(yy,zz); CHKERRQ(ierr); } 897 else PetscMemzero(z,N*sizeof(Scalar)); 898 899 idx = a->j; 900 v = a->a; 901 ii = a->i; 902 903 switch (bs) { 904 case 1: 905 for ( i=0; i<mbs; i++ ) { 906 n = ii[1] - ii[0]; ii++; 907 xb = x + i; x1 = xb[0]; 908 ib = idx + ai[i]; 909 for ( j=0; j<n; j++ ) { 910 rval = ib[j]; 911 z[rval] += *v++ * x1; 912 } 913 } 914 break; 915 case 2: 916 for ( i=0; i<mbs; i++ ) { 917 n = ii[1] - ii[0]; ii++; 918 xb = x + 2*i; x1 = xb[0]; x2 = xb[1]; 919 ib = idx + ai[i]; 920 for ( j=0; j<n; j++ ) { 921 rval = ib[j]*2; 922 z[rval++] += v[0]*x1 + v[1]*x2; 923 z[rval++] += v[2]*x1 + v[3]*x2; 924 v += 4; 925 } 926 } 927 break; 928 case 3: 929 for ( i=0; i<mbs; i++ ) { 930 n = ii[1] - ii[0]; ii++; 931 xb = x + 3*i; x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; 932 ib = idx + ai[i]; 933 for ( j=0; j<n; j++ ) { 934 rval = ib[j]*3; 935 z[rval++] += v[0]*x1 + v[1]*x2 + v[2]*x3; 936 z[rval++] += v[3]*x1 + v[4]*x2 + v[5]*x3; 937 z[rval++] += v[6]*x1 + v[7]*x2 + v[8]*x3; 938 v += 9; 939 } 940 } 941 break; 942 case 4: 943 for ( i=0; i<mbs; i++ ) { 944 n = ii[1] - ii[0]; ii++; 945 xb = x + 4*i; x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; x4 = xb[3]; 946 ib = idx + ai[i]; 947 for ( j=0; j<n; j++ ) { 948 rval = ib[j]*4; 949 z[rval++] += v[0]*x1 + v[1]*x2 + v[2]*x3 + v[3]*x4; 950 z[rval++] += v[4]*x1 + v[5]*x2 + v[6]*x3 + v[7]*x4; 951 z[rval++] += v[8]*x1 + v[9]*x2 + v[10]*x3 + v[11]*x4; 952 z[rval++] += v[12]*x1 + v[13]*x2 + v[14]*x3 + v[15]*x4; 953 v += 16; 954 } 955 } 956 break; 957 case 5: 958 for ( i=0; i<mbs; i++ ) { 959 n = ii[1] - ii[0]; ii++; 960 xb = x + 5*i; x1 = xb[0]; x2 = xb[1]; x3 = xb[2]; 961 x4 = xb[3]; x5 = xb[4]; 962 ib = idx + ai[i]; 963 for ( j=0; j<n; j++ ) { 964 rval = ib[j]*5; 965 z[rval++] += v[0]*x1 + v[1]*x2 + v[2]*x3 + v[3]*x4 + v[4]*x5; 966 z[rval++] += v[5]*x1 + v[6]*x2 + v[7]*x3 + v[8]*x4 + v[9]*x5; 967 z[rval++] += v[10]*x1 + v[11]*x2 + v[12]*x3 + v[13]*x4 + v[14]*x5; 968 z[rval++] += v[15]*x1 + v[16]*x2 + v[17]*x3 + v[18]*x4 + v[19]*x5; 969 z[rval++] += v[20]*x1 + v[21]*x2 + v[22]*x3 + v[23]*x4 + v[24]*x5; 970 v += 25; 971 } 972 } 973 break; 974 /* block sizes larger then 5 by 5 are handled by BLAS */ 975 default: { 976 int _One = 1,ncols,k; Scalar _DOne = 1.0, *work,*workt; 977 if (!a->mult_work) { 978 k = PetscMax(a->m,a->n); 979 a->mult_work = (Scalar *) PetscMalloc(k*sizeof(Scalar)); 980 CHKPTRQ(a->mult_work); 981 } 982 work = a->mult_work; 983 for ( i=0; i<mbs; i++ ) { 984 n = ii[1] - ii[0]; ii++; 985 ncols = n*bs; 986 PetscMemzero(work,ncols*sizeof(Scalar)); 987 LAgemv_("T",&bs,&ncols,&_DOne,v,&bs,x,&_One,&_DOne,work,&_One); 988 v += n*bs2; 989 x += bs; 990 workt = work; 991 for ( j=0; j<n; j++ ) { 992 zb = z + bs*(*idx++); 993 for ( k=0; k<bs; k++ ) zb[k] += workt[k] ; 994 workt += bs; 995 } 996 } 997 } 998 } 999 ierr = VecRestoreArray(xx,&xg); CHKERRQ(ierr); 1000 ierr = VecRestoreArray(zz,&zg); CHKERRQ(ierr); 1001 PLogFlops(2*a->nz*a->bs2); 1002 PetscFunctionReturn(0); 1003 } 1004 1005 #undef __FUNC__ 1006 #define __FUNC__ "MatScale_SeqBAIJ" 1007 int MatScale_SeqBAIJ(Scalar *alpha,Mat inA) 1008 { 1009 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) inA->data; 1010 int one = 1, totalnz = a->bs2*a->nz; 1011 1012 PetscFunctionBegin; 1013 BLscal_( &totalnz, alpha, a->a, &one ); 1014 PLogFlops(totalnz); 1015 PetscFunctionReturn(0); 1016 } 1017 1018 #undef __FUNC__ 1019 #define __FUNC__ "MatNorm_SeqBAIJ" 1020 int MatNorm_SeqBAIJ(Mat A,NormType type,double *norm) 1021 { 1022 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 1023 Scalar *v = a->a; 1024 double sum = 0.0; 1025 int i,nz=a->nz,bs2=a->bs2; 1026 1027 PetscFunctionBegin; 1028 if (type == NORM_FROBENIUS) { 1029 for (i=0; i< bs2*nz; i++ ) { 1030 #if defined(USE_PETSC_COMPLEX) 1031 sum += real(conj(*v)*(*v)); v++; 1032 #else 1033 sum += (*v)*(*v); v++; 1034 #endif 1035 } 1036 *norm = sqrt(sum); 1037 } 1038 else { 1039 SETERRQ(PETSC_ERR_SUP,0,"No support for this norm yet"); 1040 } 1041 PetscFunctionReturn(0); 1042 } 1043 1044 1045 #undef __FUNC__ 1046 #define __FUNC__ "MatEqual_SeqBAIJ" 1047 int MatEqual_SeqBAIJ(Mat A,Mat B, PetscTruth* flg) 1048 { 1049 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *)A->data, *b = (Mat_SeqBAIJ *)B->data; 1050 1051 PetscFunctionBegin; 1052 if (B->type !=MATSEQBAIJ) SETERRQ(PETSC_ERR_ARG_INCOMP,0,"Matrices must be same type"); 1053 1054 /* If the matrix/block dimensions are not equal, or no of nonzeros or shift */ 1055 if ((a->m != b->m) || (a->n !=b->n) || (a->bs != b->bs)|| (a->nz != b->nz)) { 1056 *flg = PETSC_FALSE; PetscFunctionReturn(0); 1057 } 1058 1059 /* if the a->i are the same */ 1060 if (PetscMemcmp(a->i,b->i, (a->mbs+1)*sizeof(int))) { 1061 *flg = PETSC_FALSE; PetscFunctionReturn(0); 1062 } 1063 1064 /* if a->j are the same */ 1065 if (PetscMemcmp(a->j,b->j,(a->nz)*sizeof(int))) { 1066 *flg = PETSC_FALSE; PetscFunctionReturn(0); 1067 } 1068 1069 /* if a->a are the same */ 1070 if (PetscMemcmp(a->a, b->a,(a->nz)*(a->bs)*(a->bs)*sizeof(Scalar))) { 1071 *flg = PETSC_FALSE; PetscFunctionReturn(0); 1072 } 1073 *flg = PETSC_TRUE; 1074 PetscFunctionReturn(0); 1075 1076 } 1077 1078 #undef __FUNC__ 1079 #define __FUNC__ "MatGetDiagonal_SeqBAIJ" 1080 int MatGetDiagonal_SeqBAIJ(Mat A,Vec v) 1081 { 1082 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 1083 int ierr,i,j,k,n,row,bs,*ai,*aj,ambs,bs2; 1084 Scalar *x, zero = 0.0,*aa,*aa_j; 1085 1086 PetscFunctionBegin; 1087 if (A->factor) SETERRQ(PETSC_ERR_ARG_WRONGSTATE,0,"Not for factored matrix"); 1088 bs = a->bs; 1089 aa = a->a; 1090 ai = a->i; 1091 aj = a->j; 1092 ambs = a->mbs; 1093 bs2 = a->bs2; 1094 1095 ierr = VecSet(&zero,v);CHKERRQ(ierr); 1096 ierr = VecGetArray(v,&x);CHKERRQ(ierr); 1097 ierr = VecGetLocalSize(v,&n);CHKERRQ(ierr); 1098 if (n != a->m) SETERRQ(PETSC_ERR_ARG_SIZ,0,"Nonconforming matrix and vector"); 1099 for ( i=0; i<ambs; i++ ) { 1100 for ( j=ai[i]; j<ai[i+1]; j++ ) { 1101 if (aj[j] == i) { 1102 row = i*bs; 1103 aa_j = aa+j*bs2; 1104 for (k=0; k<bs2; k+=(bs+1),row++) x[row] = aa_j[k]; 1105 break; 1106 } 1107 } 1108 } 1109 PetscFunctionReturn(0); 1110 } 1111 1112 #undef __FUNC__ 1113 #define __FUNC__ "MatDiagonalScale_SeqBAIJ" 1114 int MatDiagonalScale_SeqBAIJ(Mat A,Vec ll,Vec rr) 1115 { 1116 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 1117 Scalar *l,*r,x,*v,*aa,*li,*ri; 1118 int ierr,i,j,k,lm,rn,M,m,n,*ai,*aj,mbs,tmp,bs,bs2; 1119 1120 PetscFunctionBegin; 1121 ai = a->i; 1122 aj = a->j; 1123 aa = a->a; 1124 m = a->m; 1125 n = a->n; 1126 bs = a->bs; 1127 mbs = a->mbs; 1128 bs2 = a->bs2; 1129 if (ll) { 1130 ierr = VecGetArray(ll,&l); CHKERRQ(ierr); 1131 ierr = VecGetLocalSize(ll,&lm);CHKERRQ(ierr); 1132 if (lm != m) SETERRQ(PETSC_ERR_ARG_SIZ,0,"Left scaling vector wrong length"); 1133 for ( i=0; i<mbs; i++ ) { /* for each block row */ 1134 M = ai[i+1] - ai[i]; 1135 li = l + i*bs; 1136 v = aa + bs2*ai[i]; 1137 for ( j=0; j<M; j++ ) { /* for each block */ 1138 for ( k=0; k<bs2; k++ ) { 1139 (*v++) *= li[k%bs]; 1140 } 1141 } 1142 } 1143 } 1144 1145 if (rr) { 1146 ierr = VecGetArray(rr,&r); CHKERRQ(ierr); 1147 ierr = VecGetLocalSize(rr,&rn);CHKERRQ(ierr); 1148 if (rn != n) SETERRQ(PETSC_ERR_ARG_SIZ,0,"Right scaling vector wrong length"); 1149 for ( i=0; i<mbs; i++ ) { /* for each block row */ 1150 M = ai[i+1] - ai[i]; 1151 v = aa + bs2*ai[i]; 1152 for ( j=0; j<M; j++ ) { /* for each block */ 1153 ri = r + bs*aj[ai[i]+j]; 1154 for ( k=0; k<bs; k++ ) { 1155 x = ri[k]; 1156 for ( tmp=0; tmp<bs; tmp++ ) (*v++) *= x; 1157 } 1158 } 1159 } 1160 } 1161 PetscFunctionReturn(0); 1162 } 1163 1164 1165 #undef __FUNC__ 1166 #define __FUNC__ "MatGetInfo_SeqBAIJ" 1167 int MatGetInfo_SeqBAIJ(Mat A,MatInfoType flag,MatInfo *info) 1168 { 1169 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 1170 1171 PetscFunctionBegin; 1172 info->rows_global = (double)a->m; 1173 info->columns_global = (double)a->n; 1174 info->rows_local = (double)a->m; 1175 info->columns_local = (double)a->n; 1176 info->block_size = a->bs2; 1177 info->nz_allocated = a->maxnz; 1178 info->nz_used = a->bs2*a->nz; 1179 info->nz_unneeded = (double)(info->nz_allocated - info->nz_used); 1180 /* if (info->nz_unneeded != A->info.nz_unneeded) 1181 printf("space descrepancy: maxnz-nz = %d, nz_unneeded = %d\n",(int)info->nz_unneeded,(int)A->info.nz_unneeded); */ 1182 info->assemblies = A->num_ass; 1183 info->mallocs = a->reallocs; 1184 info->memory = A->mem; 1185 if (A->factor) { 1186 info->fill_ratio_given = A->info.fill_ratio_given; 1187 info->fill_ratio_needed = A->info.fill_ratio_needed; 1188 info->factor_mallocs = A->info.factor_mallocs; 1189 } else { 1190 info->fill_ratio_given = 0; 1191 info->fill_ratio_needed = 0; 1192 info->factor_mallocs = 0; 1193 } 1194 PetscFunctionReturn(0); 1195 } 1196 1197 1198 #undef __FUNC__ 1199 #define __FUNC__ "MatZeroEntries_SeqBAIJ" 1200 int MatZeroEntries_SeqBAIJ(Mat A) 1201 { 1202 Mat_SeqBAIJ *a = (Mat_SeqBAIJ *) A->data; 1203 1204 PetscFunctionBegin; 1205 PetscMemzero(a->a,a->bs2*a->i[a->mbs]*sizeof(Scalar)); 1206 PetscFunctionReturn(0); 1207 } 1208