Actual source code: pcis.c

  1: #define PETSCKSP_DLL

 3:  #include ../src/ksp/pc/impls/is/pcis.h

  5: /* -------------------------------------------------------------------------- */
  6: /*
  7:    PCISSetUp - 
  8: */
 11: PetscErrorCode  PCISSetUp(PC pc)
 12: {
 13:   PC_IS           *pcis = (PC_IS*)(pc->data);
 14:   Mat_IS          *matis = (Mat_IS*)pc->mat->data;
 15:   PetscInt        i;
 16:   PetscErrorCode  ierr;
 17:   PetscTruth      flg;
 18: 
 20:   PetscTypeCompare((PetscObject)pc->mat,MATIS,&flg);
 21:   if (!flg){
 22:     SETERRQ(PETSC_ERR_ARG_WRONG,"Preconditioner type of Neumann Neumman requires matrix of type MATIS");
 23:   }

 25:   pcis->pure_neumann = matis->pure_neumann;

 27:   /*
 28:     Creating the local vector vec1_N, containing the inverse of the number
 29:     of subdomains to which each local node (either owned or ghost)
 30:     pertains. To accomplish that, we scatter local vectors of 1's to
 31:     a global vector (adding the values); scatter the result back to
 32:     local vectors and finally invert the result.
 33:   */
 34:   {
 35:     Vec    counter;
 36:     VecDuplicate(matis->x,&pcis->vec1_N);
 37:     MatGetVecs(pc->pmat,&counter,0); /* temporary auxiliar vector */
 38:     VecSet(counter,0.0);
 39:     VecSet(pcis->vec1_N,1.0);
 40:     VecScatterBegin(matis->ctx,pcis->vec1_N,counter,ADD_VALUES,SCATTER_REVERSE);
 41:     VecScatterEnd  (matis->ctx,pcis->vec1_N,counter,ADD_VALUES,SCATTER_REVERSE);
 42:     VecScatterBegin(matis->ctx,counter,pcis->vec1_N,INSERT_VALUES,SCATTER_FORWARD);
 43:     VecScatterEnd  (matis->ctx,counter,pcis->vec1_N,INSERT_VALUES,SCATTER_FORWARD);
 44:     VecDestroy(counter);
 45:   }
 46:   /*
 47:     Creating local and global index sets for interior and
 48:     inteface nodes. Notice that interior nodes have D[i]==1.0.
 49:   */
 50:   {
 51:     PetscInt     n_I;
 52:     PetscInt    *idx_I_local,*idx_B_local,*idx_I_global,*idx_B_global;
 53:     PetscScalar *array;
 54:     /* Identifying interior and interface nodes, in local numbering */
 55:     VecGetSize(pcis->vec1_N,&pcis->n);
 56:     VecGetArray(pcis->vec1_N,&array);
 57:     PetscMalloc(pcis->n*sizeof(PetscInt),&idx_I_local);
 58:     PetscMalloc(pcis->n*sizeof(PetscInt),&idx_B_local);
 59:     for (i=0, pcis->n_B=0, n_I=0; i<pcis->n; i++) {
 60:       if (array[i] == 1.0) { idx_I_local[n_I]       = i; n_I++;       }
 61:       else                 { idx_B_local[pcis->n_B] = i; pcis->n_B++; }
 62:     }
 63:     /* Getting the global numbering */
 64:     idx_B_global = idx_I_local + n_I; /* Just avoiding allocating extra memory, since we have vacant space */
 65:     idx_I_global = idx_B_local + pcis->n_B;
 66:     ISLocalToGlobalMappingApply(matis->mapping,pcis->n_B,idx_B_local,idx_B_global);
 67:     ISLocalToGlobalMappingApply(matis->mapping,n_I,      idx_I_local,idx_I_global);
 68:     /* Creating the index sets. */
 69:     ISCreateGeneral(MPI_COMM_SELF,pcis->n_B,idx_B_local, &pcis->is_B_local);
 70:     ISCreateGeneral(MPI_COMM_SELF,pcis->n_B,idx_B_global,&pcis->is_B_global);
 71:     ISCreateGeneral(MPI_COMM_SELF,n_I      ,idx_I_local, &pcis->is_I_local);
 72:     ISCreateGeneral(MPI_COMM_SELF,n_I      ,idx_I_global,&pcis->is_I_global);
 73:     /* Freeing memory and restoring arrays */
 74:     PetscFree(idx_B_local);
 75:     PetscFree(idx_I_local);
 76:     VecRestoreArray(pcis->vec1_N,&array);
 77:   }

 79:   /*
 80:     Extracting the blocks A_II, A_BI, A_IB and A_BB from A. If the numbering
 81:     is such that interior nodes come first than the interface ones, we have

 83:     [           |      ]
 84:     [    A_II   | A_IB ]
 85:     A = [           |      ]
 86:     [-----------+------]
 87:     [    A_BI   | A_BB ]
 88:   */

 90:   MatGetSubMatrix(matis->A,pcis->is_I_local,pcis->is_I_local,PETSC_DECIDE,MAT_INITIAL_MATRIX,&pcis->A_II);
 91:   MatGetSubMatrix(matis->A,pcis->is_I_local,pcis->is_B_local,PETSC_DECIDE,MAT_INITIAL_MATRIX,&pcis->A_IB);
 92:   MatGetSubMatrix(matis->A,pcis->is_B_local,pcis->is_I_local,PETSC_DECIDE,MAT_INITIAL_MATRIX,&pcis->A_BI);
 93:   MatGetSubMatrix(matis->A,pcis->is_B_local,pcis->is_B_local,PETSC_DECIDE,MAT_INITIAL_MATRIX,&pcis->A_BB);

 95:   /*
 96:     Creating work vectors and arrays
 97:   */
 98:   /* pcis->vec1_N has already been created */
 99:   VecDuplicate(pcis->vec1_N,&pcis->vec2_N);
100:   VecCreateSeq(PETSC_COMM_SELF,pcis->n-pcis->n_B,&pcis->vec1_D);
101:   VecDuplicate(pcis->vec1_D,&pcis->vec2_D);
102:   VecDuplicate(pcis->vec1_D,&pcis->vec3_D);
103:   VecCreateSeq(PETSC_COMM_SELF,pcis->n_B,&pcis->vec1_B);
104:   VecDuplicate(pcis->vec1_B,&pcis->vec2_B);
105:   VecDuplicate(pcis->vec1_B,&pcis->vec3_B);
106:   MatGetVecs(pc->pmat,&pcis->vec1_global,0);
107:   PetscMalloc((pcis->n)*sizeof(PetscScalar),&pcis->work_N);

109:   /* Creating the scatter contexts */
110:   VecScatterCreate(pcis->vec1_global,pcis->is_I_global,pcis->vec1_D,(IS)0,&pcis->global_to_D);
111:   VecScatterCreate(pcis->vec1_N,pcis->is_B_local,pcis->vec1_B,(IS)0,&pcis->N_to_B);
112:   VecScatterCreate(pcis->vec1_global,pcis->is_B_global,pcis->vec1_B,(IS)0,&pcis->global_to_B);

114:   /* Creating scaling "matrix" D, from information in vec1_N */
115:   VecDuplicate(pcis->vec1_B,&pcis->D);
116:   VecScatterBegin(pcis->N_to_B,pcis->vec1_N,pcis->D,INSERT_VALUES,SCATTER_FORWARD);
117:   VecScatterEnd  (pcis->N_to_B,pcis->vec1_N,pcis->D,INSERT_VALUES,SCATTER_FORWARD);
118:   VecReciprocal(pcis->D);

120:   /* See historical note 01, at the bottom of this file. */

122:   /*
123:     Creating the KSP contexts for the local Dirichlet and Neumann problems.
124:   */
125:   {
126:     PC  pc_ctx;
127:     /* Dirichlet */
128:     KSPCreate(PETSC_COMM_SELF,&pcis->ksp_D);
129:     PetscObjectIncrementTabLevel((PetscObject)pcis->ksp_D,(PetscObject)pc,1);
130:     KSPSetOperators(pcis->ksp_D,pcis->A_II,pcis->A_II,SAME_PRECONDITIONER);
131:     KSPSetOptionsPrefix(pcis->ksp_D,"is_localD_");
132:     KSPGetPC(pcis->ksp_D,&pc_ctx);
133:     PCSetType(pc_ctx,PCLU);
134:     KSPSetType(pcis->ksp_D,KSPPREONLY);
135:     KSPSetFromOptions(pcis->ksp_D);
136:     /* the vectors in the following line are dummy arguments, just telling the KSP the vector size. Values are not used */
137:     KSPSetUp(pcis->ksp_D);
138:     /* Neumann */
139:     KSPCreate(PETSC_COMM_SELF,&pcis->ksp_N);
140:     PetscObjectIncrementTabLevel((PetscObject)pcis->ksp_N,(PetscObject)pc,1);
141:     KSPSetOperators(pcis->ksp_N,matis->A,matis->A,SAME_PRECONDITIONER);
142:     KSPSetOptionsPrefix(pcis->ksp_N,"is_localN_");
143:     KSPGetPC(pcis->ksp_N,&pc_ctx);
144:     PCSetType(pc_ctx,PCLU);
145:     KSPSetType(pcis->ksp_N,KSPPREONLY);
146:     KSPSetFromOptions(pcis->ksp_N);
147:     {
148:       PetscTruth damp_fixed,
149:                  remove_nullspace_fixed,
150:                  set_damping_factor_floating,
151:                  not_damp_floating,
152:                  not_remove_nullspace_floating;
153:       PetscReal  fixed_factor,
154:                  floating_factor;

156:       PetscOptionsGetReal(((PetscObject)pc_ctx)->prefix,"-pc_is_damp_fixed",&fixed_factor,&damp_fixed);
157:       if (!damp_fixed) { fixed_factor = 0.0; }
158:       PetscOptionsHasName(((PetscObject)pc_ctx)->prefix,"-pc_is_damp_fixed",&damp_fixed);

160:       PetscOptionsHasName(((PetscObject)pc_ctx)->prefix,"-pc_is_remove_nullspace_fixed",&remove_nullspace_fixed);

162:       PetscOptionsGetReal(((PetscObject)pc_ctx)->prefix,"-pc_is_set_damping_factor_floating",
163:                               &floating_factor,&set_damping_factor_floating);
164:       if (!set_damping_factor_floating) { floating_factor = 0.0; }
165:       PetscOptionsHasName(((PetscObject)pc_ctx)->prefix,"-pc_is_set_damping_factor_floating",&set_damping_factor_floating);
166:       if (!set_damping_factor_floating) { floating_factor = 1.e-12; }

168:       PetscOptionsHasName(((PetscObject)pc_ctx)->prefix,"-pc_is_not_damp_floating",&not_damp_floating);

170:       PetscOptionsHasName(((PetscObject)pc_ctx)->prefix,"-pc_is_not_remove_nullspace_floating",&not_remove_nullspace_floating);

172:       if (pcis->pure_neumann) {  /* floating subdomain */
173:         if (!(not_damp_floating)) {
174:           PCFactorSetShiftNonzero(pc_ctx,floating_factor);
175:         }
176:         if (!(not_remove_nullspace_floating)){
177:           MatNullSpace nullsp;
178:           MatNullSpaceCreate(PETSC_COMM_SELF,PETSC_TRUE,0,PETSC_NULL,&nullsp);
179:           KSPSetNullSpace(pcis->ksp_N,nullsp);
180:           MatNullSpaceDestroy(nullsp);
181:         }
182:       } else {  /* fixed subdomain */
183:         if (damp_fixed) {
184:           PCFactorSetShiftNonzero(pc_ctx,fixed_factor);
185:         }
186:         if (remove_nullspace_fixed) {
187:           MatNullSpace nullsp;
188:           MatNullSpaceCreate(PETSC_COMM_SELF,PETSC_TRUE,0,PETSC_NULL,&nullsp);
189:           KSPSetNullSpace(pcis->ksp_N,nullsp);
190:           MatNullSpaceDestroy(nullsp);
191:         }
192:       }
193:     }
194:     /* the vectors in the following line are dummy arguments, just telling the KSP the vector size. Values are not used */
195:     KSPSetUp(pcis->ksp_N);
196:   }

198:   ISLocalToGlobalMappingGetInfo(((Mat_IS*)(pc->mat->data))->mapping,&(pcis->n_neigh),&(pcis->neigh),&(pcis->n_shared),&(pcis->shared));
199:   pcis->ISLocalToGlobalMappingGetInfoWasCalled = PETSC_TRUE;
200:   return(0);
201: }

