1 /* 2 GAMG geometric-algebric multigrid PC - Mark Adams 2011 3 */ 4 #include "private/matimpl.h" 5 #include <../src/ksp/pc/impls/gamg/gamg.h> /*I "petscpc.h" I*/ 6 #include <private/kspimpl.h> 7 8 #if defined PETSC_USE_LOG 9 PetscLogEvent gamg_setup_events[NUM_SET]; 10 #endif 11 #define GAMG_MAXLEVELS 30 12 13 /* #define GAMG_STAGES */ 14 #if (defined PETSC_USE_LOG && defined GAMG_STAGES) 15 static PetscLogStage gamg_stages[GAMG_MAXLEVELS]; 16 #endif 17 18 static PetscFList GAMGList = 0; 19 20 /* ----------------------------------------------------------------------------- */ 21 #undef __FUNCT__ 22 #define __FUNCT__ "PCReset_GAMG" 23 PetscErrorCode PCReset_GAMG(PC pc) 24 { 25 PetscErrorCode ierr; 26 PC_MG *mg = (PC_MG*)pc->data; 27 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 28 29 PetscFunctionBegin; 30 if( pc_gamg->data != 0 ) { /* this should not happen, cleaned up in SetUp */ 31 ierr = PetscFree(pc_gamg->data); CHKERRQ(ierr); 32 } 33 pc_gamg->data = 0; pc_gamg->data_sz = 0; 34 PetscFunctionReturn(0); 35 } 36 37 /* -------------------------------------------------------------------------- */ 38 /* 39 createLevel: create coarse op with RAP. repartition and/or reduce number 40 of active processors. 41 42 Input Parameter: 43 . pc - parameters 44 . Amat_fine - matrix on this fine (k) level 45 . cbs - coarse block size 46 . isLast - 47 In/Output Parameter: 48 . a_P_inout - prolongation operator to the next level (k-1) 49 . a_nactive_proc - number of active procs 50 Output Parameter: 51 . a_Amat_crs - coarse matrix that is created (k-1) 52 */ 53 54 #undef __FUNCT__ 55 #define __FUNCT__ "createLevel" 56 PetscErrorCode createLevel( const PC pc, 57 const Mat Amat_fine, 58 const PetscInt cbs, 59 const PetscBool isLast, 60 Mat *a_P_inout, 61 PetscMPIInt *a_nactive_proc, 62 Mat *a_Amat_crs 63 ) 64 { 65 PC_MG *mg = (PC_MG*)pc->data; 66 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 67 const PetscBool repart = pc_gamg->repart; 68 const PetscInt min_eq_proc = pc_gamg->min_eq_proc, coarse_max = pc_gamg->coarse_eq_limit; 69 PetscErrorCode ierr; 70 Mat Cmat,Pnew,Pold=*a_P_inout; 71 IS new_indices,isnum; 72 MPI_Comm wcomm = ((PetscObject)Amat_fine)->comm; 73 PetscMPIInt mype,npe,new_npe,nactive = *a_nactive_proc; 74 PetscInt neq,NN,Istart,Iend,Istart0,Iend0,ncrs_new,ncrs0,rfactor; 75 76 PetscFunctionBegin; 77 ierr = MPI_Comm_rank( wcomm, &mype ); CHKERRQ(ierr); 78 ierr = MPI_Comm_size( wcomm, &npe ); CHKERRQ(ierr); 79 80 /* RAP */ 81 #ifdef USE_R 82 /* make R wih brute force for now */ 83 ierr = MatTranspose( Pold, Pnew ); 84 ierr = MatDestroy( &Pold ); CHKERRQ(ierr); 85 ierr = MatRARt( Amat_fine, Pnew, MAT_INITIAL_MATRIX, 2.0, &Cmat ); CHKERRQ(ierr); 86 Pold = Pnew; 87 #else 88 ierr = MatPtAP( Amat_fine, Pold, MAT_INITIAL_MATRIX, 2.0, &Cmat ); CHKERRQ(ierr); 89 #endif 90 ierr = MatSetBlockSize( Cmat, cbs ); CHKERRQ(ierr); 91 ierr = MatGetOwnershipRange( Cmat, &Istart0, &Iend0 ); CHKERRQ(ierr); 92 ncrs0 = (Iend0-Istart0)/cbs; assert((Iend0-Istart0)%cbs == 0); 93 94 /* get number of PEs to make active, reduce */ 95 ierr = MatGetSize( Cmat, &neq, &NN ); CHKERRQ(ierr); 96 new_npe = (PetscMPIInt)((float)neq/(float)min_eq_proc + 0.5); /* hardwire min. number of eq/proc */ 97 if( new_npe == 0 || neq < coarse_max ) new_npe = 1; 98 else if (new_npe >= nactive ) new_npe = nactive; /* no change, rare */ 99 if( isLast ) new_npe = 1; 100 101 if( !repart && new_npe==nactive ) { 102 *a_Amat_crs = Cmat; /* output - no repartitioning or reduction */ 103 } 104 else { 105 /* Repartition Cmat_{k} and move colums of P^{k}_{k-1} and coordinates accordingly */ 106 const PetscInt *idx,ndata_rows=pc_gamg->data_cell_rows,ndata_cols=pc_gamg->data_cell_cols,data_sz=ndata_rows*ndata_cols; 107 const PetscInt stride0=ncrs0*pc_gamg->data_cell_rows; 108 PetscInt *counts,is_sz,*newproc_idx,ii,jj,kk,strideNew,*tidx,inpe,targetPE; 109 IS isnewproc; 110 VecScatter vecscat; 111 PetscScalar *array; 112 Vec src_crd, dest_crd; 113 IS isscat; 114 115 ierr = PetscMalloc( npe*sizeof(PetscInt), &counts ); CHKERRQ(ierr); 116 #if defined PETSC_USE_LOG 117 ierr = PetscLogEventBegin(gamg_setup_events[SET12],0,0,0,0);CHKERRQ(ierr); 118 #endif 119 if( repart ) { 120 /* create sub communicator */ 121 Mat adj; 122 123 if (pc_gamg->verbose) PetscPrintf(wcomm,"\t[%d]%s repartition: npe (active): %d --> %d, neq = %d\n",mype,__FUNCT__,*a_nactive_proc,new_npe,neq); 124 125 /* MatPartitioningApply call MatConvert, which is collective */ 126 if( cbs == 1 ) { 127 ierr = MatConvert( Cmat, MATMPIADJ, MAT_INITIAL_MATRIX, &adj ); CHKERRQ(ierr); 128 } 129 else{ 130 /* make a scalar matrix to partition */ 131 Mat tMat; 132 PetscInt ncols,jj,Ii; 133 const PetscScalar *vals; 134 const PetscInt *idx; 135 PetscInt *d_nnz, *o_nnz; 136 static PetscInt llev = 0; 137 138 ierr = PetscMalloc( ncrs0*sizeof(PetscInt), &d_nnz ); CHKERRQ(ierr); 139 ierr = PetscMalloc( ncrs0*sizeof(PetscInt), &o_nnz ); CHKERRQ(ierr); 140 for ( Ii = Istart0, jj = 0 ; Ii < Iend0 ; Ii += cbs, jj++ ) { 141 ierr = MatGetRow(Cmat,Ii,&ncols,0,0); CHKERRQ(ierr); 142 d_nnz[jj] = ncols/cbs; 143 o_nnz[jj] = ncols/cbs; 144 ierr = MatRestoreRow(Cmat,Ii,&ncols,0,0); CHKERRQ(ierr); 145 if( d_nnz[jj] > ncrs0 ) d_nnz[jj] = ncrs0; 146 if( o_nnz[jj] > (neq/cbs-ncrs0) ) o_nnz[jj] = neq/cbs-ncrs0; 147 } 148 149 ierr = MatCreateMPIAIJ( wcomm, ncrs0, ncrs0, 150 PETSC_DETERMINE, PETSC_DETERMINE, 151 0, d_nnz, 0, o_nnz, 152 &tMat ); 153 CHKERRQ(ierr); 154 ierr = PetscFree( d_nnz ); CHKERRQ(ierr); 155 ierr = PetscFree( o_nnz ); CHKERRQ(ierr); 156 157 for ( ii = Istart0; ii < Iend0; ii++ ) { 158 PetscInt dest_row = ii/cbs; 159 ierr = MatGetRow(Cmat,ii,&ncols,&idx,&vals); CHKERRQ(ierr); 160 for( jj = 0 ; jj < ncols ; jj++ ){ 161 PetscInt dest_col = idx[jj]/cbs; 162 PetscScalar v = 1.0; 163 ierr = MatSetValues(tMat,1,&dest_row,1,&dest_col,&v,ADD_VALUES); CHKERRQ(ierr); 164 } 165 ierr = MatRestoreRow(Cmat,ii,&ncols,&idx,&vals); CHKERRQ(ierr); 166 } 167 ierr = MatAssemblyBegin(tMat,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 168 ierr = MatAssemblyEnd(tMat,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 169 170 if( llev++ == -1 ) { 171 PetscViewer viewer; char fname[32]; 172 sprintf(fname,"part_mat_%d.mat",llev); 173 PetscViewerBinaryOpen(wcomm,fname,FILE_MODE_WRITE,&viewer); 174 ierr = MatView( tMat, viewer ); CHKERRQ(ierr); 175 ierr = PetscViewerDestroy( &viewer ); 176 } 177 178 ierr = MatConvert( tMat, MATMPIADJ, MAT_INITIAL_MATRIX, &adj ); CHKERRQ(ierr); 179 180 ierr = MatDestroy( &tMat ); CHKERRQ(ierr); 181 } 182 183 { /* partition: get newproc_idx, set is_sz */ 184 char prefix[256]; 185 const char *pcpre; 186 const PetscInt *is_idx; 187 MatPartitioning mpart; 188 IS proc_is; 189 190 ierr = MatPartitioningCreate( wcomm, &mpart ); CHKERRQ(ierr); 191 ierr = MatPartitioningSetAdjacency( mpart, adj ); CHKERRQ(ierr); 192 ierr = PCGetOptionsPrefix( pc, &pcpre );CHKERRQ(ierr); 193 ierr = PetscSNPrintf(prefix,sizeof prefix,"%spc_gamg_",pcpre?pcpre:"");CHKERRQ(ierr); 194 ierr = PetscObjectSetOptionsPrefix((PetscObject)mpart,prefix);CHKERRQ(ierr); 195 ierr = MatPartitioningSetFromOptions( mpart ); CHKERRQ(ierr); 196 ierr = MatPartitioningSetNParts( mpart, new_npe );CHKERRQ(ierr); 197 ierr = MatPartitioningApply( mpart, &proc_is ); CHKERRQ(ierr); 198 ierr = MatPartitioningDestroy( &mpart ); CHKERRQ(ierr); 199 200 /* collect IS info */ 201 ierr = ISGetLocalSize( proc_is, &is_sz ); CHKERRQ(ierr); 202 ierr = PetscMalloc( cbs*is_sz*sizeof(PetscInt), &newproc_idx ); CHKERRQ(ierr); 203 ierr = ISGetIndices( proc_is, &is_idx ); CHKERRQ(ierr); 204 NN = 1; /* bring to "front" of machine */ 205 /*NN = npe/new_npe;*/ /* spread partitioning across machine */ 206 for( kk = jj = 0 ; kk < is_sz ; kk++ ){ 207 for( ii = 0 ; ii < cbs ; ii++, jj++ ){ 208 newproc_idx[jj] = is_idx[kk] * NN; /* distribution */ 209 } 210 } 211 ierr = ISRestoreIndices( proc_is, &is_idx ); CHKERRQ(ierr); 212 ierr = ISDestroy( &proc_is ); CHKERRQ(ierr); 213 214 is_sz *= cbs; 215 } 216 ierr = MatDestroy( &adj ); CHKERRQ(ierr); 217 218 ierr = ISCreateGeneral( wcomm, is_sz, newproc_idx, PETSC_COPY_VALUES, &isnewproc ); 219 CHKERRQ(ierr); 220 if( newproc_idx != 0 ) { 221 ierr = PetscFree( newproc_idx ); CHKERRQ(ierr); 222 } 223 } 224 else { /* simple aggreagtion of parts */ 225 /* find factor */ 226 if( new_npe == 1 ) rfactor = npe; /* easy */ 227 else { 228 PetscReal best_fact = 0.; 229 jj = -1; 230 for( kk = 1 ; kk <= npe ; kk++ ){ 231 if( npe%kk==0 ) { /* a candidate */ 232 PetscReal nactpe = (PetscReal)npe/(PetscReal)kk, fact = nactpe/(PetscReal)new_npe; 233 if(fact > 1.0) fact = 1./fact; /* keep fact < 1 */ 234 if( fact > best_fact ) { 235 best_fact = fact; jj = kk; 236 } 237 } 238 } 239 if(jj!=-1) rfactor = jj; 240 else rfactor = 1; /* prime? */ 241 } 242 new_npe = npe/rfactor; 243 244 if( new_npe==nactive ) { 245 *a_Amat_crs = Cmat; /* output - no repartitioning or reduction */ 246 ierr = PetscFree( counts ); CHKERRQ(ierr); 247 *a_nactive_proc = new_npe; /* output */ 248 if (pc_gamg->verbose) PetscPrintf(wcomm,"\t[%d]%s aggregate processors noop: new_npe=%d, neq=%d\n",mype,__FUNCT__,new_npe,neq); 249 PetscFunctionReturn(0); 250 } 251 252 /* reduce - isnewproc */ 253 targetPE = mype/rfactor; 254 255 if (pc_gamg->verbose) PetscPrintf(wcomm,"\t[%d]%s aggregate processors: npe: %d --> %d, neq=%d\n",mype,__FUNCT__,*a_nactive_proc,new_npe,neq); 256 is_sz = ncrs0*cbs; 257 ierr = ISCreateStride( wcomm, is_sz, targetPE, 0, &isnewproc ); 258 CHKERRQ(ierr); 259 } 260 261 /* 262 Create an index set from the isnewproc index set to indicate the mapping TO 263 */ 264 ierr = ISPartitioningToNumbering( isnewproc, &isnum ); CHKERRQ(ierr); 265 /* 266 Determine how many elements are assigned to each processor 267 */ 268 inpe = npe; 269 ierr = ISPartitioningCount( isnewproc, inpe, counts ); CHKERRQ(ierr); 270 ierr = ISDestroy( &isnewproc ); CHKERRQ(ierr); 271 ncrs_new = counts[mype]/cbs; 272 strideNew = ncrs_new*ndata_rows; 273 #if defined PETSC_USE_LOG 274 ierr = PetscLogEventEnd(gamg_setup_events[SET12],0,0,0,0); CHKERRQ(ierr); 275 #endif 276 /* Create a vector to contain the newly ordered element information */ 277 ierr = VecCreate( wcomm, &dest_crd ); 278 ierr = VecSetSizes( dest_crd, data_sz*ncrs_new, PETSC_DECIDE ); CHKERRQ(ierr); 279 ierr = VecSetFromOptions( dest_crd ); CHKERRQ(ierr); /* this is needed! */ 280 /* 281 There are 'ndata_rows*ndata_cols' data items per node, (one can think of the vectors of having 282 a block size of ...). Note, ISs are expanded into equation space by 'cbs'. 283 */ 284 ierr = PetscMalloc( (ncrs0*data_sz)*sizeof(PetscInt), &tidx ); CHKERRQ(ierr); 285 ierr = ISGetIndices( isnum, &idx ); CHKERRQ(ierr); 286 for(ii=0,jj=0; ii<ncrs0 ; ii++) { 287 PetscInt id = idx[ii*cbs]/cbs; /* get node back */ 288 for( kk=0; kk<data_sz ; kk++, jj++) tidx[jj] = id*data_sz + kk; 289 } 290 ierr = ISRestoreIndices( isnum, &idx ); CHKERRQ(ierr); 291 ierr = ISCreateGeneral( wcomm, data_sz*ncrs0, tidx, PETSC_COPY_VALUES, &isscat ); 292 CHKERRQ(ierr); 293 ierr = PetscFree( tidx ); CHKERRQ(ierr); 294 /* 295 Create a vector to contain the original vertex information for each element 296 */ 297 ierr = VecCreateSeq( PETSC_COMM_SELF, data_sz*ncrs0, &src_crd ); CHKERRQ(ierr); 298 for( jj=0; jj<ndata_cols ; jj++ ) { 299 for( ii=0 ; ii<ncrs0 ; ii++) { 300 for( kk=0; kk<ndata_rows ; kk++ ) { 301 PetscInt ix = ii*ndata_rows + kk + jj*stride0, jx = ii*data_sz + kk*ndata_cols + jj; 302 PetscScalar tt = (PetscScalar)pc_gamg->data[ix]; 303 ierr = VecSetValues( src_crd, 1, &jx, &tt, INSERT_VALUES ); CHKERRQ(ierr); 304 } 305 } 306 } 307 ierr = VecAssemblyBegin(src_crd); CHKERRQ(ierr); 308 ierr = VecAssemblyEnd(src_crd); CHKERRQ(ierr); 309 /* 310 Scatter the element vertex information (still in the original vertex ordering) 311 to the correct processor 312 */ 313 ierr = VecScatterCreate( src_crd, PETSC_NULL, dest_crd, isscat, &vecscat); 314 CHKERRQ(ierr); 315 ierr = ISDestroy( &isscat ); CHKERRQ(ierr); 316 ierr = VecScatterBegin(vecscat,src_crd,dest_crd,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 317 ierr = VecScatterEnd(vecscat,src_crd,dest_crd,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 318 ierr = VecScatterDestroy( &vecscat ); CHKERRQ(ierr); 319 ierr = VecDestroy( &src_crd ); CHKERRQ(ierr); 320 /* 321 Put the element vertex data into a new allocation of the gdata->ele 322 */ 323 ierr = PetscFree( pc_gamg->data ); CHKERRQ(ierr); 324 ierr = PetscMalloc( data_sz*ncrs_new*sizeof(PetscReal), &pc_gamg->data ); CHKERRQ(ierr); 325 pc_gamg->data_sz = data_sz*ncrs_new; 326 ierr = VecGetArray( dest_crd, &array ); CHKERRQ(ierr); 327 for( jj=0; jj<ndata_cols ; jj++ ) { 328 for( ii=0 ; ii<ncrs_new ; ii++) { 329 for( kk=0; kk<ndata_rows ; kk++ ) { 330 PetscInt ix = ii*ndata_rows + kk + jj*strideNew, jx = ii*data_sz + kk*ndata_cols + jj; 331 pc_gamg->data[ix] = PetscRealPart(array[jx]); 332 array[jx] = 1.e300; 333 } 334 } 335 } 336 ierr = VecRestoreArray( dest_crd, &array ); CHKERRQ(ierr); 337 ierr = VecDestroy( &dest_crd ); CHKERRQ(ierr); 338 #if defined PETSC_USE_LOG 339 ierr = PetscLogEventBegin(gamg_setup_events[SET13],0,0,0,0);CHKERRQ(ierr); 340 #endif 341 /* 342 Invert for MatGetSubMatrix 343 */ 344 ierr = ISInvertPermutation( isnum, ncrs_new*cbs, &new_indices ); CHKERRQ(ierr); 345 ierr = ISSort( new_indices ); CHKERRQ(ierr); /* is this needed? */ 346 ierr = ISDestroy( &isnum ); CHKERRQ(ierr); 347 #if defined PETSC_USE_LOG 348 ierr = PetscLogEventEnd(gamg_setup_events[SET13],0,0,0,0);CHKERRQ(ierr); 349 ierr = PetscLogEventBegin(gamg_setup_events[SET14],0,0,0,0);CHKERRQ(ierr); 350 #endif 351 /* A_crs output */ 352 ierr = MatGetSubMatrix( Cmat, new_indices, new_indices, MAT_INITIAL_MATRIX, a_Amat_crs ); 353 CHKERRQ(ierr); 354 355 ierr = MatDestroy( &Cmat ); CHKERRQ(ierr); 356 Cmat = *a_Amat_crs; /* output */ 357 ierr = MatSetBlockSize( Cmat, cbs ); CHKERRQ(ierr); 358 #if defined PETSC_USE_LOG 359 ierr = PetscLogEventEnd(gamg_setup_events[SET14],0,0,0,0);CHKERRQ(ierr); 360 #endif 361 /* prolongator */ 362 ierr = MatGetOwnershipRange( Pold, &Istart, &Iend ); CHKERRQ(ierr); 363 { 364 IS findices; 365 #if defined PETSC_USE_LOG 366 ierr = PetscLogEventBegin(gamg_setup_events[SET15],0,0,0,0);CHKERRQ(ierr); 367 #endif 368 ierr = ISCreateStride(wcomm,Iend-Istart,Istart,1,&findices); CHKERRQ(ierr); 369 #ifdef USE_R 370 ierr = MatGetSubMatrix( Pold, new_indices, findices, MAT_INITIAL_MATRIX, &Pnew ); 371 #else 372 ierr = MatGetSubMatrix( Pold, findices, new_indices, MAT_INITIAL_MATRIX, &Pnew ); 373 #endif 374 CHKERRQ(ierr); 375 ierr = ISDestroy( &findices ); CHKERRQ(ierr); 376 #if defined PETSC_USE_LOG 377 ierr = PetscLogEventEnd(gamg_setup_events[SET15],0,0,0,0);CHKERRQ(ierr); 378 #endif 379 } 380 ierr = MatDestroy( a_P_inout ); CHKERRQ(ierr); 381 *a_P_inout = Pnew; /* output - repartitioned */ 382 ierr = ISDestroy( &new_indices ); CHKERRQ(ierr); 383 ierr = PetscFree( counts ); CHKERRQ(ierr); 384 } 385 386 *a_nactive_proc = new_npe; /* output */ 387 388 if( !PETSC_TRUE ) { 389 PetscViewer viewer; char fname[32]; static int llev=0; Cmat = *a_Amat_crs; 390 if(llev==0) { 391 sprintf(fname,"Cmat_%d.m",llev++); 392 PetscViewerASCIIOpen(wcomm,fname,&viewer); 393 ierr = PetscViewerSetFormat( viewer, PETSC_VIEWER_ASCII_MATLAB); CHKERRQ(ierr); 394 ierr = MatView(Amat_fine, viewer ); CHKERRQ(ierr); 395 ierr = PetscViewerDestroy( &viewer ); 396 } 397 sprintf(fname,"Cmat_%d.m",llev++); 398 PetscViewerASCIIOpen(wcomm,fname,&viewer); 399 ierr = PetscViewerSetFormat( viewer, PETSC_VIEWER_ASCII_MATLAB); CHKERRQ(ierr); 400 ierr = MatView(Cmat, viewer ); CHKERRQ(ierr); 401 ierr = PetscViewerDestroy( &viewer ); 402 } 403 404 PetscFunctionReturn(0); 405 } 406 407 /* -------------------------------------------------------------------------- */ 408 /* 409 PCSetUp_GAMG - Prepares for the use of the GAMG preconditioner 410 by setting data structures and options. 411 412 Input Parameter: 413 . pc - the preconditioner context 414 415 Application Interface Routine: PCSetUp() 416 417 Notes: 418 The interface routine PCSetUp() is not usually called directly by 419 the user, but instead is called by PCApply() if necessary. 420 */ 421 #undef __FUNCT__ 422 #define __FUNCT__ "PCSetUp_GAMG" 423 PetscErrorCode PCSetUp_GAMG( PC pc ) 424 { 425 PetscErrorCode ierr; 426 PC_MG *mg = (PC_MG*)pc->data; 427 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 428 PC_MG_Levels **mglevels = mg->levels; 429 Mat Pmat = pc->pmat; 430 PetscInt fine_level,level,level1,M,N,bs,nloc,lidx,Istart,Iend; 431 MPI_Comm wcomm = ((PetscObject)pc)->comm; 432 PetscMPIInt mype,npe,nactivepe; 433 Mat Aarr[GAMG_MAXLEVELS], Parr[GAMG_MAXLEVELS]; 434 PetscReal emaxs[GAMG_MAXLEVELS]; 435 PetscLogDouble nnz0,nnztot; 436 MatInfo info; 437 438 PetscFunctionBegin; 439 pc_gamg->setup_count++; 440 441 if( pc->setupcalled > 0 ) { 442 /* just do Galerkin grids */ 443 Mat B,dA,dB; 444 445 /* PCSetUp_MG seems to insists on setting this to GMRES */ 446 ierr = KSPSetType( mglevels[0]->smoothd, KSPPREONLY ); CHKERRQ(ierr); 447 448 if( pc_gamg->Nlevels > 1 ) { 449 /* currently only handle case where mat and pmat are the same on coarser levels */ 450 ierr = KSPGetOperators(mglevels[pc_gamg->Nlevels-1]->smoothd,&dA,&dB,PETSC_NULL);CHKERRQ(ierr); 451 /* (re)set to get dirty flag */ 452 ierr = KSPSetOperators(mglevels[pc_gamg->Nlevels-1]->smoothd,dA,dB,SAME_NONZERO_PATTERN);CHKERRQ(ierr); 453 ierr = KSPSetUp( mglevels[pc_gamg->Nlevels-1]->smoothd ); CHKERRQ(ierr); 454 455 for (level=pc_gamg->Nlevels-2; level>-1; level--) { 456 ierr = KSPGetOperators(mglevels[level]->smoothd,PETSC_NULL,&B,PETSC_NULL);CHKERRQ(ierr); 457 /* the first time through the matrix structure has changed from repartitioning */ 458 if( pc_gamg->setup_count == 2 ) { 459 ierr = MatDestroy( &B ); CHKERRQ(ierr); 460 ierr = MatPtAP(dB,mglevels[level+1]->interpolate,MAT_INITIAL_MATRIX,1.0,&B);CHKERRQ(ierr); 461 mglevels[level]->A = B; 462 } 463 else { 464 ierr = MatPtAP(dB,mglevels[level+1]->interpolate,MAT_REUSE_MATRIX,1.0,&B);CHKERRQ(ierr); 465 } 466 ierr = KSPSetOperators(mglevels[level]->smoothd,B,B,SAME_NONZERO_PATTERN); CHKERRQ(ierr); 467 dB = B; 468 /* setup KSP/PC */ 469 ierr = KSPSetUp( mglevels[level]->smoothd ); CHKERRQ(ierr); 470 } 471 } 472 473 pc->setupcalled = 2; 474 475 PetscFunctionReturn(0); 476 } 477 478 ierr = MPI_Comm_rank(wcomm,&mype);CHKERRQ(ierr); 479 ierr = MPI_Comm_size(wcomm,&npe);CHKERRQ(ierr); 480 /* GAMG requires input of fine-grid matrix. It determines nlevels. */ 481 ierr = MatGetBlockSize( Pmat, &bs ); CHKERRQ(ierr); 482 ierr = MatGetSize( Pmat, &M, &N );CHKERRQ(ierr); 483 ierr = MatGetOwnershipRange( Pmat, &Istart, &Iend ); CHKERRQ(ierr); 484 nloc = (Iend-Istart)/bs; assert((Iend-Istart)%bs == 0); 485 486 if( pc_gamg->data == 0 && nloc > 0 ) { 487 if(!pc_gamg->createdefaultdata){ 488 SETERRQ(((PetscObject)pc)->comm,PETSC_ERR_LIB,"'createdefaultdata' not set?!?! need to support NULL data!!!"); 489 } 490 ierr = pc_gamg->createdefaultdata( pc ); CHKERRQ(ierr); 491 } 492 493 /* Get A_i and R_i */ 494 if (pc_gamg->verbose) { 495 if(pc_gamg->verbose==1) ierr = MatGetInfo(Pmat,MAT_LOCAL,&info); 496 else ierr = MatGetInfo(Pmat,MAT_GLOBAL_SUM,&info); 497 CHKERRQ(ierr); 498 nnz0 = info.nz_used; 499 nnztot = info.nz_used; 500 PetscPrintf(wcomm,"\t[%d]%s level %d N=%d, n data rows=%d, n data cols=%d, nnz/row (ave)=%d, np=%d\n", 501 mype,__FUNCT__,0,N,pc_gamg->data_cell_rows,pc_gamg->data_cell_cols, 502 (int)(nnz0/(PetscReal)N),npe); 503 } 504 for ( level=0, Aarr[0] = Pmat, nactivepe = npe; /* hard wired stopping logic */ 505 level < (pc_gamg->Nlevels-1) && (level==0 || M>pc_gamg->coarse_eq_limit); /* && (npe==1 || nactivepe>1); */ 506 level++ ){ 507 level1 = level + 1; 508 #if (defined PETSC_USE_LOG && defined GAMG_STAGES) 509 ierr = PetscLogStagePush(gamg_stages[level]); CHKERRQ( ierr ); 510 #endif 511 #if defined PETSC_USE_LOG 512 ierr = PetscLogEventBegin(gamg_setup_events[SET1],0,0,0,0); CHKERRQ(ierr); 513 #endif 514 { /* construct prolongator */ 515 Mat Gmat; assert(pc_gamg->graph); 516 IS selected, llist; assert(pc_gamg->coarsen); 517 518 ierr = pc_gamg->graph( pc, Aarr[level], &Gmat ); CHKERRQ(ierr); 519 ierr = pc_gamg->coarsen( pc, Gmat, &selected, &llist ); CHKERRQ(ierr); 520 ierr = pc_gamg->prolongator( pc, Aarr[level], Gmat, selected, llist, &Parr[level1] ); 521 CHKERRQ(ierr); 522 523 if( Parr[level1] ){ 524 /* get new block size of coarse matrices */ 525 if( pc_gamg->col_bs_id != -1 ){ 526 PetscBool flag; 527 ierr = PetscObjectComposedDataGetInt( (PetscObject)Parr[level1], pc_gamg->col_bs_id, bs, flag ); 528 CHKERRQ( ierr ); assert(flag); 529 } 530 } 531 532 if( pc_gamg->optprol && Parr[level1] ){ 533 /* smooth */ 534 ierr = pc_gamg->optprol( pc, Aarr[level], &Parr[level1] ); CHKERRQ(ierr); 535 } 536 537 ierr = MatDestroy( &Gmat ); CHKERRQ(ierr); 538 ierr = ISDestroy( &selected ); CHKERRQ(ierr); 539 ierr = ISDestroy( &llist ); CHKERRQ(ierr); 540 } 541 #if defined PETSC_USE_LOG 542 ierr = PetscLogEventEnd(gamg_setup_events[SET1],0,0,0,0);CHKERRQ(ierr); 543 #endif 544 /* cache eigen estimate */ 545 if( pc_gamg->emax_id != -1 ){ 546 PetscBool flag; 547 ierr = PetscObjectComposedDataGetReal( (PetscObject)Aarr[level], pc_gamg->emax_id, emaxs[level], flag ); 548 CHKERRQ( ierr ); 549 if( !flag ) emaxs[level] = -1.; 550 } 551 else emaxs[level] = -1.; 552 if(level==0) Aarr[0] = Pmat; /* use Pmat for finest level setup */ 553 if( !Parr[level1] ) { 554 if (pc_gamg->verbose) PetscPrintf(wcomm,"\t[%d]%s stop gridding, level %d\n",mype,__FUNCT__,level); 555 break; 556 } 557 #if defined PETSC_USE_LOG 558 ierr = PetscLogEventBegin(gamg_setup_events[SET2],0,0,0,0);CHKERRQ(ierr); 559 #endif 560 ierr = createLevel( pc, Aarr[level], bs, 561 (PetscBool)(level==pc_gamg->Nlevels-2), 562 &Parr[level1], &nactivepe, &Aarr[level1] ); 563 CHKERRQ(ierr); 564 #if defined PETSC_USE_LOG 565 ierr = PetscLogEventEnd(gamg_setup_events[SET2],0,0,0,0);CHKERRQ(ierr); 566 #endif 567 ierr = MatGetSize( Aarr[level1], &M, &N );CHKERRQ(ierr); 568 ierr = MatGetInfo( Aarr[level1], MAT_GLOBAL_SUM, &info ); CHKERRQ(ierr); 569 if (pc_gamg->verbose){ 570 PetscPrintf(wcomm,"\t\t[%d]%s %d) N=%d, n data cols=%d, nnz/row (ave)=%d, %d active pes\n", 571 mype,__FUNCT__,(int)level1,N,pc_gamg->data_cell_cols, 572 (int)(info.nz_used/(PetscReal)N),nactivepe); 573 } 574 /* stop if one node */ 575 if( M/pc_gamg->data_cell_cols < 2 ) { 576 level++; 577 break; 578 } 579 /* Vec diag; PetscScalar *data_arr,v; PetscInt Istart,Iend,kk,nloceq,id; */ 580 /* v = 1.e-10; /\* LU factor has hard wired numbers for small diags so this needs to match (yuk) *\/ */ 581 /* ierr = MatGetOwnershipRange(Aarr[level1], &Istart, &Iend); CHKERRQ(ierr); */ 582 /* nloceq = Iend-Istart; */ 583 /* ierr = MatGetVecs( Aarr[level1], &diag, 0 ); CHKERRQ(ierr); */ 584 /* ierr = MatGetDiagonal( Aarr[level1], diag ); CHKERRQ(ierr); */ 585 /* ierr = VecGetArray( diag, &data_arr ); CHKERRQ(ierr); */ 586 /* for(kk=0;kk<nloceq;kk++){ */ 587 /* if(data_arr[kk]==0.0) { */ 588 /* id = kk + Istart; */ 589 /* ierr = MatSetValues(Aarr[level1],1,&id,1,&id,&v,INSERT_VALUES); */ 590 /* CHKERRQ(ierr); */ 591 /* PetscPrintf(PETSC_COMM_SELF,"\t[%d]%s warning: added zero to diag (%d) on level %d \n",mype,__FUNCT__,id,level1); */ 592 /* } */ 593 /* } */ 594 /* ierr = VecRestoreArray( diag, &data_arr ); CHKERRQ(ierr); */ 595 /* ierr = VecDestroy( &diag ); CHKERRQ(ierr); */ 596 ierr = MatAssemblyBegin(Aarr[level1],MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 597 ierr = MatAssemblyEnd(Aarr[level1],MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 598 599 #if (defined PETSC_USE_LOG && defined GAMG_STAGES) 600 ierr = PetscLogStagePop(); CHKERRQ( ierr ); 601 #endif 602 if(pc_gamg->verbose){ 603 if(pc_gamg->verbose==1) ierr = MatGetInfo(Aarr[level1],MAT_LOCAL,&info); 604 else ierr = MatGetInfo(Aarr[level1],MAT_GLOBAL_SUM,&info); 605 CHKERRQ(ierr); 606 nnztot += info.nz_used; 607 } 608 } /* levels */ 609 610 if( pc_gamg->data ) { 611 ierr = PetscFree( pc_gamg->data ); CHKERRQ( ierr ); 612 pc_gamg->data = 0; 613 } 614 615 if (pc_gamg->verbose) PetscPrintf(wcomm,"\t[%d]%s %d levels, grid compexity = %g\n",0,__FUNCT__,level+1,nnztot/nnz0); 616 pc_gamg->Nlevels = level + 1; 617 fine_level = level; 618 ierr = PCMGSetLevels(pc,pc_gamg->Nlevels,PETSC_NULL);CHKERRQ(ierr); 619 620 if( pc_gamg->Nlevels > 1 ) { /* don't setup MG if */ 621 /* set default smoothers */ 622 for ( lidx = 1, level = pc_gamg->Nlevels-2; 623 lidx <= fine_level; 624 lidx++, level--) { 625 PetscReal emax, emin; 626 KSP smoother; PC subpc; 627 PetscBool isCheb; 628 /* set defaults */ 629 ierr = PCMGGetSmoother( pc, lidx, &smoother ); CHKERRQ(ierr); 630 ierr = KSPSetType( smoother, KSPCHEBYCHEV );CHKERRQ(ierr); 631 ierr = KSPGetPC( smoother, &subpc ); CHKERRQ(ierr); 632 /* ierr = KSPSetTolerances(smoother,PETSC_DEFAULT,PETSC_DEFAULT,PETSC_DEFAULT,2); CHKERRQ(ierr); */ 633 ierr = PCSetType( subpc, PCJACOBI ); CHKERRQ(ierr); 634 ierr = KSPSetNormType( smoother, KSP_NORM_NONE ); CHKERRQ(ierr); 635 /* overide defaults with input parameters */ 636 ierr = KSPSetFromOptions( smoother ); CHKERRQ(ierr); 637 638 ierr = KSPSetOperators( smoother, Aarr[level], Aarr[level], SAME_NONZERO_PATTERN ); CHKERRQ(ierr); 639 /* do my own cheby */ 640 ierr = PetscTypeCompare( (PetscObject)smoother, KSPCHEBYCHEV, &isCheb ); CHKERRQ(ierr); 641 642 if( isCheb ) { 643 ierr = PetscTypeCompare( (PetscObject)subpc, PCJACOBI, &isCheb ); CHKERRQ(ierr); 644 if( isCheb && emaxs[level] > 0.0 ) emax=emaxs[level]; /* eigen estimate only for diagnal PC */ 645 else{ /* eigen estimate 'emax' */ 646 KSP eksp; Mat Lmat = Aarr[level]; 647 Vec bb, xx; 648 649 ierr = MatGetVecs( Lmat, &bb, 0 ); CHKERRQ(ierr); 650 ierr = MatGetVecs( Lmat, &xx, 0 ); CHKERRQ(ierr); 651 { 652 PetscRandom rctx; 653 ierr = PetscRandomCreate(wcomm,&rctx);CHKERRQ(ierr); 654 ierr = PetscRandomSetFromOptions(rctx);CHKERRQ(ierr); 655 ierr = VecSetRandom(bb,rctx);CHKERRQ(ierr); 656 ierr = PetscRandomDestroy( &rctx ); CHKERRQ(ierr); 657 } 658 ierr = KSPCreate(wcomm,&eksp);CHKERRQ(ierr); 659 ierr = KSPSetTolerances( eksp, PETSC_DEFAULT, PETSC_DEFAULT, PETSC_DEFAULT, 10 ); 660 CHKERRQ(ierr); 661 ierr = KSPSetNormType( eksp, KSP_NORM_NONE ); CHKERRQ(ierr); 662 663 ierr = KSPAppendOptionsPrefix( eksp, "est_"); CHKERRQ(ierr); 664 ierr = KSPSetFromOptions( eksp ); CHKERRQ(ierr); 665 666 ierr = KSPSetInitialGuessNonzero( eksp, PETSC_FALSE ); CHKERRQ(ierr); 667 ierr = KSPSetOperators( eksp, Lmat, Lmat, SAME_NONZERO_PATTERN ); CHKERRQ( ierr ); 668 ierr = KSPSetComputeSingularValues( eksp,PETSC_TRUE ); CHKERRQ(ierr); 669 670 { /* set PC type to be same as smoother - does not get all parameters!!! */ 671 const PCType type; PC pc; 672 ierr = PCGetType( subpc, &type ); CHKERRQ(ierr); 673 ierr = KSPGetPC( eksp, &pc );CHKERRQ( ierr ); 674 ierr = PCSetType( pc, type ); CHKERRQ(ierr); 675 } 676 677 /* solve - keep stuff out of logging */ 678 ierr = PetscLogEventDeactivate(KSP_Solve);CHKERRQ(ierr); 679 ierr = PetscLogEventDeactivate(PC_Apply);CHKERRQ(ierr); 680 ierr = KSPSolve( eksp, bb, xx ); CHKERRQ(ierr); 681 ierr = PetscLogEventActivate(KSP_Solve);CHKERRQ(ierr); 682 ierr = PetscLogEventActivate(PC_Apply);CHKERRQ(ierr); 683 684 ierr = KSPComputeExtremeSingularValues( eksp, &emax, &emin ); CHKERRQ(ierr); 685 686 ierr = VecDestroy( &xx ); CHKERRQ(ierr); 687 ierr = VecDestroy( &bb ); CHKERRQ(ierr); 688 ierr = KSPDestroy( &eksp ); CHKERRQ(ierr); 689 690 if (pc_gamg->verbose) { 691 PetscPrintf(wcomm,"\t\t\t%s PC setup max eigen=%e min=%e\n",__FUNCT__,emax,emin); 692 } 693 } 694 { 695 PetscInt N1, N0, tt; 696 ierr = MatGetSize( Aarr[level], &N1, &tt ); CHKERRQ(ierr); 697 ierr = MatGetSize( Aarr[level+1], &N0, &tt ); CHKERRQ(ierr); 698 /* heuristic - is this crap? */ 699 emin = 1.*emax/((PetscReal)N1/(PetscReal)N0); 700 emax *= 1.05; 701 } 702 ierr = KSPChebychevSetEigenvalues( smoother, emax, emin );CHKERRQ(ierr); 703 } 704 } 705 { 706 /* coarse grid */ 707 KSP smoother,*k2; PC subpc,pc2; PetscInt ii,first; 708 Mat Lmat = Aarr[pc_gamg->Nlevels-1]; 709 ierr = PCMGGetSmoother( pc, 0, &smoother ); CHKERRQ(ierr); 710 ierr = KSPSetOperators( smoother, Lmat, Lmat, SAME_NONZERO_PATTERN ); CHKERRQ(ierr); 711 ierr = KSPSetNormType( smoother, KSP_NORM_NONE ); CHKERRQ(ierr); 712 ierr = KSPGetPC( smoother, &subpc ); CHKERRQ(ierr); 713 ierr = PCSetType( subpc, PCBJACOBI ); CHKERRQ(ierr); 714 ierr = PCSetUp( subpc ); CHKERRQ(ierr); 715 ierr = PCBJacobiGetSubKSP(subpc,&ii,&first,&k2);CHKERRQ(ierr); 716 assert(ii==1); 717 ierr = KSPGetPC(k2[0],&pc2);CHKERRQ(ierr); 718 ierr = PCSetType( pc2, PCLU ); CHKERRQ(ierr); 719 } 720 721 /* should be called in PCSetFromOptions_GAMG(), but cannot be called prior to PCMGSetLevels() */ 722 ierr = PetscObjectOptionsBegin((PetscObject)pc);CHKERRQ(ierr); 723 ierr = PCSetFromOptions_MG(pc); CHKERRQ(ierr); 724 ierr = PetscOptionsEnd();CHKERRQ(ierr); 725 if (mg->galerkin != 2) SETERRQ(wcomm,PETSC_ERR_USER,"GAMG does Galerkin manually so the -pc_mg_galerkin option must not be used."); 726 727 /* set interpolation between the levels, clean up */ 728 for (lidx=0,level=pc_gamg->Nlevels-1; 729 lidx<fine_level; 730 lidx++, level--){ 731 ierr = PCMGSetInterpolation( pc, lidx+1, Parr[level] );CHKERRQ(ierr); 732 ierr = MatDestroy( &Parr[level] ); CHKERRQ(ierr); 733 ierr = MatDestroy( &Aarr[level] ); CHKERRQ(ierr); 734 } 735 736 /* setupcalled is set to 0 so that MG is setup from scratch (needed?) */ 737 pc->setupcalled = 0; 738 ierr = PCSetUp_MG( pc );CHKERRQ( ierr ); 739 pc->setupcalled = 1; /* use 1 as signal that this has not been re-setup */ 740 741 { 742 KSP smoother; /* PCSetUp_MG seems to insists on setting this to GMRES on coarse grid */ 743 ierr = PCMGGetSmoother( pc, 0, &smoother ); CHKERRQ(ierr); 744 ierr = KSPSetType( smoother, KSPPREONLY ); CHKERRQ(ierr); 745 ierr = KSPSetUp( smoother ); CHKERRQ(ierr); 746 } 747 } 748 else { 749 KSP smoother; 750 if (pc_gamg->verbose) PetscPrintf(wcomm,"\t[%d]%s one level solver used (system is seen as DD). Using default solver.\n",mype,__FUNCT__); 751 ierr = PCMGGetSmoother( pc, 0, &smoother ); CHKERRQ(ierr); 752 ierr = KSPSetOperators( smoother, Aarr[0], Aarr[0], SAME_NONZERO_PATTERN ); CHKERRQ(ierr); 753 ierr = KSPSetType( smoother, KSPPREONLY ); CHKERRQ(ierr); 754 /* setupcalled is set to 0 so that MG is setup from scratch */ 755 pc->setupcalled = 0; 756 ierr = PCSetUp_MG( pc );CHKERRQ( ierr ); 757 pc->setupcalled = 1; /* use 1 as signal that this has not been re-setup */ 758 } 759 PetscFunctionReturn(0); 760 } 761 762 /* ------------------------------------------------------------------------- */ 763 /* 764 PCDestroy_GAMG - Destroys the private context for the GAMG preconditioner 765 that was created with PCCreate_GAMG(). 766 767 Input Parameter: 768 . pc - the preconditioner context 769 770 Application Interface Routine: PCDestroy() 771 */ 772 #undef __FUNCT__ 773 #define __FUNCT__ "PCDestroy_GAMG" 774 PetscErrorCode PCDestroy_GAMG( PC pc ) 775 { 776 PetscErrorCode ierr; 777 PC_MG *mg = (PC_MG*)pc->data; 778 PC_GAMG *pc_gamg= (PC_GAMG*)mg->innerctx; 779 780 PetscFunctionBegin; 781 ierr = PCReset_GAMG( pc );CHKERRQ(ierr); 782 ierr = PetscFree( pc_gamg );CHKERRQ(ierr); 783 ierr = PCDestroy_MG( pc );CHKERRQ(ierr); 784 PetscFunctionReturn(0); 785 } 786 787 788 #undef __FUNCT__ 789 #define __FUNCT__ "PCGAMGSetProcEqLim" 790 /*@ 791 PCGAMGSetProcEqLim - Set number of equations to aim for on coarse grids via 792 processor reduction. 793 794 Not Collective on PC 795 796 Input Parameters: 797 . pc - the preconditioner context 798 799 800 Options Database Key: 801 . -pc_gamg_process_eq_limit 802 803 Level: intermediate 804 805 Concepts: Unstructured multrigrid preconditioner 806 807 .seealso: () 808 @*/ 809 PetscErrorCode PCGAMGSetProcEqLim(PC pc, PetscInt n) 810 { 811 PetscErrorCode ierr; 812 813 PetscFunctionBegin; 814 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 815 ierr = PetscTryMethod(pc,"PCGAMGSetProcEqLim_C",(PC,PetscInt),(pc,n));CHKERRQ(ierr); 816 PetscFunctionReturn(0); 817 } 818 819 EXTERN_C_BEGIN 820 #undef __FUNCT__ 821 #define __FUNCT__ "PCGAMGSetProcEqLim_GAMG" 822 PetscErrorCode PCGAMGSetProcEqLim_GAMG(PC pc, PetscInt n) 823 { 824 PC_MG *mg = (PC_MG*)pc->data; 825 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 826 827 PetscFunctionBegin; 828 if(n>0) pc_gamg->min_eq_proc = n; 829 PetscFunctionReturn(0); 830 } 831 EXTERN_C_END 832 833 #undef __FUNCT__ 834 #define __FUNCT__ "PCGAMGSetCoarseEqLim" 835 /*@ 836 PCGAMGSetCoarseEqLim - Set max number of equations on coarse grids. 837 838 Collective on PC 839 840 Input Parameters: 841 . pc - the preconditioner context 842 843 844 Options Database Key: 845 . -pc_gamg_coarse_eq_limit 846 847 Level: intermediate 848 849 Concepts: Unstructured multrigrid preconditioner 850 851 .seealso: () 852 @*/ 853 PetscErrorCode PCGAMGSetCoarseEqLim(PC pc, PetscInt n) 854 { 855 PetscErrorCode ierr; 856 857 PetscFunctionBegin; 858 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 859 ierr = PetscTryMethod(pc,"PCGAMGSetCoarseEqLim_C",(PC,PetscInt),(pc,n));CHKERRQ(ierr); 860 PetscFunctionReturn(0); 861 } 862 863 EXTERN_C_BEGIN 864 #undef __FUNCT__ 865 #define __FUNCT__ "PCGAMGSetCoarseEqLim_GAMG" 866 PetscErrorCode PCGAMGSetCoarseEqLim_GAMG(PC pc, PetscInt n) 867 { 868 PC_MG *mg = (PC_MG*)pc->data; 869 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 870 871 PetscFunctionBegin; 872 if(n>0) pc_gamg->coarse_eq_limit = n; 873 PetscFunctionReturn(0); 874 } 875 EXTERN_C_END 876 877 #undef __FUNCT__ 878 #define __FUNCT__ "PCGAMGSetRepartitioning" 879 /*@ 880 PCGAMGSetRepartitioning - Repartition the coarse grids 881 882 Collective on PC 883 884 Input Parameters: 885 . pc - the preconditioner context 886 887 888 Options Database Key: 889 . -pc_gamg_repartition 890 891 Level: intermediate 892 893 Concepts: Unstructured multrigrid preconditioner 894 895 .seealso: () 896 @*/ 897 PetscErrorCode PCGAMGSetRepartitioning(PC pc, PetscBool n) 898 { 899 PetscErrorCode ierr; 900 901 PetscFunctionBegin; 902 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 903 ierr = PetscTryMethod(pc,"PCGAMGSetRepartitioning_C",(PC,PetscBool),(pc,n));CHKERRQ(ierr); 904 PetscFunctionReturn(0); 905 } 906 907 EXTERN_C_BEGIN 908 #undef __FUNCT__ 909 #define __FUNCT__ "PCGAMGSetRepartitioning_GAMG" 910 PetscErrorCode PCGAMGSetRepartitioning_GAMG(PC pc, PetscBool n) 911 { 912 PC_MG *mg = (PC_MG*)pc->data; 913 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 914 915 PetscFunctionBegin; 916 pc_gamg->repart = n; 917 PetscFunctionReturn(0); 918 } 919 EXTERN_C_END 920 921 #undef __FUNCT__ 922 #define __FUNCT__ "PCGAMGSetNlevels" 923 /*@ 924 PCGAMGSetNlevels - 925 926 Not collective on PC 927 928 Input Parameters: 929 . pc - the preconditioner context 930 931 932 Options Database Key: 933 . -pc_mg_levels 934 935 Level: intermediate 936 937 Concepts: Unstructured multrigrid preconditioner 938 939 .seealso: () 940 @*/ 941 PetscErrorCode PCGAMGSetNlevels(PC pc, PetscInt n) 942 { 943 PetscErrorCode ierr; 944 945 PetscFunctionBegin; 946 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 947 ierr = PetscTryMethod(pc,"PCGAMGSetNlevels_C",(PC,PetscInt),(pc,n));CHKERRQ(ierr); 948 PetscFunctionReturn(0); 949 } 950 951 EXTERN_C_BEGIN 952 #undef __FUNCT__ 953 #define __FUNCT__ "PCGAMGSetNlevels_GAMG" 954 PetscErrorCode PCGAMGSetNlevels_GAMG(PC pc, PetscInt n) 955 { 956 PC_MG *mg = (PC_MG*)pc->data; 957 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 958 959 PetscFunctionBegin; 960 pc_gamg->Nlevels = n; 961 PetscFunctionReturn(0); 962 } 963 EXTERN_C_END 964 965 #undef __FUNCT__ 966 #define __FUNCT__ "PCGAMGSetThreshold" 967 /*@ 968 PCGAMGSetThreshold - Relative threshold to use for dropping edges in aggregation graph 969 970 Not collective on PC 971 972 Input Parameters: 973 . pc - the preconditioner context 974 975 976 Options Database Key: 977 . -pc_gamg_threshold 978 979 Level: intermediate 980 981 Concepts: Unstructured multrigrid preconditioner 982 983 .seealso: () 984 @*/ 985 PetscErrorCode PCGAMGSetThreshold(PC pc, PetscReal n) 986 { 987 PetscErrorCode ierr; 988 989 PetscFunctionBegin; 990 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 991 ierr = PetscTryMethod(pc,"PCGAMGSetThreshold_C",(PC,PetscReal),(pc,n));CHKERRQ(ierr); 992 PetscFunctionReturn(0); 993 } 994 995 EXTERN_C_BEGIN 996 #undef __FUNCT__ 997 #define __FUNCT__ "PCGAMGSetThreshold_GAMG" 998 PetscErrorCode PCGAMGSetThreshold_GAMG(PC pc, PetscReal n) 999 { 1000 PC_MG *mg = (PC_MG*)pc->data; 1001 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 1002 1003 PetscFunctionBegin; 1004 pc_gamg->threshold = n; 1005 PetscFunctionReturn(0); 1006 } 1007 EXTERN_C_END 1008 1009 #undef __FUNCT__ 1010 #define __FUNCT__ "PCGAMGSetType" 1011 /*@ 1012 PCGAMGSetType - Set solution method - calls sub create method 1013 1014 Collective on PC 1015 1016 Input Parameters: 1017 . pc - the preconditioner context 1018 1019 1020 Options Database Key: 1021 . -pc_gamg_type 1022 1023 Level: intermediate 1024 1025 Concepts: Unstructured multrigrid preconditioner 1026 1027 .seealso: () 1028 @*/ 1029 PetscErrorCode PCGAMGSetType( PC pc, const PCGAMGType type ) 1030 { 1031 PetscErrorCode ierr; 1032 1033 PetscFunctionBegin; 1034 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 1035 ierr = PetscTryMethod(pc,"PCGAMGSetType_C",(PC,const PCGAMGType),(pc,type)); 1036 CHKERRQ(ierr); 1037 PetscFunctionReturn(0); 1038 } 1039 1040 EXTERN_C_BEGIN 1041 #undef __FUNCT__ 1042 #define __FUNCT__ "PCGAMGSetType_GAMG" 1043 PetscErrorCode PCGAMGSetType_GAMG( PC pc, const PCGAMGType type ) 1044 { 1045 PetscErrorCode ierr,(*r)(PC); 1046 1047 PetscFunctionBegin; 1048 ierr = PetscFListFind(GAMGList,((PetscObject)pc)->comm,type,PETSC_FALSE,(PetscVoidStarFunction)&r); 1049 CHKERRQ(ierr); 1050 1051 if (!r) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_ARG_UNKNOWN_TYPE,"Unknown GAMG type %s given",type); 1052 1053 /* call sub create method */ 1054 ierr = (*r)(pc); CHKERRQ(ierr); 1055 1056 PetscFunctionReturn(0); 1057 } 1058 EXTERN_C_END 1059 1060 #undef __FUNCT__ 1061 #define __FUNCT__ "PCSetFromOptions_GAMG" 1062 PetscErrorCode PCSetFromOptions_GAMG( PC pc ) 1063 { 1064 PetscErrorCode ierr; 1065 PC_MG *mg = (PC_MG*)pc->data; 1066 PC_GAMG *pc_gamg = (PC_GAMG*)mg->innerctx; 1067 PetscBool flag; 1068 MPI_Comm wcomm = ((PetscObject)pc)->comm; 1069 1070 PetscFunctionBegin; 1071 ierr = PetscOptionsHead("GAMG options"); CHKERRQ(ierr); 1072 { 1073 /* -pc_gamg_verbose */ 1074 ierr = PetscOptionsInt("-pc_gamg_verbose","Verbose (debugging) output for PCGAMG", 1075 "none", pc_gamg->verbose, 1076 &pc_gamg->verbose, PETSC_NULL ); 1077 CHKERRQ(ierr); 1078 1079 /* -pc_gamg_repartition */ 1080 ierr = PetscOptionsBool("-pc_gamg_repartition", 1081 "Repartion coarse grids (false)", 1082 "PCGAMGRepartitioning", 1083 pc_gamg->repart, 1084 &pc_gamg->repart, 1085 &flag); 1086 CHKERRQ(ierr); 1087 1088 /* -pc_gamg_process_eq_limit */ 1089 ierr = PetscOptionsInt("-pc_gamg_process_eq_limit", 1090 "Limit (goal) on number of equations per process on coarse grids", 1091 "PCGAMGSetProcEqLim", 1092 pc_gamg->min_eq_proc, 1093 &pc_gamg->min_eq_proc, 1094 &flag ); 1095 CHKERRQ(ierr); 1096 1097 /* -pc_gamg_coarse_eq_limit */ 1098 ierr = PetscOptionsInt("-pc_gamg_coarse_eq_limit", 1099 "Limit on number of equations for the coarse grid", 1100 "PCGAMGSetCoarseEqLim", 1101 pc_gamg->coarse_eq_limit, 1102 &pc_gamg->coarse_eq_limit, 1103 &flag ); 1104 CHKERRQ(ierr); 1105 1106 /* -pc_gamg_threshold */ 1107 ierr = PetscOptionsReal("-pc_gamg_threshold", 1108 "Relative threshold to use for dropping edges in aggregation graph", 1109 "PCGAMGSetThreshold", 1110 pc_gamg->threshold, 1111 &pc_gamg->threshold, 1112 &flag ); 1113 CHKERRQ(ierr); 1114 if(flag && pc_gamg->verbose) PetscPrintf(wcomm,"\t[%d]%s threshold set %e\n",0,__FUNCT__,pc_gamg->threshold); 1115 1116 ierr = PetscOptionsInt("-pc_mg_levels", 1117 "Set number of MG levels", 1118 "PCGAMGSetNlevels", 1119 pc_gamg->Nlevels, 1120 &pc_gamg->Nlevels, 1121 &flag ); 1122 } 1123 ierr = PetscOptionsTail();CHKERRQ(ierr); 1124 1125 PetscFunctionReturn(0); 1126 } 1127 1128 /* -------------------------------------------------------------------------- */ 1129 /*MC 1130 PCCreate_GAMG - Geometric algebraic multigrid (AMG) preconditioning framework. 1131 - This is the entry point to GAMG, registered in pcregis.c 1132 1133 Options Database Keys: 1134 Multigrid options(inherited) 1135 + -pc_mg_cycles <1>: 1 for V cycle, 2 for W-cycle (PCMGSetCycleType) 1136 . -pc_mg_smoothup <1>: Number of post-smoothing steps (PCMGSetNumberSmoothUp) 1137 . -pc_mg_smoothdown <1>: Number of pre-smoothing steps (PCMGSetNumberSmoothDown) 1138 - -pc_mg_type <multiplicative>: (one of) additive multiplicative full cascade kascade 1139 1140 Level: intermediate 1141 1142 Concepts: multigrid 1143 1144 .seealso: PCCreate(), PCSetType(), PCType (for list of available types), PC, PCMGType, 1145 PCMGSetLevels(), PCMGGetLevels(), PCMGSetType(), PCMGSetCycleType(), PCMGSetNumberSmoothDown(), 1146 PCMGSetNumberSmoothUp(), PCMGGetCoarseSolve(), PCMGSetResidual(), PCMGSetInterpolation(), 1147 PCMGSetRestriction(), PCMGGetSmoother(), PCMGGetSmootherUp(), PCMGGetSmootherDown(), 1148 PCMGSetCyclesOnLevel(), PCMGSetRhs(), PCMGSetX(), PCMGSetR() 1149 M*/ 1150 EXTERN_C_BEGIN 1151 #undef __FUNCT__ 1152 #define __FUNCT__ "PCCreate_GAMG" 1153 PetscErrorCode PCCreate_GAMG( PC pc ) 1154 { 1155 PetscErrorCode ierr; 1156 PC_GAMG *pc_gamg; 1157 PC_MG *mg; 1158 PetscClassId cookie; 1159 1160 #if defined PETSC_USE_LOG 1161 static long count = 0; 1162 #endif 1163 1164 PetscFunctionBegin; 1165 /* PCGAMG is an inherited class of PCMG. Initialize pc as PCMG */ 1166 ierr = PCSetType( pc, PCMG ); CHKERRQ(ierr); /* calls PCCreate_MG() and MGCreate_Private() */ 1167 ierr = PetscObjectChangeTypeName( (PetscObject)pc, PCGAMG ); CHKERRQ(ierr); 1168 1169 /* create a supporting struct and attach it to pc */ 1170 ierr = PetscNewLog( pc, PC_GAMG, &pc_gamg ); CHKERRQ(ierr); 1171 mg = (PC_MG*)pc->data; 1172 mg->galerkin = 2; /* Use Galerkin, but it is computed externally */ 1173 mg->innerctx = pc_gamg; 1174 1175 pc_gamg->setup_count = 0; 1176 /* these should be in subctx but repartitioning needs simple arrays */ 1177 pc_gamg->data_sz = 0; 1178 pc_gamg->data = 0; 1179 1180 /* register AMG type */ 1181 if( !GAMGList ){ 1182 ierr = PetscFListAdd(&GAMGList,GAMGGEO,"PCCreateGAMG_GEO",(void(*)(void))PCCreateGAMG_GEO);CHKERRQ(ierr); 1183 ierr = PetscFListAdd(&GAMGList,GAMGAGG,"PCCreateGAMG_AGG",(void(*)(void))PCCreateGAMG_AGG);CHKERRQ(ierr); 1184 } 1185 1186 /* overwrite the pointers of PCMG by the functions of base class PCGAMG */ 1187 pc->ops->setfromoptions = PCSetFromOptions_GAMG; 1188 pc->ops->setup = PCSetUp_GAMG; 1189 pc->ops->reset = PCReset_GAMG; 1190 pc->ops->destroy = PCDestroy_GAMG; 1191 1192 ierr = PetscObjectComposeFunctionDynamic( (PetscObject)pc, 1193 "PCGAMGSetProcEqLim_C", 1194 "PCGAMGSetProcEqLim_GAMG", 1195 PCGAMGSetProcEqLim_GAMG); 1196 CHKERRQ(ierr); 1197 1198 ierr = PetscObjectComposeFunctionDynamic( (PetscObject)pc, 1199 "PCGAMGSetCoarseEqLim_C", 1200 "PCGAMGSetCoarseEqLim_GAMG", 1201 PCGAMGSetCoarseEqLim_GAMG); 1202 CHKERRQ(ierr); 1203 1204 ierr = PetscObjectComposeFunctionDynamic( (PetscObject)pc, 1205 "PCGAMGSetRepartitioning_C", 1206 "PCGAMGSetRepartitioning_GAMG", 1207 PCGAMGSetRepartitioning_GAMG); 1208 CHKERRQ(ierr); 1209 1210 ierr = PetscObjectComposeFunctionDynamic( (PetscObject)pc, 1211 "PCGAMGSetThreshold_C", 1212 "PCGAMGSetThreshold_GAMG", 1213 PCGAMGSetThreshold_GAMG); 1214 CHKERRQ(ierr); 1215 1216 ierr = PetscObjectComposeFunctionDynamic( (PetscObject)pc, 1217 "PCGAMGSetType_C", 1218 "PCGAMGSetType_GAMG", 1219 PCGAMGSetType_GAMG); 1220 CHKERRQ(ierr); 1221 1222 pc_gamg->repart = PETSC_FALSE; 1223 pc_gamg->min_eq_proc = 100; 1224 pc_gamg->coarse_eq_limit = 800; 1225 pc_gamg->threshold = 0.05; 1226 pc_gamg->Nlevels = GAMG_MAXLEVELS; 1227 pc_gamg->verbose = 0; 1228 pc_gamg->emax_id = -1; 1229 pc_gamg->col_bs_id = -1; 1230 1231 /* instantiate derived type */ 1232 ierr = PetscOptionsHead("GAMG options"); CHKERRQ(ierr); 1233 { 1234 char tname[256] = GAMGAGG; 1235 ierr = PetscOptionsList("-pc_gamg_type","Type of GAMG method","PCGAMGSetType", 1236 GAMGList, tname, tname, sizeof(tname), PETSC_NULL ); 1237 CHKERRQ(ierr); 1238 ierr = PCGAMGSetType( pc, tname ); CHKERRQ(ierr); 1239 } 1240 ierr = PetscOptionsTail();CHKERRQ(ierr); 1241 1242 #if defined PETSC_USE_LOG 1243 if( count++ == 0 ) { 1244 PetscClassIdRegister("GAMG Setup",&cookie); 1245 PetscLogEventRegister("GAMG: createProl", cookie, &gamg_setup_events[SET1]); 1246 PetscLogEventRegister(" Graph", cookie, &gamg_setup_events[GRAPH]); 1247 /* PetscLogEventRegister(" G.Mat", cookie, &gamg_setup_events[GRAPH_MAT]); */ 1248 /* PetscLogEventRegister(" G.Filter", cookie, &gamg_setup_events[GRAPH_FILTER]); */ 1249 /* PetscLogEventRegister(" G.Square", cookie, &gamg_setup_events[GRAPH_SQR]); */ 1250 PetscLogEventRegister(" MIS/Agg", cookie, &gamg_setup_events[SET4]); 1251 PetscLogEventRegister(" geo: growSupp", cookie, &gamg_setup_events[SET5]); 1252 PetscLogEventRegister(" geo: triangle", cookie, &gamg_setup_events[SET6]); 1253 PetscLogEventRegister(" search&set", cookie, &gamg_setup_events[FIND_V]); 1254 PetscLogEventRegister(" SA: colect data", cookie, &gamg_setup_events[SET7]); 1255 PetscLogEventRegister(" SA: frmProl0", cookie, &gamg_setup_events[SET8]); 1256 PetscLogEventRegister(" SA: smooth", cookie, &gamg_setup_events[SET9]); 1257 PetscLogEventRegister("GAMG: partLevel", cookie, &gamg_setup_events[SET2]); 1258 PetscLogEventRegister(" repartition", cookie, &gamg_setup_events[SET12]); 1259 PetscLogEventRegister(" Invert-Sort", cookie, &gamg_setup_events[SET13]); 1260 PetscLogEventRegister(" Move A", cookie, &gamg_setup_events[SET14]); 1261 PetscLogEventRegister(" Move P", cookie, &gamg_setup_events[SET15]); 1262 1263 /* PetscLogEventRegister(" PL move data", cookie, &gamg_setup_events[SET13]); */ 1264 /* PetscLogEventRegister("GAMG: fix", cookie, &gamg_setup_events[SET10]); */ 1265 /* PetscLogEventRegister("GAMG: set levels", cookie, &gamg_setup_events[SET11]); */ 1266 /* create timer stages */ 1267 #if defined GAMG_STAGES 1268 { 1269 char str[32]; 1270 sprintf(str,"MG Level %d (finest)",0); 1271 PetscLogStageRegister(str, &gamg_stages[0]); 1272 PetscInt lidx; 1273 for (lidx=1;lidx<9;lidx++){ 1274 sprintf(str,"MG Level %d",lidx); 1275 PetscLogStageRegister(str, &gamg_stages[lidx]); 1276 } 1277 } 1278 #endif 1279 } 1280 #endif 1281 PetscFunctionReturn(0); 1282 } 1283 EXTERN_C_END 1284