1 2 #include <../src/mat/impls/baij/mpi/mpibaij.h> /*I "petscmat.h" I*/ 3 #include <../src/mat/impls/sbaij/mpi/mpisbaij.h> 4 #include <../src/mat/impls/sbaij/seq/sbaij.h> 5 #include <petscblaslapack.h> 6 7 extern PetscErrorCode MatSetUpMultiply_MPISBAIJ(Mat); 8 extern PetscErrorCode MatSetUpMultiply_MPISBAIJ_2comm(Mat); 9 extern PetscErrorCode MatDisAssemble_MPISBAIJ(Mat); 10 extern PetscErrorCode MatIncreaseOverlap_MPISBAIJ(Mat,PetscInt,IS[],PetscInt); 11 extern PetscErrorCode MatGetValues_SeqSBAIJ(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],PetscScalar []); 12 extern PetscErrorCode MatGetValues_SeqBAIJ(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],PetscScalar []); 13 extern PetscErrorCode MatSetValues_SeqSBAIJ(Mat,PetscInt,const PetscInt [],PetscInt,const PetscInt [],const PetscScalar [],InsertMode); 14 extern PetscErrorCode MatSetValuesBlocked_SeqSBAIJ(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],const PetscScalar[],InsertMode); 15 extern PetscErrorCode MatSetValuesBlocked_SeqBAIJ(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],const PetscScalar[],InsertMode); 16 extern PetscErrorCode MatGetRow_SeqSBAIJ(Mat,PetscInt,PetscInt*,PetscInt**,PetscScalar**); 17 extern PetscErrorCode MatRestoreRow_SeqSBAIJ(Mat,PetscInt,PetscInt*,PetscInt**,PetscScalar**); 18 extern PetscErrorCode MatZeroRows_SeqSBAIJ(Mat,IS,PetscScalar*,Vec,Vec); 19 extern PetscErrorCode MatZeroRows_SeqBAIJ(Mat,IS,PetscScalar*,Vec,Vec); 20 extern PetscErrorCode MatGetRowMaxAbs_MPISBAIJ(Mat,Vec,PetscInt[]); 21 extern PetscErrorCode MatSOR_MPISBAIJ(Mat,Vec,PetscReal,MatSORType,PetscReal,PetscInt,PetscInt,Vec); 22 23 #undef __FUNCT__ 24 #define __FUNCT__ "MatStoreValues_MPISBAIJ" 25 PetscErrorCode MatStoreValues_MPISBAIJ(Mat mat) 26 { 27 Mat_MPISBAIJ *aij = (Mat_MPISBAIJ*)mat->data; 28 PetscErrorCode ierr; 29 30 PetscFunctionBegin; 31 ierr = MatStoreValues(aij->A);CHKERRQ(ierr); 32 ierr = MatStoreValues(aij->B);CHKERRQ(ierr); 33 PetscFunctionReturn(0); 34 } 35 36 #undef __FUNCT__ 37 #define __FUNCT__ "MatRetrieveValues_MPISBAIJ" 38 PetscErrorCode MatRetrieveValues_MPISBAIJ(Mat mat) 39 { 40 Mat_MPISBAIJ *aij = (Mat_MPISBAIJ*)mat->data; 41 PetscErrorCode ierr; 42 43 PetscFunctionBegin; 44 ierr = MatRetrieveValues(aij->A);CHKERRQ(ierr); 45 ierr = MatRetrieveValues(aij->B);CHKERRQ(ierr); 46 PetscFunctionReturn(0); 47 } 48 49 #define MatSetValues_SeqSBAIJ_A_Private(row,col,value,addv) \ 50 { \ 51 \ 52 brow = row/bs; \ 53 rp = aj + ai[brow]; ap = aa + bs2*ai[brow]; \ 54 rmax = aimax[brow]; nrow = ailen[brow]; \ 55 bcol = col/bs; \ 56 ridx = row % bs; cidx = col % bs; \ 57 low = 0; high = nrow; \ 58 while (high-low > 3) { \ 59 t = (low+high)/2; \ 60 if (rp[t] > bcol) high = t; \ 61 else low = t; \ 62 } \ 63 for (_i=low; _i<high; _i++) { \ 64 if (rp[_i] > bcol) break; \ 65 if (rp[_i] == bcol) { \ 66 bap = ap + bs2*_i + bs*cidx + ridx; \ 67 if (addv == ADD_VALUES) *bap += value; \ 68 else *bap = value; \ 69 goto a_noinsert; \ 70 } \ 71 } \ 72 if (a->nonew == 1) goto a_noinsert; \ 73 if (a->nonew == -1) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Inserting a new nonzero (%D, %D) into matrix", row, col); \ 74 MatSeqXAIJReallocateAIJ(A,a->mbs,bs2,nrow,brow,bcol,rmax,aa,ai,aj,rp,ap,aimax,a->nonew,MatScalar); \ 75 N = nrow++ - 1; \ 76 /* shift up all the later entries in this row */ \ 77 for (ii=N; ii>=_i; ii--) { \ 78 rp[ii+1] = rp[ii]; \ 79 ierr = PetscMemcpy(ap+bs2*(ii+1),ap+bs2*(ii),bs2*sizeof(MatScalar));CHKERRQ(ierr); \ 80 } \ 81 if (N>=_i) { ierr = PetscMemzero(ap+bs2*_i,bs2*sizeof(MatScalar));CHKERRQ(ierr); } \ 82 rp[_i] = bcol; \ 83 ap[bs2*_i + bs*cidx + ridx] = value; \ 84 A->nonzerostate++;\ 85 a_noinsert:; \ 86 ailen[brow] = nrow; \ 87 } 88 89 #define MatSetValues_SeqSBAIJ_B_Private(row,col,value,addv) \ 90 { \ 91 brow = row/bs; \ 92 rp = bj + bi[brow]; ap = ba + bs2*bi[brow]; \ 93 rmax = bimax[brow]; nrow = bilen[brow]; \ 94 bcol = col/bs; \ 95 ridx = row % bs; cidx = col % bs; \ 96 low = 0; high = nrow; \ 97 while (high-low > 3) { \ 98 t = (low+high)/2; \ 99 if (rp[t] > bcol) high = t; \ 100 else low = t; \ 101 } \ 102 for (_i=low; _i<high; _i++) { \ 103 if (rp[_i] > bcol) break; \ 104 if (rp[_i] == bcol) { \ 105 bap = ap + bs2*_i + bs*cidx + ridx; \ 106 if (addv == ADD_VALUES) *bap += value; \ 107 else *bap = value; \ 108 goto b_noinsert; \ 109 } \ 110 } \ 111 if (b->nonew == 1) goto b_noinsert; \ 112 if (b->nonew == -1) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Inserting a new nonzero (%D, %D) into matrix", row, col); \ 113 MatSeqXAIJReallocateAIJ(B,b->mbs,bs2,nrow,brow,bcol,rmax,ba,bi,bj,rp,ap,bimax,b->nonew,MatScalar); \ 114 N = nrow++ - 1; \ 115 /* shift up all the later entries in this row */ \ 116 for (ii=N; ii>=_i; ii--) { \ 117 rp[ii+1] = rp[ii]; \ 118 ierr = PetscMemcpy(ap+bs2*(ii+1),ap+bs2*(ii),bs2*sizeof(MatScalar));CHKERRQ(ierr); \ 119 } \ 120 if (N>=_i) { ierr = PetscMemzero(ap+bs2*_i,bs2*sizeof(MatScalar));CHKERRQ(ierr);} \ 121 rp[_i] = bcol; \ 122 ap[bs2*_i + bs*cidx + ridx] = value; \ 123 B->nonzerostate++;\ 124 b_noinsert:; \ 125 bilen[brow] = nrow; \ 126 } 127 128 /* Only add/insert a(i,j) with i<=j (blocks). 129 Any a(i,j) with i>j input by user is ingored. 130 */ 131 #undef __FUNCT__ 132 #define __FUNCT__ "MatSetValues_MPISBAIJ" 133 PetscErrorCode MatSetValues_MPISBAIJ(Mat mat,PetscInt m,const PetscInt im[],PetscInt n,const PetscInt in[],const PetscScalar v[],InsertMode addv) 134 { 135 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 136 MatScalar value; 137 PetscBool roworiented = baij->roworiented; 138 PetscErrorCode ierr; 139 PetscInt i,j,row,col; 140 PetscInt rstart_orig=mat->rmap->rstart; 141 PetscInt rend_orig =mat->rmap->rend,cstart_orig=mat->cmap->rstart; 142 PetscInt cend_orig =mat->cmap->rend,bs=mat->rmap->bs; 143 144 /* Some Variables required in the macro */ 145 Mat A = baij->A; 146 Mat_SeqSBAIJ *a = (Mat_SeqSBAIJ*)(A)->data; 147 PetscInt *aimax=a->imax,*ai=a->i,*ailen=a->ilen,*aj=a->j; 148 MatScalar *aa =a->a; 149 150 Mat B = baij->B; 151 Mat_SeqBAIJ *b = (Mat_SeqBAIJ*)(B)->data; 152 PetscInt *bimax=b->imax,*bi=b->i,*bilen=b->ilen,*bj=b->j; 153 MatScalar *ba =b->a; 154 155 PetscInt *rp,ii,nrow,_i,rmax,N,brow,bcol; 156 PetscInt low,high,t,ridx,cidx,bs2=a->bs2; 157 MatScalar *ap,*bap; 158 159 /* for stash */ 160 PetscInt n_loc, *in_loc = NULL; 161 MatScalar *v_loc = NULL; 162 163 PetscFunctionBegin; 164 if (v) PetscValidScalarPointer(v,6); 165 if (!baij->donotstash) { 166 if (n > baij->n_loc) { 167 ierr = PetscFree(baij->in_loc);CHKERRQ(ierr); 168 ierr = PetscFree(baij->v_loc);CHKERRQ(ierr); 169 ierr = PetscMalloc1(n,&baij->in_loc);CHKERRQ(ierr); 170 ierr = PetscMalloc1(n,&baij->v_loc);CHKERRQ(ierr); 171 172 baij->n_loc = n; 173 } 174 in_loc = baij->in_loc; 175 v_loc = baij->v_loc; 176 } 177 178 for (i=0; i<m; i++) { 179 if (im[i] < 0) continue; 180 #if defined(PETSC_USE_DEBUG) 181 if (im[i] >= mat->rmap->N) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Row too large: row %D max %D",im[i],mat->rmap->N-1); 182 #endif 183 if (im[i] >= rstart_orig && im[i] < rend_orig) { /* this processor entry */ 184 row = im[i] - rstart_orig; /* local row index */ 185 for (j=0; j<n; j++) { 186 if (im[i]/bs > in[j]/bs) { 187 if (a->ignore_ltriangular) { 188 continue; /* ignore lower triangular blocks */ 189 } else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_USER,"Lower triangular value cannot be set for sbaij format. Ignoring these values, run with -mat_ignore_lower_triangular or call MatSetOption(mat,MAT_IGNORE_LOWER_TRIANGULAR,PETSC_TRUE)"); 190 } 191 if (in[j] >= cstart_orig && in[j] < cend_orig) { /* diag entry (A) */ 192 col = in[j] - cstart_orig; /* local col index */ 193 brow = row/bs; bcol = col/bs; 194 if (brow > bcol) continue; /* ignore lower triangular blocks of A */ 195 if (roworiented) value = v[i*n+j]; 196 else value = v[i+j*m]; 197 MatSetValues_SeqSBAIJ_A_Private(row,col,value,addv); 198 /* ierr = MatSetValues_SeqBAIJ(baij->A,1,&row,1,&col,&value,addv);CHKERRQ(ierr); */ 199 } else if (in[j] < 0) continue; 200 #if defined(PETSC_USE_DEBUG) 201 else if (in[j] >= mat->cmap->N) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Column too large: col %D max %D",in[j],mat->cmap->N-1); 202 #endif 203 else { /* off-diag entry (B) */ 204 if (mat->was_assembled) { 205 if (!baij->colmap) { 206 ierr = MatCreateColmap_MPIBAIJ_Private(mat);CHKERRQ(ierr); 207 } 208 #if defined(PETSC_USE_CTABLE) 209 ierr = PetscTableFind(baij->colmap,in[j]/bs + 1,&col);CHKERRQ(ierr); 210 col = col - 1; 211 #else 212 col = baij->colmap[in[j]/bs] - 1; 213 #endif 214 if (col < 0 && !((Mat_SeqSBAIJ*)(baij->A->data))->nonew) { 215 ierr = MatDisAssemble_MPISBAIJ(mat);CHKERRQ(ierr); 216 col = in[j]; 217 /* Reinitialize the variables required by MatSetValues_SeqBAIJ_B_Private() */ 218 B = baij->B; 219 b = (Mat_SeqBAIJ*)(B)->data; 220 bimax= b->imax;bi=b->i;bilen=b->ilen;bj=b->j; 221 ba = b->a; 222 } else col += in[j]%bs; 223 } else col = in[j]; 224 if (roworiented) value = v[i*n+j]; 225 else value = v[i+j*m]; 226 MatSetValues_SeqSBAIJ_B_Private(row,col,value,addv); 227 /* ierr = MatSetValues_SeqBAIJ(baij->B,1,&row,1,&col,&value,addv);CHKERRQ(ierr); */ 228 } 229 } 230 } else { /* off processor entry */ 231 if (mat->nooffprocentries) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Setting off process row %D even though MatSetOption(,MAT_NO_OFF_PROC_ENTRIES,PETSC_TRUE) was set",im[i]); 232 if (!baij->donotstash) { 233 mat->assembled = PETSC_FALSE; 234 n_loc = 0; 235 for (j=0; j<n; j++) { 236 if (im[i]/bs > in[j]/bs) continue; /* ignore lower triangular blocks */ 237 in_loc[n_loc] = in[j]; 238 if (roworiented) { 239 v_loc[n_loc] = v[i*n+j]; 240 } else { 241 v_loc[n_loc] = v[j*m+i]; 242 } 243 n_loc++; 244 } 245 ierr = MatStashValuesRow_Private(&mat->stash,im[i],n_loc,in_loc,v_loc,PETSC_FALSE);CHKERRQ(ierr); 246 } 247 } 248 } 249 PetscFunctionReturn(0); 250 } 251 252 #undef __FUNCT__ 253 #define __FUNCT__ "MatSetValuesBlocked_MPISBAIJ" 254 PetscErrorCode MatSetValuesBlocked_MPISBAIJ(Mat mat,PetscInt m,const PetscInt im[],PetscInt n,const PetscInt in[],const MatScalar v[],InsertMode addv) 255 { 256 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 257 const MatScalar *value; 258 MatScalar *barray =baij->barray; 259 PetscBool roworiented = baij->roworiented,ignore_ltriangular = ((Mat_SeqSBAIJ*)baij->A->data)->ignore_ltriangular; 260 PetscErrorCode ierr; 261 PetscInt i,j,ii,jj,row,col,rstart=baij->rstartbs; 262 PetscInt rend=baij->rendbs,cstart=baij->rstartbs,stepval; 263 PetscInt cend=baij->rendbs,bs=mat->rmap->bs,bs2=baij->bs2; 264 265 PetscFunctionBegin; 266 if (!barray) { 267 ierr = PetscMalloc1(bs2,&barray);CHKERRQ(ierr); 268 baij->barray = barray; 269 } 270 271 if (roworiented) { 272 stepval = (n-1)*bs; 273 } else { 274 stepval = (m-1)*bs; 275 } 276 for (i=0; i<m; i++) { 277 if (im[i] < 0) continue; 278 #if defined(PETSC_USE_DEBUG) 279 if (im[i] >= baij->Mbs) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Row too large, row %D max %D",im[i],baij->Mbs-1); 280 #endif 281 if (im[i] >= rstart && im[i] < rend) { 282 row = im[i] - rstart; 283 for (j=0; j<n; j++) { 284 if (im[i] > in[j]) { 285 if (ignore_ltriangular) continue; /* ignore lower triangular blocks */ 286 else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_USER,"Lower triangular value cannot be set for sbaij format. Ignoring these values, run with -mat_ignore_lower_triangular or call MatSetOption(mat,MAT_IGNORE_LOWER_TRIANGULAR,PETSC_TRUE)"); 287 } 288 /* If NumCol = 1 then a copy is not required */ 289 if ((roworiented) && (n == 1)) { 290 barray = (MatScalar*) v + i*bs2; 291 } else if ((!roworiented) && (m == 1)) { 292 barray = (MatScalar*) v + j*bs2; 293 } else { /* Here a copy is required */ 294 if (roworiented) { 295 value = v + i*(stepval+bs)*bs + j*bs; 296 } else { 297 value = v + j*(stepval+bs)*bs + i*bs; 298 } 299 for (ii=0; ii<bs; ii++,value+=stepval) { 300 for (jj=0; jj<bs; jj++) { 301 *barray++ = *value++; 302 } 303 } 304 barray -=bs2; 305 } 306 307 if (in[j] >= cstart && in[j] < cend) { 308 col = in[j] - cstart; 309 ierr = MatSetValuesBlocked_SeqSBAIJ(baij->A,1,&row,1,&col,barray,addv);CHKERRQ(ierr); 310 } else if (in[j] < 0) continue; 311 #if defined(PETSC_USE_DEBUG) 312 else if (in[j] >= baij->Nbs) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Column too large, col %D max %D",in[j],baij->Nbs-1); 313 #endif 314 else { 315 if (mat->was_assembled) { 316 if (!baij->colmap) { 317 ierr = MatCreateColmap_MPIBAIJ_Private(mat);CHKERRQ(ierr); 318 } 319 320 #if defined(PETSC_USE_DEBUG) 321 #if defined(PETSC_USE_CTABLE) 322 { PetscInt data; 323 ierr = PetscTableFind(baij->colmap,in[j]+1,&data);CHKERRQ(ierr); 324 if ((data - 1) % bs) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Incorrect colmap"); 325 } 326 #else 327 if ((baij->colmap[in[j]] - 1) % bs) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Incorrect colmap"); 328 #endif 329 #endif 330 #if defined(PETSC_USE_CTABLE) 331 ierr = PetscTableFind(baij->colmap,in[j]+1,&col);CHKERRQ(ierr); 332 col = (col - 1)/bs; 333 #else 334 col = (baij->colmap[in[j]] - 1)/bs; 335 #endif 336 if (col < 0 && !((Mat_SeqBAIJ*)(baij->A->data))->nonew) { 337 ierr = MatDisAssemble_MPISBAIJ(mat);CHKERRQ(ierr); 338 col = in[j]; 339 } 340 } else col = in[j]; 341 ierr = MatSetValuesBlocked_SeqBAIJ(baij->B,1,&row,1,&col,barray,addv);CHKERRQ(ierr); 342 } 343 } 344 } else { 345 if (mat->nooffprocentries) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Setting off process row %D even though MatSetOption(,MAT_NO_OFF_PROC_ENTRIES,PETSC_TRUE) was set",im[i]); 346 if (!baij->donotstash) { 347 if (roworiented) { 348 ierr = MatStashValuesRowBlocked_Private(&mat->bstash,im[i],n,in,v,m,n,i);CHKERRQ(ierr); 349 } else { 350 ierr = MatStashValuesColBlocked_Private(&mat->bstash,im[i],n,in,v,m,n,i);CHKERRQ(ierr); 351 } 352 } 353 } 354 } 355 PetscFunctionReturn(0); 356 } 357 358 #undef __FUNCT__ 359 #define __FUNCT__ "MatGetValues_MPISBAIJ" 360 PetscErrorCode MatGetValues_MPISBAIJ(Mat mat,PetscInt m,const PetscInt idxm[],PetscInt n,const PetscInt idxn[],PetscScalar v[]) 361 { 362 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 363 PetscErrorCode ierr; 364 PetscInt bs = mat->rmap->bs,i,j,bsrstart = mat->rmap->rstart,bsrend = mat->rmap->rend; 365 PetscInt bscstart = mat->cmap->rstart,bscend = mat->cmap->rend,row,col,data; 366 367 PetscFunctionBegin; 368 for (i=0; i<m; i++) { 369 if (idxm[i] < 0) continue; /* SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Negative row: %D",idxm[i]); */ 370 if (idxm[i] >= mat->rmap->N) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Row too large: row %D max %D",idxm[i],mat->rmap->N-1); 371 if (idxm[i] >= bsrstart && idxm[i] < bsrend) { 372 row = idxm[i] - bsrstart; 373 for (j=0; j<n; j++) { 374 if (idxn[j] < 0) continue; /* SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Negative column %D",idxn[j]); */ 375 if (idxn[j] >= mat->cmap->N) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Column too large: col %D max %D",idxn[j],mat->cmap->N-1); 376 if (idxn[j] >= bscstart && idxn[j] < bscend) { 377 col = idxn[j] - bscstart; 378 ierr = MatGetValues_SeqSBAIJ(baij->A,1,&row,1,&col,v+i*n+j);CHKERRQ(ierr); 379 } else { 380 if (!baij->colmap) { 381 ierr = MatCreateColmap_MPIBAIJ_Private(mat);CHKERRQ(ierr); 382 } 383 #if defined(PETSC_USE_CTABLE) 384 ierr = PetscTableFind(baij->colmap,idxn[j]/bs+1,&data);CHKERRQ(ierr); 385 data--; 386 #else 387 data = baij->colmap[idxn[j]/bs]-1; 388 #endif 389 if ((data < 0) || (baij->garray[data/bs] != idxn[j]/bs)) *(v+i*n+j) = 0.0; 390 else { 391 col = data + idxn[j]%bs; 392 ierr = MatGetValues_SeqBAIJ(baij->B,1,&row,1,&col,v+i*n+j);CHKERRQ(ierr); 393 } 394 } 395 } 396 } else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Only local values currently supported"); 397 } 398 PetscFunctionReturn(0); 399 } 400 401 #undef __FUNCT__ 402 #define __FUNCT__ "MatNorm_MPISBAIJ" 403 PetscErrorCode MatNorm_MPISBAIJ(Mat mat,NormType type,PetscReal *norm) 404 { 405 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 406 PetscErrorCode ierr; 407 PetscReal sum[2],*lnorm2; 408 409 PetscFunctionBegin; 410 if (baij->size == 1) { 411 ierr = MatNorm(baij->A,type,norm);CHKERRQ(ierr); 412 } else { 413 if (type == NORM_FROBENIUS) { 414 ierr = PetscMalloc1(2,&lnorm2);CHKERRQ(ierr); 415 ierr = MatNorm(baij->A,type,lnorm2);CHKERRQ(ierr); 416 *lnorm2 = (*lnorm2)*(*lnorm2); lnorm2++; /* squar power of norm(A) */ 417 ierr = MatNorm(baij->B,type,lnorm2);CHKERRQ(ierr); 418 *lnorm2 = (*lnorm2)*(*lnorm2); lnorm2--; /* squar power of norm(B) */ 419 ierr = MPI_Allreduce(lnorm2,sum,2,MPIU_REAL,MPIU_SUM,PetscObjectComm((PetscObject)mat));CHKERRQ(ierr); 420 *norm = PetscSqrtReal(sum[0] + 2*sum[1]); 421 ierr = PetscFree(lnorm2);CHKERRQ(ierr); 422 } else if (type == NORM_INFINITY || type == NORM_1) { /* max row/column sum */ 423 Mat_SeqSBAIJ *amat=(Mat_SeqSBAIJ*)baij->A->data; 424 Mat_SeqBAIJ *bmat=(Mat_SeqBAIJ*)baij->B->data; 425 PetscReal *rsum,*rsum2,vabs; 426 PetscInt *jj,*garray=baij->garray,rstart=baij->rstartbs,nz; 427 PetscInt brow,bcol,col,bs=baij->A->rmap->bs,row,grow,gcol,mbs=amat->mbs; 428 MatScalar *v; 429 430 ierr = PetscMalloc2(mat->cmap->N,&rsum,mat->cmap->N,&rsum2);CHKERRQ(ierr); 431 ierr = PetscMemzero(rsum,mat->cmap->N*sizeof(PetscReal));CHKERRQ(ierr); 432 /* Amat */ 433 v = amat->a; jj = amat->j; 434 for (brow=0; brow<mbs; brow++) { 435 grow = bs*(rstart + brow); 436 nz = amat->i[brow+1] - amat->i[brow]; 437 for (bcol=0; bcol<nz; bcol++) { 438 gcol = bs*(rstart + *jj); jj++; 439 for (col=0; col<bs; col++) { 440 for (row=0; row<bs; row++) { 441 vabs = PetscAbsScalar(*v); v++; 442 rsum[gcol+col] += vabs; 443 /* non-diagonal block */ 444 if (bcol > 0 && vabs > 0.0) rsum[grow+row] += vabs; 445 } 446 } 447 } 448 } 449 /* Bmat */ 450 v = bmat->a; jj = bmat->j; 451 for (brow=0; brow<mbs; brow++) { 452 grow = bs*(rstart + brow); 453 nz = bmat->i[brow+1] - bmat->i[brow]; 454 for (bcol=0; bcol<nz; bcol++) { 455 gcol = bs*garray[*jj]; jj++; 456 for (col=0; col<bs; col++) { 457 for (row=0; row<bs; row++) { 458 vabs = PetscAbsScalar(*v); v++; 459 rsum[gcol+col] += vabs; 460 rsum[grow+row] += vabs; 461 } 462 } 463 } 464 } 465 ierr = MPI_Allreduce(rsum,rsum2,mat->cmap->N,MPIU_REAL,MPIU_SUM,PetscObjectComm((PetscObject)mat));CHKERRQ(ierr); 466 *norm = 0.0; 467 for (col=0; col<mat->cmap->N; col++) { 468 if (rsum2[col] > *norm) *norm = rsum2[col]; 469 } 470 ierr = PetscFree2(rsum,rsum2);CHKERRQ(ierr); 471 } else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"No support for this norm yet"); 472 } 473 PetscFunctionReturn(0); 474 } 475 476 #undef __FUNCT__ 477 #define __FUNCT__ "MatAssemblyBegin_MPISBAIJ" 478 PetscErrorCode MatAssemblyBegin_MPISBAIJ(Mat mat,MatAssemblyType mode) 479 { 480 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 481 PetscErrorCode ierr; 482 PetscInt nstash,reallocs; 483 InsertMode addv; 484 485 PetscFunctionBegin; 486 if (baij->donotstash || mat->nooffprocentries) PetscFunctionReturn(0); 487 488 /* make sure all processors are either in INSERTMODE or ADDMODE */ 489 ierr = MPI_Allreduce((PetscEnum*)&mat->insertmode,(PetscEnum*)&addv,1,MPIU_ENUM,MPI_BOR,PetscObjectComm((PetscObject)mat));CHKERRQ(ierr); 490 if (addv == (ADD_VALUES|INSERT_VALUES)) SETERRQ(PetscObjectComm((PetscObject)mat),PETSC_ERR_ARG_WRONGSTATE,"Some processors inserted others added"); 491 mat->insertmode = addv; /* in case this processor had no cache */ 492 493 ierr = MatStashScatterBegin_Private(mat,&mat->stash,mat->rmap->range);CHKERRQ(ierr); 494 ierr = MatStashScatterBegin_Private(mat,&mat->bstash,baij->rangebs);CHKERRQ(ierr); 495 ierr = MatStashGetInfo_Private(&mat->stash,&nstash,&reallocs);CHKERRQ(ierr); 496 ierr = PetscInfo2(mat,"Stash has %D entries,uses %D mallocs.\n",nstash,reallocs);CHKERRQ(ierr); 497 ierr = MatStashGetInfo_Private(&mat->stash,&nstash,&reallocs);CHKERRQ(ierr); 498 ierr = PetscInfo2(mat,"Block-Stash has %D entries, uses %D mallocs.\n",nstash,reallocs);CHKERRQ(ierr); 499 PetscFunctionReturn(0); 500 } 501 502 #undef __FUNCT__ 503 #define __FUNCT__ "MatAssemblyEnd_MPISBAIJ" 504 PetscErrorCode MatAssemblyEnd_MPISBAIJ(Mat mat,MatAssemblyType mode) 505 { 506 Mat_MPISBAIJ *baij=(Mat_MPISBAIJ*)mat->data; 507 Mat_SeqSBAIJ *a =(Mat_SeqSBAIJ*)baij->A->data; 508 PetscErrorCode ierr; 509 PetscInt i,j,rstart,ncols,flg,bs2=baij->bs2; 510 PetscInt *row,*col; 511 PetscBool other_disassembled; 512 PetscMPIInt n; 513 PetscBool r1,r2,r3; 514 MatScalar *val; 515 InsertMode addv = mat->insertmode; 516 517 /* do not use 'b=(Mat_SeqBAIJ*)baij->B->data' as B can be reset in disassembly */ 518 PetscFunctionBegin; 519 if (!baij->donotstash && !mat->nooffprocentries) { 520 while (1) { 521 ierr = MatStashScatterGetMesg_Private(&mat->stash,&n,&row,&col,&val,&flg);CHKERRQ(ierr); 522 if (!flg) break; 523 524 for (i=0; i<n;) { 525 /* Now identify the consecutive vals belonging to the same row */ 526 for (j=i,rstart=row[j]; j<n; j++) { 527 if (row[j] != rstart) break; 528 } 529 if (j < n) ncols = j-i; 530 else ncols = n-i; 531 /* Now assemble all these values with a single function call */ 532 ierr = MatSetValues_MPISBAIJ(mat,1,row+i,ncols,col+i,val+i,addv);CHKERRQ(ierr); 533 i = j; 534 } 535 } 536 ierr = MatStashScatterEnd_Private(&mat->stash);CHKERRQ(ierr); 537 /* Now process the block-stash. Since the values are stashed column-oriented, 538 set the roworiented flag to column oriented, and after MatSetValues() 539 restore the original flags */ 540 r1 = baij->roworiented; 541 r2 = a->roworiented; 542 r3 = ((Mat_SeqBAIJ*)baij->B->data)->roworiented; 543 544 baij->roworiented = PETSC_FALSE; 545 a->roworiented = PETSC_FALSE; 546 547 ((Mat_SeqBAIJ*)baij->B->data)->roworiented = PETSC_FALSE; /* b->roworinted */ 548 while (1) { 549 ierr = MatStashScatterGetMesg_Private(&mat->bstash,&n,&row,&col,&val,&flg);CHKERRQ(ierr); 550 if (!flg) break; 551 552 for (i=0; i<n;) { 553 /* Now identify the consecutive vals belonging to the same row */ 554 for (j=i,rstart=row[j]; j<n; j++) { 555 if (row[j] != rstart) break; 556 } 557 if (j < n) ncols = j-i; 558 else ncols = n-i; 559 ierr = MatSetValuesBlocked_MPISBAIJ(mat,1,row+i,ncols,col+i,val+i*bs2,addv);CHKERRQ(ierr); 560 i = j; 561 } 562 } 563 ierr = MatStashScatterEnd_Private(&mat->bstash);CHKERRQ(ierr); 564 565 baij->roworiented = r1; 566 a->roworiented = r2; 567 568 ((Mat_SeqBAIJ*)baij->B->data)->roworiented = r3; /* b->roworinted */ 569 } 570 571 ierr = MatAssemblyBegin(baij->A,mode);CHKERRQ(ierr); 572 ierr = MatAssemblyEnd(baij->A,mode);CHKERRQ(ierr); 573 574 /* determine if any processor has disassembled, if so we must 575 also disassemble ourselfs, in order that we may reassemble. */ 576 /* 577 if nonzero structure of submatrix B cannot change then we know that 578 no processor disassembled thus we can skip this stuff 579 */ 580 if (!((Mat_SeqBAIJ*)baij->B->data)->nonew) { 581 ierr = MPI_Allreduce(&mat->was_assembled,&other_disassembled,1,MPIU_BOOL,MPI_PROD,PetscObjectComm((PetscObject)mat));CHKERRQ(ierr); 582 if (mat->was_assembled && !other_disassembled) { 583 ierr = MatDisAssemble_MPISBAIJ(mat);CHKERRQ(ierr); 584 } 585 } 586 587 if (!mat->was_assembled && mode == MAT_FINAL_ASSEMBLY) { 588 ierr = MatSetUpMultiply_MPISBAIJ(mat);CHKERRQ(ierr); /* setup Mvctx and sMvctx */ 589 } 590 ierr = MatAssemblyBegin(baij->B,mode);CHKERRQ(ierr); 591 ierr = MatAssemblyEnd(baij->B,mode);CHKERRQ(ierr); 592 593 ierr = PetscFree2(baij->rowvalues,baij->rowindices);CHKERRQ(ierr); 594 595 baij->rowvalues = 0; 596 { 597 PetscObjectState state = baij->A->nonzerostate + baij->B->nonzerostate; 598 ierr = MPI_Allreduce(&state,&mat->nonzerostate,1,MPIU_INT64,MPI_SUM,PetscObjectComm((PetscObject)mat));CHKERRQ(ierr); 599 } 600 PetscFunctionReturn(0); 601 } 602 603 extern PetscErrorCode MatView_SeqSBAIJ_ASCII(Mat,PetscViewer); 604 extern PetscErrorCode MatSetValues_MPIBAIJ(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],const PetscScalar[],InsertMode); 605 #include <petscdraw.h> 606 #undef __FUNCT__ 607 #define __FUNCT__ "MatView_MPISBAIJ_ASCIIorDraworSocket" 608 static PetscErrorCode MatView_MPISBAIJ_ASCIIorDraworSocket(Mat mat,PetscViewer viewer) 609 { 610 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 611 PetscErrorCode ierr; 612 PetscInt bs = mat->rmap->bs; 613 PetscMPIInt rank = baij->rank; 614 PetscBool iascii,isdraw; 615 PetscViewer sviewer; 616 PetscViewerFormat format; 617 618 PetscFunctionBegin; 619 ierr = PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERASCII,&iascii);CHKERRQ(ierr); 620 ierr = PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERDRAW,&isdraw);CHKERRQ(ierr); 621 if (iascii) { 622 ierr = PetscViewerGetFormat(viewer,&format);CHKERRQ(ierr); 623 if (format == PETSC_VIEWER_ASCII_INFO_DETAIL) { 624 MatInfo info; 625 ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)mat),&rank);CHKERRQ(ierr); 626 ierr = MatGetInfo(mat,MAT_LOCAL,&info);CHKERRQ(ierr); 627 ierr = PetscViewerASCIISynchronizedAllow(viewer,PETSC_TRUE);CHKERRQ(ierr); 628 ierr = PetscViewerASCIISynchronizedPrintf(viewer,"[%d] Local rows %D nz %D nz alloced %D bs %D mem %D\n",rank,mat->rmap->n,(PetscInt)info.nz_used,(PetscInt)info.nz_allocated,mat->rmap->bs,(PetscInt)info.memory);CHKERRQ(ierr); 629 ierr = MatGetInfo(baij->A,MAT_LOCAL,&info);CHKERRQ(ierr); 630 ierr = PetscViewerASCIISynchronizedPrintf(viewer,"[%d] on-diagonal part: nz %D \n",rank,(PetscInt)info.nz_used);CHKERRQ(ierr); 631 ierr = MatGetInfo(baij->B,MAT_LOCAL,&info);CHKERRQ(ierr); 632 ierr = PetscViewerASCIISynchronizedPrintf(viewer,"[%d] off-diagonal part: nz %D \n",rank,(PetscInt)info.nz_used);CHKERRQ(ierr); 633 ierr = PetscViewerFlush(viewer);CHKERRQ(ierr); 634 ierr = PetscViewerASCIISynchronizedAllow(viewer,PETSC_FALSE);CHKERRQ(ierr); 635 ierr = PetscViewerASCIIPrintf(viewer,"Information on VecScatter used in matrix-vector product: \n");CHKERRQ(ierr); 636 ierr = VecScatterView(baij->Mvctx,viewer);CHKERRQ(ierr); 637 PetscFunctionReturn(0); 638 } else if (format == PETSC_VIEWER_ASCII_INFO) { 639 ierr = PetscViewerASCIIPrintf(viewer," block size is %D\n",bs);CHKERRQ(ierr); 640 PetscFunctionReturn(0); 641 } else if (format == PETSC_VIEWER_ASCII_FACTOR_INFO) { 642 PetscFunctionReturn(0); 643 } 644 } 645 646 if (isdraw) { 647 PetscDraw draw; 648 PetscBool isnull; 649 ierr = PetscViewerDrawGetDraw(viewer,0,&draw);CHKERRQ(ierr); 650 ierr = PetscDrawIsNull(draw,&isnull);CHKERRQ(ierr); if (isnull) PetscFunctionReturn(0); 651 } 652 653 { 654 /* assemble the entire matrix onto first processor. */ 655 Mat A; 656 Mat_SeqSBAIJ *Aloc; 657 Mat_SeqBAIJ *Bloc; 658 PetscInt M = mat->rmap->N,N = mat->cmap->N,*ai,*aj,col,i,j,k,*rvals,mbs = baij->mbs; 659 MatScalar *a; 660 661 /* Should this be the same type as mat? */ 662 ierr = MatCreate(PetscObjectComm((PetscObject)mat),&A);CHKERRQ(ierr); 663 if (!rank) { 664 ierr = MatSetSizes(A,M,N,M,N);CHKERRQ(ierr); 665 } else { 666 ierr = MatSetSizes(A,0,0,M,N);CHKERRQ(ierr); 667 } 668 ierr = MatSetType(A,MATMPISBAIJ);CHKERRQ(ierr); 669 ierr = MatMPISBAIJSetPreallocation(A,mat->rmap->bs,0,NULL,0,NULL);CHKERRQ(ierr); 670 ierr = MatSetOption(A,MAT_NEW_NONZERO_LOCATION_ERR,PETSC_FALSE);CHKERRQ(ierr); 671 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)A);CHKERRQ(ierr); 672 673 /* copy over the A part */ 674 Aloc = (Mat_SeqSBAIJ*)baij->A->data; 675 ai = Aloc->i; aj = Aloc->j; a = Aloc->a; 676 ierr = PetscMalloc1(bs,&rvals);CHKERRQ(ierr); 677 678 for (i=0; i<mbs; i++) { 679 rvals[0] = bs*(baij->rstartbs + i); 680 for (j=1; j<bs; j++) rvals[j] = rvals[j-1] + 1; 681 for (j=ai[i]; j<ai[i+1]; j++) { 682 col = (baij->cstartbs+aj[j])*bs; 683 for (k=0; k<bs; k++) { 684 ierr = MatSetValues_MPISBAIJ(A,bs,rvals,1,&col,a,INSERT_VALUES);CHKERRQ(ierr); 685 col++; 686 a += bs; 687 } 688 } 689 } 690 /* copy over the B part */ 691 Bloc = (Mat_SeqBAIJ*)baij->B->data; 692 ai = Bloc->i; aj = Bloc->j; a = Bloc->a; 693 for (i=0; i<mbs; i++) { 694 695 rvals[0] = bs*(baij->rstartbs + i); 696 for (j=1; j<bs; j++) rvals[j] = rvals[j-1] + 1; 697 for (j=ai[i]; j<ai[i+1]; j++) { 698 col = baij->garray[aj[j]]*bs; 699 for (k=0; k<bs; k++) { 700 ierr = MatSetValues_MPIBAIJ(A,bs,rvals,1,&col,a,INSERT_VALUES);CHKERRQ(ierr); 701 col++; 702 a += bs; 703 } 704 } 705 } 706 ierr = PetscFree(rvals);CHKERRQ(ierr); 707 ierr = MatAssemblyBegin(A,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 708 ierr = MatAssemblyEnd(A,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 709 /* 710 Everyone has to call to draw the matrix since the graphics waits are 711 synchronized across all processors that share the PetscDraw object 712 */ 713 ierr = PetscViewerGetSingleton(viewer,&sviewer);CHKERRQ(ierr); 714 if (!rank) { 715 ierr = MatView_SeqSBAIJ_ASCII(((Mat_MPISBAIJ*)(A->data))->A,sviewer);CHKERRQ(ierr); 716 } 717 ierr = PetscViewerRestoreSingleton(viewer,&sviewer);CHKERRQ(ierr); 718 ierr = MatDestroy(&A);CHKERRQ(ierr); 719 } 720 PetscFunctionReturn(0); 721 } 722 723 #undef __FUNCT__ 724 #define __FUNCT__ "MatView_MPISBAIJ" 725 PetscErrorCode MatView_MPISBAIJ(Mat mat,PetscViewer viewer) 726 { 727 PetscErrorCode ierr; 728 PetscBool iascii,isdraw,issocket,isbinary; 729 730 PetscFunctionBegin; 731 ierr = PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERASCII,&iascii);CHKERRQ(ierr); 732 ierr = PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERDRAW,&isdraw);CHKERRQ(ierr); 733 ierr = PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERSOCKET,&issocket);CHKERRQ(ierr); 734 ierr = PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERBINARY,&isbinary);CHKERRQ(ierr); 735 if (iascii || isdraw || issocket || isbinary) { 736 ierr = MatView_MPISBAIJ_ASCIIorDraworSocket(mat,viewer);CHKERRQ(ierr); 737 } 738 PetscFunctionReturn(0); 739 } 740 741 #undef __FUNCT__ 742 #define __FUNCT__ "MatDestroy_MPISBAIJ" 743 PetscErrorCode MatDestroy_MPISBAIJ(Mat mat) 744 { 745 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 746 PetscErrorCode ierr; 747 748 PetscFunctionBegin; 749 #if defined(PETSC_USE_LOG) 750 PetscLogObjectState((PetscObject)mat,"Rows=%D,Cols=%D",mat->rmap->N,mat->cmap->N); 751 #endif 752 ierr = MatStashDestroy_Private(&mat->stash);CHKERRQ(ierr); 753 ierr = MatStashDestroy_Private(&mat->bstash);CHKERRQ(ierr); 754 ierr = MatDestroy(&baij->A);CHKERRQ(ierr); 755 ierr = MatDestroy(&baij->B);CHKERRQ(ierr); 756 #if defined(PETSC_USE_CTABLE) 757 ierr = PetscTableDestroy(&baij->colmap);CHKERRQ(ierr); 758 #else 759 ierr = PetscFree(baij->colmap);CHKERRQ(ierr); 760 #endif 761 ierr = PetscFree(baij->garray);CHKERRQ(ierr); 762 ierr = VecDestroy(&baij->lvec);CHKERRQ(ierr); 763 ierr = VecScatterDestroy(&baij->Mvctx);CHKERRQ(ierr); 764 ierr = VecDestroy(&baij->slvec0);CHKERRQ(ierr); 765 ierr = VecDestroy(&baij->slvec0b);CHKERRQ(ierr); 766 ierr = VecDestroy(&baij->slvec1);CHKERRQ(ierr); 767 ierr = VecDestroy(&baij->slvec1a);CHKERRQ(ierr); 768 ierr = VecDestroy(&baij->slvec1b);CHKERRQ(ierr); 769 ierr = VecScatterDestroy(&baij->sMvctx);CHKERRQ(ierr); 770 ierr = PetscFree2(baij->rowvalues,baij->rowindices);CHKERRQ(ierr); 771 ierr = PetscFree(baij->barray);CHKERRQ(ierr); 772 ierr = PetscFree(baij->hd);CHKERRQ(ierr); 773 ierr = VecDestroy(&baij->diag);CHKERRQ(ierr); 774 ierr = VecDestroy(&baij->bb1);CHKERRQ(ierr); 775 ierr = VecDestroy(&baij->xx1);CHKERRQ(ierr); 776 #if defined(PETSC_USE_REAL_MAT_SINGLE) 777 ierr = PetscFree(baij->setvaluescopy);CHKERRQ(ierr); 778 #endif 779 ierr = PetscFree(baij->in_loc);CHKERRQ(ierr); 780 ierr = PetscFree(baij->v_loc);CHKERRQ(ierr); 781 ierr = PetscFree(baij->rangebs);CHKERRQ(ierr); 782 ierr = PetscFree(mat->data);CHKERRQ(ierr); 783 784 ierr = PetscObjectChangeTypeName((PetscObject)mat,0);CHKERRQ(ierr); 785 ierr = PetscObjectComposeFunction((PetscObject)mat,"MatStoreValues_C",NULL);CHKERRQ(ierr); 786 ierr = PetscObjectComposeFunction((PetscObject)mat,"MatRetrieveValues_C",NULL);CHKERRQ(ierr); 787 ierr = PetscObjectComposeFunction((PetscObject)mat,"MatGetDiagonalBlock_C",NULL);CHKERRQ(ierr); 788 ierr = PetscObjectComposeFunction((PetscObject)mat,"MatMPISBAIJSetPreallocation_C",NULL);CHKERRQ(ierr); 789 ierr = PetscObjectComposeFunction((PetscObject)mat,"MatConvert_mpisbaij_mpisbstrm_C",NULL);CHKERRQ(ierr); 790 PetscFunctionReturn(0); 791 } 792 793 #undef __FUNCT__ 794 #define __FUNCT__ "MatMult_MPISBAIJ_Hermitian" 795 PetscErrorCode MatMult_MPISBAIJ_Hermitian(Mat A,Vec xx,Vec yy) 796 { 797 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 798 PetscErrorCode ierr; 799 PetscInt nt,mbs=a->mbs,bs=A->rmap->bs; 800 PetscScalar *x,*from; 801 802 PetscFunctionBegin; 803 ierr = VecGetLocalSize(xx,&nt);CHKERRQ(ierr); 804 if (nt != A->cmap->n) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Incompatible partition of A and xx"); 805 806 /* diagonal part */ 807 ierr = (*a->A->ops->mult)(a->A,xx,a->slvec1a);CHKERRQ(ierr); 808 ierr = VecSet(a->slvec1b,0.0);CHKERRQ(ierr); 809 810 /* subdiagonal part */ 811 ierr = (*a->B->ops->multhermitiantranspose)(a->B,xx,a->slvec0b);CHKERRQ(ierr); 812 813 /* copy x into the vec slvec0 */ 814 ierr = VecGetArray(a->slvec0,&from);CHKERRQ(ierr); 815 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 816 817 ierr = PetscMemcpy(from,x,bs*mbs*sizeof(MatScalar));CHKERRQ(ierr); 818 ierr = VecRestoreArray(a->slvec0,&from);CHKERRQ(ierr); 819 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 820 821 ierr = VecScatterBegin(a->sMvctx,a->slvec0,a->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 822 ierr = VecScatterEnd(a->sMvctx,a->slvec0,a->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 823 /* supperdiagonal part */ 824 ierr = (*a->B->ops->multadd)(a->B,a->slvec1b,a->slvec1a,yy);CHKERRQ(ierr); 825 PetscFunctionReturn(0); 826 } 827 828 #undef __FUNCT__ 829 #define __FUNCT__ "MatMult_MPISBAIJ" 830 PetscErrorCode MatMult_MPISBAIJ(Mat A,Vec xx,Vec yy) 831 { 832 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 833 PetscErrorCode ierr; 834 PetscInt nt,mbs=a->mbs,bs=A->rmap->bs; 835 PetscScalar *x,*from; 836 837 PetscFunctionBegin; 838 ierr = VecGetLocalSize(xx,&nt);CHKERRQ(ierr); 839 if (nt != A->cmap->n) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Incompatible partition of A and xx"); 840 841 /* diagonal part */ 842 ierr = (*a->A->ops->mult)(a->A,xx,a->slvec1a);CHKERRQ(ierr); 843 ierr = VecSet(a->slvec1b,0.0);CHKERRQ(ierr); 844 845 /* subdiagonal part */ 846 ierr = (*a->B->ops->multtranspose)(a->B,xx,a->slvec0b);CHKERRQ(ierr); 847 848 /* copy x into the vec slvec0 */ 849 ierr = VecGetArray(a->slvec0,&from);CHKERRQ(ierr); 850 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 851 852 ierr = PetscMemcpy(from,x,bs*mbs*sizeof(MatScalar));CHKERRQ(ierr); 853 ierr = VecRestoreArray(a->slvec0,&from);CHKERRQ(ierr); 854 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 855 856 ierr = VecScatterBegin(a->sMvctx,a->slvec0,a->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 857 ierr = VecScatterEnd(a->sMvctx,a->slvec0,a->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 858 /* supperdiagonal part */ 859 ierr = (*a->B->ops->multadd)(a->B,a->slvec1b,a->slvec1a,yy);CHKERRQ(ierr); 860 PetscFunctionReturn(0); 861 } 862 863 #undef __FUNCT__ 864 #define __FUNCT__ "MatMult_MPISBAIJ_2comm" 865 PetscErrorCode MatMult_MPISBAIJ_2comm(Mat A,Vec xx,Vec yy) 866 { 867 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 868 PetscErrorCode ierr; 869 PetscInt nt; 870 871 PetscFunctionBegin; 872 ierr = VecGetLocalSize(xx,&nt);CHKERRQ(ierr); 873 if (nt != A->cmap->n) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Incompatible partition of A and xx"); 874 875 ierr = VecGetLocalSize(yy,&nt);CHKERRQ(ierr); 876 if (nt != A->rmap->N) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Incompatible parition of A and yy"); 877 878 ierr = VecScatterBegin(a->Mvctx,xx,a->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 879 /* do diagonal part */ 880 ierr = (*a->A->ops->mult)(a->A,xx,yy);CHKERRQ(ierr); 881 /* do supperdiagonal part */ 882 ierr = VecScatterEnd(a->Mvctx,xx,a->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 883 ierr = (*a->B->ops->multadd)(a->B,a->lvec,yy,yy);CHKERRQ(ierr); 884 /* do subdiagonal part */ 885 ierr = (*a->B->ops->multtranspose)(a->B,xx,a->lvec);CHKERRQ(ierr); 886 ierr = VecScatterBegin(a->Mvctx,a->lvec,yy,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 887 ierr = VecScatterEnd(a->Mvctx,a->lvec,yy,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 888 PetscFunctionReturn(0); 889 } 890 891 #undef __FUNCT__ 892 #define __FUNCT__ "MatMultAdd_MPISBAIJ" 893 PetscErrorCode MatMultAdd_MPISBAIJ(Mat A,Vec xx,Vec yy,Vec zz) 894 { 895 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 896 PetscErrorCode ierr; 897 PetscInt mbs=a->mbs,bs=A->rmap->bs; 898 PetscScalar *x,*from,zero=0.0; 899 900 PetscFunctionBegin; 901 /* 902 PetscSynchronizedPrintf(PetscObjectComm((PetscObject)A)," MatMultAdd is called ...\n"); 903 PetscSynchronizedFlush(PetscObjectComm((PetscObject)A),PETSC_STDOUT); 904 */ 905 /* diagonal part */ 906 ierr = (*a->A->ops->multadd)(a->A,xx,yy,a->slvec1a);CHKERRQ(ierr); 907 ierr = VecSet(a->slvec1b,zero);CHKERRQ(ierr); 908 909 /* subdiagonal part */ 910 ierr = (*a->B->ops->multtranspose)(a->B,xx,a->slvec0b);CHKERRQ(ierr); 911 912 /* copy x into the vec slvec0 */ 913 ierr = VecGetArray(a->slvec0,&from);CHKERRQ(ierr); 914 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 915 ierr = PetscMemcpy(from,x,bs*mbs*sizeof(MatScalar));CHKERRQ(ierr); 916 ierr = VecRestoreArray(a->slvec0,&from);CHKERRQ(ierr); 917 918 ierr = VecScatterBegin(a->sMvctx,a->slvec0,a->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 919 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 920 ierr = VecScatterEnd(a->sMvctx,a->slvec0,a->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 921 922 /* supperdiagonal part */ 923 ierr = (*a->B->ops->multadd)(a->B,a->slvec1b,a->slvec1a,zz);CHKERRQ(ierr); 924 PetscFunctionReturn(0); 925 } 926 927 #undef __FUNCT__ 928 #define __FUNCT__ "MatMultAdd_MPISBAIJ_2comm" 929 PetscErrorCode MatMultAdd_MPISBAIJ_2comm(Mat A,Vec xx,Vec yy,Vec zz) 930 { 931 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 932 PetscErrorCode ierr; 933 934 PetscFunctionBegin; 935 ierr = VecScatterBegin(a->Mvctx,xx,a->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 936 /* do diagonal part */ 937 ierr = (*a->A->ops->multadd)(a->A,xx,yy,zz);CHKERRQ(ierr); 938 /* do supperdiagonal part */ 939 ierr = VecScatterEnd(a->Mvctx,xx,a->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 940 ierr = (*a->B->ops->multadd)(a->B,a->lvec,zz,zz);CHKERRQ(ierr); 941 942 /* do subdiagonal part */ 943 ierr = (*a->B->ops->multtranspose)(a->B,xx,a->lvec);CHKERRQ(ierr); 944 ierr = VecScatterBegin(a->Mvctx,a->lvec,zz,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 945 ierr = VecScatterEnd(a->Mvctx,a->lvec,zz,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 946 PetscFunctionReturn(0); 947 } 948 949 /* 950 This only works correctly for square matrices where the subblock A->A is the 951 diagonal block 952 */ 953 #undef __FUNCT__ 954 #define __FUNCT__ "MatGetDiagonal_MPISBAIJ" 955 PetscErrorCode MatGetDiagonal_MPISBAIJ(Mat A,Vec v) 956 { 957 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 958 PetscErrorCode ierr; 959 960 PetscFunctionBegin; 961 /* if (a->rmap->N != a->cmap->N) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Supports only square matrix where A->A is diag block"); */ 962 ierr = MatGetDiagonal(a->A,v);CHKERRQ(ierr); 963 PetscFunctionReturn(0); 964 } 965 966 #undef __FUNCT__ 967 #define __FUNCT__ "MatScale_MPISBAIJ" 968 PetscErrorCode MatScale_MPISBAIJ(Mat A,PetscScalar aa) 969 { 970 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 971 PetscErrorCode ierr; 972 973 PetscFunctionBegin; 974 ierr = MatScale(a->A,aa);CHKERRQ(ierr); 975 ierr = MatScale(a->B,aa);CHKERRQ(ierr); 976 PetscFunctionReturn(0); 977 } 978 979 #undef __FUNCT__ 980 #define __FUNCT__ "MatGetRow_MPISBAIJ" 981 PetscErrorCode MatGetRow_MPISBAIJ(Mat matin,PetscInt row,PetscInt *nz,PetscInt **idx,PetscScalar **v) 982 { 983 Mat_MPISBAIJ *mat = (Mat_MPISBAIJ*)matin->data; 984 PetscScalar *vworkA,*vworkB,**pvA,**pvB,*v_p; 985 PetscErrorCode ierr; 986 PetscInt bs = matin->rmap->bs,bs2 = mat->bs2,i,*cworkA,*cworkB,**pcA,**pcB; 987 PetscInt nztot,nzA,nzB,lrow,brstart = matin->rmap->rstart,brend = matin->rmap->rend; 988 PetscInt *cmap,*idx_p,cstart = mat->rstartbs; 989 990 PetscFunctionBegin; 991 if (mat->getrowactive) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONGSTATE,"Already active"); 992 mat->getrowactive = PETSC_TRUE; 993 994 if (!mat->rowvalues && (idx || v)) { 995 /* 996 allocate enough space to hold information from the longest row. 997 */ 998 Mat_SeqSBAIJ *Aa = (Mat_SeqSBAIJ*)mat->A->data; 999 Mat_SeqBAIJ *Ba = (Mat_SeqBAIJ*)mat->B->data; 1000 PetscInt max = 1,mbs = mat->mbs,tmp; 1001 for (i=0; i<mbs; i++) { 1002 tmp = Aa->i[i+1] - Aa->i[i] + Ba->i[i+1] - Ba->i[i]; /* row length */ 1003 if (max < tmp) max = tmp; 1004 } 1005 ierr = PetscMalloc2(max*bs2,&mat->rowvalues,max*bs2,&mat->rowindices);CHKERRQ(ierr); 1006 } 1007 1008 if (row < brstart || row >= brend) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Only local rows"); 1009 lrow = row - brstart; /* local row index */ 1010 1011 pvA = &vworkA; pcA = &cworkA; pvB = &vworkB; pcB = &cworkB; 1012 if (!v) {pvA = 0; pvB = 0;} 1013 if (!idx) {pcA = 0; if (!v) pcB = 0;} 1014 ierr = (*mat->A->ops->getrow)(mat->A,lrow,&nzA,pcA,pvA);CHKERRQ(ierr); 1015 ierr = (*mat->B->ops->getrow)(mat->B,lrow,&nzB,pcB,pvB);CHKERRQ(ierr); 1016 nztot = nzA + nzB; 1017 1018 cmap = mat->garray; 1019 if (v || idx) { 1020 if (nztot) { 1021 /* Sort by increasing column numbers, assuming A and B already sorted */ 1022 PetscInt imark = -1; 1023 if (v) { 1024 *v = v_p = mat->rowvalues; 1025 for (i=0; i<nzB; i++) { 1026 if (cmap[cworkB[i]/bs] < cstart) v_p[i] = vworkB[i]; 1027 else break; 1028 } 1029 imark = i; 1030 for (i=0; i<nzA; i++) v_p[imark+i] = vworkA[i]; 1031 for (i=imark; i<nzB; i++) v_p[nzA+i] = vworkB[i]; 1032 } 1033 if (idx) { 1034 *idx = idx_p = mat->rowindices; 1035 if (imark > -1) { 1036 for (i=0; i<imark; i++) { 1037 idx_p[i] = cmap[cworkB[i]/bs]*bs + cworkB[i]%bs; 1038 } 1039 } else { 1040 for (i=0; i<nzB; i++) { 1041 if (cmap[cworkB[i]/bs] < cstart) idx_p[i] = cmap[cworkB[i]/bs]*bs + cworkB[i]%bs; 1042 else break; 1043 } 1044 imark = i; 1045 } 1046 for (i=0; i<nzA; i++) idx_p[imark+i] = cstart*bs + cworkA[i]; 1047 for (i=imark; i<nzB; i++) idx_p[nzA+i] = cmap[cworkB[i]/bs]*bs + cworkB[i]%bs ; 1048 } 1049 } else { 1050 if (idx) *idx = 0; 1051 if (v) *v = 0; 1052 } 1053 } 1054 *nz = nztot; 1055 ierr = (*mat->A->ops->restorerow)(mat->A,lrow,&nzA,pcA,pvA);CHKERRQ(ierr); 1056 ierr = (*mat->B->ops->restorerow)(mat->B,lrow,&nzB,pcB,pvB);CHKERRQ(ierr); 1057 PetscFunctionReturn(0); 1058 } 1059 1060 #undef __FUNCT__ 1061 #define __FUNCT__ "MatRestoreRow_MPISBAIJ" 1062 PetscErrorCode MatRestoreRow_MPISBAIJ(Mat mat,PetscInt row,PetscInt *nz,PetscInt **idx,PetscScalar **v) 1063 { 1064 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 1065 1066 PetscFunctionBegin; 1067 if (!baij->getrowactive) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONGSTATE,"MatGetRow() must be called first"); 1068 baij->getrowactive = PETSC_FALSE; 1069 PetscFunctionReturn(0); 1070 } 1071 1072 #undef __FUNCT__ 1073 #define __FUNCT__ "MatGetRowUpperTriangular_MPISBAIJ" 1074 PetscErrorCode MatGetRowUpperTriangular_MPISBAIJ(Mat A) 1075 { 1076 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 1077 Mat_SeqSBAIJ *aA = (Mat_SeqSBAIJ*)a->A->data; 1078 1079 PetscFunctionBegin; 1080 aA->getrow_utriangular = PETSC_TRUE; 1081 PetscFunctionReturn(0); 1082 } 1083 #undef __FUNCT__ 1084 #define __FUNCT__ "MatRestoreRowUpperTriangular_MPISBAIJ" 1085 PetscErrorCode MatRestoreRowUpperTriangular_MPISBAIJ(Mat A) 1086 { 1087 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 1088 Mat_SeqSBAIJ *aA = (Mat_SeqSBAIJ*)a->A->data; 1089 1090 PetscFunctionBegin; 1091 aA->getrow_utriangular = PETSC_FALSE; 1092 PetscFunctionReturn(0); 1093 } 1094 1095 #undef __FUNCT__ 1096 #define __FUNCT__ "MatRealPart_MPISBAIJ" 1097 PetscErrorCode MatRealPart_MPISBAIJ(Mat A) 1098 { 1099 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 1100 PetscErrorCode ierr; 1101 1102 PetscFunctionBegin; 1103 ierr = MatRealPart(a->A);CHKERRQ(ierr); 1104 ierr = MatRealPart(a->B);CHKERRQ(ierr); 1105 PetscFunctionReturn(0); 1106 } 1107 1108 #undef __FUNCT__ 1109 #define __FUNCT__ "MatImaginaryPart_MPISBAIJ" 1110 PetscErrorCode MatImaginaryPart_MPISBAIJ(Mat A) 1111 { 1112 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 1113 PetscErrorCode ierr; 1114 1115 PetscFunctionBegin; 1116 ierr = MatImaginaryPart(a->A);CHKERRQ(ierr); 1117 ierr = MatImaginaryPart(a->B);CHKERRQ(ierr); 1118 PetscFunctionReturn(0); 1119 } 1120 1121 #undef __FUNCT__ 1122 #define __FUNCT__ "MatZeroEntries_MPISBAIJ" 1123 PetscErrorCode MatZeroEntries_MPISBAIJ(Mat A) 1124 { 1125 Mat_MPISBAIJ *l = (Mat_MPISBAIJ*)A->data; 1126 PetscErrorCode ierr; 1127 1128 PetscFunctionBegin; 1129 ierr = MatZeroEntries(l->A);CHKERRQ(ierr); 1130 ierr = MatZeroEntries(l->B);CHKERRQ(ierr); 1131 PetscFunctionReturn(0); 1132 } 1133 1134 #undef __FUNCT__ 1135 #define __FUNCT__ "MatGetInfo_MPISBAIJ" 1136 PetscErrorCode MatGetInfo_MPISBAIJ(Mat matin,MatInfoType flag,MatInfo *info) 1137 { 1138 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)matin->data; 1139 Mat A = a->A,B = a->B; 1140 PetscErrorCode ierr; 1141 PetscReal isend[5],irecv[5]; 1142 1143 PetscFunctionBegin; 1144 info->block_size = (PetscReal)matin->rmap->bs; 1145 1146 ierr = MatGetInfo(A,MAT_LOCAL,info);CHKERRQ(ierr); 1147 1148 isend[0] = info->nz_used; isend[1] = info->nz_allocated; isend[2] = info->nz_unneeded; 1149 isend[3] = info->memory; isend[4] = info->mallocs; 1150 1151 ierr = MatGetInfo(B,MAT_LOCAL,info);CHKERRQ(ierr); 1152 1153 isend[0] += info->nz_used; isend[1] += info->nz_allocated; isend[2] += info->nz_unneeded; 1154 isend[3] += info->memory; isend[4] += info->mallocs; 1155 if (flag == MAT_LOCAL) { 1156 info->nz_used = isend[0]; 1157 info->nz_allocated = isend[1]; 1158 info->nz_unneeded = isend[2]; 1159 info->memory = isend[3]; 1160 info->mallocs = isend[4]; 1161 } else if (flag == MAT_GLOBAL_MAX) { 1162 ierr = MPI_Allreduce(isend,irecv,5,MPIU_REAL,MPIU_MAX,PetscObjectComm((PetscObject)matin));CHKERRQ(ierr); 1163 1164 info->nz_used = irecv[0]; 1165 info->nz_allocated = irecv[1]; 1166 info->nz_unneeded = irecv[2]; 1167 info->memory = irecv[3]; 1168 info->mallocs = irecv[4]; 1169 } else if (flag == MAT_GLOBAL_SUM) { 1170 ierr = MPI_Allreduce(isend,irecv,5,MPIU_REAL,MPIU_SUM,PetscObjectComm((PetscObject)matin));CHKERRQ(ierr); 1171 1172 info->nz_used = irecv[0]; 1173 info->nz_allocated = irecv[1]; 1174 info->nz_unneeded = irecv[2]; 1175 info->memory = irecv[3]; 1176 info->mallocs = irecv[4]; 1177 } else SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Unknown MatInfoType argument %d",(int)flag); 1178 info->fill_ratio_given = 0; /* no parallel LU/ILU/Cholesky */ 1179 info->fill_ratio_needed = 0; 1180 info->factor_mallocs = 0; 1181 PetscFunctionReturn(0); 1182 } 1183 1184 #undef __FUNCT__ 1185 #define __FUNCT__ "MatSetOption_MPISBAIJ" 1186 PetscErrorCode MatSetOption_MPISBAIJ(Mat A,MatOption op,PetscBool flg) 1187 { 1188 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 1189 Mat_SeqSBAIJ *aA = (Mat_SeqSBAIJ*)a->A->data; 1190 PetscErrorCode ierr; 1191 1192 PetscFunctionBegin; 1193 switch (op) { 1194 case MAT_NEW_NONZERO_LOCATIONS: 1195 case MAT_NEW_NONZERO_ALLOCATION_ERR: 1196 case MAT_UNUSED_NONZERO_LOCATION_ERR: 1197 case MAT_KEEP_NONZERO_PATTERN: 1198 case MAT_NEW_NONZERO_LOCATION_ERR: 1199 ierr = MatSetOption(a->A,op,flg);CHKERRQ(ierr); 1200 ierr = MatSetOption(a->B,op,flg);CHKERRQ(ierr); 1201 break; 1202 case MAT_ROW_ORIENTED: 1203 a->roworiented = flg; 1204 1205 ierr = MatSetOption(a->A,op,flg);CHKERRQ(ierr); 1206 ierr = MatSetOption(a->B,op,flg);CHKERRQ(ierr); 1207 break; 1208 case MAT_NEW_DIAGONALS: 1209 ierr = PetscInfo1(A,"Option %s ignored\n",MatOptions[op]);CHKERRQ(ierr); 1210 break; 1211 case MAT_IGNORE_OFF_PROC_ENTRIES: 1212 a->donotstash = flg; 1213 break; 1214 case MAT_USE_HASH_TABLE: 1215 a->ht_flag = flg; 1216 break; 1217 case MAT_HERMITIAN: 1218 if (!A->assembled) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONGSTATE,"Must call MatAssemblyEnd() first"); 1219 ierr = MatSetOption(a->A,op,flg);CHKERRQ(ierr); 1220 1221 A->ops->mult = MatMult_MPISBAIJ_Hermitian; 1222 break; 1223 case MAT_SPD: 1224 A->spd_set = PETSC_TRUE; 1225 A->spd = flg; 1226 if (flg) { 1227 A->symmetric = PETSC_TRUE; 1228 A->structurally_symmetric = PETSC_TRUE; 1229 A->symmetric_set = PETSC_TRUE; 1230 A->structurally_symmetric_set = PETSC_TRUE; 1231 } 1232 break; 1233 case MAT_SYMMETRIC: 1234 ierr = MatSetOption(a->A,op,flg);CHKERRQ(ierr); 1235 break; 1236 case MAT_STRUCTURALLY_SYMMETRIC: 1237 ierr = MatSetOption(a->A,op,flg);CHKERRQ(ierr); 1238 break; 1239 case MAT_SYMMETRY_ETERNAL: 1240 if (!flg) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Matrix must be symmetric"); 1241 ierr = PetscInfo1(A,"Option %s ignored\n",MatOptions[op]);CHKERRQ(ierr); 1242 break; 1243 case MAT_IGNORE_LOWER_TRIANGULAR: 1244 aA->ignore_ltriangular = flg; 1245 break; 1246 case MAT_ERROR_LOWER_TRIANGULAR: 1247 aA->ignore_ltriangular = flg; 1248 break; 1249 case MAT_GETROW_UPPERTRIANGULAR: 1250 aA->getrow_utriangular = flg; 1251 break; 1252 default: 1253 SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_SUP,"unknown option %d",op); 1254 } 1255 PetscFunctionReturn(0); 1256 } 1257 1258 #undef __FUNCT__ 1259 #define __FUNCT__ "MatTranspose_MPISBAIJ" 1260 PetscErrorCode MatTranspose_MPISBAIJ(Mat A,MatReuse reuse,Mat *B) 1261 { 1262 PetscErrorCode ierr; 1263 1264 PetscFunctionBegin; 1265 if (MAT_INITIAL_MATRIX || *B != A) { 1266 ierr = MatDuplicate(A,MAT_COPY_VALUES,B);CHKERRQ(ierr); 1267 } 1268 PetscFunctionReturn(0); 1269 } 1270 1271 #undef __FUNCT__ 1272 #define __FUNCT__ "MatDiagonalScale_MPISBAIJ" 1273 PetscErrorCode MatDiagonalScale_MPISBAIJ(Mat mat,Vec ll,Vec rr) 1274 { 1275 Mat_MPISBAIJ *baij = (Mat_MPISBAIJ*)mat->data; 1276 Mat a = baij->A, b=baij->B; 1277 PetscErrorCode ierr; 1278 PetscInt nv,m,n; 1279 PetscBool flg; 1280 1281 PetscFunctionBegin; 1282 if (ll != rr) { 1283 ierr = VecEqual(ll,rr,&flg);CHKERRQ(ierr); 1284 if (!flg) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"For symmetric format, left and right scaling vectors must be same\n"); 1285 } 1286 if (!ll) PetscFunctionReturn(0); 1287 1288 ierr = MatGetLocalSize(mat,&m,&n);CHKERRQ(ierr); 1289 if (m != n) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"For symmetric format, local size %d %d must be same",m,n); 1290 1291 ierr = VecGetLocalSize(rr,&nv);CHKERRQ(ierr); 1292 if (nv!=n) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Left and right vector non-conforming local size"); 1293 1294 ierr = VecScatterBegin(baij->Mvctx,rr,baij->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 1295 1296 /* left diagonalscale the off-diagonal part */ 1297 ierr = (*b->ops->diagonalscale)(b,ll,NULL);CHKERRQ(ierr); 1298 1299 /* scale the diagonal part */ 1300 ierr = (*a->ops->diagonalscale)(a,ll,rr);CHKERRQ(ierr); 1301 1302 /* right diagonalscale the off-diagonal part */ 1303 ierr = VecScatterEnd(baij->Mvctx,rr,baij->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 1304 ierr = (*b->ops->diagonalscale)(b,NULL,baij->lvec);CHKERRQ(ierr); 1305 PetscFunctionReturn(0); 1306 } 1307 1308 #undef __FUNCT__ 1309 #define __FUNCT__ "MatSetUnfactored_MPISBAIJ" 1310 PetscErrorCode MatSetUnfactored_MPISBAIJ(Mat A) 1311 { 1312 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 1313 PetscErrorCode ierr; 1314 1315 PetscFunctionBegin; 1316 ierr = MatSetUnfactored(a->A);CHKERRQ(ierr); 1317 PetscFunctionReturn(0); 1318 } 1319 1320 static PetscErrorCode MatDuplicate_MPISBAIJ(Mat,MatDuplicateOption,Mat*); 1321 1322 #undef __FUNCT__ 1323 #define __FUNCT__ "MatEqual_MPISBAIJ" 1324 PetscErrorCode MatEqual_MPISBAIJ(Mat A,Mat B,PetscBool *flag) 1325 { 1326 Mat_MPISBAIJ *matB = (Mat_MPISBAIJ*)B->data,*matA = (Mat_MPISBAIJ*)A->data; 1327 Mat a,b,c,d; 1328 PetscBool flg; 1329 PetscErrorCode ierr; 1330 1331 PetscFunctionBegin; 1332 a = matA->A; b = matA->B; 1333 c = matB->A; d = matB->B; 1334 1335 ierr = MatEqual(a,c,&flg);CHKERRQ(ierr); 1336 if (flg) { 1337 ierr = MatEqual(b,d,&flg);CHKERRQ(ierr); 1338 } 1339 ierr = MPI_Allreduce(&flg,flag,1,MPIU_BOOL,MPI_LAND,PetscObjectComm((PetscObject)A));CHKERRQ(ierr); 1340 PetscFunctionReturn(0); 1341 } 1342 1343 #undef __FUNCT__ 1344 #define __FUNCT__ "MatCopy_MPISBAIJ" 1345 PetscErrorCode MatCopy_MPISBAIJ(Mat A,Mat B,MatStructure str) 1346 { 1347 PetscErrorCode ierr; 1348 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 1349 Mat_MPISBAIJ *b = (Mat_MPISBAIJ*)B->data; 1350 1351 PetscFunctionBegin; 1352 /* If the two matrices don't have the same copy implementation, they aren't compatible for fast copy. */ 1353 if ((str != SAME_NONZERO_PATTERN) || (A->ops->copy != B->ops->copy)) { 1354 ierr = MatGetRowUpperTriangular(A);CHKERRQ(ierr); 1355 ierr = MatCopy_Basic(A,B,str);CHKERRQ(ierr); 1356 ierr = MatRestoreRowUpperTriangular(A);CHKERRQ(ierr); 1357 } else { 1358 ierr = MatCopy(a->A,b->A,str);CHKERRQ(ierr); 1359 ierr = MatCopy(a->B,b->B,str);CHKERRQ(ierr); 1360 } 1361 PetscFunctionReturn(0); 1362 } 1363 1364 #undef __FUNCT__ 1365 #define __FUNCT__ "MatSetUp_MPISBAIJ" 1366 PetscErrorCode MatSetUp_MPISBAIJ(Mat A) 1367 { 1368 PetscErrorCode ierr; 1369 1370 PetscFunctionBegin; 1371 ierr = MatMPISBAIJSetPreallocation(A,A->rmap->bs,PETSC_DEFAULT,0,PETSC_DEFAULT,0);CHKERRQ(ierr); 1372 PetscFunctionReturn(0); 1373 } 1374 1375 #undef __FUNCT__ 1376 #define __FUNCT__ "MatAXPY_MPISBAIJ" 1377 PetscErrorCode MatAXPY_MPISBAIJ(Mat Y,PetscScalar a,Mat X,MatStructure str) 1378 { 1379 PetscErrorCode ierr; 1380 Mat_MPISBAIJ *xx=(Mat_MPISBAIJ*)X->data,*yy=(Mat_MPISBAIJ*)Y->data; 1381 PetscBLASInt bnz,one=1; 1382 Mat_SeqSBAIJ *xa,*ya; 1383 Mat_SeqBAIJ *xb,*yb; 1384 1385 PetscFunctionBegin; 1386 if (str == SAME_NONZERO_PATTERN) { 1387 PetscScalar alpha = a; 1388 xa = (Mat_SeqSBAIJ*)xx->A->data; 1389 ya = (Mat_SeqSBAIJ*)yy->A->data; 1390 ierr = PetscBLASIntCast(xa->nz,&bnz);CHKERRQ(ierr); 1391 PetscStackCallBLAS("BLASaxpy",BLASaxpy_(&bnz,&alpha,xa->a,&one,ya->a,&one)); 1392 xb = (Mat_SeqBAIJ*)xx->B->data; 1393 yb = (Mat_SeqBAIJ*)yy->B->data; 1394 ierr = PetscBLASIntCast(xb->nz,&bnz);CHKERRQ(ierr); 1395 PetscStackCallBLAS("BLASaxpy",BLASaxpy_(&bnz,&alpha,xb->a,&one,yb->a,&one)); 1396 } else { 1397 ierr = MatGetRowUpperTriangular(X);CHKERRQ(ierr); 1398 ierr = MatAXPY_Basic(Y,a,X,str);CHKERRQ(ierr); 1399 ierr = MatRestoreRowUpperTriangular(X);CHKERRQ(ierr); 1400 } 1401 PetscFunctionReturn(0); 1402 } 1403 1404 #undef __FUNCT__ 1405 #define __FUNCT__ "MatGetSubMatrices_MPISBAIJ" 1406 PetscErrorCode MatGetSubMatrices_MPISBAIJ(Mat A,PetscInt n,const IS irow[],const IS icol[],MatReuse scall,Mat *B[]) 1407 { 1408 PetscErrorCode ierr; 1409 PetscInt i; 1410 PetscBool flg; 1411 1412 PetscFunctionBegin; 1413 for (i=0; i<n; i++) { 1414 ierr = ISEqual(irow[i],icol[i],&flg);CHKERRQ(ierr); 1415 if (!flg) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Can only get symmetric submatrix for MPISBAIJ matrices"); 1416 } 1417 ierr = MatGetSubMatrices_MPIBAIJ(A,n,irow,icol,scall,B);CHKERRQ(ierr); 1418 PetscFunctionReturn(0); 1419 } 1420 1421 1422 /* -------------------------------------------------------------------*/ 1423 static struct _MatOps MatOps_Values = {MatSetValues_MPISBAIJ, 1424 MatGetRow_MPISBAIJ, 1425 MatRestoreRow_MPISBAIJ, 1426 MatMult_MPISBAIJ, 1427 /* 4*/ MatMultAdd_MPISBAIJ, 1428 MatMult_MPISBAIJ, /* transpose versions are same as non-transpose */ 1429 MatMultAdd_MPISBAIJ, 1430 0, 1431 0, 1432 0, 1433 /* 10*/ 0, 1434 0, 1435 0, 1436 MatSOR_MPISBAIJ, 1437 MatTranspose_MPISBAIJ, 1438 /* 15*/ MatGetInfo_MPISBAIJ, 1439 MatEqual_MPISBAIJ, 1440 MatGetDiagonal_MPISBAIJ, 1441 MatDiagonalScale_MPISBAIJ, 1442 MatNorm_MPISBAIJ, 1443 /* 20*/ MatAssemblyBegin_MPISBAIJ, 1444 MatAssemblyEnd_MPISBAIJ, 1445 MatSetOption_MPISBAIJ, 1446 MatZeroEntries_MPISBAIJ, 1447 /* 24*/ 0, 1448 0, 1449 0, 1450 0, 1451 0, 1452 /* 29*/ MatSetUp_MPISBAIJ, 1453 0, 1454 0, 1455 0, 1456 0, 1457 /* 34*/ MatDuplicate_MPISBAIJ, 1458 0, 1459 0, 1460 0, 1461 0, 1462 /* 39*/ MatAXPY_MPISBAIJ, 1463 MatGetSubMatrices_MPISBAIJ, 1464 MatIncreaseOverlap_MPISBAIJ, 1465 MatGetValues_MPISBAIJ, 1466 MatCopy_MPISBAIJ, 1467 /* 44*/ 0, 1468 MatScale_MPISBAIJ, 1469 0, 1470 0, 1471 0, 1472 /* 49*/ 0, 1473 0, 1474 0, 1475 0, 1476 0, 1477 /* 54*/ 0, 1478 0, 1479 MatSetUnfactored_MPISBAIJ, 1480 0, 1481 MatSetValuesBlocked_MPISBAIJ, 1482 /* 59*/ 0, 1483 0, 1484 0, 1485 0, 1486 0, 1487 /* 64*/ 0, 1488 0, 1489 0, 1490 0, 1491 0, 1492 /* 69*/ MatGetRowMaxAbs_MPISBAIJ, 1493 0, 1494 0, 1495 0, 1496 0, 1497 /* 74*/ 0, 1498 0, 1499 0, 1500 0, 1501 0, 1502 /* 79*/ 0, 1503 0, 1504 0, 1505 0, 1506 MatLoad_MPISBAIJ, 1507 /* 84*/ 0, 1508 0, 1509 0, 1510 0, 1511 0, 1512 /* 89*/ 0, 1513 0, 1514 0, 1515 0, 1516 0, 1517 /* 94*/ 0, 1518 0, 1519 0, 1520 0, 1521 0, 1522 /* 99*/ 0, 1523 0, 1524 0, 1525 0, 1526 0, 1527 /*104*/ 0, 1528 MatRealPart_MPISBAIJ, 1529 MatImaginaryPart_MPISBAIJ, 1530 MatGetRowUpperTriangular_MPISBAIJ, 1531 MatRestoreRowUpperTriangular_MPISBAIJ, 1532 /*109*/ 0, 1533 0, 1534 0, 1535 0, 1536 0, 1537 /*114*/ 0, 1538 0, 1539 0, 1540 0, 1541 0, 1542 /*119*/ 0, 1543 0, 1544 0, 1545 0, 1546 0, 1547 /*124*/ 0, 1548 0, 1549 0, 1550 0, 1551 0, 1552 /*129*/ 0, 1553 0, 1554 0, 1555 0, 1556 0, 1557 /*134*/ 0, 1558 0, 1559 0, 1560 0, 1561 0, 1562 /*139*/ 0, 1563 0, 1564 0 1565 }; 1566 1567 1568 #undef __FUNCT__ 1569 #define __FUNCT__ "MatGetDiagonalBlock_MPISBAIJ" 1570 PetscErrorCode MatGetDiagonalBlock_MPISBAIJ(Mat A,Mat *a) 1571 { 1572 PetscFunctionBegin; 1573 *a = ((Mat_MPISBAIJ*)A->data)->A; 1574 PetscFunctionReturn(0); 1575 } 1576 1577 #undef __FUNCT__ 1578 #define __FUNCT__ "MatMPISBAIJSetPreallocation_MPISBAIJ" 1579 PetscErrorCode MatMPISBAIJSetPreallocation_MPISBAIJ(Mat B,PetscInt bs,PetscInt d_nz,const PetscInt *d_nnz,PetscInt o_nz,const PetscInt *o_nnz) 1580 { 1581 Mat_MPISBAIJ *b; 1582 PetscErrorCode ierr; 1583 PetscInt i,mbs,Mbs; 1584 1585 PetscFunctionBegin; 1586 ierr = MatSetBlockSize(B,PetscAbs(bs));CHKERRQ(ierr); 1587 ierr = PetscLayoutSetUp(B->rmap);CHKERRQ(ierr); 1588 ierr = PetscLayoutSetUp(B->cmap);CHKERRQ(ierr); 1589 ierr = PetscLayoutGetBlockSize(B->rmap,&bs);CHKERRQ(ierr); 1590 1591 b = (Mat_MPISBAIJ*)B->data; 1592 mbs = B->rmap->n/bs; 1593 Mbs = B->rmap->N/bs; 1594 if (mbs*bs != B->rmap->n) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"No of local rows %D must be divisible by blocksize %D",B->rmap->N,bs); 1595 1596 B->rmap->bs = bs; 1597 b->bs2 = bs*bs; 1598 b->mbs = mbs; 1599 b->nbs = mbs; 1600 b->Mbs = Mbs; 1601 b->Nbs = Mbs; 1602 1603 for (i=0; i<=b->size; i++) { 1604 b->rangebs[i] = B->rmap->range[i]/bs; 1605 } 1606 b->rstartbs = B->rmap->rstart/bs; 1607 b->rendbs = B->rmap->rend/bs; 1608 1609 b->cstartbs = B->cmap->rstart/bs; 1610 b->cendbs = B->cmap->rend/bs; 1611 1612 if (!B->preallocated) { 1613 ierr = MatCreate(PETSC_COMM_SELF,&b->A);CHKERRQ(ierr); 1614 ierr = MatSetSizes(b->A,B->rmap->n,B->cmap->n,B->rmap->n,B->cmap->n);CHKERRQ(ierr); 1615 ierr = MatSetType(b->A,MATSEQSBAIJ);CHKERRQ(ierr); 1616 ierr = PetscLogObjectParent((PetscObject)B,(PetscObject)b->A);CHKERRQ(ierr); 1617 ierr = MatCreate(PETSC_COMM_SELF,&b->B);CHKERRQ(ierr); 1618 ierr = MatSetSizes(b->B,B->rmap->n,B->cmap->N,B->rmap->n,B->cmap->N);CHKERRQ(ierr); 1619 ierr = MatSetType(b->B,MATSEQBAIJ);CHKERRQ(ierr); 1620 ierr = PetscLogObjectParent((PetscObject)B,(PetscObject)b->B);CHKERRQ(ierr); 1621 ierr = MatStashCreate_Private(PetscObjectComm((PetscObject)B),bs,&B->bstash);CHKERRQ(ierr); 1622 } 1623 1624 ierr = MatSeqSBAIJSetPreallocation(b->A,bs,d_nz,d_nnz);CHKERRQ(ierr); 1625 ierr = MatSeqBAIJSetPreallocation(b->B,bs,o_nz,o_nnz);CHKERRQ(ierr); 1626 1627 B->preallocated = PETSC_TRUE; 1628 PetscFunctionReturn(0); 1629 } 1630 1631 #undef __FUNCT__ 1632 #define __FUNCT__ "MatMPISBAIJSetPreallocationCSR_MPISBAIJ" 1633 PetscErrorCode MatMPISBAIJSetPreallocationCSR_MPISBAIJ(Mat B,PetscInt bs,const PetscInt ii[],const PetscInt jj[],const PetscScalar V[]) 1634 { 1635 PetscInt m,rstart,cstart,cend; 1636 PetscInt i,j,d,nz,nz_max=0,*d_nnz=0,*o_nnz=0; 1637 const PetscInt *JJ =0; 1638 PetscScalar *values=0; 1639 PetscErrorCode ierr; 1640 1641 PetscFunctionBegin; 1642 if (bs < 1) SETERRQ1(PetscObjectComm((PetscObject)B),PETSC_ERR_ARG_OUTOFRANGE,"Invalid block size specified, must be positive but it is %D",bs); 1643 ierr = PetscLayoutSetBlockSize(B->rmap,bs);CHKERRQ(ierr); 1644 ierr = PetscLayoutSetBlockSize(B->cmap,bs);CHKERRQ(ierr); 1645 ierr = PetscLayoutSetUp(B->rmap);CHKERRQ(ierr); 1646 ierr = PetscLayoutSetUp(B->cmap);CHKERRQ(ierr); 1647 ierr = PetscLayoutGetBlockSize(B->rmap,&bs);CHKERRQ(ierr); 1648 m = B->rmap->n/bs; 1649 rstart = B->rmap->rstart/bs; 1650 cstart = B->cmap->rstart/bs; 1651 cend = B->cmap->rend/bs; 1652 1653 if (ii[0]) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"ii[0] must be 0 but it is %D",ii[0]); 1654 ierr = PetscMalloc2(m,&d_nnz,m,&o_nnz);CHKERRQ(ierr); 1655 for (i=0; i<m; i++) { 1656 nz = ii[i+1] - ii[i]; 1657 if (nz < 0) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Local row %D has a negative number of columns %D",i,nz); 1658 nz_max = PetscMax(nz_max,nz); 1659 JJ = jj + ii[i]; 1660 for (j=0; j<nz; j++) { 1661 if (*JJ >= cstart) break; 1662 JJ++; 1663 } 1664 d = 0; 1665 for (; j<nz; j++) { 1666 if (*JJ++ >= cend) break; 1667 d++; 1668 } 1669 d_nnz[i] = d; 1670 o_nnz[i] = nz - d; 1671 } 1672 ierr = MatMPISBAIJSetPreallocation(B,bs,0,d_nnz,0,o_nnz);CHKERRQ(ierr); 1673 ierr = PetscFree2(d_nnz,o_nnz);CHKERRQ(ierr); 1674 1675 values = (PetscScalar*)V; 1676 if (!values) { 1677 ierr = PetscMalloc1(bs*bs*nz_max,&values);CHKERRQ(ierr); 1678 ierr = PetscMemzero(values,bs*bs*nz_max*sizeof(PetscScalar));CHKERRQ(ierr); 1679 } 1680 for (i=0; i<m; i++) { 1681 PetscInt row = i + rstart; 1682 PetscInt ncols = ii[i+1] - ii[i]; 1683 const PetscInt *icols = jj + ii[i]; 1684 const PetscScalar *svals = values + (V ? (bs*bs*ii[i]) : 0); 1685 ierr = MatSetValuesBlocked_MPISBAIJ(B,1,&row,ncols,icols,svals,INSERT_VALUES);CHKERRQ(ierr); 1686 } 1687 1688 if (!V) { ierr = PetscFree(values);CHKERRQ(ierr); } 1689 ierr = MatAssemblyBegin(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 1690 ierr = MatAssemblyEnd(B,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 1691 ierr = MatSetOption(B,MAT_NEW_NONZERO_LOCATION_ERR,PETSC_TRUE);CHKERRQ(ierr); 1692 PetscFunctionReturn(0); 1693 } 1694 1695 #if defined(PETSC_HAVE_MUMPS) 1696 PETSC_EXTERN PetscErrorCode MatGetFactor_sbaij_mumps(Mat,MatFactorType,Mat*); 1697 #endif 1698 #if defined(PETSC_HAVE_PASTIX) 1699 PETSC_EXTERN PetscErrorCode MatGetFactor_mpisbaij_pastix(Mat,MatFactorType,Mat*); 1700 #endif 1701 1702 /*MC 1703 MATMPISBAIJ - MATMPISBAIJ = "mpisbaij" - A matrix type to be used for distributed symmetric sparse block matrices, 1704 based on block compressed sparse row format. Only the upper triangular portion of the "diagonal" portion of 1705 the matrix is stored. 1706 1707 For complex numbers by default this matrix is symmetric, NOT Hermitian symmetric. To make it Hermitian symmetric you 1708 can call MatSetOption(Mat, MAT_HERMITIAN); 1709 1710 Options Database Keys: 1711 . -mat_type mpisbaij - sets the matrix type to "mpisbaij" during a call to MatSetFromOptions() 1712 1713 Level: beginner 1714 1715 .seealso: MatCreateMPISBAIJ 1716 M*/ 1717 1718 PETSC_EXTERN PetscErrorCode MatConvert_MPISBAIJ_MPISBSTRM(Mat,MatType,MatReuse,Mat*); 1719 1720 #undef __FUNCT__ 1721 #define __FUNCT__ "MatCreate_MPISBAIJ" 1722 PETSC_EXTERN PetscErrorCode MatCreate_MPISBAIJ(Mat B) 1723 { 1724 Mat_MPISBAIJ *b; 1725 PetscErrorCode ierr; 1726 PetscBool flg; 1727 1728 PetscFunctionBegin; 1729 ierr = PetscNewLog(B,&b);CHKERRQ(ierr); 1730 B->data = (void*)b; 1731 ierr = PetscMemcpy(B->ops,&MatOps_Values,sizeof(struct _MatOps));CHKERRQ(ierr); 1732 1733 B->ops->destroy = MatDestroy_MPISBAIJ; 1734 B->ops->view = MatView_MPISBAIJ; 1735 B->assembled = PETSC_FALSE; 1736 B->insertmode = NOT_SET_VALUES; 1737 1738 ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)B),&b->rank);CHKERRQ(ierr); 1739 ierr = MPI_Comm_size(PetscObjectComm((PetscObject)B),&b->size);CHKERRQ(ierr); 1740 1741 /* build local table of row and column ownerships */ 1742 ierr = PetscMalloc1((b->size+2),&b->rangebs);CHKERRQ(ierr); 1743 1744 /* build cache for off array entries formed */ 1745 ierr = MatStashCreate_Private(PetscObjectComm((PetscObject)B),1,&B->stash);CHKERRQ(ierr); 1746 1747 b->donotstash = PETSC_FALSE; 1748 b->colmap = NULL; 1749 b->garray = NULL; 1750 b->roworiented = PETSC_TRUE; 1751 1752 /* stuff used in block assembly */ 1753 b->barray = 0; 1754 1755 /* stuff used for matrix vector multiply */ 1756 b->lvec = 0; 1757 b->Mvctx = 0; 1758 b->slvec0 = 0; 1759 b->slvec0b = 0; 1760 b->slvec1 = 0; 1761 b->slvec1a = 0; 1762 b->slvec1b = 0; 1763 b->sMvctx = 0; 1764 1765 /* stuff for MatGetRow() */ 1766 b->rowindices = 0; 1767 b->rowvalues = 0; 1768 b->getrowactive = PETSC_FALSE; 1769 1770 /* hash table stuff */ 1771 b->ht = 0; 1772 b->hd = 0; 1773 b->ht_size = 0; 1774 b->ht_flag = PETSC_FALSE; 1775 b->ht_fact = 0; 1776 b->ht_total_ct = 0; 1777 b->ht_insert_ct = 0; 1778 1779 /* stuff for MatGetSubMatrices_MPIBAIJ_local() */ 1780 b->ijonly = PETSC_FALSE; 1781 1782 b->in_loc = 0; 1783 b->v_loc = 0; 1784 b->n_loc = 0; 1785 ierr = PetscOptionsBegin(PetscObjectComm((PetscObject)B),NULL,"Options for loading MPISBAIJ matrix 1","Mat");CHKERRQ(ierr); 1786 ierr = PetscOptionsBool("-mat_use_hash_table","Use hash table to save memory in constructing matrix","MatSetOption",PETSC_FALSE,&flg,NULL);CHKERRQ(ierr); 1787 if (flg) { 1788 PetscReal fact = 1.39; 1789 ierr = MatSetOption(B,MAT_USE_HASH_TABLE,PETSC_TRUE);CHKERRQ(ierr); 1790 ierr = PetscOptionsReal("-mat_use_hash_table","Use hash table factor","MatMPIBAIJSetHashTableFactor",fact,&fact,NULL);CHKERRQ(ierr); 1791 if (fact <= 1.0) fact = 1.39; 1792 ierr = MatMPIBAIJSetHashTableFactor(B,fact);CHKERRQ(ierr); 1793 ierr = PetscInfo1(B,"Hash table Factor used %5.2f\n",fact);CHKERRQ(ierr); 1794 } 1795 ierr = PetscOptionsEnd();CHKERRQ(ierr); 1796 1797 #if defined(PETSC_HAVE_PASTIX) 1798 ierr = PetscObjectComposeFunction((PetscObject)B,"MatGetFactor_pastix_C",MatGetFactor_mpisbaij_pastix);CHKERRQ(ierr); 1799 #endif 1800 #if defined(PETSC_HAVE_MUMPS) 1801 ierr = PetscObjectComposeFunction((PetscObject)B,"MatGetFactor_mumps_C",MatGetFactor_sbaij_mumps);CHKERRQ(ierr); 1802 #endif 1803 ierr = PetscObjectComposeFunction((PetscObject)B,"MatStoreValues_C",MatStoreValues_MPISBAIJ);CHKERRQ(ierr); 1804 ierr = PetscObjectComposeFunction((PetscObject)B,"MatRetrieveValues_C",MatRetrieveValues_MPISBAIJ);CHKERRQ(ierr); 1805 ierr = PetscObjectComposeFunction((PetscObject)B,"MatGetDiagonalBlock_C",MatGetDiagonalBlock_MPISBAIJ);CHKERRQ(ierr); 1806 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMPISBAIJSetPreallocation_C",MatMPISBAIJSetPreallocation_MPISBAIJ);CHKERRQ(ierr); 1807 ierr = PetscObjectComposeFunction((PetscObject)B,"MatMPISBAIJSetPreallocationCSR_C",MatMPISBAIJSetPreallocationCSR_MPISBAIJ);CHKERRQ(ierr); 1808 ierr = PetscObjectComposeFunction((PetscObject)B,"MatConvert_mpisbaij_mpisbstrm_C",MatConvert_MPISBAIJ_MPISBSTRM);CHKERRQ(ierr); 1809 1810 B->symmetric = PETSC_TRUE; 1811 B->structurally_symmetric = PETSC_TRUE; 1812 B->symmetric_set = PETSC_TRUE; 1813 B->structurally_symmetric_set = PETSC_TRUE; 1814 1815 ierr = PetscObjectChangeTypeName((PetscObject)B,MATMPISBAIJ);CHKERRQ(ierr); 1816 PetscFunctionReturn(0); 1817 } 1818 1819 /*MC 1820 MATSBAIJ - MATSBAIJ = "sbaij" - A matrix type to be used for symmetric block sparse matrices. 1821 1822 This matrix type is identical to MATSEQSBAIJ when constructed with a single process communicator, 1823 and MATMPISBAIJ otherwise. 1824 1825 Options Database Keys: 1826 . -mat_type sbaij - sets the matrix type to "sbaij" during a call to MatSetFromOptions() 1827 1828 Level: beginner 1829 1830 .seealso: MatCreateMPISBAIJ,MATSEQSBAIJ,MATMPISBAIJ 1831 M*/ 1832 1833 #undef __FUNCT__ 1834 #define __FUNCT__ "MatMPISBAIJSetPreallocation" 1835 /*@C 1836 MatMPISBAIJSetPreallocation - For good matrix assembly performance 1837 the user should preallocate the matrix storage by setting the parameters 1838 d_nz (or d_nnz) and o_nz (or o_nnz). By setting these parameters accurately, 1839 performance can be increased by more than a factor of 50. 1840 1841 Collective on Mat 1842 1843 Input Parameters: 1844 + A - the matrix 1845 . bs - size of blockk 1846 . d_nz - number of block nonzeros per block row in diagonal portion of local 1847 submatrix (same for all local rows) 1848 . d_nnz - array containing the number of block nonzeros in the various block rows 1849 in the upper triangular and diagonal part of the in diagonal portion of the local 1850 (possibly different for each block row) or NULL. If you plan to factor the matrix you must leave room 1851 for the diagonal entry and set a value even if it is zero. 1852 . o_nz - number of block nonzeros per block row in the off-diagonal portion of local 1853 submatrix (same for all local rows). 1854 - o_nnz - array containing the number of nonzeros in the various block rows of the 1855 off-diagonal portion of the local submatrix that is right of the diagonal 1856 (possibly different for each block row) or NULL. 1857 1858 1859 Options Database Keys: 1860 . -mat_no_unroll - uses code that does not unroll the loops in the 1861 block calculations (much slower) 1862 . -mat_block_size - size of the blocks to use 1863 1864 Notes: 1865 1866 If PETSC_DECIDE or PETSC_DETERMINE is used for a particular argument on one processor 1867 than it must be used on all processors that share the object for that argument. 1868 1869 If the *_nnz parameter is given then the *_nz parameter is ignored 1870 1871 Storage Information: 1872 For a square global matrix we define each processor's diagonal portion 1873 to be its local rows and the corresponding columns (a square submatrix); 1874 each processor's off-diagonal portion encompasses the remainder of the 1875 local matrix (a rectangular submatrix). 1876 1877 The user can specify preallocated storage for the diagonal part of 1878 the local submatrix with either d_nz or d_nnz (not both). Set 1879 d_nz=PETSC_DEFAULT and d_nnz=NULL for PETSc to control dynamic 1880 memory allocation. Likewise, specify preallocated storage for the 1881 off-diagonal part of the local submatrix with o_nz or o_nnz (not both). 1882 1883 You can call MatGetInfo() to get information on how effective the preallocation was; 1884 for example the fields mallocs,nz_allocated,nz_used,nz_unneeded; 1885 You can also run with the option -info and look for messages with the string 1886 malloc in them to see if additional memory allocation was needed. 1887 1888 Consider a processor that owns rows 3, 4 and 5 of a parallel matrix. In 1889 the figure below we depict these three local rows and all columns (0-11). 1890 1891 .vb 1892 0 1 2 3 4 5 6 7 8 9 10 11 1893 -------------------------- 1894 row 3 |. . . d d d o o o o o o 1895 row 4 |. . . d d d o o o o o o 1896 row 5 |. . . d d d o o o o o o 1897 -------------------------- 1898 .ve 1899 1900 Thus, any entries in the d locations are stored in the d (diagonal) 1901 submatrix, and any entries in the o locations are stored in the 1902 o (off-diagonal) submatrix. Note that the d matrix is stored in 1903 MatSeqSBAIJ format and the o submatrix in MATSEQBAIJ format. 1904 1905 Now d_nz should indicate the number of block nonzeros per row in the upper triangular 1906 plus the diagonal part of the d matrix, 1907 and o_nz should indicate the number of block nonzeros per row in the o matrix 1908 1909 In general, for PDE problems in which most nonzeros are near the diagonal, 1910 one expects d_nz >> o_nz. For large problems you MUST preallocate memory 1911 or you will get TERRIBLE performance; see the users' manual chapter on 1912 matrices. 1913 1914 Level: intermediate 1915 1916 .keywords: matrix, block, aij, compressed row, sparse, parallel 1917 1918 .seealso: MatCreate(), MatCreateSeqSBAIJ(), MatSetValues(), MatCreateBAIJ(), PetscSplitOwnership() 1919 @*/ 1920 PetscErrorCode MatMPISBAIJSetPreallocation(Mat B,PetscInt bs,PetscInt d_nz,const PetscInt d_nnz[],PetscInt o_nz,const PetscInt o_nnz[]) 1921 { 1922 PetscErrorCode ierr; 1923 1924 PetscFunctionBegin; 1925 PetscValidHeaderSpecific(B,MAT_CLASSID,1); 1926 PetscValidType(B,1); 1927 PetscValidLogicalCollectiveInt(B,bs,2); 1928 ierr = PetscTryMethod(B,"MatMPISBAIJSetPreallocation_C",(Mat,PetscInt,PetscInt,const PetscInt[],PetscInt,const PetscInt[]),(B,bs,d_nz,d_nnz,o_nz,o_nnz));CHKERRQ(ierr); 1929 PetscFunctionReturn(0); 1930 } 1931 1932 #undef __FUNCT__ 1933 #define __FUNCT__ "MatCreateSBAIJ" 1934 /*@C 1935 MatCreateSBAIJ - Creates a sparse parallel matrix in symmetric block AIJ format 1936 (block compressed row). For good matrix assembly performance 1937 the user should preallocate the matrix storage by setting the parameters 1938 d_nz (or d_nnz) and o_nz (or o_nnz). By setting these parameters accurately, 1939 performance can be increased by more than a factor of 50. 1940 1941 Collective on MPI_Comm 1942 1943 Input Parameters: 1944 + comm - MPI communicator 1945 . bs - size of blockk 1946 . m - number of local rows (or PETSC_DECIDE to have calculated if M is given) 1947 This value should be the same as the local size used in creating the 1948 y vector for the matrix-vector product y = Ax. 1949 . n - number of local columns (or PETSC_DECIDE to have calculated if N is given) 1950 This value should be the same as the local size used in creating the 1951 x vector for the matrix-vector product y = Ax. 1952 . M - number of global rows (or PETSC_DETERMINE to have calculated if m is given) 1953 . N - number of global columns (or PETSC_DETERMINE to have calculated if n is given) 1954 . d_nz - number of block nonzeros per block row in diagonal portion of local 1955 submatrix (same for all local rows) 1956 . d_nnz - array containing the number of block nonzeros in the various block rows 1957 in the upper triangular portion of the in diagonal portion of the local 1958 (possibly different for each block block row) or NULL. 1959 If you plan to factor the matrix you must leave room for the diagonal entry and 1960 set its value even if it is zero. 1961 . o_nz - number of block nonzeros per block row in the off-diagonal portion of local 1962 submatrix (same for all local rows). 1963 - o_nnz - array containing the number of nonzeros in the various block rows of the 1964 off-diagonal portion of the local submatrix (possibly different for 1965 each block row) or NULL. 1966 1967 Output Parameter: 1968 . A - the matrix 1969 1970 Options Database Keys: 1971 . -mat_no_unroll - uses code that does not unroll the loops in the 1972 block calculations (much slower) 1973 . -mat_block_size - size of the blocks to use 1974 . -mat_mpi - use the parallel matrix data structures even on one processor 1975 (defaults to using SeqBAIJ format on one processor) 1976 1977 It is recommended that one use the MatCreate(), MatSetType() and/or MatSetFromOptions(), 1978 MatXXXXSetPreallocation() paradgm instead of this routine directly. 1979 [MatXXXXSetPreallocation() is, for example, MatSeqAIJSetPreallocation] 1980 1981 Notes: 1982 The number of rows and columns must be divisible by blocksize. 1983 This matrix type does not support complex Hermitian operation. 1984 1985 The user MUST specify either the local or global matrix dimensions 1986 (possibly both). 1987 1988 If PETSC_DECIDE or PETSC_DETERMINE is used for a particular argument on one processor 1989 than it must be used on all processors that share the object for that argument. 1990 1991 If the *_nnz parameter is given then the *_nz parameter is ignored 1992 1993 Storage Information: 1994 For a square global matrix we define each processor's diagonal portion 1995 to be its local rows and the corresponding columns (a square submatrix); 1996 each processor's off-diagonal portion encompasses the remainder of the 1997 local matrix (a rectangular submatrix). 1998 1999 The user can specify preallocated storage for the diagonal part of 2000 the local submatrix with either d_nz or d_nnz (not both). Set 2001 d_nz=PETSC_DEFAULT and d_nnz=NULL for PETSc to control dynamic 2002 memory allocation. Likewise, specify preallocated storage for the 2003 off-diagonal part of the local submatrix with o_nz or o_nnz (not both). 2004 2005 Consider a processor that owns rows 3, 4 and 5 of a parallel matrix. In 2006 the figure below we depict these three local rows and all columns (0-11). 2007 2008 .vb 2009 0 1 2 3 4 5 6 7 8 9 10 11 2010 -------------------------- 2011 row 3 |. . . d d d o o o o o o 2012 row 4 |. . . d d d o o o o o o 2013 row 5 |. . . d d d o o o o o o 2014 -------------------------- 2015 .ve 2016 2017 Thus, any entries in the d locations are stored in the d (diagonal) 2018 submatrix, and any entries in the o locations are stored in the 2019 o (off-diagonal) submatrix. Note that the d matrix is stored in 2020 MatSeqSBAIJ format and the o submatrix in MATSEQBAIJ format. 2021 2022 Now d_nz should indicate the number of block nonzeros per row in the upper triangular 2023 plus the diagonal part of the d matrix, 2024 and o_nz should indicate the number of block nonzeros per row in the o matrix. 2025 In general, for PDE problems in which most nonzeros are near the diagonal, 2026 one expects d_nz >> o_nz. For large problems you MUST preallocate memory 2027 or you will get TERRIBLE performance; see the users' manual chapter on 2028 matrices. 2029 2030 Level: intermediate 2031 2032 .keywords: matrix, block, aij, compressed row, sparse, parallel 2033 2034 .seealso: MatCreate(), MatCreateSeqSBAIJ(), MatSetValues(), MatCreateBAIJ() 2035 @*/ 2036 2037 PetscErrorCode MatCreateSBAIJ(MPI_Comm comm,PetscInt bs,PetscInt m,PetscInt n,PetscInt M,PetscInt N,PetscInt d_nz,const PetscInt d_nnz[],PetscInt o_nz,const PetscInt o_nnz[],Mat *A) 2038 { 2039 PetscErrorCode ierr; 2040 PetscMPIInt size; 2041 2042 PetscFunctionBegin; 2043 ierr = MatCreate(comm,A);CHKERRQ(ierr); 2044 ierr = MatSetSizes(*A,m,n,M,N);CHKERRQ(ierr); 2045 ierr = MPI_Comm_size(comm,&size);CHKERRQ(ierr); 2046 if (size > 1) { 2047 ierr = MatSetType(*A,MATMPISBAIJ);CHKERRQ(ierr); 2048 ierr = MatMPISBAIJSetPreallocation(*A,bs,d_nz,d_nnz,o_nz,o_nnz);CHKERRQ(ierr); 2049 } else { 2050 ierr = MatSetType(*A,MATSEQSBAIJ);CHKERRQ(ierr); 2051 ierr = MatSeqSBAIJSetPreallocation(*A,bs,d_nz,d_nnz);CHKERRQ(ierr); 2052 } 2053 PetscFunctionReturn(0); 2054 } 2055 2056 2057 #undef __FUNCT__ 2058 #define __FUNCT__ "MatDuplicate_MPISBAIJ" 2059 static PetscErrorCode MatDuplicate_MPISBAIJ(Mat matin,MatDuplicateOption cpvalues,Mat *newmat) 2060 { 2061 Mat mat; 2062 Mat_MPISBAIJ *a,*oldmat = (Mat_MPISBAIJ*)matin->data; 2063 PetscErrorCode ierr; 2064 PetscInt len=0,nt,bs=matin->rmap->bs,mbs=oldmat->mbs; 2065 PetscScalar *array; 2066 2067 PetscFunctionBegin; 2068 *newmat = 0; 2069 2070 ierr = MatCreate(PetscObjectComm((PetscObject)matin),&mat);CHKERRQ(ierr); 2071 ierr = MatSetSizes(mat,matin->rmap->n,matin->cmap->n,matin->rmap->N,matin->cmap->N);CHKERRQ(ierr); 2072 ierr = MatSetType(mat,((PetscObject)matin)->type_name);CHKERRQ(ierr); 2073 ierr = PetscMemcpy(mat->ops,matin->ops,sizeof(struct _MatOps));CHKERRQ(ierr); 2074 ierr = PetscLayoutReference(matin->rmap,&mat->rmap);CHKERRQ(ierr); 2075 ierr = PetscLayoutReference(matin->cmap,&mat->cmap);CHKERRQ(ierr); 2076 2077 mat->factortype = matin->factortype; 2078 mat->preallocated = PETSC_TRUE; 2079 mat->assembled = PETSC_TRUE; 2080 mat->insertmode = NOT_SET_VALUES; 2081 2082 a = (Mat_MPISBAIJ*)mat->data; 2083 a->bs2 = oldmat->bs2; 2084 a->mbs = oldmat->mbs; 2085 a->nbs = oldmat->nbs; 2086 a->Mbs = oldmat->Mbs; 2087 a->Nbs = oldmat->Nbs; 2088 2089 2090 a->size = oldmat->size; 2091 a->rank = oldmat->rank; 2092 a->donotstash = oldmat->donotstash; 2093 a->roworiented = oldmat->roworiented; 2094 a->rowindices = 0; 2095 a->rowvalues = 0; 2096 a->getrowactive = PETSC_FALSE; 2097 a->barray = 0; 2098 a->rstartbs = oldmat->rstartbs; 2099 a->rendbs = oldmat->rendbs; 2100 a->cstartbs = oldmat->cstartbs; 2101 a->cendbs = oldmat->cendbs; 2102 2103 /* hash table stuff */ 2104 a->ht = 0; 2105 a->hd = 0; 2106 a->ht_size = 0; 2107 a->ht_flag = oldmat->ht_flag; 2108 a->ht_fact = oldmat->ht_fact; 2109 a->ht_total_ct = 0; 2110 a->ht_insert_ct = 0; 2111 2112 ierr = PetscMemcpy(a->rangebs,oldmat->rangebs,(a->size+2)*sizeof(PetscInt));CHKERRQ(ierr); 2113 if (oldmat->colmap) { 2114 #if defined(PETSC_USE_CTABLE) 2115 ierr = PetscTableCreateCopy(oldmat->colmap,&a->colmap);CHKERRQ(ierr); 2116 #else 2117 ierr = PetscMalloc1((a->Nbs),&a->colmap);CHKERRQ(ierr); 2118 ierr = PetscLogObjectMemory((PetscObject)mat,(a->Nbs)*sizeof(PetscInt));CHKERRQ(ierr); 2119 ierr = PetscMemcpy(a->colmap,oldmat->colmap,(a->Nbs)*sizeof(PetscInt));CHKERRQ(ierr); 2120 #endif 2121 } else a->colmap = 0; 2122 2123 if (oldmat->garray && (len = ((Mat_SeqBAIJ*)(oldmat->B->data))->nbs)) { 2124 ierr = PetscMalloc1(len,&a->garray);CHKERRQ(ierr); 2125 ierr = PetscLogObjectMemory((PetscObject)mat,len*sizeof(PetscInt));CHKERRQ(ierr); 2126 ierr = PetscMemcpy(a->garray,oldmat->garray,len*sizeof(PetscInt));CHKERRQ(ierr); 2127 } else a->garray = 0; 2128 2129 ierr = MatStashCreate_Private(PetscObjectComm((PetscObject)matin),matin->rmap->bs,&mat->bstash);CHKERRQ(ierr); 2130 ierr = VecDuplicate(oldmat->lvec,&a->lvec);CHKERRQ(ierr); 2131 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->lvec);CHKERRQ(ierr); 2132 ierr = VecScatterCopy(oldmat->Mvctx,&a->Mvctx);CHKERRQ(ierr); 2133 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->Mvctx);CHKERRQ(ierr); 2134 2135 ierr = VecDuplicate(oldmat->slvec0,&a->slvec0);CHKERRQ(ierr); 2136 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->slvec0);CHKERRQ(ierr); 2137 ierr = VecDuplicate(oldmat->slvec1,&a->slvec1);CHKERRQ(ierr); 2138 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->slvec1);CHKERRQ(ierr); 2139 2140 ierr = VecGetLocalSize(a->slvec1,&nt);CHKERRQ(ierr); 2141 ierr = VecGetArray(a->slvec1,&array);CHKERRQ(ierr); 2142 ierr = VecCreateSeqWithArray(PETSC_COMM_SELF,1,bs*mbs,array,&a->slvec1a);CHKERRQ(ierr); 2143 ierr = VecCreateSeqWithArray(PETSC_COMM_SELF,1,nt-bs*mbs,array+bs*mbs,&a->slvec1b);CHKERRQ(ierr); 2144 ierr = VecRestoreArray(a->slvec1,&array);CHKERRQ(ierr); 2145 ierr = VecGetArray(a->slvec0,&array);CHKERRQ(ierr); 2146 ierr = VecCreateSeqWithArray(PETSC_COMM_SELF,1,nt-bs*mbs,array+bs*mbs,&a->slvec0b);CHKERRQ(ierr); 2147 ierr = VecRestoreArray(a->slvec0,&array);CHKERRQ(ierr); 2148 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->slvec0);CHKERRQ(ierr); 2149 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->slvec1);CHKERRQ(ierr); 2150 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->slvec0b);CHKERRQ(ierr); 2151 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->slvec1a);CHKERRQ(ierr); 2152 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->slvec1b);CHKERRQ(ierr); 2153 2154 /* ierr = VecScatterCopy(oldmat->sMvctx,&a->sMvctx); - not written yet, replaced by the lazy trick: */ 2155 ierr = PetscObjectReference((PetscObject)oldmat->sMvctx);CHKERRQ(ierr); 2156 a->sMvctx = oldmat->sMvctx; 2157 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->sMvctx);CHKERRQ(ierr); 2158 2159 ierr = MatDuplicate(oldmat->A,cpvalues,&a->A);CHKERRQ(ierr); 2160 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->A);CHKERRQ(ierr); 2161 ierr = MatDuplicate(oldmat->B,cpvalues,&a->B);CHKERRQ(ierr); 2162 ierr = PetscLogObjectParent((PetscObject)mat,(PetscObject)a->B);CHKERRQ(ierr); 2163 ierr = PetscFunctionListDuplicate(((PetscObject)matin)->qlist,&((PetscObject)mat)->qlist);CHKERRQ(ierr); 2164 *newmat = mat; 2165 PetscFunctionReturn(0); 2166 } 2167 2168 #undef __FUNCT__ 2169 #define __FUNCT__ "MatLoad_MPISBAIJ" 2170 PetscErrorCode MatLoad_MPISBAIJ(Mat newmat,PetscViewer viewer) 2171 { 2172 PetscErrorCode ierr; 2173 PetscInt i,nz,j,rstart,rend; 2174 PetscScalar *vals,*buf; 2175 MPI_Comm comm; 2176 MPI_Status status; 2177 PetscMPIInt rank,size,tag = ((PetscObject)viewer)->tag,*sndcounts = 0,*browners,maxnz,*rowners,mmbs; 2178 PetscInt header[4],*rowlengths = 0,M,N,m,*cols,*locrowlens; 2179 PetscInt *procsnz = 0,jj,*mycols,*ibuf; 2180 PetscInt bs =1,Mbs,mbs,extra_rows; 2181 PetscInt *dlens,*odlens,*mask,*masked1,*masked2,rowcount,odcount; 2182 PetscInt dcount,kmax,k,nzcount,tmp,sizesset=1,grows,gcols; 2183 int fd; 2184 2185 PetscFunctionBegin; 2186 ierr = PetscObjectGetComm((PetscObject)viewer,&comm);CHKERRQ(ierr); 2187 ierr = PetscOptionsBegin(comm,NULL,"Options for loading MPISBAIJ matrix 2","Mat");CHKERRQ(ierr); 2188 ierr = PetscOptionsInt("-matload_block_size","Set the blocksize used to store the matrix","MatLoad",bs,&bs,NULL);CHKERRQ(ierr); 2189 ierr = PetscOptionsEnd();CHKERRQ(ierr); 2190 2191 ierr = MPI_Comm_size(comm,&size);CHKERRQ(ierr); 2192 ierr = MPI_Comm_rank(comm,&rank);CHKERRQ(ierr); 2193 if (!rank) { 2194 ierr = PetscViewerBinaryGetDescriptor(viewer,&fd);CHKERRQ(ierr); 2195 ierr = PetscBinaryRead(fd,(char*)header,4,PETSC_INT);CHKERRQ(ierr); 2196 if (header[0] != MAT_FILE_CLASSID) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_FILE_UNEXPECTED,"not matrix object"); 2197 if (header[3] < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_FILE_UNEXPECTED,"Matrix stored in special format, cannot load as MPISBAIJ"); 2198 } 2199 2200 if (newmat->rmap->n < 0 && newmat->rmap->N < 0 && newmat->cmap->n < 0 && newmat->cmap->N < 0) sizesset = 0; 2201 2202 ierr = MPI_Bcast(header+1,3,MPIU_INT,0,comm);CHKERRQ(ierr); 2203 M = header[1]; 2204 N = header[2]; 2205 2206 /* If global rows/cols are set to PETSC_DECIDE, set it to the sizes given in the file */ 2207 if (sizesset && newmat->rmap->N < 0) newmat->rmap->N = M; 2208 if (sizesset && newmat->cmap->N < 0) newmat->cmap->N = N; 2209 2210 /* If global sizes are set, check if they are consistent with that given in the file */ 2211 if (sizesset) { 2212 ierr = MatGetSize(newmat,&grows,&gcols);CHKERRQ(ierr); 2213 } 2214 if (sizesset && newmat->rmap->N != grows) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_FILE_UNEXPECTED, "Inconsistent # of rows:Matrix in file has (%d) and input matrix has (%d)",M,grows); 2215 if (sizesset && newmat->cmap->N != gcols) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_FILE_UNEXPECTED, "Inconsistent # of cols:Matrix in file has (%d) and input matrix has (%d)",N,gcols); 2216 2217 if (M != N) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Can only do square matrices"); 2218 2219 /* 2220 This code adds extra rows to make sure the number of rows is 2221 divisible by the blocksize 2222 */ 2223 Mbs = M/bs; 2224 extra_rows = bs - M + bs*(Mbs); 2225 if (extra_rows == bs) extra_rows = 0; 2226 else Mbs++; 2227 if (extra_rows &&!rank) { 2228 ierr = PetscInfo(viewer,"Padding loaded matrix to match blocksize\n");CHKERRQ(ierr); 2229 } 2230 2231 /* determine ownership of all rows */ 2232 if (newmat->rmap->n < 0) { /* PETSC_DECIDE */ 2233 mbs = Mbs/size + ((Mbs % size) > rank); 2234 m = mbs*bs; 2235 } else { /* User Set */ 2236 m = newmat->rmap->n; 2237 mbs = m/bs; 2238 } 2239 ierr = PetscMalloc2(size+1,&rowners,size+1,&browners);CHKERRQ(ierr); 2240 ierr = PetscMPIIntCast(mbs,&mmbs);CHKERRQ(ierr); 2241 ierr = MPI_Allgather(&mmbs,1,MPI_INT,rowners+1,1,MPI_INT,comm);CHKERRQ(ierr); 2242 rowners[0] = 0; 2243 for (i=2; i<=size; i++) rowners[i] += rowners[i-1]; 2244 for (i=0; i<=size; i++) browners[i] = rowners[i]*bs; 2245 rstart = rowners[rank]; 2246 rend = rowners[rank+1]; 2247 2248 /* distribute row lengths to all processors */ 2249 ierr = PetscMalloc1((rend-rstart)*bs,&locrowlens);CHKERRQ(ierr); 2250 if (!rank) { 2251 ierr = PetscMalloc1((M+extra_rows),&rowlengths);CHKERRQ(ierr); 2252 ierr = PetscBinaryRead(fd,rowlengths,M,PETSC_INT);CHKERRQ(ierr); 2253 for (i=0; i<extra_rows; i++) rowlengths[M+i] = 1; 2254 ierr = PetscMalloc1(size,&sndcounts);CHKERRQ(ierr); 2255 for (i=0; i<size; i++) sndcounts[i] = browners[i+1] - browners[i]; 2256 ierr = MPI_Scatterv(rowlengths,sndcounts,browners,MPIU_INT,locrowlens,(rend-rstart)*bs,MPIU_INT,0,comm);CHKERRQ(ierr); 2257 ierr = PetscFree(sndcounts);CHKERRQ(ierr); 2258 } else { 2259 ierr = MPI_Scatterv(0,0,0,MPIU_INT,locrowlens,(rend-rstart)*bs,MPIU_INT,0,comm);CHKERRQ(ierr); 2260 } 2261 2262 if (!rank) { /* procs[0] */ 2263 /* calculate the number of nonzeros on each processor */ 2264 ierr = PetscMalloc1(size,&procsnz);CHKERRQ(ierr); 2265 ierr = PetscMemzero(procsnz,size*sizeof(PetscInt));CHKERRQ(ierr); 2266 for (i=0; i<size; i++) { 2267 for (j=rowners[i]*bs; j< rowners[i+1]*bs; j++) { 2268 procsnz[i] += rowlengths[j]; 2269 } 2270 } 2271 ierr = PetscFree(rowlengths);CHKERRQ(ierr); 2272 2273 /* determine max buffer needed and allocate it */ 2274 maxnz = 0; 2275 for (i=0; i<size; i++) { 2276 maxnz = PetscMax(maxnz,procsnz[i]); 2277 } 2278 ierr = PetscMalloc1(maxnz,&cols);CHKERRQ(ierr); 2279 2280 /* read in my part of the matrix column indices */ 2281 nz = procsnz[0]; 2282 ierr = PetscMalloc1(nz,&ibuf);CHKERRQ(ierr); 2283 mycols = ibuf; 2284 if (size == 1) nz -= extra_rows; 2285 ierr = PetscBinaryRead(fd,mycols,nz,PETSC_INT);CHKERRQ(ierr); 2286 if (size == 1) { 2287 for (i=0; i< extra_rows; i++) mycols[nz+i] = M+i; 2288 } 2289 2290 /* read in every ones (except the last) and ship off */ 2291 for (i=1; i<size-1; i++) { 2292 nz = procsnz[i]; 2293 ierr = PetscBinaryRead(fd,cols,nz,PETSC_INT);CHKERRQ(ierr); 2294 ierr = MPI_Send(cols,nz,MPIU_INT,i,tag,comm);CHKERRQ(ierr); 2295 } 2296 /* read in the stuff for the last proc */ 2297 if (size != 1) { 2298 nz = procsnz[size-1] - extra_rows; /* the extra rows are not on the disk */ 2299 ierr = PetscBinaryRead(fd,cols,nz,PETSC_INT);CHKERRQ(ierr); 2300 for (i=0; i<extra_rows; i++) cols[nz+i] = M+i; 2301 ierr = MPI_Send(cols,nz+extra_rows,MPIU_INT,size-1,tag,comm);CHKERRQ(ierr); 2302 } 2303 ierr = PetscFree(cols);CHKERRQ(ierr); 2304 } else { /* procs[i], i>0 */ 2305 /* determine buffer space needed for message */ 2306 nz = 0; 2307 for (i=0; i<m; i++) nz += locrowlens[i]; 2308 ierr = PetscMalloc1(nz,&ibuf);CHKERRQ(ierr); 2309 mycols = ibuf; 2310 /* receive message of column indices*/ 2311 ierr = MPI_Recv(mycols,nz,MPIU_INT,0,tag,comm,&status);CHKERRQ(ierr); 2312 ierr = MPI_Get_count(&status,MPIU_INT,&maxnz);CHKERRQ(ierr); 2313 if (maxnz != nz) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_FILE_UNEXPECTED,"something is wrong with file"); 2314 } 2315 2316 /* loop over local rows, determining number of off diagonal entries */ 2317 ierr = PetscMalloc2(rend-rstart,&dlens,rend-rstart,&odlens);CHKERRQ(ierr); 2318 ierr = PetscMalloc3(Mbs,&mask,Mbs,&masked1,Mbs,&masked2);CHKERRQ(ierr); 2319 ierr = PetscMemzero(mask,Mbs*sizeof(PetscInt));CHKERRQ(ierr); 2320 ierr = PetscMemzero(masked1,Mbs*sizeof(PetscInt));CHKERRQ(ierr); 2321 ierr = PetscMemzero(masked2,Mbs*sizeof(PetscInt));CHKERRQ(ierr); 2322 rowcount = 0; 2323 nzcount = 0; 2324 for (i=0; i<mbs; i++) { 2325 dcount = 0; 2326 odcount = 0; 2327 for (j=0; j<bs; j++) { 2328 kmax = locrowlens[rowcount]; 2329 for (k=0; k<kmax; k++) { 2330 tmp = mycols[nzcount++]/bs; /* block col. index */ 2331 if (!mask[tmp]) { 2332 mask[tmp] = 1; 2333 if (tmp < rstart || tmp >= rend) masked2[odcount++] = tmp; /* entry in off-diag portion */ 2334 else masked1[dcount++] = tmp; /* entry in diag portion */ 2335 } 2336 } 2337 rowcount++; 2338 } 2339 2340 dlens[i] = dcount; /* d_nzz[i] */ 2341 odlens[i] = odcount; /* o_nzz[i] */ 2342 2343 /* zero out the mask elements we set */ 2344 for (j=0; j<dcount; j++) mask[masked1[j]] = 0; 2345 for (j=0; j<odcount; j++) mask[masked2[j]] = 0; 2346 } 2347 if (!sizesset) { 2348 ierr = MatSetSizes(newmat,m,m,M+extra_rows,N+extra_rows);CHKERRQ(ierr); 2349 } 2350 ierr = MatMPISBAIJSetPreallocation(newmat,bs,0,dlens,0,odlens);CHKERRQ(ierr); 2351 ierr = MatSetOption(newmat,MAT_IGNORE_LOWER_TRIANGULAR,PETSC_TRUE);CHKERRQ(ierr); 2352 2353 if (!rank) { 2354 ierr = PetscMalloc1(maxnz,&buf);CHKERRQ(ierr); 2355 /* read in my part of the matrix numerical values */ 2356 nz = procsnz[0]; 2357 vals = buf; 2358 mycols = ibuf; 2359 if (size == 1) nz -= extra_rows; 2360 ierr = PetscBinaryRead(fd,vals,nz,PETSC_SCALAR);CHKERRQ(ierr); 2361 if (size == 1) { 2362 for (i=0; i< extra_rows; i++) vals[nz+i] = 1.0; 2363 } 2364 2365 /* insert into matrix */ 2366 jj = rstart*bs; 2367 for (i=0; i<m; i++) { 2368 ierr = MatSetValues(newmat,1,&jj,locrowlens[i],mycols,vals,INSERT_VALUES);CHKERRQ(ierr); 2369 mycols += locrowlens[i]; 2370 vals += locrowlens[i]; 2371 jj++; 2372 } 2373 2374 /* read in other processors (except the last one) and ship out */ 2375 for (i=1; i<size-1; i++) { 2376 nz = procsnz[i]; 2377 vals = buf; 2378 ierr = PetscBinaryRead(fd,vals,nz,PETSC_SCALAR);CHKERRQ(ierr); 2379 ierr = MPI_Send(vals,nz,MPIU_SCALAR,i,((PetscObject)newmat)->tag,comm);CHKERRQ(ierr); 2380 } 2381 /* the last proc */ 2382 if (size != 1) { 2383 nz = procsnz[i] - extra_rows; 2384 vals = buf; 2385 ierr = PetscBinaryRead(fd,vals,nz,PETSC_SCALAR);CHKERRQ(ierr); 2386 for (i=0; i<extra_rows; i++) vals[nz+i] = 1.0; 2387 ierr = MPI_Send(vals,nz+extra_rows,MPIU_SCALAR,size-1,((PetscObject)newmat)->tag,comm);CHKERRQ(ierr); 2388 } 2389 ierr = PetscFree(procsnz);CHKERRQ(ierr); 2390 2391 } else { 2392 /* receive numeric values */ 2393 ierr = PetscMalloc1(nz,&buf);CHKERRQ(ierr); 2394 2395 /* receive message of values*/ 2396 vals = buf; 2397 mycols = ibuf; 2398 ierr = MPI_Recv(vals,nz,MPIU_SCALAR,0,((PetscObject)newmat)->tag,comm,&status);CHKERRQ(ierr); 2399 ierr = MPI_Get_count(&status,MPIU_SCALAR,&maxnz);CHKERRQ(ierr); 2400 if (maxnz != nz) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_FILE_UNEXPECTED,"something is wrong with file"); 2401 2402 /* insert into matrix */ 2403 jj = rstart*bs; 2404 for (i=0; i<m; i++) { 2405 ierr = MatSetValues_MPISBAIJ(newmat,1,&jj,locrowlens[i],mycols,vals,INSERT_VALUES);CHKERRQ(ierr); 2406 mycols += locrowlens[i]; 2407 vals += locrowlens[i]; 2408 jj++; 2409 } 2410 } 2411 2412 ierr = PetscFree(locrowlens);CHKERRQ(ierr); 2413 ierr = PetscFree(buf);CHKERRQ(ierr); 2414 ierr = PetscFree(ibuf);CHKERRQ(ierr); 2415 ierr = PetscFree2(rowners,browners);CHKERRQ(ierr); 2416 ierr = PetscFree2(dlens,odlens);CHKERRQ(ierr); 2417 ierr = PetscFree3(mask,masked1,masked2);CHKERRQ(ierr); 2418 ierr = MatAssemblyBegin(newmat,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2419 ierr = MatAssemblyEnd(newmat,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 2420 PetscFunctionReturn(0); 2421 } 2422 2423 #undef __FUNCT__ 2424 #define __FUNCT__ "MatMPISBAIJSetHashTableFactor" 2425 /*XXXXX@ 2426 MatMPISBAIJSetHashTableFactor - Sets the factor required to compute the size of the HashTable. 2427 2428 Input Parameters: 2429 . mat - the matrix 2430 . fact - factor 2431 2432 Not Collective on Mat, each process can have a different hash factor 2433 2434 Level: advanced 2435 2436 Notes: 2437 This can also be set by the command line option: -mat_use_hash_table fact 2438 2439 .keywords: matrix, hashtable, factor, HT 2440 2441 .seealso: MatSetOption() 2442 @XXXXX*/ 2443 2444 2445 #undef __FUNCT__ 2446 #define __FUNCT__ "MatGetRowMaxAbs_MPISBAIJ" 2447 PetscErrorCode MatGetRowMaxAbs_MPISBAIJ(Mat A,Vec v,PetscInt idx[]) 2448 { 2449 Mat_MPISBAIJ *a = (Mat_MPISBAIJ*)A->data; 2450 Mat_SeqBAIJ *b = (Mat_SeqBAIJ*)(a->B)->data; 2451 PetscReal atmp; 2452 PetscReal *work,*svalues,*rvalues; 2453 PetscErrorCode ierr; 2454 PetscInt i,bs,mbs,*bi,*bj,brow,j,ncols,krow,kcol,col,row,Mbs,bcol; 2455 PetscMPIInt rank,size; 2456 PetscInt *rowners_bs,dest,count,source; 2457 PetscScalar *va; 2458 MatScalar *ba; 2459 MPI_Status stat; 2460 2461 PetscFunctionBegin; 2462 if (idx) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Send email to petsc-maint@mcs.anl.gov"); 2463 ierr = MatGetRowMaxAbs(a->A,v,NULL);CHKERRQ(ierr); 2464 ierr = VecGetArray(v,&va);CHKERRQ(ierr); 2465 2466 ierr = MPI_Comm_size(PetscObjectComm((PetscObject)A),&size);CHKERRQ(ierr); 2467 ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)A),&rank);CHKERRQ(ierr); 2468 2469 bs = A->rmap->bs; 2470 mbs = a->mbs; 2471 Mbs = a->Mbs; 2472 ba = b->a; 2473 bi = b->i; 2474 bj = b->j; 2475 2476 /* find ownerships */ 2477 rowners_bs = A->rmap->range; 2478 2479 /* each proc creates an array to be distributed */ 2480 ierr = PetscMalloc1(bs*Mbs,&work);CHKERRQ(ierr); 2481 ierr = PetscMemzero(work,bs*Mbs*sizeof(PetscReal));CHKERRQ(ierr); 2482 2483 /* row_max for B */ 2484 if (rank != size-1) { 2485 for (i=0; i<mbs; i++) { 2486 ncols = bi[1] - bi[0]; bi++; 2487 brow = bs*i; 2488 for (j=0; j<ncols; j++) { 2489 bcol = bs*(*bj); 2490 for (kcol=0; kcol<bs; kcol++) { 2491 col = bcol + kcol; /* local col index */ 2492 col += rowners_bs[rank+1]; /* global col index */ 2493 for (krow=0; krow<bs; krow++) { 2494 atmp = PetscAbsScalar(*ba); ba++; 2495 row = brow + krow; /* local row index */ 2496 if (PetscRealPart(va[row]) < atmp) va[row] = atmp; 2497 if (work[col] < atmp) work[col] = atmp; 2498 } 2499 } 2500 bj++; 2501 } 2502 } 2503 2504 /* send values to its owners */ 2505 for (dest=rank+1; dest<size; dest++) { 2506 svalues = work + rowners_bs[dest]; 2507 count = rowners_bs[dest+1]-rowners_bs[dest]; 2508 ierr = MPI_Send(svalues,count,MPIU_REAL,dest,rank,PetscObjectComm((PetscObject)A));CHKERRQ(ierr); 2509 } 2510 } 2511 2512 /* receive values */ 2513 if (rank) { 2514 rvalues = work; 2515 count = rowners_bs[rank+1]-rowners_bs[rank]; 2516 for (source=0; source<rank; source++) { 2517 ierr = MPI_Recv(rvalues,count,MPIU_REAL,MPI_ANY_SOURCE,MPI_ANY_TAG,PetscObjectComm((PetscObject)A),&stat);CHKERRQ(ierr); 2518 /* process values */ 2519 for (i=0; i<count; i++) { 2520 if (PetscRealPart(va[i]) < rvalues[i]) va[i] = rvalues[i]; 2521 } 2522 } 2523 } 2524 2525 ierr = VecRestoreArray(v,&va);CHKERRQ(ierr); 2526 ierr = PetscFree(work);CHKERRQ(ierr); 2527 PetscFunctionReturn(0); 2528 } 2529 2530 #undef __FUNCT__ 2531 #define __FUNCT__ "MatSOR_MPISBAIJ" 2532 PetscErrorCode MatSOR_MPISBAIJ(Mat matin,Vec bb,PetscReal omega,MatSORType flag,PetscReal fshift,PetscInt its,PetscInt lits,Vec xx) 2533 { 2534 Mat_MPISBAIJ *mat = (Mat_MPISBAIJ*)matin->data; 2535 PetscErrorCode ierr; 2536 PetscInt mbs=mat->mbs,bs=matin->rmap->bs; 2537 PetscScalar *x,*ptr,*from; 2538 Vec bb1; 2539 const PetscScalar *b; 2540 2541 PetscFunctionBegin; 2542 if (its <= 0 || lits <= 0) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Relaxation requires global its %D and local its %D both positive",its,lits); 2543 if (bs > 1) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"SSOR for block size > 1 is not yet implemented"); 2544 2545 if (flag == SOR_APPLY_UPPER) { 2546 ierr = (*mat->A->ops->sor)(mat->A,bb,omega,flag,fshift,lits,1,xx);CHKERRQ(ierr); 2547 PetscFunctionReturn(0); 2548 } 2549 2550 if ((flag & SOR_LOCAL_SYMMETRIC_SWEEP) == SOR_LOCAL_SYMMETRIC_SWEEP) { 2551 if (flag & SOR_ZERO_INITIAL_GUESS) { 2552 ierr = (*mat->A->ops->sor)(mat->A,bb,omega,flag,fshift,lits,lits,xx);CHKERRQ(ierr); 2553 its--; 2554 } 2555 2556 ierr = VecDuplicate(bb,&bb1);CHKERRQ(ierr); 2557 while (its--) { 2558 2559 /* lower triangular part: slvec0b = - B^T*xx */ 2560 ierr = (*mat->B->ops->multtranspose)(mat->B,xx,mat->slvec0b);CHKERRQ(ierr); 2561 2562 /* copy xx into slvec0a */ 2563 ierr = VecGetArray(mat->slvec0,&ptr);CHKERRQ(ierr); 2564 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 2565 ierr = PetscMemcpy(ptr,x,bs*mbs*sizeof(MatScalar));CHKERRQ(ierr); 2566 ierr = VecRestoreArray(mat->slvec0,&ptr);CHKERRQ(ierr); 2567 2568 ierr = VecScale(mat->slvec0,-1.0);CHKERRQ(ierr); 2569 2570 /* copy bb into slvec1a */ 2571 ierr = VecGetArray(mat->slvec1,&ptr);CHKERRQ(ierr); 2572 ierr = VecGetArrayRead(bb,&b);CHKERRQ(ierr); 2573 ierr = PetscMemcpy(ptr,b,bs*mbs*sizeof(MatScalar));CHKERRQ(ierr); 2574 ierr = VecRestoreArray(mat->slvec1,&ptr);CHKERRQ(ierr); 2575 2576 /* set slvec1b = 0 */ 2577 ierr = VecSet(mat->slvec1b,0.0);CHKERRQ(ierr); 2578 2579 ierr = VecScatterBegin(mat->sMvctx,mat->slvec0,mat->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 2580 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 2581 ierr = VecRestoreArrayRead(bb,&b);CHKERRQ(ierr); 2582 ierr = VecScatterEnd(mat->sMvctx,mat->slvec0,mat->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 2583 2584 /* upper triangular part: bb1 = bb1 - B*x */ 2585 ierr = (*mat->B->ops->multadd)(mat->B,mat->slvec1b,mat->slvec1a,bb1);CHKERRQ(ierr); 2586 2587 /* local diagonal sweep */ 2588 ierr = (*mat->A->ops->sor)(mat->A,bb1,omega,SOR_SYMMETRIC_SWEEP,fshift,lits,lits,xx);CHKERRQ(ierr); 2589 } 2590 ierr = VecDestroy(&bb1);CHKERRQ(ierr); 2591 } else if ((flag & SOR_LOCAL_FORWARD_SWEEP) && (its == 1) && (flag & SOR_ZERO_INITIAL_GUESS)) { 2592 ierr = (*mat->A->ops->sor)(mat->A,bb,omega,flag,fshift,lits,1,xx);CHKERRQ(ierr); 2593 } else if ((flag & SOR_LOCAL_BACKWARD_SWEEP) && (its == 1) && (flag & SOR_ZERO_INITIAL_GUESS)) { 2594 ierr = (*mat->A->ops->sor)(mat->A,bb,omega,flag,fshift,lits,1,xx);CHKERRQ(ierr); 2595 } else if (flag & SOR_EISENSTAT) { 2596 Vec xx1; 2597 PetscBool hasop; 2598 const PetscScalar *diag; 2599 PetscScalar *sl,scale = (omega - 2.0)/omega; 2600 PetscInt i,n; 2601 2602 if (!mat->xx1) { 2603 ierr = VecDuplicate(bb,&mat->xx1);CHKERRQ(ierr); 2604 ierr = VecDuplicate(bb,&mat->bb1);CHKERRQ(ierr); 2605 } 2606 xx1 = mat->xx1; 2607 bb1 = mat->bb1; 2608 2609 ierr = (*mat->A->ops->sor)(mat->A,bb,omega,(MatSORType)(SOR_ZERO_INITIAL_GUESS | SOR_LOCAL_BACKWARD_SWEEP),fshift,lits,1,xx);CHKERRQ(ierr); 2610 2611 if (!mat->diag) { 2612 /* this is wrong for same matrix with new nonzero values */ 2613 ierr = MatGetVecs(matin,&mat->diag,NULL);CHKERRQ(ierr); 2614 ierr = MatGetDiagonal(matin,mat->diag);CHKERRQ(ierr); 2615 } 2616 ierr = MatHasOperation(matin,MATOP_MULT_DIAGONAL_BLOCK,&hasop);CHKERRQ(ierr); 2617 2618 if (hasop) { 2619 ierr = MatMultDiagonalBlock(matin,xx,bb1);CHKERRQ(ierr); 2620 ierr = VecAYPX(mat->slvec1a,scale,bb);CHKERRQ(ierr); 2621 } else { 2622 /* 2623 These two lines are replaced by code that may be a bit faster for a good compiler 2624 ierr = VecPointwiseMult(mat->slvec1a,mat->diag,xx);CHKERRQ(ierr); 2625 ierr = VecAYPX(mat->slvec1a,scale,bb);CHKERRQ(ierr); 2626 */ 2627 ierr = VecGetArray(mat->slvec1a,&sl);CHKERRQ(ierr); 2628 ierr = VecGetArrayRead(mat->diag,&diag);CHKERRQ(ierr); 2629 ierr = VecGetArrayRead(bb,&b);CHKERRQ(ierr); 2630 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 2631 ierr = VecGetLocalSize(xx,&n);CHKERRQ(ierr); 2632 if (omega == 1.0) { 2633 for (i=0; i<n; i++) sl[i] = b[i] - diag[i]*x[i]; 2634 ierr = PetscLogFlops(2.0*n);CHKERRQ(ierr); 2635 } else { 2636 for (i=0; i<n; i++) sl[i] = b[i] + scale*diag[i]*x[i]; 2637 ierr = PetscLogFlops(3.0*n);CHKERRQ(ierr); 2638 } 2639 ierr = VecRestoreArray(mat->slvec1a,&sl);CHKERRQ(ierr); 2640 ierr = VecRestoreArrayRead(mat->diag,&diag);CHKERRQ(ierr); 2641 ierr = VecRestoreArrayRead(bb,&b);CHKERRQ(ierr); 2642 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 2643 } 2644 2645 /* multiply off-diagonal portion of matrix */ 2646 ierr = VecSet(mat->slvec1b,0.0);CHKERRQ(ierr); 2647 ierr = (*mat->B->ops->multtranspose)(mat->B,xx,mat->slvec0b);CHKERRQ(ierr); 2648 ierr = VecGetArray(mat->slvec0,&from);CHKERRQ(ierr); 2649 ierr = VecGetArray(xx,&x);CHKERRQ(ierr); 2650 ierr = PetscMemcpy(from,x,bs*mbs*sizeof(MatScalar));CHKERRQ(ierr); 2651 ierr = VecRestoreArray(mat->slvec0,&from);CHKERRQ(ierr); 2652 ierr = VecRestoreArray(xx,&x);CHKERRQ(ierr); 2653 ierr = VecScatterBegin(mat->sMvctx,mat->slvec0,mat->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 2654 ierr = VecScatterEnd(mat->sMvctx,mat->slvec0,mat->slvec1,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 2655 ierr = (*mat->B->ops->multadd)(mat->B,mat->slvec1b,mat->slvec1a,mat->slvec1a);CHKERRQ(ierr); 2656 2657 /* local sweep */ 2658 ierr = (*mat->A->ops->sor)(mat->A,mat->slvec1a,omega,(MatSORType)(SOR_ZERO_INITIAL_GUESS | SOR_LOCAL_FORWARD_SWEEP),fshift,lits,1,xx1);CHKERRQ(ierr); 2659 ierr = VecAXPY(xx,1.0,xx1);CHKERRQ(ierr); 2660 } else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"MatSORType is not supported for SBAIJ matrix format"); 2661 PetscFunctionReturn(0); 2662 } 2663 2664 #undef __FUNCT__ 2665 #define __FUNCT__ "MatSOR_MPISBAIJ_2comm" 2666 PetscErrorCode MatSOR_MPISBAIJ_2comm(Mat matin,Vec bb,PetscReal omega,MatSORType flag,PetscReal fshift,PetscInt its,PetscInt lits,Vec xx) 2667 { 2668 Mat_MPISBAIJ *mat = (Mat_MPISBAIJ*)matin->data; 2669 PetscErrorCode ierr; 2670 Vec lvec1,bb1; 2671 2672 PetscFunctionBegin; 2673 if (its <= 0 || lits <= 0) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Relaxation requires global its %D and local its %D both positive",its,lits); 2674 if (matin->rmap->bs > 1) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"SSOR for block size > 1 is not yet implemented"); 2675 2676 if ((flag & SOR_LOCAL_SYMMETRIC_SWEEP) == SOR_LOCAL_SYMMETRIC_SWEEP) { 2677 if (flag & SOR_ZERO_INITIAL_GUESS) { 2678 ierr = (*mat->A->ops->sor)(mat->A,bb,omega,flag,fshift,lits,lits,xx);CHKERRQ(ierr); 2679 its--; 2680 } 2681 2682 ierr = VecDuplicate(mat->lvec,&lvec1);CHKERRQ(ierr); 2683 ierr = VecDuplicate(bb,&bb1);CHKERRQ(ierr); 2684 while (its--) { 2685 ierr = VecScatterBegin(mat->Mvctx,xx,mat->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 2686 2687 /* lower diagonal part: bb1 = bb - B^T*xx */ 2688 ierr = (*mat->B->ops->multtranspose)(mat->B,xx,lvec1);CHKERRQ(ierr); 2689 ierr = VecScale(lvec1,-1.0);CHKERRQ(ierr); 2690 2691 ierr = VecScatterEnd(mat->Mvctx,xx,mat->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 2692 ierr = VecCopy(bb,bb1);CHKERRQ(ierr); 2693 ierr = VecScatterBegin(mat->Mvctx,lvec1,bb1,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 2694 2695 /* upper diagonal part: bb1 = bb1 - B*x */ 2696 ierr = VecScale(mat->lvec,-1.0);CHKERRQ(ierr); 2697 ierr = (*mat->B->ops->multadd)(mat->B,mat->lvec,bb1,bb1);CHKERRQ(ierr); 2698 2699 ierr = VecScatterEnd(mat->Mvctx,lvec1,bb1,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 2700 2701 /* diagonal sweep */ 2702 ierr = (*mat->A->ops->sor)(mat->A,bb1,omega,SOR_SYMMETRIC_SWEEP,fshift,lits,lits,xx);CHKERRQ(ierr); 2703 } 2704 ierr = VecDestroy(&lvec1);CHKERRQ(ierr); 2705 ierr = VecDestroy(&bb1);CHKERRQ(ierr); 2706 } else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"MatSORType is not supported for SBAIJ matrix format"); 2707 PetscFunctionReturn(0); 2708 } 2709 2710 #undef __FUNCT__ 2711 #define __FUNCT__ "MatCreateMPISBAIJWithArrays" 2712 /*@ 2713 MatCreateMPISBAIJWithArrays - creates a MPI SBAIJ matrix using arrays that contain in standard 2714 CSR format the local rows. 2715 2716 Collective on MPI_Comm 2717 2718 Input Parameters: 2719 + comm - MPI communicator 2720 . bs - the block size, only a block size of 1 is supported 2721 . m - number of local rows (Cannot be PETSC_DECIDE) 2722 . n - This value should be the same as the local size used in creating the 2723 x vector for the matrix-vector product y = Ax. (or PETSC_DECIDE to have 2724 calculated if N is given) For square matrices n is almost always m. 2725 . M - number of global rows (or PETSC_DETERMINE to have calculated if m is given) 2726 . N - number of global columns (or PETSC_DETERMINE to have calculated if n is given) 2727 . i - row indices 2728 . j - column indices 2729 - a - matrix values 2730 2731 Output Parameter: 2732 . mat - the matrix 2733 2734 Level: intermediate 2735 2736 Notes: 2737 The i, j, and a arrays ARE copied by this routine into the internal format used by PETSc; 2738 thus you CANNOT change the matrix entries by changing the values of a[] after you have 2739 called this routine. Use MatCreateMPIAIJWithSplitArrays() to avoid needing to copy the arrays. 2740 2741 The i and j indices are 0 based, and i indices are indices corresponding to the local j array. 2742 2743 .keywords: matrix, aij, compressed row, sparse, parallel 2744 2745 .seealso: MatCreate(), MatCreateSeqAIJ(), MatSetValues(), MatMPIAIJSetPreallocation(), MatMPIAIJSetPreallocationCSR(), 2746 MPIAIJ, MatCreateAIJ(), MatCreateMPIAIJWithSplitArrays() 2747 @*/ 2748 PetscErrorCode MatCreateMPISBAIJWithArrays(MPI_Comm comm,PetscInt bs,PetscInt m,PetscInt n,PetscInt M,PetscInt N,const PetscInt i[],const PetscInt j[],const PetscScalar a[],Mat *mat) 2749 { 2750 PetscErrorCode ierr; 2751 2752 2753 PetscFunctionBegin; 2754 if (i[0]) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"i (row indices) must start with 0"); 2755 if (m < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"local number of rows (m) cannot be PETSC_DECIDE, or negative"); 2756 ierr = MatCreate(comm,mat);CHKERRQ(ierr); 2757 ierr = MatSetSizes(*mat,m,n,M,N);CHKERRQ(ierr); 2758 ierr = MatSetType(*mat,MATMPISBAIJ);CHKERRQ(ierr); 2759 ierr = MatMPISBAIJSetPreallocationCSR(*mat,bs,i,j,a);CHKERRQ(ierr); 2760 PetscFunctionReturn(0); 2761 } 2762 2763 2764 #undef __FUNCT__ 2765 #define __FUNCT__ "MatMPISBAIJSetPreallocationCSR" 2766 /*@C 2767 MatMPISBAIJSetPreallocationCSR - Allocates memory for a sparse parallel matrix in BAIJ format 2768 (the default parallel PETSc format). 2769 2770 Collective on MPI_Comm 2771 2772 Input Parameters: 2773 + A - the matrix 2774 . bs - the block size 2775 . i - the indices into j for the start of each local row (starts with zero) 2776 . j - the column indices for each local row (starts with zero) these must be sorted for each row 2777 - v - optional values in the matrix 2778 2779 Level: developer 2780 2781 .keywords: matrix, aij, compressed row, sparse, parallel 2782 2783 .seealso: MatCreate(), MatCreateSeqAIJ(), MatSetValues(), MatMPIBAIJSetPreallocation(), MatCreateAIJ(), MPIAIJ 2784 @*/ 2785 PetscErrorCode MatMPISBAIJSetPreallocationCSR(Mat B,PetscInt bs,const PetscInt i[],const PetscInt j[], const PetscScalar v[]) 2786 { 2787 PetscErrorCode ierr; 2788 2789 PetscFunctionBegin; 2790 ierr = PetscTryMethod(B,"MatMPISBAIJSetPreallocationCSR_C",(Mat,PetscInt,const PetscInt[],const PetscInt[],const PetscScalar[]),(B,bs,i,j,v));CHKERRQ(ierr); 2791 PetscFunctionReturn(0); 2792 } 2793 2794 2795