203: /* -------------------------------------------------------------------------- */
204: /*
205:    PCISDestroy -
206: */
209: PetscErrorCode  PCISDestroy(PC pc)
210: {
211:   PC_IS          *pcis = (PC_IS*)(pc->data);

215:   if (pcis->is_B_local)  {ISDestroy(pcis->is_B_local);}
216:   if (pcis->is_I_local)  {ISDestroy(pcis->is_I_local);}
217:   if (pcis->is_B_global) {ISDestroy(pcis->is_B_global);}
218:   if (pcis->is_I_global) {ISDestroy(pcis->is_I_global);}
219:   if (pcis->A_II)        {MatDestroy(pcis->A_II);}
220:   if (pcis->A_IB)        {MatDestroy(pcis->A_IB);}
221:   if (pcis->A_BI)        {MatDestroy(pcis->A_BI);}
222:   if (pcis->A_BB)        {MatDestroy(pcis->A_BB);}
223:   if (pcis->D)           {VecDestroy(pcis->D);}
224:   if (pcis->ksp_N)      {KSPDestroy(pcis->ksp_N);}
225:   if (pcis->ksp_D)      {KSPDestroy(pcis->ksp_D);}
226:   if (pcis->vec1_N)      {VecDestroy(pcis->vec1_N);}
227:   if (pcis->vec2_N)      {VecDestroy(pcis->vec2_N);}
228:   if (pcis->vec1_D)      {VecDestroy(pcis->vec1_D);}
229:   if (pcis->vec2_D)      {VecDestroy(pcis->vec2_D);}
230:   if (pcis->vec3_D)      {VecDestroy(pcis->vec3_D);}
231:   if (pcis->vec1_B)      {VecDestroy(pcis->vec1_B);}
232:   if (pcis->vec2_B)      {VecDestroy(pcis->vec2_B);}
233:   if (pcis->vec3_B)      {VecDestroy(pcis->vec3_B);}
234:   if (pcis->vec1_global) {VecDestroy(pcis->vec1_global);}
235:   if (pcis->global_to_D) {VecScatterDestroy(pcis->global_to_D);}
236:   if (pcis->N_to_B)      {VecScatterDestroy(pcis->N_to_B);}
237:   if (pcis->global_to_B) {VecScatterDestroy(pcis->global_to_B);}
238:   PetscFree(pcis->work_N);
239:   if (pcis->ISLocalToGlobalMappingGetInfoWasCalled) {
240:     ISLocalToGlobalMappingRestoreInfo((ISLocalToGlobalMapping)0,&(pcis->n_neigh),&(pcis->neigh),&(pcis->n_shared),&(pcis->shared));
241:   }
242:   return(0);
243: }

