1 /* 2 GAMG geometric-algebric multiogrid PC - Mark Adams 2011 3 */ 4 5 #include <../src/ksp/pc/impls/gamg/gamg.h> /*I "petscpc.h" I*/ 6 #include <petsc-private/kspimpl.h> 7 8 #include <petscblaslapack.h> 9 10 typedef struct { 11 PetscInt nsmooths; 12 PetscBool sym_graph; 13 PetscBool square_graph; 14 } PC_GAMG_AGG; 15 16 #undef __FUNCT__ 17 #define __FUNCT__ "PCGAMGSetNSmooths" 18 /*@ 19 PCGAMGSetNSmooths - Set number of smoothing steps (1 is typical) 20 21 Not Collective on PC 22 23 Input Parameters: 24 . pc - the preconditioner context 25 26 Options Database Key: 27 . -pc_gamg_agg_nsmooths 28 29 Level: intermediate 30 31 Concepts: Aggregation AMG preconditioner 32 33 .seealso: () 34 @*/ 35 PetscErrorCode PCGAMGSetNSmooths(PC pc, PetscInt n) 36 { 37 PetscErrorCode ierr; 38 39 PetscFunctionBegin; 40 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 41 ierr = PetscTryMethod(pc,"PCGAMGSetNSmooths_C",(PC,PetscInt),(pc,n));CHKERRQ(ierr); 42 PetscFunctionReturn(0); 43 } 44 45 #undef __FUNCT__ 46 #define __FUNCT__ "PCGAMGSetNSmooths_GAMG" 47 PetscErrorCode PCGAMGSetNSmooths_GAMG(PC pc, PetscInt n) 48 { 49 PC_MG *mg = (PC_MG*)pc->data; 50 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 51 PC_GAMG_AGG *pc_gamg_agg = (PC_GAMG_AGG*)pc_gamg->subctx; 52 53 PetscFunctionBegin; 54 pc_gamg_agg->nsmooths = n; 55 PetscFunctionReturn(0); 56 } 57 58 #undef __FUNCT__ 59 #define __FUNCT__ "PCGAMGSetSymGraph" 60 /*@ 61 PCGAMGSetSymGraph - 62 63 Not Collective on PC 64 65 Input Parameters: 66 . pc - the preconditioner context 67 68 Options Database Key: 69 . -pc_gamg_sym_graph 70 71 Level: intermediate 72 73 Concepts: Aggregation AMG preconditioner 74 75 .seealso: () 76 @*/ 77 PetscErrorCode PCGAMGSetSymGraph(PC pc, PetscBool n) 78 { 79 PetscErrorCode ierr; 80 81 PetscFunctionBegin; 82 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 83 ierr = PetscTryMethod(pc,"PCGAMGSetSymGraph_C",(PC,PetscBool),(pc,n));CHKERRQ(ierr); 84 PetscFunctionReturn(0); 85 } 86 87 #undef __FUNCT__ 88 #define __FUNCT__ "PCGAMGSetSymGraph_GAMG" 89 PetscErrorCode PCGAMGSetSymGraph_GAMG(PC pc, PetscBool n) 90 { 91 PC_MG *mg = (PC_MG*)pc->data; 92 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 93 PC_GAMG_AGG *pc_gamg_agg = (PC_GAMG_AGG*)pc_gamg->subctx; 94 95 PetscFunctionBegin; 96 pc_gamg_agg->sym_graph = n; 97 PetscFunctionReturn(0); 98 } 99 100 #undef __FUNCT__ 101 #define __FUNCT__ "PCGAMGSetSquareGraph" 102 /*@ 103 PCGAMGSetSquareGraph - 104 105 Not Collective on PC 106 107 Input Parameters: 108 . pc - the preconditioner context 109 110 Options Database Key: 111 . -pc_gamg_square_graph 112 113 Level: intermediate 114 115 Concepts: Aggregation AMG preconditioner 116 117 .seealso: () 118 @*/ 119 PetscErrorCode PCGAMGSetSquareGraph(PC pc, PetscBool n) 120 { 121 PetscErrorCode ierr; 122 123 PetscFunctionBegin; 124 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 125 ierr = PetscTryMethod(pc,"PCGAMGSetSquareGraph_C",(PC,PetscBool),(pc,n));CHKERRQ(ierr); 126 PetscFunctionReturn(0); 127 } 128 129 #undef __FUNCT__ 130 #define __FUNCT__ "PCGAMGSetSquareGraph_GAMG" 131 PetscErrorCode PCGAMGSetSquareGraph_GAMG(PC pc, PetscBool n) 132 { 133 PC_MG *mg = (PC_MG*)pc->data; 134 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 135 PC_GAMG_AGG *pc_gamg_agg = (PC_GAMG_AGG*)pc_gamg->subctx; 136 137 PetscFunctionBegin; 138 pc_gamg_agg->square_graph = n; 139 PetscFunctionReturn(0); 140 } 141 142 /* -------------------------------------------------------------------------- */ 143 /* 144 PCSetFromOptions_GAMG_AGG 145 146 Input Parameter: 147 . pc - 148 */ 149 #undef __FUNCT__ 150 #define __FUNCT__ "PCSetFromOptions_GAMG_AGG" 151 PetscErrorCode PCSetFromOptions_GAMG_AGG(PC pc) 152 { 153 PetscErrorCode ierr; 154 PC_MG *mg = (PC_MG*)pc->data; 155 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 156 PC_GAMG_AGG *pc_gamg_agg = (PC_GAMG_AGG*)pc_gamg->subctx; 157 PetscBool flag; 158 159 PetscFunctionBegin; 160 161 ierr = PetscOptionsHead("GAMG-AGG options");CHKERRQ(ierr); 162 { 163 /* -pc_gamg_agg_nsmooths */ 164 pc_gamg_agg->nsmooths = 1; 165 166 ierr = PetscOptionsInt("-pc_gamg_agg_nsmooths", 167 "smoothing steps for smoothed aggregation, usually 1 (0)", 168 "PCGAMGSetNSmooths", 169 pc_gamg_agg->nsmooths, 170 &pc_gamg_agg->nsmooths, 171 &flag);CHKERRQ(ierr); 172 173 /* -pc_gamg_sym_graph */ 174 pc_gamg_agg->sym_graph = PETSC_FALSE; 175 176 ierr = PetscOptionsBool("-pc_gamg_sym_graph", 177 "Set for asymmetric matrices", 178 "PCGAMGSetSymGraph", 179 pc_gamg_agg->sym_graph, 180 &pc_gamg_agg->sym_graph, 181 &flag);CHKERRQ(ierr); 182 183 /* -pc_gamg_square_graph */ 184 pc_gamg_agg->square_graph = PETSC_TRUE; 185 186 ierr = PetscOptionsBool("-pc_gamg_square_graph", 187 "For faster coarsening and lower coarse grid complexity", 188 "PCGAMGSetSquareGraph", 189 pc_gamg_agg->square_graph, 190 &pc_gamg_agg->square_graph, 191 &flag);CHKERRQ(ierr); 192 } 193 ierr = PetscOptionsTail();CHKERRQ(ierr); 194 PetscFunctionReturn(0); 195 } 196 197 /* -------------------------------------------------------------------------- */ 198 /* 199 PCDestroy_AGG 200 201 Input Parameter: 202 . pc - 203 */ 204 #undef __FUNCT__ 205 #define __FUNCT__ "PCDestroy_GAMG_AGG" 206 PetscErrorCode PCDestroy_GAMG_AGG(PC pc) 207 { 208 PetscErrorCode ierr; 209 PC_MG *mg = (PC_MG*)pc->data; 210 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 211 212 PetscFunctionBegin; 213 ierr = PetscFree(pc_gamg->subctx);CHKERRQ(ierr); 214 PetscFunctionReturn(0); 215 } 216 217 /* -------------------------------------------------------------------------- */ 218 /* 219 PCSetCoordinates_AGG 220 - collective 221 222 Input Parameter: 223 . pc - the preconditioner context 224 . ndm - dimesion of data (used for dof/vertex for Stokes) 225 . a_nloc - number of vertices local 226 . coords - [a_nloc][ndm] - interleaved coordinate data: {x_0, y_0, z_0, x_1, y_1, ...} 227 */ 228 229 #undef __FUNCT__ 230 #define __FUNCT__ "PCSetCoordinates_AGG" 231 static PetscErrorCode PCSetCoordinates_AGG(PC pc, PetscInt ndm, PetscInt a_nloc, PetscReal *coords) 232 { 233 PC_MG *mg = (PC_MG*)pc->data; 234 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 235 PetscErrorCode ierr; 236 PetscInt arrsz,kk,ii,jj,nloc,ndatarows,ndf; 237 Mat mat = pc->pmat; 238 239 PetscFunctionBegin; 240 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 241 PetscValidHeaderSpecific(mat,MAT_CLASSID,1); 242 nloc = a_nloc; 243 244 /* SA: null space vectors */ 245 ierr = MatGetBlockSize(mat, &ndf);CHKERRQ(ierr); /* this does not work for Stokes */ 246 if (coords && ndf==1) pc_gamg->data_cell_cols = 1; /* scalar w/ coords and SA (not needed) */ 247 else if (coords) { 248 if (ndm > ndf) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"degrees of motion %d > block size %d",ndm,ndf); 249 pc_gamg->data_cell_cols = (ndm==2 ? 3 : 6); /* displacement elasticity */ 250 if (ndm != ndf) { 251 if (pc_gamg->data_cell_cols != ndf) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Don't know how to create null space for ndm=%d, ndf=%d. Use MatSetNearNullSpace.",ndm,ndf); 252 } 253 } else pc_gamg->data_cell_cols = ndf; /* no data, force SA with constant null space vectors */ 254 pc_gamg->data_cell_rows = ndatarows = ndf; 255 if (pc_gamg->data_cell_cols <= 0) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"pc_gamg->data_cell_cols %D <= 0",pc_gamg->data_cell_cols); 256 arrsz = nloc*pc_gamg->data_cell_rows*pc_gamg->data_cell_cols; 257 258 /* create data - syntactic sugar that should be refactored at some point */ 259 if (pc_gamg->data==0 || (pc_gamg->data_sz != arrsz)) { 260 ierr = PetscFree(pc_gamg->data);CHKERRQ(ierr); 261 ierr = PetscMalloc((arrsz+1)*sizeof(PetscReal), &pc_gamg->data);CHKERRQ(ierr); 262 } 263 /* copy data in - column oriented */ 264 for (kk=0; kk<nloc; kk++) { 265 const PetscInt M = nloc*pc_gamg->data_cell_rows; /* stride into data */ 266 PetscReal *data = &pc_gamg->data[kk*ndatarows]; /* start of cell */ 267 if (pc_gamg->data_cell_cols==1) *data = 1.0; 268 else { 269 /* translational modes */ 270 for (ii=0;ii<ndatarows;ii++) { 271 for (jj=0;jj<ndatarows;jj++) { 272 if (ii==jj)data[ii*M + jj] = 1.0; 273 else data[ii*M + jj] = 0.0; 274 } 275 } 276 277 /* rotational modes */ 278 if (coords) { 279 if (ndm == 2) { 280 data += 2*M; 281 data[0] = -coords[2*kk+1]; 282 data[1] = coords[2*kk]; 283 } else { 284 data += 3*M; 285 data[0] = 0.0; data[M+0] = coords[3*kk+2]; data[2*M+0] = -coords[3*kk+1]; 286 data[1] = -coords[3*kk+2]; data[M+1] = 0.0; data[2*M+1] = coords[3*kk]; 287 data[2] = coords[3*kk+1]; data[M+2] = -coords[3*kk]; data[2*M+2] = 0.0; 288 } 289 } 290 } 291 } 292 293 pc_gamg->data_sz = arrsz; 294 PetscFunctionReturn(0); 295 } 296 297 typedef PetscInt NState; 298 static const NState NOT_DONE=-2; 299 static const NState DELETED =-1; 300 static const NState REMOVED =-3; 301 #define IS_SELECTED(s) (s!=DELETED && s!=NOT_DONE && s!=REMOVED) 302 303 /* -------------------------------------------------------------------------- */ 304 /* 305 smoothAggs - greedy grab of with G1 (unsquared graph) -- AIJ specific 306 - AGG-MG specific: clears singletons out of 'selected_2' 307 308 Input Parameter: 309 . Gmat_2 - glabal matrix of graph (data not defined) 310 . Gmat_1 - base graph to grab with 311 Input/Output Parameter: 312 . aggs_2 - linked list of aggs with gids) 313 */ 314 #undef __FUNCT__ 315 #define __FUNCT__ "smoothAggs" 316 static PetscErrorCode smoothAggs(const Mat Gmat_2, /* base (squared) graph */ 317 const Mat Gmat_1, /* base graph */ 318 /* const IS selected_2, [nselected local] selected vertices */ 319 PetscCoarsenData *aggs_2) /* [nselected local] global ID of aggregate */ 320 { 321 PetscErrorCode ierr; 322 PetscBool isMPI; 323 Mat_SeqAIJ *matA_1, *matB_1=0, *matA_2, *matB_2=0; 324 MPI_Comm comm; 325 PetscMPIInt rank,size; 326 PetscInt lid,*ii,*idx,ix,Iend,my0,kk,n,j; 327 Mat_MPIAIJ *mpimat_2 = 0, *mpimat_1=0; 328 const PetscInt nloc = Gmat_2->rmap->n; 329 PetscScalar *cpcol_1_state,*cpcol_2_state,*cpcol_2_par_orig,*lid_parent_gid; 330 PetscInt *lid_cprowID_1; 331 NState *lid_state; 332 Vec ghost_par_orig2; 333 334 PetscFunctionBegin; 335 ierr = PetscObjectGetComm((PetscObject)Gmat_2,&comm);CHKERRQ(ierr); 336 ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 337 ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 338 ierr = MatGetOwnershipRange(Gmat_1,&my0,&Iend);CHKERRQ(ierr); 339 340 if (PETSC_FALSE) { 341 PetscViewer viewer; char fname[32]; static int llev=0; 342 sprintf(fname,"Gmat2_%d.m",llev++); 343 PetscViewerASCIIOpen(comm,fname,&viewer); 344 ierr = PetscViewerSetFormat(viewer, PETSC_VIEWER_ASCII_MATLAB);CHKERRQ(ierr); 345 ierr = MatView(Gmat_2, viewer);CHKERRQ(ierr); 346 ierr = PetscViewerDestroy(&viewer); 347 } 348 349 /* get submatrices */ 350 ierr = PetscObjectTypeCompare((PetscObject)Gmat_1, MATMPIAIJ, &isMPI);CHKERRQ(ierr); 351 if (isMPI) { 352 /* grab matrix objects */ 353 mpimat_2 = (Mat_MPIAIJ*)Gmat_2->data; 354 mpimat_1 = (Mat_MPIAIJ*)Gmat_1->data; 355 matA_1 = (Mat_SeqAIJ*)mpimat_1->A->data; 356 matB_1 = (Mat_SeqAIJ*)mpimat_1->B->data; 357 matA_2 = (Mat_SeqAIJ*)mpimat_2->A->data; 358 matB_2 = (Mat_SeqAIJ*)mpimat_2->B->data; 359 360 /* force compressed row storage for B matrix in AuxMat */ 361 matB_1->compressedrow.check = PETSC_TRUE; 362 363 ierr = MatCheckCompressedRow(mpimat_1->B,&matB_1->compressedrow,matB_1->i,Gmat_1->rmap->n,-1.0);CHKERRQ(ierr); 364 365 ierr = PetscMalloc(nloc*sizeof(PetscInt), &lid_cprowID_1);CHKERRQ(ierr); 366 for (lid = 0; lid < nloc; lid++) lid_cprowID_1[lid] = -1; 367 for (ix=0; ix<matB_1->compressedrow.nrows; ix++) { 368 PetscInt lid = matB_1->compressedrow.rindex[ix]; 369 lid_cprowID_1[lid] = ix; 370 } 371 } else { 372 matA_1 = (Mat_SeqAIJ*)Gmat_1->data; 373 matA_2 = (Mat_SeqAIJ*)Gmat_2->data; 374 lid_cprowID_1 = NULL; 375 } 376 if (!(matA_1 && !matA_1->compressedrow.use)) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"!(matA_1 && !matA_1->compressedrow.use)"); 377 if (!(matB_1==0 || matB_1->compressedrow.use)) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"!(matB_1==0 || matB_1->compressedrow.use)"); 378 if (!(matA_2 && !matA_2->compressedrow.use)) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"!(matA_2 && !matA_2->compressedrow.use)"); 379 if (!(matB_2==0 || matB_2->compressedrow.use)) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"!(matB_2==0 || matB_2->compressedrow.use)"); 380 381 /* get state of locals and selected gid for deleted */ 382 ierr = PetscMalloc(nloc*sizeof(NState), &lid_state);CHKERRQ(ierr); 383 ierr = PetscMalloc(nloc*sizeof(PetscScalar), &lid_parent_gid);CHKERRQ(ierr); 384 for (lid = 0; lid < nloc; lid++) { 385 lid_parent_gid[lid] = -1.0; 386 lid_state[lid] = DELETED; 387 } 388 389 /* set lid_state */ 390 for (lid = 0; lid < nloc; lid++) { 391 PetscCDPos pos; 392 ierr = PetscCDGetHeadPos(aggs_2,lid,&pos);CHKERRQ(ierr); 393 if (pos) { 394 PetscInt gid1; 395 396 ierr = PetscLLNGetID(pos, &gid1);CHKERRQ(ierr); 397 if (gid1 != lid+my0) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"gid1 %D != lid %D + my0 %D",gid1,lid,my0); 398 lid_state[lid] = gid1; 399 } 400 } 401 402 /* map local to selected local, DELETED means a ghost owns it */ 403 for (lid=kk=0; lid<nloc; lid++) { 404 NState state = lid_state[lid]; 405 if (IS_SELECTED(state)) { 406 PetscCDPos pos; 407 ierr = PetscCDGetHeadPos(aggs_2,lid,&pos);CHKERRQ(ierr); 408 while (pos) { 409 PetscInt gid1; 410 ierr = PetscLLNGetID(pos, &gid1);CHKERRQ(ierr); 411 ierr = PetscCDGetNextPos(aggs_2,lid,&pos);CHKERRQ(ierr); 412 413 if (gid1 >= my0 && gid1 < Iend) lid_parent_gid[gid1-my0] = (PetscScalar)(lid + my0); 414 } 415 } 416 } 417 /* get 'cpcol_1/2_state' & cpcol_2_par_orig - uses mpimat_1/2->lvec for temp space */ 418 if (isMPI) { 419 Vec tempVec; 420 /* get 'cpcol_1_state' */ 421 ierr = MatGetVecs(Gmat_1, &tempVec, 0);CHKERRQ(ierr); 422 for (kk=0,j=my0; kk<nloc; kk++,j++) { 423 PetscScalar v = (PetscScalar)lid_state[kk]; 424 ierr = VecSetValues(tempVec, 1, &j, &v, INSERT_VALUES);CHKERRQ(ierr); 425 } 426 ierr = VecAssemblyBegin(tempVec);CHKERRQ(ierr); 427 ierr = VecAssemblyEnd(tempVec);CHKERRQ(ierr); 428 ierr = VecScatterBegin(mpimat_1->Mvctx,tempVec, mpimat_1->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 429 ierr = VecScatterEnd(mpimat_1->Mvctx,tempVec, mpimat_1->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 430 ierr = VecGetArray(mpimat_1->lvec, &cpcol_1_state);CHKERRQ(ierr); 431 /* get 'cpcol_2_state' */ 432 ierr = VecScatterBegin(mpimat_2->Mvctx,tempVec, mpimat_2->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 433 ierr = VecScatterEnd(mpimat_2->Mvctx,tempVec, mpimat_2->lvec,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 434 ierr = VecGetArray(mpimat_2->lvec, &cpcol_2_state);CHKERRQ(ierr); 435 /* get 'cpcol_2_par_orig' */ 436 for (kk=0,j=my0; kk<nloc; kk++,j++) { 437 PetscScalar v = (PetscScalar)lid_parent_gid[kk]; 438 ierr = VecSetValues(tempVec, 1, &j, &v, INSERT_VALUES);CHKERRQ(ierr); 439 } 440 ierr = VecAssemblyBegin(tempVec);CHKERRQ(ierr); 441 ierr = VecAssemblyEnd(tempVec);CHKERRQ(ierr); 442 ierr = VecDuplicate(mpimat_2->lvec, &ghost_par_orig2);CHKERRQ(ierr); 443 ierr = VecScatterBegin(mpimat_2->Mvctx,tempVec, ghost_par_orig2,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 444 ierr = VecScatterEnd(mpimat_2->Mvctx,tempVec, ghost_par_orig2,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 445 ierr = VecGetArray(ghost_par_orig2, &cpcol_2_par_orig);CHKERRQ(ierr); 446 447 ierr = VecDestroy(&tempVec);CHKERRQ(ierr); 448 } /* ismpi */ 449 450 /* doit */ 451 for (lid=0; lid<nloc; lid++) { 452 NState state = lid_state[lid]; 453 if (IS_SELECTED(state)) { 454 /* steal locals */ 455 ii = matA_1->i; n = ii[lid+1] - ii[lid]; 456 idx = matA_1->j + ii[lid]; 457 for (j=0; j<n; j++) { 458 PetscInt lidj = idx[j], sgid; 459 NState statej = lid_state[lidj]; 460 if (statej==DELETED && (sgid=(PetscInt)PetscRealPart(lid_parent_gid[lidj])) != lid+my0) { /* steal local */ 461 lid_parent_gid[lidj] = (PetscScalar)(lid+my0); /* send this if sgid is not local */ 462 if (sgid >= my0 && sgid < Iend) { /* I'm stealing this local from a local sgid */ 463 PetscInt hav=0,slid=sgid-my0,gidj=lidj+my0; 464 PetscCDPos pos,last=NULL; 465 /* looking for local from local so id_llist_2 works */ 466 ierr = PetscCDGetHeadPos(aggs_2,slid,&pos);CHKERRQ(ierr); 467 while (pos) { 468 PetscInt gid; 469 ierr = PetscLLNGetID(pos, &gid);CHKERRQ(ierr); 470 if (gid == gidj) { 471 if (!last) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"last cannot be null"); 472 ierr = PetscCDRemoveNextNode(aggs_2, slid, last);CHKERRQ(ierr); 473 ierr = PetscCDAppendNode(aggs_2, lid, pos);CHKERRQ(ierr); 474 hav = 1; 475 break; 476 } else last = pos; 477 478 ierr = PetscCDGetNextPos(aggs_2,slid,&pos);CHKERRQ(ierr); 479 } 480 if (hav!=1) { 481 if (!hav) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"failed to find adj in 'selected' lists - structurally unsymmetric matrix"); 482 SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"found node %d times???",hav); 483 } 484 } else { /* I'm stealing this local, owned by a ghost */ 485 if (sgid != -1) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Have un-symmetric graph (apparently). Use '-pc_gamg_sym_graph true' to symetrize the graph or '-pc_gamg_threshold 0.0' if the matrix is structurally symmetric."); 486 ierr = PetscCDAppendID(aggs_2, lid, lidj+my0);CHKERRQ(ierr); 487 } 488 } 489 } /* local neighbors */ 490 } else if (state == DELETED && lid_cprowID_1) { 491 PetscInt sgidold = (PetscInt)PetscRealPart(lid_parent_gid[lid]); 492 /* see if I have a selected ghost neighbor that will steal me */ 493 if ((ix=lid_cprowID_1[lid]) != -1) { 494 ii = matB_1->compressedrow.i; n = ii[ix+1] - ii[ix]; 495 idx = matB_1->j + ii[ix]; 496 for (j=0; j<n; j++) { 497 PetscInt cpid = idx[j]; 498 NState statej = (NState)PetscRealPart(cpcol_1_state[cpid]); 499 if (IS_SELECTED(statej) && sgidold != (PetscInt)statej) { /* ghost will steal this, remove from my list */ 500 lid_parent_gid[lid] = (PetscScalar)statej; /* send who selected */ 501 if (sgidold>=my0 && sgidold<Iend) { /* this was mine */ 502 PetscInt hav=0,oldslidj=sgidold-my0; 503 PetscCDPos pos,last=NULL; 504 /* remove from 'oldslidj' list */ 505 ierr = PetscCDGetHeadPos(aggs_2,oldslidj,&pos);CHKERRQ(ierr); 506 while (pos) { 507 PetscInt gid; 508 ierr = PetscLLNGetID(pos, &gid);CHKERRQ(ierr); 509 if (lid+my0 == gid) { 510 /* id_llist_2[lastid] = id_llist_2[flid]; /\* remove lid from oldslidj list *\/ */ 511 if (!last) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"last cannot be null"); 512 ierr = PetscCDRemoveNextNode(aggs_2, oldslidj, last);CHKERRQ(ierr); 513 /* ghost (PetscScalar)statej will add this later */ 514 hav = 1; 515 break; 516 } else last = pos; 517 518 ierr = PetscCDGetNextPos(aggs_2,oldslidj,&pos);CHKERRQ(ierr); 519 } 520 if (hav!=1) { 521 if (hav==0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"failed to find adj in 'selected' lists - structurally unsymmetric matrix"); 522 SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"found node %d times???",hav); 523 } 524 } else { 525 /* ghosts remove this later */ 526 } 527 } 528 } 529 } 530 } /* selected/deleted */ 531 } /* node loop */ 532 533 if (isMPI) { 534 PetscScalar *cpcol_2_parent,*cpcol_2_gid; 535 Vec tempVec,ghostgids2,ghostparents2; 536 PetscInt cpid,nghost_2; 537 GAMGHashTable gid_cpid; 538 539 ierr = VecGetSize(mpimat_2->lvec, &nghost_2);CHKERRQ(ierr); 540 ierr = MatGetVecs(Gmat_2, &tempVec, 0);CHKERRQ(ierr); 541 542 /* get 'cpcol_2_parent' */ 543 for (kk=0,j=my0; kk<nloc; kk++,j++) { 544 ierr = VecSetValues(tempVec, 1, &j, &lid_parent_gid[kk], INSERT_VALUES);CHKERRQ(ierr); 545 } 546 ierr = VecAssemblyBegin(tempVec);CHKERRQ(ierr); 547 ierr = VecAssemblyEnd(tempVec);CHKERRQ(ierr); 548 ierr = VecDuplicate(mpimat_2->lvec, &ghostparents2);CHKERRQ(ierr); 549 ierr = VecScatterBegin(mpimat_2->Mvctx,tempVec, ghostparents2,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 550 ierr = VecScatterEnd(mpimat_2->Mvctx,tempVec, ghostparents2,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 551 ierr = VecGetArray(ghostparents2, &cpcol_2_parent);CHKERRQ(ierr); 552 553 /* get 'cpcol_2_gid' */ 554 for (kk=0,j=my0; kk<nloc; kk++,j++) { 555 PetscScalar v = (PetscScalar)j; 556 ierr = VecSetValues(tempVec, 1, &j, &v, INSERT_VALUES);CHKERRQ(ierr); 557 } 558 ierr = VecAssemblyBegin(tempVec);CHKERRQ(ierr); 559 ierr = VecAssemblyEnd(tempVec);CHKERRQ(ierr); 560 ierr = VecDuplicate(mpimat_2->lvec, &ghostgids2);CHKERRQ(ierr); 561 ierr = VecScatterBegin(mpimat_2->Mvctx,tempVec, ghostgids2,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 562 ierr = VecScatterEnd(mpimat_2->Mvctx,tempVec, ghostgids2,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 563 ierr = VecGetArray(ghostgids2, &cpcol_2_gid);CHKERRQ(ierr); 564 565 ierr = VecDestroy(&tempVec);CHKERRQ(ierr); 566 567 /* look for deleted ghosts and add to table */ 568 ierr = GAMGTableCreate(2*nghost_2+1, &gid_cpid);CHKERRQ(ierr); 569 for (cpid = 0; cpid < nghost_2; cpid++) { 570 NState state = (NState)PetscRealPart(cpcol_2_state[cpid]); 571 if (state==DELETED) { 572 PetscInt sgid_new = (PetscInt)PetscRealPart(cpcol_2_parent[cpid]); 573 PetscInt sgid_old = (PetscInt)PetscRealPart(cpcol_2_par_orig[cpid]); 574 if (sgid_old == -1 && sgid_new != -1) { 575 PetscInt gid = (PetscInt)PetscRealPart(cpcol_2_gid[cpid]); 576 ierr = GAMGTableAdd(&gid_cpid, gid, cpid);CHKERRQ(ierr); 577 } 578 } 579 } 580 581 /* look for deleted ghosts and see if they moved - remove it */ 582 for (lid=0; lid<nloc; lid++) { 583 NState state = lid_state[lid]; 584 if (IS_SELECTED(state)) { 585 PetscCDPos pos,last=NULL; 586 /* look for deleted ghosts and see if they moved */ 587 ierr = PetscCDGetHeadPos(aggs_2,lid,&pos);CHKERRQ(ierr); 588 while (pos) { 589 PetscInt gid; 590 ierr = PetscLLNGetID(pos, &gid);CHKERRQ(ierr); 591 592 if (gid < my0 || gid >= Iend) { 593 ierr = GAMGTableFind(&gid_cpid, gid, &cpid);CHKERRQ(ierr); 594 if (cpid != -1) { 595 /* a moved ghost - */ 596 /* id_llist_2[lastid] = id_llist_2[flid]; /\* remove 'flid' from list *\/ */ 597 ierr = PetscCDRemoveNextNode(aggs_2, lid, last);CHKERRQ(ierr); 598 } else last = pos; 599 } else last = pos; 600 601 ierr = PetscCDGetNextPos(aggs_2,lid,&pos);CHKERRQ(ierr); 602 } /* loop over list of deleted */ 603 } /* selected */ 604 } 605 ierr = GAMGTableDestroy(&gid_cpid);CHKERRQ(ierr); 606 607 /* look at ghosts, see if they changed - and it */ 608 for (cpid = 0; cpid < nghost_2; cpid++) { 609 PetscInt sgid_new = (PetscInt)PetscRealPart(cpcol_2_parent[cpid]); 610 if (sgid_new >= my0 && sgid_new < Iend) { /* this is mine */ 611 PetscInt gid = (PetscInt)PetscRealPart(cpcol_2_gid[cpid]); 612 PetscInt slid_new=sgid_new-my0,hav=0; 613 PetscCDPos pos; 614 /* search for this gid to see if I have it */ 615 ierr = PetscCDGetHeadPos(aggs_2,slid_new,&pos);CHKERRQ(ierr); 616 while (pos) { 617 PetscInt gidj; 618 ierr = PetscLLNGetID(pos, &gidj);CHKERRQ(ierr); 619 ierr = PetscCDGetNextPos(aggs_2,slid_new,&pos);CHKERRQ(ierr); 620 621 if (gidj == gid) { hav = 1; break; } 622 } 623 if (hav != 1) { 624 /* insert 'flidj' into head of llist */ 625 ierr = PetscCDAppendID(aggs_2, slid_new, gid);CHKERRQ(ierr); 626 } 627 } 628 } 629 630 ierr = VecRestoreArray(mpimat_1->lvec, &cpcol_1_state);CHKERRQ(ierr); 631 ierr = VecRestoreArray(mpimat_2->lvec, &cpcol_2_state);CHKERRQ(ierr); 632 ierr = VecRestoreArray(ghostparents2, &cpcol_2_parent);CHKERRQ(ierr); 633 ierr = VecRestoreArray(ghostgids2, &cpcol_2_gid);CHKERRQ(ierr); 634 ierr = PetscFree(lid_cprowID_1);CHKERRQ(ierr); 635 ierr = VecDestroy(&ghostgids2);CHKERRQ(ierr); 636 ierr = VecDestroy(&ghostparents2);CHKERRQ(ierr); 637 ierr = VecDestroy(&ghost_par_orig2);CHKERRQ(ierr); 638 } 639 640 ierr = PetscFree(lid_parent_gid);CHKERRQ(ierr); 641 ierr = PetscFree(lid_state);CHKERRQ(ierr); 642 PetscFunctionReturn(0); 643 } 644 645 /* -------------------------------------------------------------------------- */ 646 /* 647 PCSetData_AGG - called if data is not set with PCSetCoordinates. 648 Looks in Mat for near null space. 649 Does not work for Stokes 650 651 Input Parameter: 652 . pc - 653 . a_A - matrix to get (near) null space out of. 654 */ 655 #undef __FUNCT__ 656 #define __FUNCT__ "PCSetData_AGG" 657 PetscErrorCode PCSetData_AGG(PC pc, Mat a_A) 658 { 659 PetscErrorCode ierr; 660 PC_MG *mg = (PC_MG*)pc->data; 661 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 662 MatNullSpace mnull; 663 664 PetscFunctionBegin; 665 ierr = MatGetNearNullSpace(a_A, &mnull);CHKERRQ(ierr); 666 if (!mnull) { 667 PetscInt bs,NN,MM; 668 ierr = MatGetBlockSize(a_A, &bs);CHKERRQ(ierr); 669 ierr = MatGetLocalSize(a_A, &MM, &NN);CHKERRQ(ierr); 670 if (MM % bs) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"MM %D must be divisible by bs %D",MM,bs); 671 ierr = PCSetCoordinates_AGG(pc, bs, MM/bs, NULL);CHKERRQ(ierr); 672 } else { 673 PetscReal *nullvec; 674 PetscBool has_const; 675 PetscInt i,j,mlocal,nvec,bs; 676 const Vec *vecs; const PetscScalar *v; 677 ierr = MatGetLocalSize(a_A,&mlocal,NULL);CHKERRQ(ierr); 678 ierr = MatNullSpaceGetVecs(mnull, &has_const, &nvec, &vecs);CHKERRQ(ierr); 679 ierr = PetscMalloc((nvec+!!has_const)*mlocal*sizeof(*nullvec),&nullvec);CHKERRQ(ierr); 680 if (has_const) for (i=0; i<mlocal; i++) nullvec[i] = 1.0; 681 for (i=0; i<nvec; i++) { 682 ierr = VecGetArrayRead(vecs[i],&v);CHKERRQ(ierr); 683 for (j=0; j<mlocal; j++) nullvec[(i+!!has_const)*mlocal + j] = PetscRealPart(v[j]); 684 ierr = VecRestoreArrayRead(vecs[i],&v);CHKERRQ(ierr); 685 } 686 pc_gamg->data = nullvec; 687 pc_gamg->data_cell_cols = (nvec+!!has_const); 688 689 ierr = MatGetBlockSize(a_A, &bs);CHKERRQ(ierr); /* this does not work for Stokes */ 690 691 pc_gamg->data_cell_rows = bs; 692 } 693 PetscFunctionReturn(0); 694 } 695 696 /* -------------------------------------------------------------------------- */ 697 /* 698 formProl0 699 700 Input Parameter: 701 . agg_llists - list of arrays with aggregates 702 . bs - block size 703 . nSAvec - column bs of new P 704 . my0crs - global index of start of locals 705 . data_stride - bs*(nloc nodes + ghost nodes) 706 . data_in[data_stride*nSAvec] - local data on fine grid 707 . flid_fgid[data_stride/bs] - make local to global IDs, includes ghosts in 'locals_llist' 708 Output Parameter: 709 . a_data_out - in with fine grid data (w/ghosts), out with coarse grid data 710 . a_Prol - prolongation operator 711 */ 712 #undef __FUNCT__ 713 #define __FUNCT__ "formProl0" 714 static PetscErrorCode formProl0(const PetscCoarsenData *agg_llists, /* list from selected vertices of aggregate unselected vertices */ 715 const PetscInt bs, /* (row) block size */ 716 const PetscInt nSAvec, /* column bs */ 717 const PetscInt my0crs, /* global index of start of locals */ 718 const PetscInt data_stride, /* (nloc+nghost)*bs */ 719 PetscReal data_in[], /* [data_stride][nSAvec] */ 720 const PetscInt flid_fgid[], /* [data_stride/bs] */ 721 PetscReal **a_data_out, 722 Mat a_Prol) /* prolongation operator (output)*/ 723 { 724 PetscErrorCode ierr; 725 PetscInt Istart,my0,Iend,nloc,clid,flid,aggID,kk,jj,ii,mm,ndone,nSelected,minsz,nghosts,out_data_stride; 726 MPI_Comm comm; 727 PetscMPIInt rank, size; 728 PetscReal *out_data; 729 PetscCDPos pos; 730 GAMGHashTable fgid_flid; 731 732 /* #define OUT_AGGS */ 733 #if defined(OUT_AGGS) 734 static PetscInt llev = 0; char fname[32]; FILE *file = NULL; PetscInt pM; 735 #endif 736 737 PetscFunctionBegin; 738 ierr = PetscObjectGetComm((PetscObject)a_Prol,&comm);CHKERRQ(ierr); 739 ierr = MPI_Comm_rank(comm,&rank);CHKERRQ(ierr); 740 ierr = MPI_Comm_size(comm,&size);CHKERRQ(ierr); 741 ierr = MatGetOwnershipRange(a_Prol, &Istart, &Iend);CHKERRQ(ierr); 742 nloc = (Iend-Istart)/bs; my0 = Istart/bs; 743 if ((Iend-Istart) % bs) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Iend %D - Istart %d must be divisible by bs %D",Iend,Istart,bs); 744 Iend /= bs; 745 nghosts = data_stride/bs - nloc; 746 747 ierr = GAMGTableCreate(2*nghosts+1, &fgid_flid);CHKERRQ(ierr); 748 for (kk=0; kk<nghosts; kk++) { 749 ierr = GAMGTableAdd(&fgid_flid, flid_fgid[nloc+kk], nloc+kk);CHKERRQ(ierr); 750 } 751 752 #if defined(OUT_AGGS) 753 sprintf(fname,"aggs_%d_%d.m",llev++,rank); 754 if (llev==1) file = fopen(fname,"w"); 755 MatGetSize(a_Prol, &pM, &jj); 756 #endif 757 758 /* count selected -- same as number of cols of P */ 759 for (nSelected=mm=0; mm<nloc; mm++) { 760 PetscBool ise; 761 ierr = PetscCDEmptyAt(agg_llists, mm, &ise);CHKERRQ(ierr); 762 if (!ise) nSelected++; 763 } 764 ierr = MatGetOwnershipRangeColumn(a_Prol, &ii, &jj);CHKERRQ(ierr); 765 if ((ii/nSAvec) != my0crs) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"ii %D /nSAvec %D != my0crs %D",ii,nSAvec,my0crs); 766 if (nSelected != (jj-ii)/nSAvec) SETERRQ4(PETSC_COMM_SELF,PETSC_ERR_PLIB,"nSelected %D != (jj %D - ii %D)/nSAvec %D",nSelected,jj,ii,nSAvec); 767 768 /* aloc space for coarse point data (output) */ 769 out_data_stride = nSelected*nSAvec; 770 771 ierr = PetscMalloc(out_data_stride*nSAvec*sizeof(PetscReal), &out_data);CHKERRQ(ierr); 772 for (ii=0;ii<out_data_stride*nSAvec;ii++) out_data[ii]=PETSC_MAX_REAL; 773 *a_data_out = out_data; /* output - stride nSelected*nSAvec */ 774 775 /* find points and set prolongation */ 776 minsz = 100; 777 ndone = 0; 778 for (mm = clid = 0; mm < nloc; mm++) { 779 ierr = PetscCDSizeAt(agg_llists, mm, &jj);CHKERRQ(ierr); 780 if (jj > 0) { 781 const PetscInt lid = mm, cgid = my0crs + clid; 782 PetscInt cids[100]; /* max bs */ 783 PetscBLASInt asz =jj,M=asz*bs,N=nSAvec,INFO; 784 PetscBLASInt Mdata=M+((N-M>0) ? N-M : 0),LDA=Mdata,LWORK=N*bs; 785 PetscScalar *qqc,*qqr,*TAU,*WORK; 786 PetscInt *fids; 787 PetscReal *data; 788 /* count agg */ 789 if (asz<minsz) minsz = asz; 790 791 /* get block */ 792 ierr = PetscMalloc((Mdata*N)*sizeof(PetscScalar), &qqc);CHKERRQ(ierr); 793 ierr = PetscMalloc((M*N)*sizeof(PetscScalar), &qqr);CHKERRQ(ierr); 794 ierr = PetscMalloc(N*sizeof(PetscScalar), &TAU);CHKERRQ(ierr); 795 ierr = PetscMalloc(LWORK*sizeof(PetscScalar), &WORK);CHKERRQ(ierr); 796 ierr = PetscMalloc(M*sizeof(PetscInt), &fids);CHKERRQ(ierr); 797 798 aggID = 0; 799 ierr = PetscCDGetHeadPos(agg_llists,lid,&pos);CHKERRQ(ierr); 800 while (pos) { 801 PetscInt gid1; 802 ierr = PetscLLNGetID(pos, &gid1);CHKERRQ(ierr); 803 ierr = PetscCDGetNextPos(agg_llists,lid,&pos);CHKERRQ(ierr); 804 805 if (gid1 >= my0 && gid1 < Iend) flid = gid1 - my0; 806 else { 807 ierr = GAMGTableFind(&fgid_flid, gid1, &flid);CHKERRQ(ierr); 808 if (flid < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cannot find gid1 in table"); 809 } 810 /* copy in B_i matrix - column oriented */ 811 data = &data_in[flid*bs]; 812 for (kk = ii = 0; ii < bs; ii++) { 813 for (jj = 0; jj < N; jj++) { 814 PetscReal d = data[jj*data_stride + ii]; 815 qqc[jj*Mdata + aggID*bs + ii] = d; 816 } 817 } 818 #if defined(OUT_AGGS) 819 if (llev==1) { 820 char str[] = "plot(%e,%e,'r*'), hold on,\n", col[] = "rgbkmc", sim[] = "*os+h>d<vx^"; 821 PetscInt MM,pi,pj; 822 str[12] = col[(clid+17*rank)%6]; str[13] = sim[(clid+17*rank)%11]; 823 MM = (PetscInt)(PetscSqrtReal((PetscReal)pM)); 824 pj = gid1/MM; pi = gid1%MM; 825 fprintf(file,str,(double)pi,(double)pj); 826 /* fprintf(file,str,data[2*data_stride+1],-data[2*data_stride]); */ 827 } 828 #endif 829 /* set fine IDs */ 830 for (kk=0; kk<bs; kk++) fids[aggID*bs + kk] = flid_fgid[flid]*bs + kk; 831 832 aggID++; 833 } 834 835 /* pad with zeros */ 836 for (ii = asz*bs; ii < Mdata; ii++) { 837 for (jj = 0; jj < N; jj++, kk++) { 838 qqc[jj*Mdata + ii] = .0; 839 } 840 } 841 842 ndone += aggID; 843 /* QR */ 844 ierr = PetscFPTrapPush(PETSC_FP_TRAP_OFF);CHKERRQ(ierr); 845 PetscStackCallBLAS("LAPACKgeqrf",LAPACKgeqrf_(&Mdata, &N, qqc, &LDA, TAU, WORK, &LWORK, &INFO)); 846 ierr = PetscFPTrapPop();CHKERRQ(ierr); 847 if (INFO != 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"xGEQRF error"); 848 /* get R - column oriented - output B_{i+1} */ 849 { 850 PetscReal *data = &out_data[clid*nSAvec]; 851 for (jj = 0; jj < nSAvec; jj++) { 852 for (ii = 0; ii < nSAvec; ii++) { 853 if (data[jj*out_data_stride + ii] != PETSC_MAX_REAL) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"data[jj*out_data_stride + ii] != %e",PETSC_MAX_REAL); 854 if (ii <= jj) data[jj*out_data_stride + ii] = PetscRealPart(qqc[jj*Mdata + ii]); 855 else data[jj*out_data_stride + ii] = 0.; 856 } 857 } 858 } 859 860 /* get Q - row oriented */ 861 PetscStackCallBLAS("LAPACKungqr",LAPACKungqr_(&Mdata, &N, &N, qqc, &LDA, TAU, WORK, &LWORK, &INFO)); 862 if (INFO != 0) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"xORGQR error arg %d",-INFO); 863 864 for (ii = 0; ii < M; ii++) { 865 for (jj = 0; jj < N; jj++) { 866 qqr[N*ii + jj] = qqc[jj*Mdata + ii]; 867 } 868 } 869 870 /* add diagonal block of P0 */ 871 for (kk=0; kk<N; kk++) { 872 cids[kk] = N*cgid + kk; /* global col IDs in P0 */ 873 } 874 ierr = MatSetValues(a_Prol,M,fids,N,cids,qqr,INSERT_VALUES);CHKERRQ(ierr); 875 876 ierr = PetscFree(qqc);CHKERRQ(ierr); 877 ierr = PetscFree(qqr);CHKERRQ(ierr); 878 ierr = PetscFree(TAU);CHKERRQ(ierr); 879 ierr = PetscFree(WORK);CHKERRQ(ierr); 880 ierr = PetscFree(fids);CHKERRQ(ierr); 881 clid++; 882 } /* coarse agg */ 883 } /* for all fine nodes */ 884 ierr = MatAssemblyBegin(a_Prol,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 885 ierr = MatAssemblyEnd(a_Prol,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 886 887 /* ierr = MPI_Allreduce(&ndone, &ii, 1, MPIU_INT, MPIU_SUM, comm); */ 888 /* MatGetSize(a_Prol, &kk, &jj); */ 889 /* ierr = MPI_Allreduce(&minsz, &jj, 1, MPIU_INT, MPIU_MIN, comm); */ 890 /* PetscPrintf(comm," **** [%d]%s %d total done, %d nodes (%d local done), min agg. size = %d\n",rank,__FUNCT__,ii,kk/bs,ndone,jj); */ 891 892 #if defined(OUT_AGGS) 893 if (llev==1) fclose(file); 894 #endif 895 ierr = GAMGTableDestroy(&fgid_flid);CHKERRQ(ierr); 896 PetscFunctionReturn(0); 897 } 898 899 /* -------------------------------------------------------------------------- */ 900 /* 901 PCGAMGgraph_AGG 902 903 Input Parameter: 904 . pc - this 905 . Amat - matrix on this fine level 906 Output Parameter: 907 . a_Gmat - 908 */ 909 #undef __FUNCT__ 910 #define __FUNCT__ "PCGAMGgraph_AGG" 911 PetscErrorCode PCGAMGgraph_AGG(PC pc,const Mat Amat,Mat *a_Gmat) 912 { 913 PetscErrorCode ierr; 914 PC_MG *mg = (PC_MG*)pc->data; 915 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 916 const PetscInt verbose = pc_gamg->verbose; 917 const PetscReal vfilter = pc_gamg->threshold; 918 PC_GAMG_AGG *pc_gamg_agg = (PC_GAMG_AGG*)pc_gamg->subctx; 919 PetscMPIInt rank,size; 920 Mat Gmat; 921 MPI_Comm comm; 922 PetscBool /* set,flg , */ symm; 923 924 PetscFunctionBegin; 925 ierr = PetscObjectGetComm((PetscObject)Amat,&comm);CHKERRQ(ierr); 926 #if defined PETSC_USE_LOG 927 ierr = PetscLogEventBegin(PC_GAMGGgraph_AGG,0,0,0,0);CHKERRQ(ierr); 928 #endif 929 ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 930 ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 931 932 /* ierr = MatIsSymmetricKnown(Amat, &set, &flg);CHKERRQ(ierr); || !(set && flg) -- this causes lot of symm calls */ 933 symm = (PetscBool)(pc_gamg_agg->sym_graph); /* && !pc_gamg_agg->square_graph; */ 934 935 ierr = PCGAMGCreateGraph(Amat, &Gmat);CHKERRQ(ierr); 936 ierr = PCGAMGFilterGraph(&Gmat, vfilter, symm, verbose);CHKERRQ(ierr); 937 938 *a_Gmat = Gmat; 939 940 #if defined PETSC_USE_LOG 941 ierr = PetscLogEventEnd(PC_GAMGGgraph_AGG,0,0,0,0);CHKERRQ(ierr); 942 #endif 943 PetscFunctionReturn(0); 944 } 945 946 /* -------------------------------------------------------------------------- */ 947 /* 948 PCGAMGCoarsen_AGG 949 950 Input Parameter: 951 . a_pc - this 952 Input/Output Parameter: 953 . a_Gmat1 - graph on this fine level - coarsening can change this (squares it) 954 Output Parameter: 955 . agg_lists - list of aggregates 956 */ 957 #undef __FUNCT__ 958 #define __FUNCT__ "PCGAMGCoarsen_AGG" 959 PetscErrorCode PCGAMGCoarsen_AGG(PC a_pc,Mat *a_Gmat1,PetscCoarsenData **agg_lists) 960 { 961 PetscErrorCode ierr; 962 PC_MG *mg = (PC_MG*)a_pc->data; 963 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 964 PC_GAMG_AGG *pc_gamg_agg = (PC_GAMG_AGG*)pc_gamg->subctx; 965 Mat mat,Gmat2, Gmat1 = *a_Gmat1; /* squared graph */ 966 const PetscInt verbose = pc_gamg->verbose; 967 IS perm; 968 PetscInt Ii,nloc,bs,n,m; 969 PetscInt *permute; 970 PetscBool *bIndexSet; 971 MatCoarsen crs; 972 MPI_Comm comm; 973 PetscMPIInt rank,size; 974 975 PetscFunctionBegin; 976 #if defined PETSC_USE_LOG 977 ierr = PetscLogEventBegin(PC_GAMGCoarsen_AGG,0,0,0,0);CHKERRQ(ierr); 978 #endif 979 ierr = PetscObjectGetComm((PetscObject)Gmat1,&comm);CHKERRQ(ierr); 980 ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 981 ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 982 ierr = MatGetLocalSize(Gmat1, &n, &m);CHKERRQ(ierr); 983 ierr = MatGetBlockSize(Gmat1, &bs);CHKERRQ(ierr); 984 if (bs != 1) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"bs %D must be 1",bs); 985 nloc = n/bs; 986 987 if (pc_gamg_agg->square_graph) { 988 PetscBool rart=PETSC_FALSE; 989 990 if (verbose > 1) PetscPrintf(comm,"[%d]%s square graph\n",rank,__FUNCT__); 991 ierr = PetscOptionsGetBool(NULL,"-use_rart",&rart,NULL);CHKERRQ(ierr); 992 if (rart) { /* Gmat2 = Gmat1*Gmat1^T - via inner products */ 993 ierr = MatMatTransposeMult(Gmat1, Gmat1, MAT_INITIAL_MATRIX, PETSC_DEFAULT, &Gmat2);CHKERRQ(ierr); 994 } else { /* Gmat2 = Gmat1^T*Gmat1 - via outer products */ 995 ierr = MatTransposeMatMult(Gmat1, Gmat1, MAT_INITIAL_MATRIX, PETSC_DEFAULT, &Gmat2);CHKERRQ(ierr); 996 } 997 if (verbose > 2) { 998 ierr = PetscPrintf(comm,"[%d]%s square graph done\n",rank,__FUNCT__);CHKERRQ(ierr); 999 /* check for symetry */ 1000 if (verbose > 4) { 1001 1002 } 1003 } 1004 } else Gmat2 = Gmat1; 1005 1006 /* get MIS aggs */ 1007 /* randomize */ 1008 ierr = PetscMalloc(nloc*sizeof(PetscInt), &permute);CHKERRQ(ierr); 1009 ierr = PetscMalloc(nloc*sizeof(PetscBool), &bIndexSet);CHKERRQ(ierr); 1010 for (Ii = 0; Ii < nloc; Ii++) { 1011 bIndexSet[Ii] = PETSC_FALSE; 1012 permute[Ii] = Ii; 1013 } 1014 srand(1); /* make deterministic */ 1015 for (Ii = 0; Ii < nloc; Ii++) { 1016 PetscInt iSwapIndex = rand()%nloc; 1017 if (!bIndexSet[iSwapIndex] && iSwapIndex != Ii) { 1018 PetscInt iTemp = permute[iSwapIndex]; 1019 permute[iSwapIndex] = permute[Ii]; 1020 permute[Ii] = iTemp; 1021 bIndexSet[iSwapIndex] = PETSC_TRUE; 1022 } 1023 } 1024 ierr = PetscFree(bIndexSet);CHKERRQ(ierr); 1025 1026 if (verbose > 1) PetscPrintf(comm,"[%d]%s coarsen graph\n",rank,__FUNCT__); 1027 1028 ierr = ISCreateGeneral(PETSC_COMM_SELF, nloc, permute, PETSC_USE_POINTER, &perm);CHKERRQ(ierr); 1029 #if defined PETSC_GAMG_USE_LOG 1030 ierr = PetscLogEventBegin(petsc_gamg_setup_events[SET4],0,0,0,0);CHKERRQ(ierr); 1031 #endif 1032 ierr = MatCoarsenCreate(comm, &crs);CHKERRQ(ierr); 1033 /* ierr = MatCoarsenSetType(crs, MATCOARSENMIS);CHKERRQ(ierr); */ 1034 ierr = MatCoarsenSetFromOptions(crs);CHKERRQ(ierr); 1035 ierr = MatCoarsenSetGreedyOrdering(crs, perm);CHKERRQ(ierr); 1036 ierr = MatCoarsenSetAdjacency(crs, Gmat2);CHKERRQ(ierr); 1037 ierr = MatCoarsenSetVerbose(crs, pc_gamg->verbose);CHKERRQ(ierr); 1038 ierr = MatCoarsenSetStrictAggs(crs, PETSC_TRUE);CHKERRQ(ierr); 1039 ierr = MatCoarsenApply(crs);CHKERRQ(ierr); 1040 ierr = MatCoarsenGetData(crs, agg_lists);CHKERRQ(ierr); /* output */ 1041 ierr = MatCoarsenDestroy(&crs);CHKERRQ(ierr); 1042 1043 ierr = ISDestroy(&perm);CHKERRQ(ierr); 1044 ierr = PetscFree(permute);CHKERRQ(ierr); 1045 #if defined PETSC_GAMG_USE_LOG 1046 ierr = PetscLogEventEnd(petsc_gamg_setup_events[SET4],0,0,0,0);CHKERRQ(ierr); 1047 #endif 1048 if (verbose > 2) PetscPrintf(comm,"[%d]%s coarsen graph done\n",rank,__FUNCT__); 1049 1050 /* smooth aggs */ 1051 if (Gmat2 != Gmat1) { 1052 const PetscCoarsenData *llist = *agg_lists; 1053 ierr = smoothAggs(Gmat2, Gmat1, *agg_lists);CHKERRQ(ierr); 1054 ierr = MatDestroy(&Gmat1);CHKERRQ(ierr); 1055 *a_Gmat1 = Gmat2; /* output */ 1056 ierr = PetscCDGetMat(llist, &mat);CHKERRQ(ierr); 1057 if (mat) SETERRQ(comm,PETSC_ERR_ARG_WRONG, "Auxilary matrix with squared graph????"); 1058 } else { 1059 const PetscCoarsenData *llist = *agg_lists; 1060 /* see if we have a matrix that takes precedence (returned from MatCoarsenAppply) */ 1061 ierr = PetscCDGetMat(llist, &mat);CHKERRQ(ierr); 1062 if (mat) { 1063 ierr = MatDestroy(&Gmat1);CHKERRQ(ierr); 1064 *a_Gmat1 = mat; /* output */ 1065 } 1066 } 1067 #if defined PETSC_USE_LOG 1068 ierr = PetscLogEventEnd(PC_GAMGCoarsen_AGG,0,0,0,0);CHKERRQ(ierr); 1069 #endif 1070 if (verbose > 2) PetscPrintf(comm,"[%d]%s PCGAMGCoarsen_AGG done\n",rank,__FUNCT__); 1071 PetscFunctionReturn(0); 1072 } 1073 1074 /* -------------------------------------------------------------------------- */ 1075 /* 1076 PCGAMGProlongator_AGG 1077 1078 Input Parameter: 1079 . pc - this 1080 . Amat - matrix on this fine level 1081 . Graph - used to get ghost data for nodes in 1082 . agg_lists - list of aggregates 1083 Output Parameter: 1084 . a_P_out - prolongation operator to the next level 1085 */ 1086 #undef __FUNCT__ 1087 #define __FUNCT__ "PCGAMGProlongator_AGG" 1088 PetscErrorCode PCGAMGProlongator_AGG(PC pc,const Mat Amat,const Mat Gmat,PetscCoarsenData *agg_lists,Mat *a_P_out) 1089 { 1090 PC_MG *mg = (PC_MG*)pc->data; 1091 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 1092 const PetscInt verbose = pc_gamg->verbose; 1093 const PetscInt data_cols = pc_gamg->data_cell_cols; 1094 PetscErrorCode ierr; 1095 PetscInt Istart,Iend,nloc,ii,jj,kk,my0,nLocalSelected,bs; 1096 Mat Prol; 1097 PetscMPIInt rank, size; 1098 MPI_Comm comm; 1099 const PetscInt col_bs = data_cols; 1100 PetscReal *data_w_ghost; 1101 PetscInt myCrs0, nbnodes=0, *flid_fgid; 1102 1103 PetscFunctionBegin; 1104 ierr = PetscObjectGetComm((PetscObject)Amat,&comm);CHKERRQ(ierr); 1105 #if defined PETSC_USE_LOG 1106 ierr = PetscLogEventBegin(PC_GAMGProlongator_AGG,0,0,0,0);CHKERRQ(ierr); 1107 #endif 1108 ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 1109 ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 1110 ierr = MatGetOwnershipRange(Amat, &Istart, &Iend);CHKERRQ(ierr); 1111 ierr = MatGetBlockSize(Amat, &bs);CHKERRQ(ierr); 1112 nloc = (Iend-Istart)/bs; my0 = Istart/bs; 1113 if ((Iend-Istart) % bs) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"(Iend %D - Istart %D) not divisible by bs %D",Iend,Istart,bs); 1114 1115 /* get 'nLocalSelected' */ 1116 for (ii=0, nLocalSelected = 0; ii < nloc; ii++) { 1117 PetscBool ise; 1118 /* filter out singletons 0 or 1? */ 1119 ierr = PetscCDEmptyAt(agg_lists, ii, &ise);CHKERRQ(ierr); 1120 if (!ise) nLocalSelected++; 1121 } 1122 1123 /* create prolongator, create P matrix */ 1124 ierr = MatCreate(comm, &Prol);CHKERRQ(ierr); 1125 ierr = MatSetSizes(Prol,nloc*bs,nLocalSelected*col_bs,PETSC_DETERMINE,PETSC_DETERMINE);CHKERRQ(ierr); 1126 ierr = MatSetBlockSizes(Prol, bs, col_bs);CHKERRQ(ierr); 1127 ierr = MatSetType(Prol, MATAIJ);CHKERRQ(ierr); 1128 ierr = MatSeqAIJSetPreallocation(Prol, data_cols, NULL);CHKERRQ(ierr); 1129 ierr = MatMPIAIJSetPreallocation(Prol,data_cols, NULL,data_cols, NULL);CHKERRQ(ierr); 1130 /* nloc*bs, nLocalSelected*col_bs, */ 1131 /* PETSC_DETERMINE, PETSC_DETERMINE, */ 1132 /* data_cols, NULL, data_cols, NULL, */ 1133 /* &Prol); */ 1134 1135 /* can get all points "removed" */ 1136 ierr = MatGetSize(Prol, &kk, &ii);CHKERRQ(ierr); 1137 if (ii==0) { 1138 if (verbose > 0) PetscPrintf(comm,"[%d]%s no selected points on coarse grid\n",rank,__FUNCT__); 1139 ierr = MatDestroy(&Prol);CHKERRQ(ierr); 1140 *a_P_out = NULL; /* out */ 1141 PetscFunctionReturn(0); 1142 } 1143 if (verbose > 0) PetscPrintf(comm,"\t\t[%d]%s New grid %d nodes\n",rank,__FUNCT__,ii/col_bs); 1144 ierr = MatGetOwnershipRangeColumn(Prol, &myCrs0, &kk);CHKERRQ(ierr); 1145 1146 if ((kk-myCrs0) % col_bs) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"(kk %D -myCrs0 %D) not divisible by col_bs %D",kk,myCrs0,col_bs); 1147 myCrs0 = myCrs0/col_bs; 1148 if ((kk/col_bs-myCrs0) != nLocalSelected) SETERRQ4(PETSC_COMM_SELF,PETSC_ERR_PLIB,"(kk %D/col_bs %D - myCrs0 %D) != nLocalSelected %D)",kk,col_bs,myCrs0,nLocalSelected); 1149 1150 /* create global vector of data in 'data_w_ghost' */ 1151 #if defined PETSC_GAMG_USE_LOG 1152 ierr = PetscLogEventBegin(petsc_gamg_setup_events[SET7],0,0,0,0);CHKERRQ(ierr); 1153 #endif 1154 if (size > 1) { /* */ 1155 PetscReal *tmp_gdata,*tmp_ldata,*tp2; 1156 ierr = PetscMalloc(nloc*sizeof(PetscReal), &tmp_ldata);CHKERRQ(ierr); 1157 for (jj = 0; jj < data_cols; jj++) { 1158 for (kk = 0; kk < bs; kk++) { 1159 PetscInt ii,stride; 1160 const PetscReal *tp = pc_gamg->data + jj*bs*nloc + kk; 1161 for (ii = 0; ii < nloc; ii++, tp += bs) tmp_ldata[ii] = *tp; 1162 1163 ierr = PCGAMGGetDataWithGhosts(Gmat, 1, tmp_ldata, &stride, &tmp_gdata);CHKERRQ(ierr); 1164 1165 if (jj==0 && kk==0) { /* now I know how many todal nodes - allocate */ 1166 ierr = PetscMalloc(stride*bs*data_cols*sizeof(PetscReal), &data_w_ghost);CHKERRQ(ierr); 1167 nbnodes = bs*stride; 1168 } 1169 tp2 = data_w_ghost + jj*bs*stride + kk; 1170 for (ii = 0; ii < stride; ii++, tp2 += bs) *tp2 = tmp_gdata[ii]; 1171 ierr = PetscFree(tmp_gdata);CHKERRQ(ierr); 1172 } 1173 } 1174 ierr = PetscFree(tmp_ldata);CHKERRQ(ierr); 1175 } else { 1176 nbnodes = bs*nloc; 1177 data_w_ghost = (PetscReal*)pc_gamg->data; 1178 } 1179 1180 /* get P0 */ 1181 if (size > 1) { 1182 PetscReal *fid_glid_loc,*fiddata; 1183 PetscInt stride; 1184 1185 ierr = PetscMalloc(nloc*sizeof(PetscReal), &fid_glid_loc);CHKERRQ(ierr); 1186 for (kk=0; kk<nloc; kk++) fid_glid_loc[kk] = (PetscReal)(my0+kk); 1187 ierr = PCGAMGGetDataWithGhosts(Gmat, 1, fid_glid_loc, &stride, &fiddata);CHKERRQ(ierr); 1188 ierr = PetscMalloc(stride*sizeof(PetscInt), &flid_fgid);CHKERRQ(ierr); 1189 for (kk=0; kk<stride; kk++) flid_fgid[kk] = (PetscInt)fiddata[kk]; 1190 ierr = PetscFree(fiddata);CHKERRQ(ierr); 1191 1192 if (stride != nbnodes/bs) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"stride %D != nbnodes %D/bs %D",stride,nbnodes,bs); 1193 ierr = PetscFree(fid_glid_loc);CHKERRQ(ierr); 1194 } else { 1195 ierr = PetscMalloc(nloc*sizeof(PetscInt), &flid_fgid);CHKERRQ(ierr); 1196 for (kk=0; kk<nloc; kk++) flid_fgid[kk] = my0 + kk; 1197 } 1198 #if defined PETSC_GAMG_USE_LOG 1199 ierr = PetscLogEventEnd(petsc_gamg_setup_events[SET7],0,0,0,0);CHKERRQ(ierr); 1200 ierr = PetscLogEventBegin(petsc_gamg_setup_events[SET8],0,0,0,0);CHKERRQ(ierr); 1201 #endif 1202 { 1203 PetscReal *data_out = NULL; 1204 ierr = formProl0(agg_lists, bs, data_cols, myCrs0, nbnodes,data_w_ghost, flid_fgid, &data_out, Prol);CHKERRQ(ierr); 1205 ierr = PetscFree(pc_gamg->data);CHKERRQ(ierr); 1206 1207 pc_gamg->data = data_out; 1208 pc_gamg->data_cell_rows = data_cols; 1209 pc_gamg->data_sz = data_cols*data_cols*nLocalSelected; 1210 } 1211 #if defined PETSC_GAMG_USE_LOG 1212 ierr = PetscLogEventEnd(petsc_gamg_setup_events[SET8],0,0,0,0);CHKERRQ(ierr); 1213 #endif 1214 if (size > 1) ierr = PetscFree(data_w_ghost);CHKERRQ(ierr); 1215 ierr = PetscFree(flid_fgid);CHKERRQ(ierr); 1216 1217 *a_P_out = Prol; /* out */ 1218 #if defined PETSC_USE_LOG 1219 ierr = PetscLogEventEnd(PC_GAMGProlongator_AGG,0,0,0,0);CHKERRQ(ierr); 1220 #endif 1221 PetscFunctionReturn(0); 1222 } 1223 1224 /* -------------------------------------------------------------------------- */ 1225 /* 1226 PCGAMGOptprol_AGG 1227 1228 Input Parameter: 1229 . pc - this 1230 . Amat - matrix on this fine level 1231 In/Output Parameter: 1232 . a_P_out - prolongation operator to the next level 1233 */ 1234 #undef __FUNCT__ 1235 #define __FUNCT__ "PCGAMGOptprol_AGG" 1236 PetscErrorCode PCGAMGOptprol_AGG(PC pc,const Mat Amat,Mat *a_P) 1237 { 1238 PetscErrorCode ierr; 1239 PC_MG *mg = (PC_MG*)pc->data; 1240 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 1241 const PetscInt verbose = pc_gamg->verbose; 1242 PC_GAMG_AGG *pc_gamg_agg = (PC_GAMG_AGG*)pc_gamg->subctx; 1243 PetscInt jj; 1244 PetscMPIInt rank,size; 1245 Mat Prol = *a_P; 1246 MPI_Comm comm; 1247 1248 PetscFunctionBegin; 1249 ierr = PetscObjectGetComm((PetscObject)Amat,&comm);CHKERRQ(ierr); 1250 #if defined PETSC_USE_LOG 1251 ierr = PetscLogEventBegin(PC_GAMGOptprol_AGG,0,0,0,0);CHKERRQ(ierr); 1252 #endif 1253 ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 1254 ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 1255 1256 /* smooth P0 */ 1257 for (jj = 0; jj < pc_gamg_agg->nsmooths; jj++) { 1258 Mat tMat; 1259 Vec diag; 1260 PetscReal alpha, emax, emin; 1261 #if defined PETSC_GAMG_USE_LOG 1262 ierr = PetscLogEventBegin(petsc_gamg_setup_events[SET9],0,0,0,0);CHKERRQ(ierr); 1263 #endif 1264 if (jj == 0) { 1265 KSP eksp; 1266 Vec bb, xx; 1267 PC epc; 1268 ierr = MatGetVecs(Amat, &bb, 0);CHKERRQ(ierr); 1269 ierr = MatGetVecs(Amat, &xx, 0);CHKERRQ(ierr); 1270 { 1271 PetscRandom rctx; 1272 ierr = PetscRandomCreate(comm,&rctx);CHKERRQ(ierr); 1273 ierr = PetscRandomSetFromOptions(rctx);CHKERRQ(ierr); 1274 ierr = VecSetRandom(bb,rctx);CHKERRQ(ierr); 1275 ierr = PetscRandomDestroy(&rctx);CHKERRQ(ierr); 1276 } 1277 1278 /* zeroing out BC rows -- needed for crazy matrices */ 1279 { 1280 PetscInt Istart,Iend,ncols,jj,Ii; 1281 PetscScalar zero = 0.0; 1282 ierr = MatGetOwnershipRange(Amat, &Istart, &Iend);CHKERRQ(ierr); 1283 for (Ii = Istart, jj = 0; Ii < Iend; Ii++, jj++) { 1284 ierr = MatGetRow(Amat,Ii,&ncols,0,0);CHKERRQ(ierr); 1285 if (ncols <= 1) { 1286 ierr = VecSetValues(bb, 1, &Ii, &zero, INSERT_VALUES);CHKERRQ(ierr); 1287 } 1288 ierr = MatRestoreRow(Amat,Ii,&ncols,0,0);CHKERRQ(ierr); 1289 } 1290 ierr = VecAssemblyBegin(bb);CHKERRQ(ierr); 1291 ierr = VecAssemblyEnd(bb);CHKERRQ(ierr); 1292 } 1293 1294 ierr = KSPCreate(comm,&eksp);CHKERRQ(ierr); 1295 ierr = KSPSetTolerances(eksp,PETSC_DEFAULT,PETSC_DEFAULT,PETSC_DEFAULT,10);CHKERRQ(ierr); 1296 ierr = KSPSetNormType(eksp, KSP_NORM_NONE);CHKERRQ(ierr); 1297 ierr = KSPSetOptionsPrefix(eksp,((PetscObject)pc)->prefix);CHKERRQ(ierr); 1298 ierr = KSPAppendOptionsPrefix(eksp, "gamg_est_");CHKERRQ(ierr); 1299 ierr = KSPSetFromOptions(eksp);CHKERRQ(ierr); 1300 1301 ierr = KSPSetInitialGuessNonzero(eksp, PETSC_FALSE);CHKERRQ(ierr); 1302 ierr = KSPSetOperators(eksp, Amat, Amat, SAME_NONZERO_PATTERN);CHKERRQ(ierr); 1303 ierr = KSPSetComputeSingularValues(eksp,PETSC_TRUE);CHKERRQ(ierr); 1304 1305 ierr = KSPGetPC(eksp, &epc);CHKERRQ(ierr); 1306 ierr = PCSetType(epc, PCJACOBI);CHKERRQ(ierr); /* smoother in smoothed agg. */ 1307 1308 /* solve - keep stuff out of logging */ 1309 ierr = PetscLogEventDeactivate(KSP_Solve);CHKERRQ(ierr); 1310 ierr = PetscLogEventDeactivate(PC_Apply);CHKERRQ(ierr); 1311 ierr = KSPSolve(eksp, bb, xx);CHKERRQ(ierr); 1312 ierr = PetscLogEventActivate(KSP_Solve);CHKERRQ(ierr); 1313 ierr = PetscLogEventActivate(PC_Apply);CHKERRQ(ierr); 1314 1315 ierr = KSPComputeExtremeSingularValues(eksp, &emax, &emin);CHKERRQ(ierr); 1316 if (verbose > 0) { 1317 PetscPrintf(comm,"\t\t\t%s smooth P0: max eigen=%e min=%e PC=%s\n", 1318 __FUNCT__,emax,emin,PCJACOBI); 1319 } 1320 ierr = VecDestroy(&xx);CHKERRQ(ierr); 1321 ierr = VecDestroy(&bb);CHKERRQ(ierr); 1322 ierr = KSPDestroy(&eksp);CHKERRQ(ierr); 1323 1324 if (pc_gamg->emax_id == -1) { 1325 ierr = PetscObjectComposedDataRegister(&pc_gamg->emax_id);CHKERRQ(ierr); 1326 if (pc_gamg->emax_id == -1) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"pc_gamg->emax_id == -1"); 1327 } 1328 ierr = PetscObjectComposedDataSetScalar((PetscObject)Amat, pc_gamg->emax_id, emax);CHKERRQ(ierr); 1329 } 1330 1331 /* smooth P1 := (I - omega/lam D^{-1}A)P0 */ 1332 ierr = MatMatMult(Amat, Prol, MAT_INITIAL_MATRIX, PETSC_DEFAULT, &tMat);CHKERRQ(ierr); 1333 ierr = MatGetVecs(Amat, &diag, 0);CHKERRQ(ierr); 1334 ierr = MatGetDiagonal(Amat, diag);CHKERRQ(ierr); /* effectively PCJACOBI */ 1335 ierr = VecReciprocal(diag);CHKERRQ(ierr); 1336 ierr = MatDiagonalScale(tMat, diag, 0);CHKERRQ(ierr); 1337 ierr = VecDestroy(&diag);CHKERRQ(ierr); 1338 alpha = -1.4/emax; 1339 ierr = MatAYPX(tMat, alpha, Prol, SUBSET_NONZERO_PATTERN);CHKERRQ(ierr); 1340 ierr = MatDestroy(&Prol);CHKERRQ(ierr); 1341 Prol = tMat; 1342 #if defined PETSC_GAMG_USE_LOG 1343 ierr = PetscLogEventEnd(petsc_gamg_setup_events[SET9],0,0,0,0);CHKERRQ(ierr); 1344 #endif 1345 } 1346 #if defined PETSC_USE_LOG 1347 ierr = PetscLogEventEnd(PC_GAMGOptprol_AGG,0,0,0,0);CHKERRQ(ierr); 1348 #endif 1349 *a_P = Prol; 1350 PetscFunctionReturn(0); 1351 } 1352 1353 /* -------------------------------------------------------------------------- */ 1354 /* 1355 PCGAMGKKTProl_AGG 1356 1357 Input Parameter: 1358 . pc - this 1359 . Prol11 - matrix on this fine level 1360 . A21 - matrix on this fine level 1361 In/Output Parameter: 1362 . a_P22 - prolongation operator to the next level 1363 */ 1364 #undef __FUNCT__ 1365 #define __FUNCT__ "PCGAMGKKTProl_AGG" 1366 PetscErrorCode PCGAMGKKTProl_AGG(PC pc,const Mat Prol11,const Mat A21,Mat *a_P22) 1367 { 1368 PetscErrorCode ierr; 1369 PC_MG *mg = (PC_MG*)pc->data; 1370 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 1371 const PetscInt verbose = pc_gamg->verbose; 1372 /* PC_GAMG_AGG *pc_gamg_agg = (PC_GAMG_AGG*)pc_gamg->subctx; */ 1373 PetscMPIInt rank,size; 1374 Mat Prol22,Tmat,Gmat; 1375 MPI_Comm comm; 1376 PetscCoarsenData *agg_lists; 1377 1378 PetscFunctionBegin; 1379 ierr = PetscObjectGetComm((PetscObject)pc,&comm);CHKERRQ(ierr); 1380 #if defined PETSC_USE_LOG 1381 ierr = PetscLogEventBegin(PC_GAMGKKTProl_AGG,0,0,0,0);CHKERRQ(ierr); 1382 #endif 1383 ierr = MPI_Comm_rank(comm, &rank);CHKERRQ(ierr); 1384 ierr = MPI_Comm_size(comm, &size);CHKERRQ(ierr); 1385 1386 /* form C graph */ 1387 ierr = MatMatMult(A21, Prol11, MAT_INITIAL_MATRIX, PETSC_DEFAULT, &Tmat);CHKERRQ(ierr); 1388 ierr = MatMatTransposeMult(Tmat, Tmat, MAT_INITIAL_MATRIX, PETSC_DEFAULT, &Gmat);CHKERRQ(ierr); 1389 ierr = MatDestroy(&Tmat);CHKERRQ(ierr); 1390 ierr = PCGAMGFilterGraph(&Gmat, 0.0, PETSC_FALSE, verbose);CHKERRQ(ierr); 1391 1392 /* coarsen constraints */ 1393 { 1394 MatCoarsen crs; 1395 ierr = MatCoarsenCreate(comm, &crs);CHKERRQ(ierr); 1396 ierr = MatCoarsenSetType(crs, MATCOARSENMIS);CHKERRQ(ierr); 1397 ierr = MatCoarsenSetAdjacency(crs, Gmat);CHKERRQ(ierr); 1398 ierr = MatCoarsenSetVerbose(crs, verbose);CHKERRQ(ierr); 1399 ierr = MatCoarsenSetStrictAggs(crs, PETSC_TRUE);CHKERRQ(ierr); 1400 ierr = MatCoarsenApply(crs);CHKERRQ(ierr); 1401 ierr = MatCoarsenGetData(crs, &agg_lists);CHKERRQ(ierr); 1402 ierr = MatCoarsenDestroy(&crs);CHKERRQ(ierr); 1403 } 1404 1405 /* form simple prolongation 'Prol22' */ 1406 { 1407 PetscInt ii,mm,clid,my0,nloc,nLocalSelected; 1408 PetscScalar val = 1.0; 1409 /* get 'nLocalSelected' */ 1410 ierr = MatGetLocalSize(Gmat, &nloc, &ii);CHKERRQ(ierr); 1411 for (ii=0, nLocalSelected = 0; ii < nloc; ii++) { 1412 PetscBool ise; 1413 /* filter out singletons 0 or 1? */ 1414 ierr = PetscCDEmptyAt(agg_lists, ii, &ise);CHKERRQ(ierr); 1415 if (!ise) nLocalSelected++; 1416 } 1417 1418 ierr = MatCreate(comm,&Prol22);CHKERRQ(ierr); 1419 ierr = MatSetSizes(Prol22,nloc, nLocalSelected,PETSC_DETERMINE, PETSC_DETERMINE);CHKERRQ(ierr); 1420 ierr = MatSetType(Prol22, MATAIJ);CHKERRQ(ierr); 1421 ierr = MatSeqAIJSetPreallocation(Prol22,1,NULL);CHKERRQ(ierr); 1422 ierr = MatMPIAIJSetPreallocation(Prol22,1,NULL,1,NULL);CHKERRQ(ierr); 1423 /* ierr = MatCreateAIJ(comm, */ 1424 /* nloc, nLocalSelected, */ 1425 /* PETSC_DETERMINE, PETSC_DETERMINE, */ 1426 /* 1, NULL, 1, NULL, */ 1427 /* &Prol22); */ 1428 1429 ierr = MatGetOwnershipRange(Prol22, &my0, &ii);CHKERRQ(ierr); 1430 nloc = ii - my0; 1431 1432 /* make aggregates */ 1433 for (mm = clid = 0; mm < nloc; mm++) { 1434 ierr = PetscCDSizeAt(agg_lists, mm, &ii);CHKERRQ(ierr); 1435 if (ii > 0) { 1436 PetscInt asz=ii,cgid=my0+clid,rids[1000]; 1437 PetscCDPos pos; 1438 if (asz>1000) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Very large aggregate: %d",asz); 1439 ii = 0; 1440 ierr = PetscCDGetHeadPos(agg_lists,mm,&pos);CHKERRQ(ierr); 1441 while (pos) { 1442 PetscInt gid1; 1443 ierr = PetscLLNGetID(pos, &gid1);CHKERRQ(ierr); 1444 ierr = PetscCDGetNextPos(agg_lists,mm,&pos);CHKERRQ(ierr); 1445 1446 rids[ii++] = gid1; 1447 } 1448 if (ii != asz) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"ii %D != asz %D",ii,asz); 1449 /* add diagonal block of P0 */ 1450 ierr = MatSetValues(Prol22,asz,rids,1,&cgid,&val,INSERT_VALUES);CHKERRQ(ierr); 1451 1452 clid++; 1453 } /* coarse agg */ 1454 } /* for all fine nodes */ 1455 ierr = MatAssemblyBegin(Prol22,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 1456 ierr = MatAssemblyEnd(Prol22,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 1457 } 1458 1459 /* clean up */ 1460 ierr = MatDestroy(&Gmat);CHKERRQ(ierr); 1461 ierr = PetscCDDestroy(agg_lists);CHKERRQ(ierr); 1462 #if defined PETSC_USE_LOG 1463 ierr = PetscLogEventEnd(PC_GAMGKKTProl_AGG,0,0,0,0);CHKERRQ(ierr); 1464 #endif 1465 *a_P22 = Prol22; 1466 PetscFunctionReturn(0); 1467 } 1468 1469 /* -------------------------------------------------------------------------- */ 1470 /* 1471 PCCreateGAMG_AGG 1472 1473 Input Parameter: 1474 . pc - 1475 */ 1476 #undef __FUNCT__ 1477 #define __FUNCT__ "PCCreateGAMG_AGG" 1478 PetscErrorCode PCCreateGAMG_AGG(PC pc) 1479 { 1480 PetscErrorCode ierr; 1481 PC_MG *mg = (PC_MG*)pc->data; 1482 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 1483 PC_GAMG_AGG *pc_gamg_agg; 1484 1485 PetscFunctionBegin; 1486 /* create sub context for SA */ 1487 ierr = PetscNewLog(pc, PC_GAMG_AGG, &pc_gamg_agg);CHKERRQ(ierr); 1488 pc_gamg->subctx = pc_gamg_agg; 1489 1490 pc_gamg->ops->setfromoptions = PCSetFromOptions_GAMG_AGG; 1491 pc_gamg->ops->destroy = PCDestroy_GAMG_AGG; 1492 /* reset does not do anything; setup not virtual */ 1493 1494 /* set internal function pointers */ 1495 pc_gamg->ops->graph = PCGAMGgraph_AGG; 1496 pc_gamg->ops->coarsen = PCGAMGCoarsen_AGG; 1497 pc_gamg->ops->prolongator = PCGAMGProlongator_AGG; 1498 pc_gamg->ops->optprol = PCGAMGOptprol_AGG; 1499 pc_gamg->ops->formkktprol = PCGAMGKKTProl_AGG; 1500 1501 pc_gamg->ops->createdefaultdata = PCSetData_AGG; 1502 1503 ierr = PetscObjectComposeFunction((PetscObject)pc,"PCSetCoordinates_C",PCSetCoordinates_AGG);CHKERRQ(ierr); 1504 PetscFunctionReturn(0); 1505 } 1506