Actual source code: bjacobi.c
petsc-3.14.1 2020-11-03
2: /*
3: Defines a block Jacobi preconditioner.
4: */
6: #include <../src/ksp/pc/impls/bjacobi/bjacobi.h>
8: static PetscErrorCode PCSetUp_BJacobi_Singleblock(PC,Mat,Mat);
9: static PetscErrorCode PCSetUp_BJacobi_Multiblock(PC,Mat,Mat);
10: static PetscErrorCode PCSetUp_BJacobi_Multiproc(PC);
12: static PetscErrorCode PCSetUp_BJacobi(PC pc)
13: {
14: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
15: Mat mat = pc->mat,pmat = pc->pmat;
17: PetscBool hasop;
18: PetscInt N,M,start,i,sum,end;
19: PetscInt bs,i_start=-1,i_end=-1;
20: PetscMPIInt rank,size;
21: const char *pprefix,*mprefix;
24: MPI_Comm_rank(PetscObjectComm((PetscObject)pc),&rank);
25: MPI_Comm_size(PetscObjectComm((PetscObject)pc),&size);
26: MatGetLocalSize(pc->pmat,&M,&N);
27: MatGetBlockSize(pc->pmat,&bs);
29: if (jac->n > 0 && jac->n < size) {
30: PCSetUp_BJacobi_Multiproc(pc);
31: return(0);
32: }
34: /* --------------------------------------------------------------------------
35: Determines the number of blocks assigned to each processor
36: -----------------------------------------------------------------------------*/
38: /* local block count given */
39: if (jac->n_local > 0 && jac->n < 0) {
40: MPIU_Allreduce(&jac->n_local,&jac->n,1,MPIU_INT,MPI_SUM,PetscObjectComm((PetscObject)pc));
41: if (jac->l_lens) { /* check that user set these correctly */
42: sum = 0;
43: for (i=0; i<jac->n_local; i++) {
44: if (jac->l_lens[i]/bs*bs !=jac->l_lens[i]) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Mat blocksize doesn't match block Jacobi layout");
45: sum += jac->l_lens[i];
46: }
47: if (sum != M) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Local lens set incorrectly");
48: } else {
49: PetscMalloc1(jac->n_local,&jac->l_lens);
50: for (i=0; i<jac->n_local; i++) jac->l_lens[i] = bs*((M/bs)/jac->n_local + (((M/bs) % jac->n_local) > i));
51: }
52: } else if (jac->n > 0 && jac->n_local < 0) { /* global block count given */
53: /* global blocks given: determine which ones are local */
54: if (jac->g_lens) {
55: /* check if the g_lens is has valid entries */
56: for (i=0; i<jac->n; i++) {
57: if (!jac->g_lens[i]) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Zero block not allowed");
58: if (jac->g_lens[i]/bs*bs != jac->g_lens[i]) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Mat blocksize doesn't match block Jacobi layout");
59: }
60: if (size == 1) {
61: jac->n_local = jac->n;
62: PetscMalloc1(jac->n_local,&jac->l_lens);
63: PetscArraycpy(jac->l_lens,jac->g_lens,jac->n_local);
64: /* check that user set these correctly */
65: sum = 0;
66: for (i=0; i<jac->n_local; i++) sum += jac->l_lens[i];
67: if (sum != M) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Global lens set incorrectly");
68: } else {
69: MatGetOwnershipRange(pc->pmat,&start,&end);
70: /* loop over blocks determing first one owned by me */
71: sum = 0;
72: for (i=0; i<jac->n+1; i++) {
73: if (sum == start) { i_start = i; goto start_1;}
74: if (i < jac->n) sum += jac->g_lens[i];
75: }
76: SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Block sizes used in PCBJacobiSetTotalBlocks()\nare not compatible with parallel matrix layout");
77: start_1:
78: for (i=i_start; i<jac->n+1; i++) {
79: if (sum == end) { i_end = i; goto end_1; }
80: if (i < jac->n) sum += jac->g_lens[i];
81: }
82: SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Block sizes used in PCBJacobiSetTotalBlocks()\nare not compatible with parallel matrix layout");
83: end_1:
84: jac->n_local = i_end - i_start;
85: PetscMalloc1(jac->n_local,&jac->l_lens);
86: PetscArraycpy(jac->l_lens,jac->g_lens+i_start,jac->n_local);
87: }
88: } else { /* no global blocks given, determine then using default layout */
89: jac->n_local = jac->n/size + ((jac->n % size) > rank);
90: PetscMalloc1(jac->n_local,&jac->l_lens);
91: for (i=0; i<jac->n_local; i++) {
92: jac->l_lens[i] = ((M/bs)/jac->n_local + (((M/bs) % jac->n_local) > i))*bs;
93: if (!jac->l_lens[i]) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_SIZ,"Too many blocks given");
94: }
95: }
96: } else if (jac->n < 0 && jac->n_local < 0) { /* no blocks given */
97: jac->n = size;
98: jac->n_local = 1;
99: PetscMalloc1(1,&jac->l_lens);
100: jac->l_lens[0] = M;
101: } else { /* jac->n > 0 && jac->n_local > 0 */
102: if (!jac->l_lens) {
103: PetscMalloc1(jac->n_local,&jac->l_lens);
104: for (i=0; i<jac->n_local; i++) jac->l_lens[i] = bs*((M/bs)/jac->n_local + (((M/bs) % jac->n_local) > i));
105: }
106: }
107: if (jac->n_local < 1) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Number of blocks is less than number of processors");
109: /* -------------------------
110: Determines mat and pmat
111: ---------------------------*/
112: MatHasOperation(pc->mat,MATOP_GET_DIAGONAL_BLOCK,&hasop);
113: if (!hasop && size == 1) {
114: mat = pc->mat;
115: pmat = pc->pmat;
116: } else {
117: if (pc->useAmat) {
118: /* use block from Amat matrix, not Pmat for local MatMult() */
119: MatGetDiagonalBlock(pc->mat,&mat);
120: /* make submatrix have same prefix as entire matrix */
121: PetscObjectGetOptionsPrefix((PetscObject)pc->mat,&mprefix);
122: PetscObjectSetOptionsPrefix((PetscObject)mat,mprefix);
123: }
124: if (pc->pmat != pc->mat || !pc->useAmat) {
125: MatGetDiagonalBlock(pc->pmat,&pmat);
126: /* make submatrix have same prefix as entire matrix */
127: PetscObjectGetOptionsPrefix((PetscObject)pc->pmat,&pprefix);
128: PetscObjectSetOptionsPrefix((PetscObject)pmat,pprefix);
129: } else pmat = mat;
130: }
132: /* ------
133: Setup code depends on the number of blocks
134: */
135: if (jac->n_local == 1) {
136: PCSetUp_BJacobi_Singleblock(pc,mat,pmat);
137: } else {
138: PCSetUp_BJacobi_Multiblock(pc,mat,pmat);
139: }
140: return(0);
141: }
143: /* Default destroy, if it has never been setup */
144: static PetscErrorCode PCDestroy_BJacobi(PC pc)
145: {
146: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
150: PetscFree(jac->g_lens);
151: PetscFree(jac->l_lens);
152: PetscFree(pc->data);
153: return(0);
154: }
157: static PetscErrorCode PCSetFromOptions_BJacobi(PetscOptionItems *PetscOptionsObject,PC pc)
158: {
159: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
161: PetscInt blocks,i;
162: PetscBool flg;
165: PetscOptionsHead(PetscOptionsObject,"Block Jacobi options");
166: PetscOptionsInt("-pc_bjacobi_blocks","Total number of blocks","PCBJacobiSetTotalBlocks",jac->n,&blocks,&flg);
167: if (flg) {PCBJacobiSetTotalBlocks(pc,blocks,NULL);}
168: PetscOptionsInt("-pc_bjacobi_local_blocks","Local number of blocks","PCBJacobiSetLocalBlocks",jac->n_local,&blocks,&flg);
169: if (flg) {PCBJacobiSetLocalBlocks(pc,blocks,NULL);}
170: if (jac->ksp) {
171: /* The sub-KSP has already been set up (e.g., PCSetUp_BJacobi_Singleblock), but KSPSetFromOptions was not called
172: * unless we had already been called. */
173: for (i=0; i<jac->n_local; i++) {
174: KSPSetFromOptions(jac->ksp[i]);
175: }
176: }
177: PetscOptionsTail();
178: return(0);
179: }
181: #include <petscdraw.h>
182: static PetscErrorCode PCView_BJacobi(PC pc,PetscViewer viewer)
183: {
184: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
185: PC_BJacobi_Multiproc *mpjac = (PC_BJacobi_Multiproc*)jac->data;
186: PetscErrorCode ierr;
187: PetscMPIInt rank;
188: PetscInt i;
189: PetscBool iascii,isstring,isdraw;
190: PetscViewer sviewer;
193: PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERASCII,&iascii);
194: PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERSTRING,&isstring);
195: PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERDRAW,&isdraw);
196: if (iascii) {
197: if (pc->useAmat) {
198: PetscViewerASCIIPrintf(viewer," using Amat local matrix, number of blocks = %D\n",jac->n);
199: }
200: PetscViewerASCIIPrintf(viewer," number of blocks = %D\n",jac->n);
201: MPI_Comm_rank(PetscObjectComm((PetscObject)pc),&rank);
202: if (jac->same_local_solves) {
203: PetscViewerASCIIPrintf(viewer," Local solver is the same for all blocks, as in the following KSP and PC objects on rank 0:\n");
204: if (jac->ksp && !jac->psubcomm) {
205: PetscViewerGetSubViewer(viewer,PETSC_COMM_SELF,&sviewer);
206: if (!rank) {
207: PetscViewerASCIIPushTab(viewer);
208: KSPView(jac->ksp[0],sviewer);
209: PetscViewerASCIIPopTab(viewer);
210: }
211: PetscViewerRestoreSubViewer(viewer,PETSC_COMM_SELF,&sviewer);
212: } else if (mpjac && jac->ksp && mpjac->psubcomm) {
213: PetscViewerGetSubViewer(viewer,mpjac->psubcomm->child,&sviewer);
214: if (!mpjac->psubcomm->color) {
215: PetscViewerASCIIPushTab(viewer);
216: KSPView(*(jac->ksp),sviewer);
217: PetscViewerASCIIPopTab(viewer);
218: }
219: PetscViewerRestoreSubViewer(viewer,mpjac->psubcomm->child,&sviewer);
220: }
221: } else {
222: PetscInt n_global;
223: MPIU_Allreduce(&jac->n_local,&n_global,1,MPIU_INT,MPI_MAX,PetscObjectComm((PetscObject)pc));
224: PetscViewerASCIIPushSynchronized(viewer);
225: PetscViewerASCIIPrintf(viewer," Local solve info for each block is in the following KSP and PC objects:\n");
226: PetscViewerASCIISynchronizedPrintf(viewer,"[%d] number of local blocks = %D, first local block number = %D\n",
227: rank,jac->n_local,jac->first_local);
228: PetscViewerASCIIPushTab(viewer);
229: PetscViewerGetSubViewer(viewer,PETSC_COMM_SELF,&sviewer);
230: for (i=0; i<jac->n_local; i++) {
231: PetscViewerASCIISynchronizedPrintf(viewer,"[%d] local block number %D\n",rank,i);
232: KSPView(jac->ksp[i],sviewer);
233: PetscViewerASCIISynchronizedPrintf(viewer,"- - - - - - - - - - - - - - - - - -\n");
234: }
235: PetscViewerRestoreSubViewer(viewer,PETSC_COMM_SELF,&sviewer);
236: PetscViewerASCIIPopTab(viewer);
237: PetscViewerFlush(viewer);
238: PetscViewerASCIIPopSynchronized(viewer);
239: }
240: } else if (isstring) {
241: PetscViewerStringSPrintf(viewer," blks=%D",jac->n);
242: PetscViewerGetSubViewer(viewer,PETSC_COMM_SELF,&sviewer);
243: if (jac->ksp) {KSPView(jac->ksp[0],sviewer);}
244: PetscViewerRestoreSubViewer(viewer,PETSC_COMM_SELF,&sviewer);
245: } else if (isdraw) {
246: PetscDraw draw;
247: char str[25];
248: PetscReal x,y,bottom,h;
250: PetscViewerDrawGetDraw(viewer,0,&draw);
251: PetscDrawGetCurrentPoint(draw,&x,&y);
252: PetscSNPrintf(str,25,"Number blocks %D",jac->n);
253: PetscDrawStringBoxed(draw,x,y,PETSC_DRAW_RED,PETSC_DRAW_BLACK,str,NULL,&h);
254: bottom = y - h;
255: PetscDrawPushCurrentPoint(draw,x,bottom);
256: /* warning the communicator on viewer is different then on ksp in parallel */
257: if (jac->ksp) {KSPView(jac->ksp[0],viewer);}
258: PetscDrawPopCurrentPoint(draw);
259: }
260: return(0);
261: }
263: /* -------------------------------------------------------------------------------------*/
265: static PetscErrorCode PCBJacobiGetSubKSP_BJacobi(PC pc,PetscInt *n_local,PetscInt *first_local,KSP **ksp)
266: {
267: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
270: if (!pc->setupcalled) SETERRQ(PetscObjectComm((PetscObject)pc),PETSC_ERR_ARG_WRONGSTATE,"Must call KSPSetUp() or PCSetUp() first");
272: if (n_local) *n_local = jac->n_local;
273: if (first_local) *first_local = jac->first_local;
274: *ksp = jac->ksp;
275: jac->same_local_solves = PETSC_FALSE; /* Assume that local solves are now different;
276: not necessarily true though! This flag is
277: used only for PCView_BJacobi() */
278: return(0);
279: }
281: static PetscErrorCode PCBJacobiSetTotalBlocks_BJacobi(PC pc,PetscInt blocks,PetscInt *lens)
282: {
283: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
287: if (pc->setupcalled > 0 && jac->n!=blocks) SETERRQ(PetscObjectComm((PetscObject)pc),PETSC_ERR_ORDER,"Cannot alter number of blocks after PCSetUp()/KSPSetUp() has been called");
288: jac->n = blocks;
289: if (!lens) jac->g_lens = NULL;
290: else {
291: PetscMalloc1(blocks,&jac->g_lens);
292: PetscLogObjectMemory((PetscObject)pc,blocks*sizeof(PetscInt));
293: PetscArraycpy(jac->g_lens,lens,blocks);
294: }
295: return(0);
296: }
298: static PetscErrorCode PCBJacobiGetTotalBlocks_BJacobi(PC pc, PetscInt *blocks, const PetscInt *lens[])
299: {
300: PC_BJacobi *jac = (PC_BJacobi*) pc->data;
303: *blocks = jac->n;
304: if (lens) *lens = jac->g_lens;
305: return(0);
306: }
308: static PetscErrorCode PCBJacobiSetLocalBlocks_BJacobi(PC pc,PetscInt blocks,const PetscInt lens[])
309: {
310: PC_BJacobi *jac;
314: jac = (PC_BJacobi*)pc->data;
316: jac->n_local = blocks;
317: if (!lens) jac->l_lens = NULL;
318: else {
319: PetscMalloc1(blocks,&jac->l_lens);
320: PetscLogObjectMemory((PetscObject)pc,blocks*sizeof(PetscInt));
321: PetscArraycpy(jac->l_lens,lens,blocks);
322: }
323: return(0);
324: }
326: static PetscErrorCode PCBJacobiGetLocalBlocks_BJacobi(PC pc, PetscInt *blocks, const PetscInt *lens[])
327: {
328: PC_BJacobi *jac = (PC_BJacobi*) pc->data;
331: *blocks = jac->n_local;
332: if (lens) *lens = jac->l_lens;
333: return(0);
334: }
336: /* -------------------------------------------------------------------------------------*/
338: /*@C
339: PCBJacobiGetSubKSP - Gets the local KSP contexts for all blocks on
340: this processor.
342: Not Collective
344: Input Parameter:
345: . pc - the preconditioner context
347: Output Parameters:
348: + n_local - the number of blocks on this processor, or NULL
349: . first_local - the global number of the first block on this processor, or NULL
350: - ksp - the array of KSP contexts
352: Notes:
353: After PCBJacobiGetSubKSP() the array of KSP contexts is not to be freed.
355: Currently for some matrix implementations only 1 block per processor
356: is supported.
358: You must call KSPSetUp() or PCSetUp() before calling PCBJacobiGetSubKSP().
360: Fortran Usage: You must pass in a KSP array that is large enough to contain all the local KSPs.
361: You can call PCBJacobiGetSubKSP(pc,nlocal,firstlocal,PETSC_NULL_KSP,ierr) to determine how large the
362: KSP array must be.
364: Level: advanced
366: .seealso: PCBJacobiGetSubKSP()
367: @*/
368: PetscErrorCode PCBJacobiGetSubKSP(PC pc,PetscInt *n_local,PetscInt *first_local,KSP *ksp[])
369: {
374: PetscUseMethod(pc,"PCBJacobiGetSubKSP_C",(PC,PetscInt*,PetscInt*,KSP **),(pc,n_local,first_local,ksp));
375: return(0);
376: }
378: /*@
379: PCBJacobiSetTotalBlocks - Sets the global number of blocks for the block
380: Jacobi preconditioner.
382: Collective on PC
384: Input Parameters:
385: + pc - the preconditioner context
386: . blocks - the number of blocks
387: - lens - [optional] integer array containing the size of each block
389: Options Database Key:
390: . -pc_bjacobi_blocks <blocks> - Sets the number of global blocks
392: Notes:
393: Currently only a limited number of blocking configurations are supported.
394: All processors sharing the PC must call this routine with the same data.
396: Level: intermediate
398: .seealso: PCSetUseAmat(), PCBJacobiSetLocalBlocks()
399: @*/
400: PetscErrorCode PCBJacobiSetTotalBlocks(PC pc,PetscInt blocks,const PetscInt lens[])
401: {
406: if (blocks <= 0) SETERRQ(PetscObjectComm((PetscObject)pc),PETSC_ERR_ARG_OUTOFRANGE,"Must have positive blocks");
407: PetscTryMethod(pc,"PCBJacobiSetTotalBlocks_C",(PC,PetscInt,const PetscInt[]),(pc,blocks,lens));
408: return(0);
409: }
411: /*@C
412: PCBJacobiGetTotalBlocks - Gets the global number of blocks for the block
413: Jacobi preconditioner.
415: Not Collective
417: Input Parameter:
418: . pc - the preconditioner context
420: Output parameters:
421: + blocks - the number of blocks
422: - lens - integer array containing the size of each block
424: Level: intermediate
426: .seealso: PCSetUseAmat(), PCBJacobiGetLocalBlocks()
427: @*/
428: PetscErrorCode PCBJacobiGetTotalBlocks(PC pc, PetscInt *blocks, const PetscInt *lens[])
429: {
435: PetscUseMethod(pc,"PCBJacobiGetTotalBlocks_C",(PC,PetscInt*, const PetscInt *[]),(pc,blocks,lens));
436: return(0);
437: }
439: /*@
440: PCBJacobiSetLocalBlocks - Sets the local number of blocks for the block
441: Jacobi preconditioner.
443: Not Collective
445: Input Parameters:
446: + pc - the preconditioner context
447: . blocks - the number of blocks
448: - lens - [optional] integer array containing size of each block
450: Options Database Key:
451: . -pc_bjacobi_local_blocks <blocks> - Sets the number of local blocks
453: Note:
454: Currently only a limited number of blocking configurations are supported.
456: Level: intermediate
458: .seealso: PCSetUseAmat(), PCBJacobiSetTotalBlocks()
459: @*/
460: PetscErrorCode PCBJacobiSetLocalBlocks(PC pc,PetscInt blocks,const PetscInt lens[])
461: {
466: if (blocks < 0) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Must have nonegative blocks");
467: PetscTryMethod(pc,"PCBJacobiSetLocalBlocks_C",(PC,PetscInt,const PetscInt []),(pc,blocks,lens));
468: return(0);
469: }
471: /*@C
472: PCBJacobiGetLocalBlocks - Gets the local number of blocks for the block
473: Jacobi preconditioner.
475: Not Collective
477: Input Parameters:
478: + pc - the preconditioner context
479: . blocks - the number of blocks
480: - lens - [optional] integer array containing size of each block
482: Note:
483: Currently only a limited number of blocking configurations are supported.
485: Level: intermediate
487: .seealso: PCSetUseAmat(), PCBJacobiGetTotalBlocks()
488: @*/
489: PetscErrorCode PCBJacobiGetLocalBlocks(PC pc, PetscInt *blocks, const PetscInt *lens[])
490: {
496: PetscUseMethod(pc,"PCBJacobiGetLocalBlocks_C",(PC,PetscInt*, const PetscInt *[]),(pc,blocks,lens));
497: return(0);
498: }
500: /* -----------------------------------------------------------------------------------*/
502: /*MC
503: PCBJACOBI - Use block Jacobi preconditioning, each block is (approximately) solved with
504: its own KSP object.
506: Options Database Keys:
507: + -pc_use_amat - use Amat to apply block of operator in inner Krylov method
508: - -pc_bjacobi_blocks <n> - use n total blocks
510: Notes:
511: Each processor can have one or more blocks, or a single block can be shared by several processes. Defaults to one block per processor.
513: To set options on the solvers for each block append -sub_ to all the KSP, KSP, and PC
514: options database keys. For example, -sub_pc_type ilu -sub_pc_factor_levels 1 -sub_ksp_type preonly
516: To set the options on the solvers separate for each block call PCBJacobiGetSubKSP()
517: and set the options directly on the resulting KSP object (you can access its PC
518: KSPGetPC())
520: For GPU-based vectors (CUDA, ViennaCL) it is recommended to use exactly one block per MPI process for best
521: performance. Different block partitioning may lead to additional data transfers
522: between host and GPU that lead to degraded performance.
524: The options prefix for each block is sub_, for example -sub_pc_type lu.
526: When multiple processes share a single block, each block encompasses exactly all the unknowns owned its set of processes.
528: Level: beginner
530: .seealso: PCCreate(), PCSetType(), PCType (for list of available types), PC,
531: PCASM, PCSetUseAmat(), PCGetUseAmat(), PCBJacobiGetSubKSP(), PCBJacobiSetTotalBlocks(),
532: PCBJacobiSetLocalBlocks(), PCSetModifySubMatrices()
533: M*/
535: PETSC_EXTERN PetscErrorCode PCCreate_BJacobi(PC pc)
536: {
538: PetscMPIInt rank;
539: PC_BJacobi *jac;
542: PetscNewLog(pc,&jac);
543: MPI_Comm_rank(PetscObjectComm((PetscObject)pc),&rank);
545: pc->ops->apply = NULL;
546: pc->ops->matapply = NULL;
547: pc->ops->applytranspose = NULL;
548: pc->ops->setup = PCSetUp_BJacobi;
549: pc->ops->destroy = PCDestroy_BJacobi;
550: pc->ops->setfromoptions = PCSetFromOptions_BJacobi;
551: pc->ops->view = PCView_BJacobi;
552: pc->ops->applyrichardson = NULL;
554: pc->data = (void*)jac;
555: jac->n = -1;
556: jac->n_local = -1;
557: jac->first_local = rank;
558: jac->ksp = NULL;
559: jac->same_local_solves = PETSC_TRUE;
560: jac->g_lens = NULL;
561: jac->l_lens = NULL;
562: jac->psubcomm = NULL;
564: PetscObjectComposeFunction((PetscObject)pc,"PCBJacobiGetSubKSP_C",PCBJacobiGetSubKSP_BJacobi);
565: PetscObjectComposeFunction((PetscObject)pc,"PCBJacobiSetTotalBlocks_C",PCBJacobiSetTotalBlocks_BJacobi);
566: PetscObjectComposeFunction((PetscObject)pc,"PCBJacobiGetTotalBlocks_C",PCBJacobiGetTotalBlocks_BJacobi);
567: PetscObjectComposeFunction((PetscObject)pc,"PCBJacobiSetLocalBlocks_C",PCBJacobiSetLocalBlocks_BJacobi);
568: PetscObjectComposeFunction((PetscObject)pc,"PCBJacobiGetLocalBlocks_C",PCBJacobiGetLocalBlocks_BJacobi);
569: return(0);
570: }
572: /* --------------------------------------------------------------------------------------------*/
573: /*
574: These are for a single block per processor; works for AIJ, BAIJ; Seq and MPI
575: */
576: static PetscErrorCode PCReset_BJacobi_Singleblock(PC pc)
577: {
578: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
579: PC_BJacobi_Singleblock *bjac = (PC_BJacobi_Singleblock*)jac->data;
580: PetscErrorCode ierr;
583: KSPReset(jac->ksp[0]);
584: VecDestroy(&bjac->x);
585: VecDestroy(&bjac->y);
586: return(0);
587: }
589: static PetscErrorCode PCDestroy_BJacobi_Singleblock(PC pc)
590: {
591: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
592: PC_BJacobi_Singleblock *bjac = (PC_BJacobi_Singleblock*)jac->data;
593: PetscErrorCode ierr;
596: PCReset_BJacobi_Singleblock(pc);
597: KSPDestroy(&jac->ksp[0]);
598: PetscFree(jac->ksp);
599: PetscFree(jac->l_lens);
600: PetscFree(jac->g_lens);
601: PetscFree(bjac);
602: PetscFree(pc->data);
603: return(0);
604: }
606: static PetscErrorCode PCSetUpOnBlocks_BJacobi_Singleblock(PC pc)
607: {
608: PetscErrorCode ierr;
609: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
610: KSP subksp = jac->ksp[0];
611: KSPConvergedReason reason;
614: KSPSetUp(subksp);
615: KSPGetConvergedReason(subksp,&reason);
616: if (reason == KSP_DIVERGED_PC_FAILED) {
617: pc->failedreason = PC_SUBPC_ERROR;
618: }
619: return(0);
620: }
622: static PetscErrorCode PCApply_BJacobi_Singleblock(PC pc,Vec x,Vec y)
623: {
624: PetscErrorCode ierr;
625: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
626: PC_BJacobi_Singleblock *bjac = (PC_BJacobi_Singleblock*)jac->data;
629: VecGetLocalVectorRead(x, bjac->x);
630: VecGetLocalVector(y, bjac->y);
631: /* Since the inner KSP matrix may point directly to the diagonal block of an MPI matrix the inner
632: matrix may change even if the outer KSP/PC has not updated the preconditioner, this will trigger a rebuild
633: of the inner preconditioner automatically unless we pass down the outer preconditioners reuse flag.*/
634: KSPSetReusePreconditioner(jac->ksp[0],pc->reusepreconditioner);
635: KSPSolve(jac->ksp[0],bjac->x,bjac->y);
636: KSPCheckSolve(jac->ksp[0],pc,bjac->y);
637: VecRestoreLocalVectorRead(x, bjac->x);
638: VecRestoreLocalVector(y, bjac->y);
639: return(0);
640: }
642: static PetscErrorCode PCMatApply_BJacobi_Singleblock(PC pc,Mat X,Mat Y)
643: {
644: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
645: Mat sX,sY;
649: /* Since the inner KSP matrix may point directly to the diagonal block of an MPI matrix the inner
650: matrix may change even if the outer KSP/PC has not updated the preconditioner, this will trigger a rebuild
651: of the inner preconditioner automatically unless we pass down the outer preconditioners reuse flag.*/
652: KSPSetReusePreconditioner(jac->ksp[0],pc->reusepreconditioner);
653: MatDenseGetLocalMatrix(X,&sX);
654: MatDenseGetLocalMatrix(Y,&sY);
655: KSPMatSolve(jac->ksp[0],sX,sY);
656: return(0);
657: }
659: static PetscErrorCode PCApplySymmetricLeft_BJacobi_Singleblock(PC pc,Vec x,Vec y)
660: {
661: PetscErrorCode ierr;
662: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
663: PC_BJacobi_Singleblock *bjac = (PC_BJacobi_Singleblock*)jac->data;
664: PetscScalar *y_array;
665: const PetscScalar *x_array;
666: PC subpc;
669: /*
670: The VecPlaceArray() is to avoid having to copy the
671: y vector into the bjac->x vector. The reason for
672: the bjac->x vector is that we need a sequential vector
673: for the sequential solve.
674: */
675: VecGetArrayRead(x,&x_array);
676: VecGetArray(y,&y_array);
677: VecPlaceArray(bjac->x,x_array);
678: VecPlaceArray(bjac->y,y_array);
679: /* apply the symmetric left portion of the inner PC operator */
680: /* note this by-passes the inner KSP and its options completely */
681: KSPGetPC(jac->ksp[0],&subpc);
682: PCApplySymmetricLeft(subpc,bjac->x,bjac->y);
683: VecResetArray(bjac->x);
684: VecResetArray(bjac->y);
685: VecRestoreArrayRead(x,&x_array);
686: VecRestoreArray(y,&y_array);
687: return(0);
688: }
690: static PetscErrorCode PCApplySymmetricRight_BJacobi_Singleblock(PC pc,Vec x,Vec y)
691: {
692: PetscErrorCode ierr;
693: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
694: PC_BJacobi_Singleblock *bjac = (PC_BJacobi_Singleblock*)jac->data;
695: PetscScalar *y_array;
696: const PetscScalar *x_array;
697: PC subpc;
700: /*
701: The VecPlaceArray() is to avoid having to copy the
702: y vector into the bjac->x vector. The reason for
703: the bjac->x vector is that we need a sequential vector
704: for the sequential solve.
705: */
706: VecGetArrayRead(x,&x_array);
707: VecGetArray(y,&y_array);
708: VecPlaceArray(bjac->x,x_array);
709: VecPlaceArray(bjac->y,y_array);
711: /* apply the symmetric right portion of the inner PC operator */
712: /* note this by-passes the inner KSP and its options completely */
714: KSPGetPC(jac->ksp[0],&subpc);
715: PCApplySymmetricRight(subpc,bjac->x,bjac->y);
717: VecRestoreArrayRead(x,&x_array);
718: VecRestoreArray(y,&y_array);
719: return(0);
720: }
722: static PetscErrorCode PCApplyTranspose_BJacobi_Singleblock(PC pc,Vec x,Vec y)
723: {
724: PetscErrorCode ierr;
725: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
726: PC_BJacobi_Singleblock *bjac = (PC_BJacobi_Singleblock*)jac->data;
727: PetscScalar *y_array;
728: const PetscScalar *x_array;
731: /*
732: The VecPlaceArray() is to avoid having to copy the
733: y vector into the bjac->x vector. The reason for
734: the bjac->x vector is that we need a sequential vector
735: for the sequential solve.
736: */
737: VecGetArrayRead(x,&x_array);
738: VecGetArray(y,&y_array);
739: VecPlaceArray(bjac->x,x_array);
740: VecPlaceArray(bjac->y,y_array);
741: KSPSolveTranspose(jac->ksp[0],bjac->x,bjac->y);
742: KSPCheckSolve(jac->ksp[0],pc,bjac->y);
743: VecResetArray(bjac->x);
744: VecResetArray(bjac->y);
745: VecRestoreArrayRead(x,&x_array);
746: VecRestoreArray(y,&y_array);
747: return(0);
748: }
750: static PetscErrorCode PCSetUp_BJacobi_Singleblock(PC pc,Mat mat,Mat pmat)
751: {
752: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
753: PetscErrorCode ierr;
754: PetscInt m;
755: KSP ksp;
756: PC_BJacobi_Singleblock *bjac;
757: PetscBool wasSetup = PETSC_TRUE;
758: VecType vectype;
761: if (!pc->setupcalled) {
762: const char *prefix;
764: if (!jac->ksp) {
765: wasSetup = PETSC_FALSE;
767: KSPCreate(PETSC_COMM_SELF,&ksp);
768: KSPSetErrorIfNotConverged(ksp,pc->erroriffailure);
769: PetscObjectIncrementTabLevel((PetscObject)ksp,(PetscObject)pc,1);
770: PetscLogObjectParent((PetscObject)pc,(PetscObject)ksp);
771: KSPSetType(ksp,KSPPREONLY);
772: PCGetOptionsPrefix(pc,&prefix);
773: KSPSetOptionsPrefix(ksp,prefix);
774: KSPAppendOptionsPrefix(ksp,"sub_");
776: pc->ops->reset = PCReset_BJacobi_Singleblock;
777: pc->ops->destroy = PCDestroy_BJacobi_Singleblock;
778: pc->ops->apply = PCApply_BJacobi_Singleblock;
779: pc->ops->matapply = PCMatApply_BJacobi_Singleblock;
780: pc->ops->applysymmetricleft = PCApplySymmetricLeft_BJacobi_Singleblock;
781: pc->ops->applysymmetricright = PCApplySymmetricRight_BJacobi_Singleblock;
782: pc->ops->applytranspose = PCApplyTranspose_BJacobi_Singleblock;
783: pc->ops->setuponblocks = PCSetUpOnBlocks_BJacobi_Singleblock;
785: PetscMalloc1(1,&jac->ksp);
786: jac->ksp[0] = ksp;
788: PetscNewLog(pc,&bjac);
789: jac->data = (void*)bjac;
790: } else {
791: ksp = jac->ksp[0];
792: bjac = (PC_BJacobi_Singleblock*)jac->data;
793: }
795: /*
796: The reason we need to generate these vectors is to serve
797: as the right-hand side and solution vector for the solve on the
798: block. We do not need to allocate space for the vectors since
799: that is provided via VecPlaceArray() just before the call to
800: KSPSolve() on the block.
801: */
802: MatGetSize(pmat,&m,&m);
803: VecCreateSeqWithArray(PETSC_COMM_SELF,1,m,NULL,&bjac->x);
804: VecCreateSeqWithArray(PETSC_COMM_SELF,1,m,NULL,&bjac->y);
805: MatGetVecType(pmat,&vectype);
806: VecSetType(bjac->x,vectype);
807: VecSetType(bjac->y,vectype);
808: PetscLogObjectParent((PetscObject)pc,(PetscObject)bjac->x);
809: PetscLogObjectParent((PetscObject)pc,(PetscObject)bjac->y);
810: } else {
811: ksp = jac->ksp[0];
812: bjac = (PC_BJacobi_Singleblock*)jac->data;
813: }
814: if (pc->useAmat) {
815: KSPSetOperators(ksp,mat,pmat);
816: } else {
817: KSPSetOperators(ksp,pmat,pmat);
818: }
819: if (!wasSetup && pc->setfromoptionscalled) {
820: /* If PCSetFromOptions_BJacobi is called later, KSPSetFromOptions will be called at that time. */
821: KSPSetFromOptions(ksp);
822: }
823: return(0);
824: }
826: /* ---------------------------------------------------------------------------------------------*/
827: static PetscErrorCode PCReset_BJacobi_Multiblock(PC pc)
828: {
829: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
830: PC_BJacobi_Multiblock *bjac = (PC_BJacobi_Multiblock*)jac->data;
831: PetscErrorCode ierr;
832: PetscInt i;
835: if (bjac && bjac->pmat) {
836: MatDestroyMatrices(jac->n_local,&bjac->pmat);
837: if (pc->useAmat) {
838: MatDestroyMatrices(jac->n_local,&bjac->mat);
839: }
840: }
842: for (i=0; i<jac->n_local; i++) {
843: KSPReset(jac->ksp[i]);
844: if (bjac && bjac->x) {
845: VecDestroy(&bjac->x[i]);
846: VecDestroy(&bjac->y[i]);
847: ISDestroy(&bjac->is[i]);
848: }
849: }
850: PetscFree(jac->l_lens);
851: PetscFree(jac->g_lens);
852: return(0);
853: }
855: static PetscErrorCode PCDestroy_BJacobi_Multiblock(PC pc)
856: {
857: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
858: PC_BJacobi_Multiblock *bjac = (PC_BJacobi_Multiblock*)jac->data;
859: PetscErrorCode ierr;
860: PetscInt i;
863: PCReset_BJacobi_Multiblock(pc);
864: if (bjac) {
865: PetscFree2(bjac->x,bjac->y);
866: PetscFree(bjac->starts);
867: PetscFree(bjac->is);
868: }
869: PetscFree(jac->data);
870: for (i=0; i<jac->n_local; i++) {
871: KSPDestroy(&jac->ksp[i]);
872: }
873: PetscFree(jac->ksp);
874: PetscFree(pc->data);
875: return(0);
876: }
878: static PetscErrorCode PCSetUpOnBlocks_BJacobi_Multiblock(PC pc)
879: {
880: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
881: PetscErrorCode ierr;
882: PetscInt i,n_local = jac->n_local;
883: KSPConvergedReason reason;
886: for (i=0; i<n_local; i++) {
887: KSPSetUp(jac->ksp[i]);
888: KSPGetConvergedReason(jac->ksp[i],&reason);
889: if (reason == KSP_DIVERGED_PC_FAILED) {
890: pc->failedreason = PC_SUBPC_ERROR;
891: }
892: }
893: return(0);
894: }
896: /*
897: Preconditioner for block Jacobi
898: */
899: static PetscErrorCode PCApply_BJacobi_Multiblock(PC pc,Vec x,Vec y)
900: {
901: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
902: PetscErrorCode ierr;
903: PetscInt i,n_local = jac->n_local;
904: PC_BJacobi_Multiblock *bjac = (PC_BJacobi_Multiblock*)jac->data;
905: PetscScalar *yin;
906: const PetscScalar *xin;
909: VecGetArrayRead(x,&xin);
910: VecGetArray(y,&yin);
911: for (i=0; i<n_local; i++) {
912: /*
913: To avoid copying the subvector from x into a workspace we instead
914: make the workspace vector array point to the subpart of the array of
915: the global vector.
916: */
917: VecPlaceArray(bjac->x[i],xin+bjac->starts[i]);
918: VecPlaceArray(bjac->y[i],yin+bjac->starts[i]);
920: PetscLogEventBegin(PC_ApplyOnBlocks,jac->ksp[i],bjac->x[i],bjac->y[i],0);
921: KSPSolve(jac->ksp[i],bjac->x[i],bjac->y[i]);
922: KSPCheckSolve(jac->ksp[i],pc,bjac->y[i]);
923: PetscLogEventEnd(PC_ApplyOnBlocks,jac->ksp[i],bjac->x[i],bjac->y[i],0);
925: VecResetArray(bjac->x[i]);
926: VecResetArray(bjac->y[i]);
927: }
928: VecRestoreArrayRead(x,&xin);
929: VecRestoreArray(y,&yin);
930: return(0);
931: }
933: /*
934: Preconditioner for block Jacobi
935: */
936: static PetscErrorCode PCApplyTranspose_BJacobi_Multiblock(PC pc,Vec x,Vec y)
937: {
938: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
939: PetscErrorCode ierr;
940: PetscInt i,n_local = jac->n_local;
941: PC_BJacobi_Multiblock *bjac = (PC_BJacobi_Multiblock*)jac->data;
942: PetscScalar *yin;
943: const PetscScalar *xin;
946: VecGetArrayRead(x,&xin);
947: VecGetArray(y,&yin);
948: for (i=0; i<n_local; i++) {
949: /*
950: To avoid copying the subvector from x into a workspace we instead
951: make the workspace vector array point to the subpart of the array of
952: the global vector.
953: */
954: VecPlaceArray(bjac->x[i],xin+bjac->starts[i]);
955: VecPlaceArray(bjac->y[i],yin+bjac->starts[i]);
957: PetscLogEventBegin(PC_ApplyTransposeOnBlocks,jac->ksp[i],bjac->x[i],bjac->y[i],0);
958: KSPSolveTranspose(jac->ksp[i],bjac->x[i],bjac->y[i]);
959: KSPCheckSolve(jac->ksp[i],pc,bjac->y[i]);
960: PetscLogEventEnd(PC_ApplyTransposeOnBlocks,jac->ksp[i],bjac->x[i],bjac->y[i],0);
962: VecResetArray(bjac->x[i]);
963: VecResetArray(bjac->y[i]);
964: }
965: VecRestoreArrayRead(x,&xin);
966: VecRestoreArray(y,&yin);
967: return(0);
968: }
970: static PetscErrorCode PCSetUp_BJacobi_Multiblock(PC pc,Mat mat,Mat pmat)
971: {
972: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
973: PetscErrorCode ierr;
974: PetscInt m,n_local,N,M,start,i;
975: const char *prefix,*pprefix,*mprefix;
976: KSP ksp;
977: Vec x,y;
978: PC_BJacobi_Multiblock *bjac = (PC_BJacobi_Multiblock*)jac->data;
979: PC subpc;
980: IS is;
981: MatReuse scall;
982: VecType vectype;
985: MatGetLocalSize(pc->pmat,&M,&N);
987: n_local = jac->n_local;
989: if (pc->useAmat) {
990: PetscBool same;
991: PetscObjectTypeCompare((PetscObject)mat,((PetscObject)pmat)->type_name,&same);
992: if (!same) SETERRQ(PetscObjectComm((PetscObject)pc),PETSC_ERR_ARG_INCOMP,"Matrices not of same type");
993: }
995: if (!pc->setupcalled) {
996: scall = MAT_INITIAL_MATRIX;
998: if (!jac->ksp) {
999: pc->ops->reset = PCReset_BJacobi_Multiblock;
1000: pc->ops->destroy = PCDestroy_BJacobi_Multiblock;
1001: pc->ops->apply = PCApply_BJacobi_Multiblock;
1002: pc->ops->matapply = NULL;
1003: pc->ops->applytranspose= PCApplyTranspose_BJacobi_Multiblock;
1004: pc->ops->setuponblocks = PCSetUpOnBlocks_BJacobi_Multiblock;
1006: PetscNewLog(pc,&bjac);
1007: PetscMalloc1(n_local,&jac->ksp);
1008: PetscLogObjectMemory((PetscObject)pc,sizeof(n_local*sizeof(KSP)));
1009: PetscMalloc2(n_local,&bjac->x,n_local,&bjac->y);
1010: PetscMalloc1(n_local,&bjac->starts);
1011: PetscLogObjectMemory((PetscObject)pc,sizeof(n_local*sizeof(PetscScalar)));
1013: jac->data = (void*)bjac;
1014: PetscMalloc1(n_local,&bjac->is);
1015: PetscLogObjectMemory((PetscObject)pc,sizeof(n_local*sizeof(IS)));
1017: for (i=0; i<n_local; i++) {
1018: KSPCreate(PETSC_COMM_SELF,&ksp);
1019: KSPSetErrorIfNotConverged(ksp,pc->erroriffailure);
1020: PetscObjectIncrementTabLevel((PetscObject)ksp,(PetscObject)pc,1);
1021: PetscLogObjectParent((PetscObject)pc,(PetscObject)ksp);
1022: KSPSetType(ksp,KSPPREONLY);
1023: KSPGetPC(ksp,&subpc);
1024: PCGetOptionsPrefix(pc,&prefix);
1025: KSPSetOptionsPrefix(ksp,prefix);
1026: KSPAppendOptionsPrefix(ksp,"sub_");
1028: jac->ksp[i] = ksp;
1029: }
1030: } else {
1031: bjac = (PC_BJacobi_Multiblock*)jac->data;
1032: }
1034: start = 0;
1035: MatGetVecType(pmat,&vectype);
1036: for (i=0; i<n_local; i++) {
1037: m = jac->l_lens[i];
1038: /*
1039: The reason we need to generate these vectors is to serve
1040: as the right-hand side and solution vector for the solve on the
1041: block. We do not need to allocate space for the vectors since
1042: that is provided via VecPlaceArray() just before the call to
1043: KSPSolve() on the block.
1045: */
1046: VecCreateSeq(PETSC_COMM_SELF,m,&x);
1047: VecCreateSeqWithArray(PETSC_COMM_SELF,1,m,NULL,&y);
1048: VecSetType(x,vectype);
1049: VecSetType(y,vectype);
1050: PetscLogObjectParent((PetscObject)pc,(PetscObject)x);
1051: PetscLogObjectParent((PetscObject)pc,(PetscObject)y);
1053: bjac->x[i] = x;
1054: bjac->y[i] = y;
1055: bjac->starts[i] = start;
1057: ISCreateStride(PETSC_COMM_SELF,m,start,1,&is);
1058: bjac->is[i] = is;
1059: PetscLogObjectParent((PetscObject)pc,(PetscObject)is);
1061: start += m;
1062: }
1063: } else {
1064: bjac = (PC_BJacobi_Multiblock*)jac->data;
1065: /*
1066: Destroy the blocks from the previous iteration
1067: */
1068: if (pc->flag == DIFFERENT_NONZERO_PATTERN) {
1069: MatDestroyMatrices(n_local,&bjac->pmat);
1070: if (pc->useAmat) {
1071: MatDestroyMatrices(n_local,&bjac->mat);
1072: }
1073: scall = MAT_INITIAL_MATRIX;
1074: } else scall = MAT_REUSE_MATRIX;
1075: }
1077: MatCreateSubMatrices(pmat,n_local,bjac->is,bjac->is,scall,&bjac->pmat);
1078: if (pc->useAmat) {
1079: MatCreateSubMatrices(mat,n_local,bjac->is,bjac->is,scall,&bjac->mat);
1080: }
1081: /* Return control to the user so that the submatrices can be modified (e.g., to apply
1082: different boundary conditions for the submatrices than for the global problem) */
1083: PCModifySubMatrices(pc,n_local,bjac->is,bjac->is,bjac->pmat,pc->modifysubmatricesP);
1085: PetscObjectGetOptionsPrefix((PetscObject)pmat,&pprefix);
1086: for (i=0; i<n_local; i++) {
1087: PetscLogObjectParent((PetscObject)pc,(PetscObject)bjac->pmat[i]);
1088: PetscObjectSetOptionsPrefix((PetscObject)bjac->pmat[i],pprefix);
1089: if (pc->useAmat) {
1090: PetscLogObjectParent((PetscObject)pc,(PetscObject)bjac->mat[i]);
1091: PetscObjectGetOptionsPrefix((PetscObject)mat,&mprefix);
1092: PetscObjectSetOptionsPrefix((PetscObject)bjac->mat[i],mprefix);
1093: KSPSetOperators(jac->ksp[i],bjac->mat[i],bjac->pmat[i]);
1094: } else {
1095: KSPSetOperators(jac->ksp[i],bjac->pmat[i],bjac->pmat[i]);
1096: }
1097: if (pc->setfromoptionscalled) {
1098: KSPSetFromOptions(jac->ksp[i]);
1099: }
1100: }
1101: return(0);
1102: }
1104: /* ---------------------------------------------------------------------------------------------*/
1105: /*
1106: These are for a single block with multiple processes;
1107: */
1108: static PetscErrorCode PCReset_BJacobi_Multiproc(PC pc)
1109: {
1110: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
1111: PC_BJacobi_Multiproc *mpjac = (PC_BJacobi_Multiproc*)jac->data;
1112: PetscErrorCode ierr;
1115: VecDestroy(&mpjac->ysub);
1116: VecDestroy(&mpjac->xsub);
1117: MatDestroy(&mpjac->submats);
1118: if (jac->ksp) {KSPReset(jac->ksp[0]);}
1119: return(0);
1120: }
1122: static PetscErrorCode PCDestroy_BJacobi_Multiproc(PC pc)
1123: {
1124: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
1125: PC_BJacobi_Multiproc *mpjac = (PC_BJacobi_Multiproc*)jac->data;
1126: PetscErrorCode ierr;
1129: PCReset_BJacobi_Multiproc(pc);
1130: KSPDestroy(&jac->ksp[0]);
1131: PetscFree(jac->ksp);
1132: PetscSubcommDestroy(&mpjac->psubcomm);
1134: PetscFree(mpjac);
1135: PetscFree(pc->data);
1136: return(0);
1137: }
1139: static PetscErrorCode PCApply_BJacobi_Multiproc(PC pc,Vec x,Vec y)
1140: {
1141: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
1142: PC_BJacobi_Multiproc *mpjac = (PC_BJacobi_Multiproc*)jac->data;
1143: PetscErrorCode ierr;
1144: PetscScalar *yarray;
1145: const PetscScalar *xarray;
1146: KSPConvergedReason reason;
1149: /* place x's and y's local arrays into xsub and ysub */
1150: VecGetArrayRead(x,&xarray);
1151: VecGetArray(y,&yarray);
1152: VecPlaceArray(mpjac->xsub,xarray);
1153: VecPlaceArray(mpjac->ysub,yarray);
1155: /* apply preconditioner on each matrix block */
1156: PetscLogEventBegin(PC_ApplyOnBlocks,jac->ksp[0],mpjac->xsub,mpjac->ysub,0);
1157: KSPSolve(jac->ksp[0],mpjac->xsub,mpjac->ysub);
1158: KSPCheckSolve(jac->ksp[0],pc,mpjac->ysub);
1159: PetscLogEventEnd(PC_ApplyOnBlocks,jac->ksp[0],mpjac->xsub,mpjac->ysub,0);
1160: KSPGetConvergedReason(jac->ksp[0],&reason);
1161: if (reason == KSP_DIVERGED_PC_FAILED) {
1162: pc->failedreason = PC_SUBPC_ERROR;
1163: }
1165: VecResetArray(mpjac->xsub);
1166: VecResetArray(mpjac->ysub);
1167: VecRestoreArrayRead(x,&xarray);
1168: VecRestoreArray(y,&yarray);
1169: return(0);
1170: }
1172: static PetscErrorCode PCMatApply_BJacobi_Multiproc(PC pc,Mat X,Mat Y)
1173: {
1174: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
1175: KSPConvergedReason reason;
1176: Mat sX,sY;
1177: const PetscScalar *x;
1178: PetscScalar *y;
1179: PetscInt m,N,lda,ldb;
1180: PetscErrorCode ierr;
1183: /* apply preconditioner on each matrix block */
1184: MatGetLocalSize(X,&m,NULL);
1185: MatGetSize(X,NULL,&N);
1186: MatDenseGetLDA(X,&lda);
1187: MatDenseGetLDA(Y,&ldb);
1188: MatDenseGetArrayRead(X,&x);
1189: MatDenseGetArrayWrite(Y,&y);
1190: MatCreateDense(PetscObjectComm((PetscObject)jac->ksp[0]),m,PETSC_DECIDE,PETSC_DECIDE,N,(PetscScalar*)x,&sX);
1191: MatCreateDense(PetscObjectComm((PetscObject)jac->ksp[0]),m,PETSC_DECIDE,PETSC_DECIDE,N,y,&sY);
1192: MatDenseSetLDA(sX,lda);
1193: MatDenseSetLDA(sY,ldb);
1194: PetscLogEventBegin(PC_ApplyOnBlocks,jac->ksp[0],X,Y,0);
1195: KSPMatSolve(jac->ksp[0],sX,sY);
1196: KSPCheckSolve(jac->ksp[0],pc,NULL);
1197: PetscLogEventEnd(PC_ApplyOnBlocks,jac->ksp[0],X,Y,0);
1198: MatDestroy(&sY);
1199: MatDestroy(&sX);
1200: MatDenseRestoreArrayWrite(Y,&y);
1201: MatDenseRestoreArrayRead(X,&x);
1202: KSPGetConvergedReason(jac->ksp[0],&reason);
1203: if (reason == KSP_DIVERGED_PC_FAILED) {
1204: pc->failedreason = PC_SUBPC_ERROR;
1205: }
1206: return(0);
1207: }
1209: static PetscErrorCode PCSetUp_BJacobi_Multiproc(PC pc)
1210: {
1211: PC_BJacobi *jac = (PC_BJacobi*)pc->data;
1212: PC_BJacobi_Multiproc *mpjac = (PC_BJacobi_Multiproc*)jac->data;
1213: PetscErrorCode ierr;
1214: PetscInt m,n;
1215: MPI_Comm comm,subcomm=0;
1216: const char *prefix;
1217: PetscBool wasSetup = PETSC_TRUE;
1218: VecType vectype;
1222: PetscObjectGetComm((PetscObject)pc,&comm);
1223: if (jac->n_local > 1) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Only a single block in a subcommunicator is supported");
1224: jac->n_local = 1; /* currently only a single block is supported for a subcommunicator */
1225: if (!pc->setupcalled) {
1226: wasSetup = PETSC_FALSE;
1227: PetscNewLog(pc,&mpjac);
1228: jac->data = (void*)mpjac;
1230: /* initialize datastructure mpjac */
1231: if (!jac->psubcomm) {
1232: /* Create default contiguous subcommunicatiors if user does not provide them */
1233: PetscSubcommCreate(comm,&jac->psubcomm);
1234: PetscSubcommSetNumber(jac->psubcomm,jac->n);
1235: PetscSubcommSetType(jac->psubcomm,PETSC_SUBCOMM_CONTIGUOUS);
1236: PetscLogObjectMemory((PetscObject)pc,sizeof(PetscSubcomm));
1237: }
1238: mpjac->psubcomm = jac->psubcomm;
1239: subcomm = PetscSubcommChild(mpjac->psubcomm);
1241: /* Get matrix blocks of pmat */
1242: MatGetMultiProcBlock(pc->pmat,subcomm,MAT_INITIAL_MATRIX,&mpjac->submats);
1244: /* create a new PC that processors in each subcomm have copy of */
1245: PetscMalloc1(1,&jac->ksp);
1246: KSPCreate(subcomm,&jac->ksp[0]);
1247: KSPSetErrorIfNotConverged(jac->ksp[0],pc->erroriffailure);
1248: PetscObjectIncrementTabLevel((PetscObject)jac->ksp[0],(PetscObject)pc,1);
1249: PetscLogObjectParent((PetscObject)pc,(PetscObject)jac->ksp[0]);
1250: KSPSetOperators(jac->ksp[0],mpjac->submats,mpjac->submats);
1251: KSPGetPC(jac->ksp[0],&mpjac->pc);
1253: PCGetOptionsPrefix(pc,&prefix);
1254: KSPSetOptionsPrefix(jac->ksp[0],prefix);
1255: KSPAppendOptionsPrefix(jac->ksp[0],"sub_");
1257: /* create dummy vectors xsub and ysub */
1258: MatGetLocalSize(mpjac->submats,&m,&n);
1259: VecCreateMPIWithArray(subcomm,1,n,PETSC_DECIDE,NULL,&mpjac->xsub);
1260: VecCreateMPIWithArray(subcomm,1,m,PETSC_DECIDE,NULL,&mpjac->ysub);
1261: MatGetVecType(mpjac->submats,&vectype);
1262: VecSetType(mpjac->xsub,vectype);
1263: VecSetType(mpjac->ysub,vectype);
1264: PetscLogObjectParent((PetscObject)pc,(PetscObject)mpjac->xsub);
1265: PetscLogObjectParent((PetscObject)pc,(PetscObject)mpjac->ysub);
1267: pc->ops->reset = PCReset_BJacobi_Multiproc;
1268: pc->ops->destroy = PCDestroy_BJacobi_Multiproc;
1269: pc->ops->apply = PCApply_BJacobi_Multiproc;
1270: pc->ops->matapply= PCMatApply_BJacobi_Multiproc;
1271: } else { /* pc->setupcalled */
1272: subcomm = PetscSubcommChild(mpjac->psubcomm);
1273: if (pc->flag == DIFFERENT_NONZERO_PATTERN) {
1274: /* destroy old matrix blocks, then get new matrix blocks */
1275: if (mpjac->submats) {MatDestroy(&mpjac->submats);}
1276: MatGetMultiProcBlock(pc->pmat,subcomm,MAT_INITIAL_MATRIX,&mpjac->submats);
1277: } else {
1278: MatGetMultiProcBlock(pc->pmat,subcomm,MAT_REUSE_MATRIX,&mpjac->submats);
1279: }
1280: KSPSetOperators(jac->ksp[0],mpjac->submats,mpjac->submats);
1281: }
1283: if (!wasSetup && pc->setfromoptionscalled) {
1284: KSPSetFromOptions(jac->ksp[0]);
1285: }
1286: return(0);
1287: }