245: /* -------------------------------------------------------------------------- */
246: /*
247:    PCISCreate - 
248: */
251: PetscErrorCode  PCISCreate(PC pc)
252: {
253:   PC_IS *pcis = (PC_IS*)(pc->data);

256:   pcis->is_B_local  = 0;
257:   pcis->is_I_local  = 0;
258:   pcis->is_B_global = 0;
259:   pcis->is_I_global = 0;
260:   pcis->A_II        = 0;
261:   pcis->A_IB        = 0;
262:   pcis->A_BI        = 0;
263:   pcis->A_BB        = 0;
264:   pcis->D           = 0;
265:   pcis->ksp_N      = 0;
266:   pcis->ksp_D      = 0;
267:   pcis->vec1_N      = 0;
268:   pcis->vec2_N      = 0;
269:   pcis->vec1_D      = 0;
270:   pcis->vec2_D      = 0;
271:   pcis->vec3_D      = 0;
272:   pcis->vec1_B      = 0;
273:   pcis->vec2_B      = 0;
274:   pcis->vec3_B      = 0;
275:   pcis->vec1_global = 0;
276:   pcis->work_N      = 0;
277:   pcis->global_to_D = 0;
278:   pcis->N_to_B      = 0;
279:   pcis->global_to_B = 0;
280:   pcis->ISLocalToGlobalMappingGetInfoWasCalled = PETSC_FALSE;
281:   return(0);
282: }

284: /* -------------------------------------------------------------------------- */
285: /*
286:    PCISApplySchur -

288:    Input parameters:
289: .  pc - preconditioner context
290: .  v - vector to which the Schur complement is to be applied (it is NOT modified inside this function, UNLESS vec2_B is null)

292:    Output parameters:
293: .  vec1_B - result of Schur complement applied to chunk
294: .  vec2_B - garbage (used as work space), or null (and v is used as workspace)
295: .  vec1_D - garbage (used as work space)
296: .  vec2_D - garbage (used as work space)

298: */
301: PetscErrorCode  PCISApplySchur(PC pc, Vec v, Vec vec1_B, Vec vec2_B, Vec vec1_D, Vec vec2_D)
302: {
304:   PC_IS          *pcis = (PC_IS*)(pc->data);

307:   if (!vec2_B) { vec2_B = v; }

309:   MatMult(pcis->A_BB,v,vec1_B);
310:   MatMult(pcis->A_IB,v,vec1_D);
311:   KSPSolve(pcis->ksp_D,vec1_D,vec2_D);
312:   MatMult(pcis->A_BI,vec2_D,vec2_B);
313:   VecAXPY(vec1_B,-1.0,vec2_B);
314:   return(0);
315: }

317: /* -------------------------------------------------------------------------- */
318: /*
319:    PCISScatterArrayNToVecB - Scatters interface node values from a big array (of all local nodes, interior or interface,
320:    including ghosts) into an interface vector, when in SCATTER_FORWARD mode, or vice-versa, when in SCATTER_REVERSE
321:    mode.

323:    Input parameters:
324: .  pc - preconditioner context
325: .  array_N - [when in SCATTER_FORWARD mode] Array to be scattered into the vector
326: .  v_B - [when in SCATTER_REVERSE mode] Vector to be scattered into the array

328:    Output parameter:
329: .  array_N - [when in SCATTER_REVERSE mode] Array to receive the scattered vector
330: .  v_B - [when in SCATTER_FORWARD mode] Vector to receive the scattered array

332:    Notes:
333:    The entries in the array that do not correspond to interface nodes remain unaltered.
334: */
337: PetscErrorCode  PCISScatterArrayNToVecB (PetscScalar *array_N, Vec v_B, InsertMode imode, ScatterMode smode, PC pc)
338: {
339:   PetscInt       i;
340:   const PetscInt *idex;
342:   PetscScalar    *array_B;
343:   PC_IS          *pcis = (PC_IS*)(pc->data);

346:   VecGetArray(v_B,&array_B);
347:   ISGetIndices(pcis->is_B_local,&idex);

349:   if (smode == SCATTER_FORWARD) {
350:     if (imode == INSERT_VALUES) {
351:       for (i=0; i<pcis->n_B; i++) { array_B[i]  = array_N[idex[i]]; }
352:     } else {  /* ADD_VALUES */
353:       for (i=0; i<pcis->n_B; i++) { array_B[i] += array_N[idex[i]]; }
354:     }
355:   } else {  /* SCATTER_REVERSE */
356:     if (imode == INSERT_VALUES) {
357:       for (i=0; i<pcis->n_B; i++) { array_N[idex[i]]  = array_B[i]; }
358:     } else {  /* ADD_VALUES */
359:       for (i=0; i<pcis->n_B; i++) { array_N[idex[i]] += array_B[i]; }
360:     }
361:   }
362:   ISRestoreIndices(pcis->is_B_local,&idex);
363:   VecRestoreArray(v_B,&array_B);
364:   return(0);
365: }

367: /* -------------------------------------------------------------------------- */
368: /*
369:    PCISApplyInvSchur - Solves the Neumann problem related to applying the inverse of the Schur complement.
370:    More precisely, solves the problem:
371:                                         [ A_II  A_IB ] [ . ]   [ 0 ]
372:                                         [            ] [   ] = [   ]
373:                                         [ A_BI  A_BB ] [ x ]   [ b ]

375:    Input parameters:
376: .  pc - preconditioner context
377: .  b - vector of local interface nodes (including ghosts)

379:    Output parameters:
380: .  x - vector of local interface nodes (including ghosts); returns the application of the inverse of the Schur
381:        complement to b
382: .  vec1_N - vector of local nodes (interior and interface, including ghosts); returns garbage (used as work space)
383: .  vec2_N - vector of local nodes (interior and interface, including ghosts); returns garbage (used as work space)

385: */
388: PetscErrorCode  PCISApplyInvSchur (PC pc, Vec b, Vec x, Vec vec1_N, Vec vec2_N)
389: {
391:   PC_IS          *pcis = (PC_IS*)(pc->data);

394:   /*
395:     Neumann solvers. 
396:     Applying the inverse of the local Schur complement, i.e, solving a Neumann
397:     Problem with zero at the interior nodes of the RHS and extracting the interface
398:     part of the solution. inverse Schur complement is applied to b and the result
399:     is stored in x.
400:   */
401:   /* Setting the RHS vec1_N */
402:   VecSet(vec1_N,0.0);
403:   VecScatterBegin(pcis->N_to_B,b,vec1_N,INSERT_VALUES,SCATTER_REVERSE);
404:   VecScatterEnd  (pcis->N_to_B,b,vec1_N,INSERT_VALUES,SCATTER_REVERSE);
405:   /* Checking for consistency of the RHS */
406:   {
407:     PetscTruth flg;
408:     PetscOptionsHasName(PETSC_NULL,"-pc_is_check_consistency",&flg);
409:     if (flg) {
410:       PetscScalar average;
411:       PetscViewer viewer;
412:       PetscViewerASCIIGetStdout(((PetscObject)pc)->comm,&viewer);

414:       VecSum(vec1_N,&average);
415:       average = average / ((PetscReal)pcis->n);
416:       if (pcis->pure_neumann) {

418:         PetscViewerASCIISynchronizedPrintf(viewer,"Subdomain %04d is floating. Average = % 1.14e\n",
419:                                              PetscGlobalRank,PetscAbsScalar(average));
420:       } else {
421:         PetscViewerASCIISynchronizedPrintf(viewer,"Subdomain %04d is fixed.    Average = % 1.14e\n",
422:                                              PetscGlobalRank,PetscAbsScalar(average));
423:       }
424:       PetscViewerFlush(viewer);
425:     }
426:   }
427:   /* Solving the system for vec2_N */
428:   KSPSolve(pcis->ksp_N,vec1_N,vec2_N);
429:   /* Extracting the local interface vector out of the solution */
430:   VecScatterBegin(pcis->N_to_B,vec2_N,x,INSERT_VALUES,SCATTER_FORWARD);
431:   VecScatterEnd  (pcis->N_to_B,vec2_N,x,INSERT_VALUES,SCATTER_FORWARD);
432:   return(0);
433: }