Actual source code: gasm.c

  1: /*
  2:   This file defines an "generalized" additive Schwarz preconditioner for any Mat implementation.
  3:   In this version each MPI rank may intersect multiple subdomains and any subdomain may
  4:   intersect multiple MPI ranks.  Intersections of subdomains with MPI ranks are called *local
  5:   subdomains*.

  7:        N    - total number of distinct global subdomains  (set explicitly in PCGASMSetTotalSubdomains() or implicitly PCGASMSetSubdomains() and then calculated in PCSetUp_GASM())
  8:        n    - actual number of local subdomains on this rank (set in PCGASMSetSubdomains() or calculated in PCGASMSetTotalSubdomains())
  9:        nmax - maximum number of local subdomains per rank    (calculated in PCSetUp_GASM())
 10: */
 11: #include <petsc/private/pcimpl.h>
 12: #include <petscdm.h>

 14: typedef struct {
 15:   PetscInt   N, n, nmax;
 16:   PetscInt   overlap;                /* overlap requested by user */
 17:   PCGASMType type;                   /* use reduced interpolation, restriction or both */
 18:   PetscBool  type_set;               /* if user set this value (so won't change it for symmetric problems) */
 19:   PetscBool  same_subdomain_solvers; /* flag indicating whether all local solvers are same */
 20:   PetscBool  sort_indices;           /* flag to sort subdomain indices */
 21:   PetscBool  user_subdomains;        /* whether the user set explicit subdomain index sets -- keep them on PCReset() */
 22:   PetscBool  dm_subdomains;          /* whether DM is allowed to define subdomains */
 23:   PetscBool  hierarchicalpartitioning;
 24:   IS        *ois;           /* index sets that define the outer (conceptually, overlapping) subdomains */
 25:   IS        *iis;           /* index sets that define the inner (conceptually, nonoverlapping) subdomains */
 26:   KSP       *ksp;           /* linear solvers for each subdomain */
 27:   Mat       *pmat;          /* subdomain block matrices */
 28:   Vec        gx, gy;        /* Merged work vectors */
 29:   Vec       *x, *y;         /* Split work vectors; storage aliases pieces of storage of the above merged vectors. */
 30:   VecScatter gorestriction; /* merged restriction to disjoint union of outer subdomains */
 31:   VecScatter girestriction; /* merged restriction to disjoint union of inner subdomains */
 32:   VecScatter pctoouter;
 33:   IS         permutationIS;
 34:   Mat        permutationP;
 35:   Mat        pcmat;
 36:   Vec        pcx, pcy;
 37: } PC_GASM;

 39: static PetscErrorCode PCGASMComputeGlobalSubdomainNumbering_Private(PC pc, PetscInt **numbering, PetscInt **permutation)
 40: {
 41:   PC_GASM *osm = (PC_GASM *)pc->data;
 42:   PetscInt i;

 44:   PetscFunctionBegin;
 45:   /* Determine the number of globally-distinct subdomains and compute a global numbering for them. */
 46:   PetscCall(PetscMalloc2(osm->n, numbering, osm->n, permutation));
 47:   PetscCall(PetscObjectsListGetGlobalNumbering(PetscObjectComm((PetscObject)pc), osm->n, (PetscObject *)osm->iis, NULL, *numbering));
 48:   for (i = 0; i < osm->n; ++i) (*permutation)[i] = i;
 49:   PetscCall(PetscSortIntWithPermutation(osm->n, *numbering, *permutation));
 50:   PetscFunctionReturn(PETSC_SUCCESS);
 51: }

 53: static PetscErrorCode PCGASMSubdomainView_Private(PC pc, PetscInt i, PetscViewer viewer)
 54: {
 55:   PC_GASM        *osm = (PC_GASM *)pc->data;
 56:   PetscInt        j, nidx;
 57:   const PetscInt *idx;
 58:   PetscViewer     sviewer;
 59:   char           *cidx;

 61:   PetscFunctionBegin;
 62:   PetscCheck(i >= -1 && i < osm->n, PetscObjectComm((PetscObject)viewer), PETSC_ERR_ARG_WRONG, "Invalid subdomain %" PetscInt_FMT ": must nonnegative and less than %" PetscInt_FMT, i, osm->n);

 64:   /* Inner subdomains. */
 65:   /*
 66:    No more than 15 characters per index plus a space.
 67:    PetscViewerStringSPrintf requires a string of size at least 2, so use (nidx+1) instead of nidx,
 68:    in case nidx == 0. That will take care of the space for the trailing '\0' as well.
 69:    For nidx == 0, the whole string 16 '\0'.
 70:    */
 71:   PetscCall(PetscViewerASCIIPrintf(viewer, "Inner subdomain:\n"));
 72:   PetscCall(PetscViewerFlush(viewer));
 73:   PetscCall(PetscViewerASCIIPushSynchronized(viewer));
 74:   if (i > -1) {
 75:     PetscCall(ISGetLocalSize(osm->iis[i], &nidx));
 76:     PetscCall(PetscMalloc1(16 * (nidx + 1) + 1, &cidx));
 77:     PetscCall(PetscViewerStringOpen(PETSC_COMM_SELF, cidx, 16 * (nidx + 1) + 1, &sviewer));
 78:     PetscCall(ISGetIndices(osm->iis[i], &idx));
 79:     for (j = 0; j < nidx; ++j) PetscCall(PetscViewerStringSPrintf(sviewer, "%" PetscInt_FMT " ", idx[j]));
 80:     PetscCall(ISRestoreIndices(osm->iis[i], &idx));
 81:     PetscCall(PetscViewerDestroy(&sviewer));
 82:     PetscCall(PetscViewerASCIISynchronizedPrintf(viewer, "%s", cidx));
 83:     PetscCall(PetscFree(cidx));
 84:   }
 85:   PetscCall(PetscViewerFlush(viewer));
 86:   PetscCall(PetscViewerASCIIPopSynchronized(viewer));
 87:   PetscCall(PetscViewerASCIIPrintf(viewer, "\n"));
 88:   PetscCall(PetscViewerFlush(viewer));

 90:   /* Outer subdomains. */
 91:   /*
 92:    No more than 15 characters per index plus a space.
 93:    PetscViewerStringSPrintf requires a string of size at least 2, so use (nidx+1) instead of nidx,
 94:    in case nidx == 0. That will take care of the space for the trailing '\0' as well.
 95:    For nidx == 0, the whole string 16 '\0'.
 96:    */
 97:   PetscCall(PetscViewerASCIIPrintf(viewer, "Outer subdomain:\n"));
 98:   PetscCall(PetscViewerFlush(viewer));
 99:   PetscCall(PetscViewerASCIIPushSynchronized(viewer));
100:   if (i > -1) {
101:     PetscCall(ISGetLocalSize(osm->ois[i], &nidx));
102:     PetscCall(PetscMalloc1(16 * (nidx + 1) + 1, &cidx));
103:     PetscCall(PetscViewerStringOpen(PETSC_COMM_SELF, cidx, 16 * (nidx + 1) + 1, &sviewer));
104:     PetscCall(ISGetIndices(osm->ois[i], &idx));
105:     for (j = 0; j < nidx; ++j) PetscCall(PetscViewerStringSPrintf(sviewer, "%" PetscInt_FMT " ", idx[j]));
106:     PetscCall(PetscViewerDestroy(&sviewer));
107:     PetscCall(ISRestoreIndices(osm->ois[i], &idx));
108:     PetscCall(PetscViewerASCIISynchronizedPrintf(viewer, "%s", cidx));
109:     PetscCall(PetscFree(cidx));
110:   }
111:   PetscCall(PetscViewerFlush(viewer));
112:   PetscCall(PetscViewerASCIIPopSynchronized(viewer));
113:   PetscCall(PetscViewerASCIIPrintf(viewer, "\n"));
114:   PetscCall(PetscViewerFlush(viewer));
115:   PetscFunctionReturn(PETSC_SUCCESS);
116: }

118: static PetscErrorCode PCGASMPrintSubdomains(PC pc)
119: {
120:   PC_GASM    *osm = (PC_GASM *)pc->data;
121:   const char *prefix;
122:   char        fname[PETSC_MAX_PATH_LEN + 1];
123:   PetscInt    l, d, count;
124:   PetscBool   found;
125:   PetscViewer viewer;
126:   PetscInt   *numbering, *permutation; /* global numbering of locally-supported subdomains and the permutation from the local ordering */

128:   PetscFunctionBegin;
129:   PetscCall(PCGetOptionsPrefix(pc, &prefix));
130:   PetscCall(PetscOptionsHasName(NULL, prefix, "-pc_gasm_print_subdomains", &found));
131:   if (!found) PetscFunctionReturn(PETSC_SUCCESS);
132:   PetscCall(PetscOptionsGetString(NULL, prefix, "-pc_gasm_print_subdomains", fname, sizeof(fname), &found));
133:   if (!found) PetscCall(PetscStrncpy(fname, "stdout", sizeof(fname)));
134:   PetscCall(PetscViewerASCIIOpen(PetscObjectComm((PetscObject)pc), fname, &viewer));
135:   /*
136:    Make sure the viewer has a name. Otherwise this may cause a deadlock or other weird errors when creating a subcomm viewer:
137:    the subcomm viewer will attempt to inherit the viewer's name, which, if not set, will be constructed collectively on the comm.
138:   */
139:   PetscCall(PetscObjectName((PetscObject)viewer));
140:   l = 0;
141:   PetscCall(PCGASMComputeGlobalSubdomainNumbering_Private(pc, &numbering, &permutation));
142:   for (count = 0; count < osm->N; ++count) {
143:     /* Now let subdomains go one at a time in the global numbering order and print their subdomain/solver info. */
144:     if (l < osm->n) {
145:       d = permutation[l]; /* d is the local number of the l-th smallest (in the global ordering) among the locally supported subdomains */
146:       if (numbering[d] == count) l++;
147:       else d = -1;
148:     } else d = -1;
149:     PetscCall(PCGASMSubdomainView_Private(pc, d, viewer));
150:   }
151:   PetscCall(PetscFree2(numbering, permutation));
152:   PetscCall(PetscViewerDestroy(&viewer));
153:   PetscFunctionReturn(PETSC_SUCCESS);
154: }

156: static PetscErrorCode PCView_GASM(PC pc, PetscViewer viewer)
157: {
158:   PC_GASM    *osm = (PC_GASM *)pc->data;
159:   const char *prefix;
160:   PetscMPIInt rank, size;
161:   PetscInt    bsz;
162:   PetscBool   iascii, view_subdomains = PETSC_FALSE;
163:   PetscViewer sviewer;
164:   PetscInt    count, l;
165:   char        overlap[256]     = "user-defined overlap";
166:   char        gsubdomains[256] = "unknown total number of subdomains";
167:   char        msubdomains[256] = "unknown max number of local subdomains";
168:   PetscInt   *numbering, *permutation; /* global numbering of locally-supported subdomains and the permutation from the local ordering */

170:   PetscFunctionBegin;
171:   PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)pc), &size));
172:   PetscCallMPI(MPI_Comm_rank(PetscObjectComm((PetscObject)pc), &rank));

174:   if (osm->overlap >= 0) PetscCall(PetscSNPrintf(overlap, sizeof(overlap), "requested amount of overlap = %" PetscInt_FMT, osm->overlap));
175:   if (osm->N != PETSC_DETERMINE) PetscCall(PetscSNPrintf(gsubdomains, sizeof(gsubdomains), "total number of subdomains = %" PetscInt_FMT, osm->N));
176:   if (osm->nmax != PETSC_DETERMINE) PetscCall(PetscSNPrintf(msubdomains, sizeof(msubdomains), "max number of local subdomains = %" PetscInt_FMT, osm->nmax));

178:   PetscCall(PCGetOptionsPrefix(pc, &prefix));
179:   PetscCall(PetscOptionsGetBool(NULL, prefix, "-pc_gasm_view_subdomains", &view_subdomains, NULL));

181:   PetscCall(PetscObjectTypeCompare((PetscObject)viewer, PETSCVIEWERASCII, &iascii));
182:   if (iascii) {
183:     /*
184:      Make sure the viewer has a name. Otherwise this may cause a deadlock when creating a subcomm viewer:
185:      the subcomm viewer will attempt to inherit the viewer's name, which, if not set, will be constructed
186:      collectively on the comm.
187:      */
188:     PetscCall(PetscObjectName((PetscObject)viewer));
189:     PetscCall(PetscViewerASCIIPrintf(viewer, "  Restriction/interpolation type: %s\n", PCGASMTypes[osm->type]));
190:     PetscCall(PetscViewerASCIIPrintf(viewer, "  %s\n", overlap));
191:     PetscCall(PetscViewerASCIIPrintf(viewer, "  %s\n", gsubdomains));
192:     PetscCall(PetscViewerASCIIPrintf(viewer, "  %s\n", msubdomains));
193:     PetscCall(PetscViewerASCIIPushSynchronized(viewer));
194:     PetscCall(PetscViewerASCIISynchronizedPrintf(viewer, "  [%d|%d] number of locally-supported subdomains = %" PetscInt_FMT "\n", rank, size, osm->n));
195:     PetscCall(PetscViewerFlush(viewer));
196:     PetscCall(PetscViewerASCIIPopSynchronized(viewer));
197:     /* Cannot take advantage of osm->same_subdomain_solvers without a global numbering of subdomains. */
198:     PetscCall(PetscViewerASCIIPrintf(viewer, "  Subdomain solver info is as follows:\n"));
199:     PetscCall(PetscViewerASCIIPushTab(viewer));
200:     PetscCall(PetscViewerASCIIPrintf(viewer, "  - - - - - - - - - - - - - - - - - -\n"));
201:     /* Now let subdomains go one at a time in the global numbering order and print their subdomain/solver info. */
202:     PetscCall(PCGASMComputeGlobalSubdomainNumbering_Private(pc, &numbering, &permutation));
203:     l = 0;
204:     for (count = 0; count < osm->N; ++count) {
205:       PetscMPIInt srank, ssize;
206:       if (l < osm->n) {
207:         PetscInt d = permutation[l]; /* d is the local number of the l-th smallest (in the global ordering) among the locally supported subdomains */
208:         if (numbering[d] == count) {
209:           PetscCallMPI(MPI_Comm_size(((PetscObject)osm->ois[d])->comm, &ssize));
210:           PetscCallMPI(MPI_Comm_rank(((PetscObject)osm->ois[d])->comm, &srank));
211:           PetscCall(PetscViewerGetSubViewer(viewer, ((PetscObject)osm->ois[d])->comm, &sviewer));
212:           PetscCall(ISGetLocalSize(osm->ois[d], &bsz));
213:           PetscCall(PetscViewerASCIISynchronizedPrintf(sviewer, "  [%d|%d] (subcomm [%d|%d]) local subdomain number %" PetscInt_FMT ", local size = %" PetscInt_FMT "\n", rank, size, srank, ssize, d, bsz));
214:           PetscCall(PetscViewerFlush(sviewer));
215:           PetscCall(PetscViewerASCIIPushTab(sviewer));
216:           if (view_subdomains) PetscCall(PCGASMSubdomainView_Private(pc, d, sviewer));
217:           if (!pc->setupcalled) {
218:             PetscCall(PetscViewerASCIISynchronizedPrintf(sviewer, "  Solver not set up yet: PCSetUp() not yet called\n"));
219:           } else {
220:             PetscCall(KSPView(osm->ksp[d], sviewer));
221:           }
222:           PetscCall(PetscViewerASCIIPopTab(sviewer));
223:           PetscCall(PetscViewerASCIIPrintf(sviewer, "  - - - - - - - - - - - - - - - - - -\n"));
224:           PetscCall(PetscViewerFlush(sviewer));
225:           PetscCall(PetscViewerRestoreSubViewer(viewer, ((PetscObject)osm->ois[d])->comm, &sviewer));
226:           ++l;
227:         } else {
228:           PetscCall(PetscViewerGetSubViewer(viewer, PETSC_COMM_SELF, &sviewer));
229:           PetscCall(PetscViewerRestoreSubViewer(viewer, PETSC_COMM_SELF, &sviewer));
230:         }
231:       } else {
232:         PetscCall(PetscViewerGetSubViewer(viewer, PETSC_COMM_SELF, &sviewer));
233:         PetscCall(PetscViewerRestoreSubViewer(viewer, PETSC_COMM_SELF, &sviewer));
234:       }
235:     }
236:     PetscCall(PetscFree2(numbering, permutation));
237:     PetscCall(PetscViewerASCIIPopTab(viewer));
238:     PetscCall(PetscViewerFlush(viewer));
239:     /* this line is needed to match the extra PetscViewerASCIIPushSynchronized() in PetscViewerGetSubViewer() */
240:     PetscCall(PetscViewerASCIIPopSynchronized(viewer));
241:   }
242:   PetscFunctionReturn(PETSC_SUCCESS);
243: }

245: PETSC_INTERN PetscErrorCode PCGASMCreateLocalSubdomains(Mat A, PetscInt nloc, IS *iis[]);

247: static PetscErrorCode PCGASMSetHierarchicalPartitioning(PC pc)
248: {
249:   PC_GASM        *osm = (PC_GASM *)pc->data;
250:   MatPartitioning part;
251:   MPI_Comm        comm;
252:   PetscMPIInt     size;
253:   PetscInt        nlocalsubdomains, fromrows_localsize;
254:   IS              partitioning, fromrows, isn;
255:   Vec             outervec;

257:   PetscFunctionBegin;
258:   PetscCall(PetscObjectGetComm((PetscObject)pc, &comm));
259:   PetscCallMPI(MPI_Comm_size(comm, &size));
260:   /* we do not need a hierarchical partitioning when
261:     * the total number of subdomains is consistent with
262:     * the number of MPI tasks.
263:     * For the following cases, we do not need to use HP
264:     * */
265:   if (osm->N == PETSC_DETERMINE || osm->N >= size || osm->N == 1) PetscFunctionReturn(PETSC_SUCCESS);
266:   PetscCheck(size % osm->N == 0, PETSC_COMM_WORLD, PETSC_ERR_ARG_INCOMP, "have to specify the total number of subdomains %" PetscInt_FMT " to be a factor of the number of ranks %d ", osm->N, size);
267:   nlocalsubdomains = size / osm->N;
268:   osm->n           = 1;
269:   PetscCall(MatPartitioningCreate(comm, &part));
270:   PetscCall(MatPartitioningSetAdjacency(part, pc->pmat));
271:   PetscCall(MatPartitioningSetType(part, MATPARTITIONINGHIERARCH));
272:   PetscCall(MatPartitioningHierarchicalSetNcoarseparts(part, osm->N));
273:   PetscCall(MatPartitioningHierarchicalSetNfineparts(part, nlocalsubdomains));
274:   PetscCall(MatPartitioningSetFromOptions(part));
275:   /* get new rank owner number of each vertex */
276:   PetscCall(MatPartitioningApply(part, &partitioning));
277:   PetscCall(ISBuildTwoSided(partitioning, NULL, &fromrows));
278:   PetscCall(ISPartitioningToNumbering(partitioning, &isn));
279:   PetscCall(ISDestroy(&isn));
280:   PetscCall(ISGetLocalSize(fromrows, &fromrows_localsize));
281:   PetscCall(MatPartitioningDestroy(&part));
282:   PetscCall(MatCreateVecs(pc->pmat, &outervec, NULL));
283:   PetscCall(VecCreateMPI(comm, fromrows_localsize, PETSC_DETERMINE, &osm->pcx));
284:   PetscCall(VecDuplicate(osm->pcx, &osm->pcy));
285:   PetscCall(VecScatterCreate(osm->pcx, NULL, outervec, fromrows, &osm->pctoouter));
286:   PetscCall(MatCreateSubMatrix(pc->pmat, fromrows, fromrows, MAT_INITIAL_MATRIX, &osm->permutationP));
287:   PetscCall(PetscObjectReference((PetscObject)fromrows));
288:   osm->permutationIS = fromrows;
289:   osm->pcmat         = pc->pmat;
290:   PetscCall(PetscObjectReference((PetscObject)osm->permutationP));
291:   pc->pmat = osm->permutationP;
292:   PetscCall(VecDestroy(&outervec));
293:   PetscCall(ISDestroy(&fromrows));
294:   PetscCall(ISDestroy(&partitioning));
295:   osm->n = PETSC_DETERMINE;
296:   PetscFunctionReturn(PETSC_SUCCESS);
297: }

299: static PetscErrorCode PCSetUp_GASM(PC pc)
300: {
301:   PC_GASM        *osm = (PC_GASM *)pc->data;
302:   PetscInt        i, nInnerIndices, nTotalInnerIndices;
303:   PetscMPIInt     rank, size;
304:   MatReuse        scall = MAT_REUSE_MATRIX;
305:   KSP             ksp;
306:   PC              subpc;
307:   const char     *prefix, *pprefix;
308:   Vec             x, y;
309:   PetscInt        oni;   /* Number of indices in the i-th local outer subdomain.               */
310:   const PetscInt *oidxi; /* Indices from the i-th subdomain local outer subdomain.             */
311:   PetscInt        on;    /* Number of indices in the disjoint union of local outer subdomains. */
312:   PetscInt       *oidx;  /* Indices in the disjoint union of local outer subdomains. */
313:   IS              gois;  /* Disjoint union the global indices of outer subdomains.             */
314:   IS              goid;  /* Identity IS of the size of the disjoint union of outer subdomains. */
315:   PetscScalar    *gxarray, *gyarray;
316:   PetscInt        gostart; /* Start of locally-owned indices in the vectors -- osm->gx,osm->gy -- over the disjoint union of outer subdomains. */
317:   PetscInt        num_subdomains  = 0;
318:   DM             *subdomain_dm    = NULL;
319:   char          **subdomain_names = NULL;
320:   PetscInt       *numbering;

322:   PetscFunctionBegin;
323:   PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)pc), &size));
324:   PetscCallMPI(MPI_Comm_rank(PetscObjectComm((PetscObject)pc), &rank));
325:   if (!pc->setupcalled) {
326:     /* use a hierarchical partitioning */
327:     if (osm->hierarchicalpartitioning) PetscCall(PCGASMSetHierarchicalPartitioning(pc));
328:     if (osm->n == PETSC_DETERMINE) {
329:       if (osm->N != PETSC_DETERMINE) {
330:         /* No local subdomains given, but the desired number of total subdomains is known, so construct them accordingly. */
331:         PetscCall(PCGASMCreateSubdomains(pc->pmat, osm->N, &osm->n, &osm->iis));
332:       } else if (osm->dm_subdomains && pc->dm) {
333:         /* try pc->dm next, if allowed */
334:         PetscInt d;
335:         IS      *inner_subdomain_is, *outer_subdomain_is;
336:         PetscCall(DMCreateDomainDecomposition(pc->dm, &num_subdomains, &subdomain_names, &inner_subdomain_is, &outer_subdomain_is, &subdomain_dm));
337:         if (num_subdomains) PetscCall(PCGASMSetSubdomains(pc, num_subdomains, inner_subdomain_is, outer_subdomain_is));
338:         for (d = 0; d < num_subdomains; ++d) {
339:           if (inner_subdomain_is) PetscCall(ISDestroy(&inner_subdomain_is[d]));
340:           if (outer_subdomain_is) PetscCall(ISDestroy(&outer_subdomain_is[d]));
341:         }
342:         PetscCall(PetscFree(inner_subdomain_is));
343:         PetscCall(PetscFree(outer_subdomain_is));
344:       } else {
345:         /* still no subdomains; use one per rank */
346:         osm->nmax = osm->n = 1;
347:         PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)pc), &size));
348:         osm->N = size;
349:         PetscCall(PCGASMCreateLocalSubdomains(pc->pmat, osm->n, &osm->iis));
350:       }
351:     }
352:     if (!osm->iis) {
353:       /*
354:        osm->n was set in PCGASMSetSubdomains(), but the actual subdomains have not been supplied.
355:        We create the requisite number of local inner subdomains and then expand them into
356:        out subdomains, if necessary.
357:        */
358:       PetscCall(PCGASMCreateLocalSubdomains(pc->pmat, osm->n, &osm->iis));
359:     }
360:     if (!osm->ois) {
361:       /*
362:             Initially make outer subdomains the same as inner subdomains. If nonzero additional overlap
363:             has been requested, copy the inner subdomains over so they can be modified.
364:       */
365:       PetscCall(PetscMalloc1(osm->n, &osm->ois));
366:       for (i = 0; i < osm->n; ++i) {
367:         if (osm->overlap > 0 && osm->N > 1) { /* With positive overlap, osm->iis[i] will be modified */
368:           PetscCall(ISDuplicate(osm->iis[i], (osm->ois) + i));
369:           PetscCall(ISCopy(osm->iis[i], osm->ois[i]));
370:         } else {
371:           PetscCall(PetscObjectReference((PetscObject)osm->iis[i]));
372:           osm->ois[i] = osm->iis[i];
373:         }
374:       }
375:       if (osm->overlap > 0 && osm->N > 1) {
376:         /* Extend the "overlapping" regions by a number of steps */
377:         PetscCall(MatIncreaseOverlapSplit(pc->pmat, osm->n, osm->ois, osm->overlap));
378:       }
379:     }

381:     /* Now the subdomains are defined.  Determine their global and max local numbers, if necessary. */
382:     if (osm->nmax == PETSC_DETERMINE) {
383:       PetscMPIInt inwork, outwork;
384:       /* determine global number of subdomains and the max number of local subdomains */
385:       inwork = osm->n;
386:       PetscCall(MPIU_Allreduce(&inwork, &outwork, 1, MPI_INT, MPI_MAX, PetscObjectComm((PetscObject)pc)));
387:       osm->nmax = outwork;
388:     }
389:     if (osm->N == PETSC_DETERMINE) {
390:       /* Determine the number of globally-distinct subdomains and compute a global numbering for them. */
391:       PetscCall(PetscObjectsListGetGlobalNumbering(PetscObjectComm((PetscObject)pc), osm->n, (PetscObject *)osm->ois, &osm->N, NULL));
392:     }

394:     if (osm->sort_indices) {
395:       for (i = 0; i < osm->n; i++) {
396:         PetscCall(ISSort(osm->ois[i]));
397:         PetscCall(ISSort(osm->iis[i]));
398:       }
399:     }
400:     PetscCall(PCGetOptionsPrefix(pc, &prefix));
401:     PetscCall(PCGASMPrintSubdomains(pc));

403:     /*
404:        Merge the ISs, create merged vectors and restrictions.
405:      */
406:     /* Merge outer subdomain ISs and construct a restriction onto the disjoint union of local outer subdomains. */
407:     on = 0;
408:     for (i = 0; i < osm->n; i++) {
409:       PetscCall(ISGetLocalSize(osm->ois[i], &oni));
410:       on += oni;
411:     }
412:     PetscCall(PetscMalloc1(on, &oidx));
413:     on = 0;
414:     /* Merge local indices together */
415:     for (i = 0; i < osm->n; i++) {
416:       PetscCall(ISGetLocalSize(osm->ois[i], &oni));
417:       PetscCall(ISGetIndices(osm->ois[i], &oidxi));
418:       PetscCall(PetscArraycpy(oidx + on, oidxi, oni));
419:       PetscCall(ISRestoreIndices(osm->ois[i], &oidxi));
420:       on += oni;
421:     }
422:     PetscCall(ISCreateGeneral(((PetscObject)(pc))->comm, on, oidx, PETSC_OWN_POINTER, &gois));
423:     nTotalInnerIndices = 0;
424:     for (i = 0; i < osm->n; i++) {
425:       PetscCall(ISGetLocalSize(osm->iis[i], &nInnerIndices));
426:       nTotalInnerIndices += nInnerIndices;
427:     }
428:     PetscCall(VecCreateMPI(((PetscObject)(pc))->comm, nTotalInnerIndices, PETSC_DETERMINE, &x));
429:     PetscCall(VecDuplicate(x, &y));

431:     PetscCall(VecCreateMPI(PetscObjectComm((PetscObject)pc), on, PETSC_DECIDE, &osm->gx));
432:     PetscCall(VecDuplicate(osm->gx, &osm->gy));
433:     PetscCall(VecGetOwnershipRange(osm->gx, &gostart, NULL));
434:     PetscCall(ISCreateStride(PetscObjectComm((PetscObject)pc), on, gostart, 1, &goid));
435:     /* gois might indices not on local */
436:     PetscCall(VecScatterCreate(x, gois, osm->gx, goid, &osm->gorestriction));
437:     PetscCall(PetscMalloc1(osm->n, &numbering));
438:     PetscCall(PetscObjectsListGetGlobalNumbering(PetscObjectComm((PetscObject)pc), osm->n, (PetscObject *)osm->ois, NULL, numbering));
439:     PetscCall(VecDestroy(&x));
440:     PetscCall(ISDestroy(&gois));

442:     /* Merge inner subdomain ISs and construct a restriction onto the disjoint union of local inner subdomains. */
443:     {
444:       PetscInt        ini;   /* Number of indices the i-th a local inner subdomain. */
445:       PetscInt        in;    /* Number of indices in the disjoint union of local inner subdomains. */
446:       PetscInt       *iidx;  /* Global indices in the merged local inner subdomain. */
447:       PetscInt       *ioidx; /* Global indices of the disjoint union of inner subdomains within the disjoint union of outer subdomains. */
448:       IS              giis;  /* IS for the disjoint union of inner subdomains. */
449:       IS              giois; /* IS for the disjoint union of inner subdomains within the disjoint union of outer subdomains. */
450:       PetscScalar    *array;
451:       const PetscInt *indices;
452:       PetscInt        k;
453:       on = 0;
454:       for (i = 0; i < osm->n; i++) {
455:         PetscCall(ISGetLocalSize(osm->ois[i], &oni));
456:         on += oni;
457:       }
458:       PetscCall(PetscMalloc1(on, &iidx));
459:       PetscCall(PetscMalloc1(on, &ioidx));
460:       PetscCall(VecGetArray(y, &array));
461:       /* set communicator id to determine where overlap is */
462:       in = 0;
463:       for (i = 0; i < osm->n; i++) {
464:         PetscCall(ISGetLocalSize(osm->iis[i], &ini));
465:         for (k = 0; k < ini; ++k) array[in + k] = numbering[i];
466:         in += ini;
467:       }
468:       PetscCall(VecRestoreArray(y, &array));
469:       PetscCall(VecScatterBegin(osm->gorestriction, y, osm->gy, INSERT_VALUES, SCATTER_FORWARD));
470:       PetscCall(VecScatterEnd(osm->gorestriction, y, osm->gy, INSERT_VALUES, SCATTER_FORWARD));
471:       PetscCall(VecGetOwnershipRange(osm->gy, &gostart, NULL));
472:       PetscCall(VecGetArray(osm->gy, &array));
473:       on = 0;
474:       in = 0;
475:       for (i = 0; i < osm->n; i++) {
476:         PetscCall(ISGetLocalSize(osm->ois[i], &oni));
477:         PetscCall(ISGetIndices(osm->ois[i], &indices));
478:         for (k = 0; k < oni; k++) {
479:           /*  skip overlapping indices to get inner domain */
480:           if (PetscRealPart(array[on + k]) != numbering[i]) continue;
481:           iidx[in]    = indices[k];
482:           ioidx[in++] = gostart + on + k;
483:         }
484:         PetscCall(ISRestoreIndices(osm->ois[i], &indices));
485:         on += oni;
486:       }
487:       PetscCall(VecRestoreArray(osm->gy, &array));
488:       PetscCall(ISCreateGeneral(PetscObjectComm((PetscObject)pc), in, iidx, PETSC_OWN_POINTER, &giis));
489:       PetscCall(ISCreateGeneral(PetscObjectComm((PetscObject)pc), in, ioidx, PETSC_OWN_POINTER, &giois));
490:       PetscCall(VecScatterCreate(y, giis, osm->gy, giois, &osm->girestriction));
491:       PetscCall(VecDestroy(&y));
492:       PetscCall(ISDestroy(&giis));
493:       PetscCall(ISDestroy(&giois));
494:     }
495:     PetscCall(ISDestroy(&goid));
496:     PetscCall(PetscFree(numbering));

498:     /* Create the subdomain work vectors. */
499:     PetscCall(PetscMalloc1(osm->n, &osm->x));
500:     PetscCall(PetscMalloc1(osm->n, &osm->y));
501:     PetscCall(VecGetArray(osm->gx, &gxarray));
502:     PetscCall(VecGetArray(osm->gy, &gyarray));
503:     for (i = 0, on = 0; i < osm->n; ++i, on += oni) {
504:       PetscInt oNi;
505:       PetscCall(ISGetLocalSize(osm->ois[i], &oni));
506:       /* on a sub communicator */
507:       PetscCall(ISGetSize(osm->ois[i], &oNi));
508:       PetscCall(VecCreateMPIWithArray(((PetscObject)osm->ois[i])->comm, 1, oni, oNi, gxarray + on, &osm->x[i]));
509:       PetscCall(VecCreateMPIWithArray(((PetscObject)osm->ois[i])->comm, 1, oni, oNi, gyarray + on, &osm->y[i]));
510:     }
511:     PetscCall(VecRestoreArray(osm->gx, &gxarray));
512:     PetscCall(VecRestoreArray(osm->gy, &gyarray));
513:     /* Create the subdomain solvers */
514:     PetscCall(PetscMalloc1(osm->n, &osm->ksp));
515:     for (i = 0; i < osm->n; i++) {
516:       char subprefix[PETSC_MAX_PATH_LEN + 1];
517:       PetscCall(KSPCreate(((PetscObject)osm->ois[i])->comm, &ksp));
518:       PetscCall(KSPSetNestLevel(ksp, pc->kspnestlevel));
519:       PetscCall(KSPSetErrorIfNotConverged(ksp, pc->erroriffailure));
520:       PetscCall(PetscObjectIncrementTabLevel((PetscObject)ksp, (PetscObject)pc, 1));
521:       PetscCall(KSPSetType(ksp, KSPPREONLY));
522:       PetscCall(KSPGetPC(ksp, &subpc)); /* Why do we need this here? */
523:       if (subdomain_dm) {
524:         PetscCall(KSPSetDM(ksp, subdomain_dm[i]));
525:         PetscCall(DMDestroy(subdomain_dm + i));
526:       }
527:       PetscCall(PCGetOptionsPrefix(pc, &prefix));
528:       PetscCall(KSPSetOptionsPrefix(ksp, prefix));
529:       if (subdomain_names && subdomain_names[i]) {
530:         PetscCall(PetscSNPrintf(subprefix, PETSC_MAX_PATH_LEN, "sub_%s_", subdomain_names[i]));
531:         PetscCall(KSPAppendOptionsPrefix(ksp, subprefix));
532:         PetscCall(PetscFree(subdomain_names[i]));
533:       }
534:       PetscCall(KSPAppendOptionsPrefix(ksp, "sub_"));
535:       osm->ksp[i] = ksp;
536:     }
537:     PetscCall(PetscFree(subdomain_dm));
538:     PetscCall(PetscFree(subdomain_names));
539:     scall = MAT_INITIAL_MATRIX;
540:   } else { /* if (pc->setupcalled) */
541:     /*
542:        Destroy the submatrices from the previous iteration
543:     */
544:     if (pc->flag == DIFFERENT_NONZERO_PATTERN) {
545:       PetscCall(MatDestroyMatrices(osm->n, &osm->pmat));
546:       scall = MAT_INITIAL_MATRIX;
547:     }
548:     if (osm->permutationIS) {
549:       PetscCall(MatCreateSubMatrix(pc->pmat, osm->permutationIS, osm->permutationIS, scall, &osm->permutationP));
550:       PetscCall(PetscObjectReference((PetscObject)osm->permutationP));
551:       osm->pcmat = pc->pmat;
552:       pc->pmat   = osm->permutationP;
553:     }
554:   }

556:   /*
557:      Extract the submatrices.
558:   */
559:   if (size > 1) {
560:     PetscCall(MatCreateSubMatricesMPI(pc->pmat, osm->n, osm->ois, osm->ois, scall, &osm->pmat));
561:   } else {
562:     PetscCall(MatCreateSubMatrices(pc->pmat, osm->n, osm->ois, osm->ois, scall, &osm->pmat));
563:   }
564:   if (scall == MAT_INITIAL_MATRIX) {
565:     PetscCall(PetscObjectGetOptionsPrefix((PetscObject)pc->pmat, &pprefix));
566:     for (i = 0; i < osm->n; i++) PetscCall(PetscObjectSetOptionsPrefix((PetscObject)osm->pmat[i], pprefix));
567:   }

569:   /* Return control to the user so that the submatrices can be modified (e.g., to apply
570:      different boundary conditions for the submatrices than for the global problem) */
571:   PetscCall(PCModifySubMatrices(pc, osm->n, osm->ois, osm->ois, osm->pmat, pc->modifysubmatricesP));

573:   /*
574:      Loop over submatrices putting them into local ksps
575:   */
576:   for (i = 0; i < osm->n; i++) {
577:     PetscCall(KSPSetOperators(osm->ksp[i], osm->pmat[i], osm->pmat[i]));
578:     PetscCall(KSPGetOptionsPrefix(osm->ksp[i], &prefix));
579:     PetscCall(MatSetOptionsPrefix(osm->pmat[i], prefix));
580:     if (!pc->setupcalled) PetscCall(KSPSetFromOptions(osm->ksp[i]));
581:   }
582:   if (osm->pcmat) {
583:     PetscCall(MatDestroy(&pc->pmat));
584:     pc->pmat   = osm->pcmat;
585:     osm->pcmat = NULL;
586:   }
587:   PetscFunctionReturn(PETSC_SUCCESS);
588: }

590: static PetscErrorCode PCSetUpOnBlocks_GASM(PC pc)
591: {
592:   PC_GASM *osm = (PC_GASM *)pc->data;
593:   PetscInt i;

595:   PetscFunctionBegin;
596:   for (i = 0; i < osm->n; i++) PetscCall(KSPSetUp(osm->ksp[i]));
597:   PetscFunctionReturn(PETSC_SUCCESS);
598: }

600: static PetscErrorCode PCApply_GASM(PC pc, Vec xin, Vec yout)
601: {
602:   PC_GASM    *osm = (PC_GASM *)pc->data;
603:   PetscInt    i;
604:   Vec         x, y;
605:   ScatterMode forward = SCATTER_FORWARD, reverse = SCATTER_REVERSE;

607:   PetscFunctionBegin;
608:   if (osm->pctoouter) {
609:     PetscCall(VecScatterBegin(osm->pctoouter, xin, osm->pcx, INSERT_VALUES, SCATTER_REVERSE));
610:     PetscCall(VecScatterEnd(osm->pctoouter, xin, osm->pcx, INSERT_VALUES, SCATTER_REVERSE));
611:     x = osm->pcx;
612:     y = osm->pcy;
613:   } else {
614:     x = xin;
615:     y = yout;
616:   }
617:   /*
618:      support for limiting the restriction or interpolation only to the inner
619:      subdomain values (leaving the other values 0).
620:   */
621:   if (!(osm->type & PC_GASM_RESTRICT)) {
622:     /* have to zero the work RHS since scatter may leave some slots empty */
623:     PetscCall(VecZeroEntries(osm->gx));
624:     PetscCall(VecScatterBegin(osm->girestriction, x, osm->gx, INSERT_VALUES, forward));
625:   } else {
626:     PetscCall(VecScatterBegin(osm->gorestriction, x, osm->gx, INSERT_VALUES, forward));
627:   }
628:   PetscCall(VecZeroEntries(osm->gy));
629:   if (!(osm->type & PC_GASM_RESTRICT)) {
630:     PetscCall(VecScatterEnd(osm->girestriction, x, osm->gx, INSERT_VALUES, forward));
631:   } else {
632:     PetscCall(VecScatterEnd(osm->gorestriction, x, osm->gx, INSERT_VALUES, forward));
633:   }
634:   /* do the subdomain solves */
635:   for (i = 0; i < osm->n; ++i) {
636:     PetscCall(KSPSolve(osm->ksp[i], osm->x[i], osm->y[i]));
637:     PetscCall(KSPCheckSolve(osm->ksp[i], pc, osm->y[i]));
638:   }
639:   /* do we need to zero y? */
640:   PetscCall(VecZeroEntries(y));
641:   if (!(osm->type & PC_GASM_INTERPOLATE)) {
642:     PetscCall(VecScatterBegin(osm->girestriction, osm->gy, y, ADD_VALUES, reverse));
643:     PetscCall(VecScatterEnd(osm->girestriction, osm->gy, y, ADD_VALUES, reverse));
644:   } else {
645:     PetscCall(VecScatterBegin(osm->gorestriction, osm->gy, y, ADD_VALUES, reverse));
646:     PetscCall(VecScatterEnd(osm->gorestriction, osm->gy, y, ADD_VALUES, reverse));
647:   }
648:   if (osm->pctoouter) {
649:     PetscCall(VecScatterBegin(osm->pctoouter, y, yout, INSERT_VALUES, SCATTER_FORWARD));
650:     PetscCall(VecScatterEnd(osm->pctoouter, y, yout, INSERT_VALUES, SCATTER_FORWARD));
651:   }
652:   PetscFunctionReturn(PETSC_SUCCESS);
653: }

655: static PetscErrorCode PCMatApply_GASM(PC pc, Mat Xin, Mat Yout)
656: {
657:   PC_GASM    *osm = (PC_GASM *)pc->data;
658:   Mat         X, Y, O = NULL, Z, W;
659:   Vec         x, y;
660:   PetscInt    i, m, M, N;
661:   ScatterMode forward = SCATTER_FORWARD, reverse = SCATTER_REVERSE;

663:   PetscFunctionBegin;
664:   PetscCheck(osm->n == 1, PetscObjectComm((PetscObject)pc), PETSC_ERR_SUP, "Not yet implemented");
665:   PetscCall(MatGetSize(Xin, NULL, &N));
666:   if (osm->pctoouter) {
667:     PetscCall(VecGetLocalSize(osm->pcx, &m));
668:     PetscCall(VecGetSize(osm->pcx, &M));
669:     PetscCall(MatCreateDense(PetscObjectComm((PetscObject)osm->ois[0]), m, PETSC_DECIDE, M, N, NULL, &O));
670:     for (i = 0; i < N; ++i) {
671:       PetscCall(MatDenseGetColumnVecRead(Xin, i, &x));
672:       PetscCall(MatDenseGetColumnVecWrite(O, i, &y));
673:       PetscCall(VecScatterBegin(osm->pctoouter, x, y, INSERT_VALUES, SCATTER_REVERSE));
674:       PetscCall(VecScatterEnd(osm->pctoouter, x, y, INSERT_VALUES, SCATTER_REVERSE));
675:       PetscCall(MatDenseRestoreColumnVecWrite(O, i, &y));
676:       PetscCall(MatDenseRestoreColumnVecRead(Xin, i, &x));
677:     }
678:     X = Y = O;
679:   } else {
680:     X = Xin;
681:     Y = Yout;
682:   }
683:   /*
684:      support for limiting the restriction or interpolation only to the inner
685:      subdomain values (leaving the other values 0).
686:   */
687:   PetscCall(VecGetLocalSize(osm->x[0], &m));
688:   PetscCall(VecGetSize(osm->x[0], &M));
689:   PetscCall(MatCreateDense(PetscObjectComm((PetscObject)osm->ois[0]), m, PETSC_DECIDE, M, N, NULL, &Z));
690:   for (i = 0; i < N; ++i) {
691:     PetscCall(MatDenseGetColumnVecRead(X, i, &x));
692:     PetscCall(MatDenseGetColumnVecWrite(Z, i, &y));
693:     if (!(osm->type & PC_GASM_RESTRICT)) {
694:       /* have to zero the work RHS since scatter may leave some slots empty */
695:       PetscCall(VecZeroEntries(y));
696:       PetscCall(VecScatterBegin(osm->girestriction, x, y, INSERT_VALUES, forward));
697:       PetscCall(VecScatterEnd(osm->girestriction, x, y, INSERT_VALUES, forward));
698:     } else {
699:       PetscCall(VecScatterBegin(osm->gorestriction, x, y, INSERT_VALUES, forward));
700:       PetscCall(VecScatterEnd(osm->gorestriction, x, y, INSERT_VALUES, forward));
701:     }
702:     PetscCall(MatDenseRestoreColumnVecWrite(Z, i, &y));
703:     PetscCall(MatDenseRestoreColumnVecRead(X, i, &x));
704:   }
705:   PetscCall(MatCreateDense(PetscObjectComm((PetscObject)osm->ois[0]), m, PETSC_DECIDE, M, N, NULL, &W));
706:   PetscCall(MatSetOption(Z, MAT_NO_OFF_PROC_ENTRIES, PETSC_TRUE));
707:   PetscCall(MatAssemblyBegin(Z, MAT_FINAL_ASSEMBLY));
708:   PetscCall(MatAssemblyEnd(Z, MAT_FINAL_ASSEMBLY));
709:   /* do the subdomain solve */
710:   PetscCall(KSPMatSolve(osm->ksp[0], Z, W));
711:   PetscCall(KSPCheckSolve(osm->ksp[0], pc, NULL));
712:   PetscCall(MatDestroy(&Z));
713:   /* do we need to zero y? */
714:   PetscCall(MatZeroEntries(Y));
715:   for (i = 0; i < N; ++i) {
716:     PetscCall(MatDenseGetColumnVecWrite(Y, i, &y));
717:     PetscCall(MatDenseGetColumnVecRead(W, i, &x));
718:     if (!(osm->type & PC_GASM_INTERPOLATE)) {
719:       PetscCall(VecScatterBegin(osm->girestriction, x, y, ADD_VALUES, reverse));
720:       PetscCall(VecScatterEnd(osm->girestriction, x, y, ADD_VALUES, reverse));
721:     } else {
722:       PetscCall(VecScatterBegin(osm->gorestriction, x, y, ADD_VALUES, reverse));
723:       PetscCall(VecScatterEnd(osm->gorestriction, x, y, ADD_VALUES, reverse));
724:     }
725:     PetscCall(MatDenseRestoreColumnVecRead(W, i, &x));
726:     if (osm->pctoouter) {
727:       PetscCall(MatDenseGetColumnVecWrite(Yout, i, &x));
728:       PetscCall(VecScatterBegin(osm->pctoouter, y, x, INSERT_VALUES, SCATTER_FORWARD));
729:       PetscCall(VecScatterEnd(osm->pctoouter, y, x, INSERT_VALUES, SCATTER_FORWARD));
730:       PetscCall(MatDenseRestoreColumnVecRead(Yout, i, &x));
731:     }
732:     PetscCall(MatDenseRestoreColumnVecWrite(Y, i, &y));
733:   }
734:   PetscCall(MatDestroy(&W));
735:   PetscCall(MatDestroy(&O));
736:   PetscFunctionReturn(PETSC_SUCCESS);
737: }

739: static PetscErrorCode PCApplyTranspose_GASM(PC pc, Vec xin, Vec yout)
740: {
741:   PC_GASM    *osm = (PC_GASM *)pc->data;
742:   PetscInt    i;
743:   Vec         x, y;
744:   ScatterMode forward = SCATTER_FORWARD, reverse = SCATTER_REVERSE;

746:   PetscFunctionBegin;
747:   if (osm->pctoouter) {
748:     PetscCall(VecScatterBegin(osm->pctoouter, xin, osm->pcx, INSERT_VALUES, SCATTER_REVERSE));
749:     PetscCall(VecScatterEnd(osm->pctoouter, xin, osm->pcx, INSERT_VALUES, SCATTER_REVERSE));
750:     x = osm->pcx;
751:     y = osm->pcy;
752:   } else {
753:     x = xin;
754:     y = yout;
755:   }
756:   /*
757:      Support for limiting the restriction or interpolation to only local
758:      subdomain values (leaving the other values 0).

760:      Note: these are reversed from the PCApply_GASM() because we are applying the
761:      transpose of the three terms
762:   */
763:   if (!(osm->type & PC_GASM_INTERPOLATE)) {
764:     /* have to zero the work RHS since scatter may leave some slots empty */
765:     PetscCall(VecZeroEntries(osm->gx));
766:     PetscCall(VecScatterBegin(osm->girestriction, x, osm->gx, INSERT_VALUES, forward));
767:   } else {
768:     PetscCall(VecScatterBegin(osm->gorestriction, x, osm->gx, INSERT_VALUES, forward));
769:   }
770:   PetscCall(VecZeroEntries(osm->gy));
771:   if (!(osm->type & PC_GASM_INTERPOLATE)) {
772:     PetscCall(VecScatterEnd(osm->girestriction, x, osm->gx, INSERT_VALUES, forward));
773:   } else {
774:     PetscCall(VecScatterEnd(osm->gorestriction, x, osm->gx, INSERT_VALUES, forward));
775:   }
776:   /* do the local solves */
777:   for (i = 0; i < osm->n; ++i) { /* Note that the solves are local, so we can go to osm->n, rather than osm->nmax. */
778:     PetscCall(KSPSolveTranspose(osm->ksp[i], osm->x[i], osm->y[i]));
779:     PetscCall(KSPCheckSolve(osm->ksp[i], pc, osm->y[i]));
780:   }
781:   PetscCall(VecZeroEntries(y));
782:   if (!(osm->type & PC_GASM_RESTRICT)) {
783:     PetscCall(VecScatterBegin(osm->girestriction, osm->gy, y, ADD_VALUES, reverse));
784:     PetscCall(VecScatterEnd(osm->girestriction, osm->gy, y, ADD_VALUES, reverse));
785:   } else {
786:     PetscCall(VecScatterBegin(osm->gorestriction, osm->gy, y, ADD_VALUES, reverse));
787:     PetscCall(VecScatterEnd(osm->gorestriction, osm->gy, y, ADD_VALUES, reverse));
788:   }
789:   if (osm->pctoouter) {
790:     PetscCall(VecScatterBegin(osm->pctoouter, y, yout, INSERT_VALUES, SCATTER_FORWARD));
791:     PetscCall(VecScatterEnd(osm->pctoouter, y, yout, INSERT_VALUES, SCATTER_FORWARD));
792:   }
793:   PetscFunctionReturn(PETSC_SUCCESS);
794: }

796: static PetscErrorCode PCReset_GASM(PC pc)
797: {
798:   PC_GASM *osm = (PC_GASM *)pc->data;
799:   PetscInt i;

801:   PetscFunctionBegin;
802:   if (osm->ksp) {
803:     for (i = 0; i < osm->n; i++) PetscCall(KSPReset(osm->ksp[i]));
804:   }
805:   if (osm->pmat) {
806:     if (osm->n > 0) {
807:       PetscMPIInt size;
808:       PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)pc), &size));
809:       if (size > 1) {
810:         /* osm->pmat is created by MatCreateSubMatricesMPI(), cannot use MatDestroySubMatrices() */
811:         PetscCall(MatDestroyMatrices(osm->n, &osm->pmat));
812:       } else {
813:         PetscCall(MatDestroySubMatrices(osm->n, &osm->pmat));
814:       }
815:     }
816:   }
817:   if (osm->x) {
818:     for (i = 0; i < osm->n; i++) {
819:       PetscCall(VecDestroy(&osm->x[i]));
820:       PetscCall(VecDestroy(&osm->y[i]));
821:     }
822:   }
823:   PetscCall(VecDestroy(&osm->gx));
824:   PetscCall(VecDestroy(&osm->gy));

826:   PetscCall(VecScatterDestroy(&osm->gorestriction));
827:   PetscCall(VecScatterDestroy(&osm->girestriction));
828:   if (!osm->user_subdomains) {
829:     PetscCall(PCGASMDestroySubdomains(osm->n, &osm->ois, &osm->iis));
830:     osm->N    = PETSC_DETERMINE;
831:     osm->nmax = PETSC_DETERMINE;
832:   }
833:   if (osm->pctoouter) PetscCall(VecScatterDestroy(&osm->pctoouter));
834:   if (osm->permutationIS) PetscCall(ISDestroy(&osm->permutationIS));
835:   if (osm->pcx) PetscCall(VecDestroy(&osm->pcx));
836:   if (osm->pcy) PetscCall(VecDestroy(&osm->pcy));
837:   if (osm->permutationP) PetscCall(MatDestroy(&osm->permutationP));
838:   if (osm->pcmat) PetscCall(MatDestroy(&osm->pcmat));
839:   PetscFunctionReturn(PETSC_SUCCESS);
840: }

842: static PetscErrorCode PCDestroy_GASM(PC pc)
843: {
844:   PC_GASM *osm = (PC_GASM *)pc->data;
845:   PetscInt i;

847:   PetscFunctionBegin;
848:   PetscCall(PCReset_GASM(pc));
849:   /* PCReset will not destroy subdomains, if user_subdomains is true. */
850:   PetscCall(PCGASMDestroySubdomains(osm->n, &osm->ois, &osm->iis));
851:   if (osm->ksp) {
852:     for (i = 0; i < osm->n; i++) PetscCall(KSPDestroy(&osm->ksp[i]));
853:     PetscCall(PetscFree(osm->ksp));
854:   }
855:   PetscCall(PetscFree(osm->x));
856:   PetscCall(PetscFree(osm->y));
857:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMSetSubdomains_C", NULL));
858:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMSetOverlap_C", NULL));
859:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMSetType_C", NULL));
860:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMSetSortIndices_C", NULL));
861:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMGetSubKSP_C", NULL));
862:   PetscCall(PetscFree(pc->data));
863:   PetscFunctionReturn(PETSC_SUCCESS);
864: }

866: static PetscErrorCode PCSetFromOptions_GASM(PC pc, PetscOptionItems *PetscOptionsObject)
867: {
868:   PC_GASM   *osm = (PC_GASM *)pc->data;
869:   PetscInt   blocks, ovl;
870:   PetscBool  flg;
871:   PCGASMType gasmtype;

873:   PetscFunctionBegin;
874:   PetscOptionsHeadBegin(PetscOptionsObject, "Generalized additive Schwarz options");
875:   PetscCall(PetscOptionsBool("-pc_gasm_use_dm_subdomains", "If subdomains aren't set, use DMCreateDomainDecomposition() to define subdomains.", "PCGASMSetUseDMSubdomains", osm->dm_subdomains, &osm->dm_subdomains, &flg));
876:   PetscCall(PetscOptionsInt("-pc_gasm_total_subdomains", "Total number of subdomains across communicator", "PCGASMSetTotalSubdomains", osm->N, &blocks, &flg));
877:   if (flg) PetscCall(PCGASMSetTotalSubdomains(pc, blocks));
878:   PetscCall(PetscOptionsInt("-pc_gasm_overlap", "Number of overlapping degrees of freedom", "PCGASMSetOverlap", osm->overlap, &ovl, &flg));
879:   if (flg) {
880:     PetscCall(PCGASMSetOverlap(pc, ovl));
881:     osm->dm_subdomains = PETSC_FALSE;
882:   }
883:   flg = PETSC_FALSE;
884:   PetscCall(PetscOptionsEnum("-pc_gasm_type", "Type of restriction/extension", "PCGASMSetType", PCGASMTypes, (PetscEnum)osm->type, (PetscEnum *)&gasmtype, &flg));
885:   if (flg) PetscCall(PCGASMSetType(pc, gasmtype));
886:   PetscCall(PetscOptionsBool("-pc_gasm_use_hierachical_partitioning", "use hierarchical partitioning", NULL, osm->hierarchicalpartitioning, &osm->hierarchicalpartitioning, &flg));
887:   PetscOptionsHeadEnd();
888:   PetscFunctionReturn(PETSC_SUCCESS);
889: }

891: /*@
892:   PCGASMSetTotalSubdomains - sets the total number of subdomains to use across the communicator for `PCGASM`

894:   Logically Collective

896:   Input Parameters:
897: + pc - the preconditioner
898: - N  - total number of subdomains

900:   Level: beginner

902: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetSubdomains()`, `PCGASMSetOverlap()`
903:           `PCGASMCreateSubdomains2D()`
904: @*/
905: PetscErrorCode PCGASMSetTotalSubdomains(PC pc, PetscInt N)
906: {
907:   PC_GASM    *osm = (PC_GASM *)pc->data;
908:   PetscMPIInt size, rank;

910:   PetscFunctionBegin;
911:   PetscCheck(N >= 1, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Total number of subdomains must be 1 or more, got N = %" PetscInt_FMT, N);
912:   PetscCheck(!pc->setupcalled, PetscObjectComm((PetscObject)pc), PETSC_ERR_ARG_WRONGSTATE, "PCGASMSetTotalSubdomains() should be called before calling PCSetUp().");

914:   PetscCall(PCGASMDestroySubdomains(osm->n, &osm->iis, &osm->ois));
915:   osm->ois = osm->iis = NULL;

917:   PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)pc), &size));
918:   PetscCallMPI(MPI_Comm_rank(PetscObjectComm((PetscObject)pc), &rank));
919:   osm->N             = N;
920:   osm->n             = PETSC_DETERMINE;
921:   osm->nmax          = PETSC_DETERMINE;
922:   osm->dm_subdomains = PETSC_FALSE;
923:   PetscFunctionReturn(PETSC_SUCCESS);
924: }

926: static PetscErrorCode PCGASMSetSubdomains_GASM(PC pc, PetscInt n, IS iis[], IS ois[])
927: {
928:   PC_GASM *osm = (PC_GASM *)pc->data;
929:   PetscInt i;

931:   PetscFunctionBegin;
932:   PetscCheck(n >= 1, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Each MPI rank must have 1 or more subdomains, got n = %" PetscInt_FMT, n);
933:   PetscCheck(!pc->setupcalled, PetscObjectComm((PetscObject)pc), PETSC_ERR_ARG_WRONGSTATE, "PCGASMSetSubdomains() should be called before calling PCSetUp().");

935:   PetscCall(PCGASMDestroySubdomains(osm->n, &osm->iis, &osm->ois));
936:   osm->iis = osm->ois = NULL;
937:   osm->n              = n;
938:   osm->N              = PETSC_DETERMINE;
939:   osm->nmax           = PETSC_DETERMINE;
940:   if (ois) {
941:     PetscCall(PetscMalloc1(n, &osm->ois));
942:     for (i = 0; i < n; i++) {
943:       PetscCall(PetscObjectReference((PetscObject)ois[i]));
944:       osm->ois[i] = ois[i];
945:     }
946:     /*
947:        Since the user set the outer subdomains, even if nontrivial overlap was requested via PCGASMSetOverlap(),
948:        it will be ignored.  To avoid confusion later on (e.g., when viewing the PC), the overlap size is set to -1.
949:     */
950:     osm->overlap = -1;
951:     /* inner subdomains must be provided  */
952:     PetscCheck(iis, PETSC_COMM_SELF, PETSC_ERR_ARG_NULL, "inner indices have to be provided ");
953:   } /* end if */
954:   if (iis) {
955:     PetscCall(PetscMalloc1(n, &osm->iis));
956:     for (i = 0; i < n; i++) {
957:       PetscCall(PetscObjectReference((PetscObject)iis[i]));
958:       osm->iis[i] = iis[i];
959:     }
960:     if (!ois) {
961:       osm->ois = NULL;
962:       /* if user does not provide outer indices, we will create the corresponding outer indices using  osm->overlap =1 in PCSetUp_GASM */
963:     }
964:   }
965:   if (PetscDefined(USE_DEBUG)) {
966:     PetscInt        j, rstart, rend, *covered, lsize;
967:     const PetscInt *indices;
968:     /* check if the inner indices cover and only cover the local portion of the preconditioning matrix */
969:     PetscCall(MatGetOwnershipRange(pc->pmat, &rstart, &rend));
970:     PetscCall(PetscCalloc1(rend - rstart, &covered));
971:     /* check if the current MPI rank owns indices from others */
972:     for (i = 0; i < n; i++) {
973:       PetscCall(ISGetIndices(osm->iis[i], &indices));
974:       PetscCall(ISGetLocalSize(osm->iis[i], &lsize));
975:       for (j = 0; j < lsize; j++) {
976:         PetscCheck(indices[j] >= rstart && indices[j] < rend, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "inner subdomains can not own an index %" PetscInt_FMT " from other ranks", indices[j]);
977:         PetscCheck(covered[indices[j] - rstart] != 1, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "inner subdomains can not have an overlapping index %" PetscInt_FMT " ", indices[j]);
978:         covered[indices[j] - rstart] = 1;
979:       }
980:       PetscCall(ISRestoreIndices(osm->iis[i], &indices));
981:     }
982:     /* check if we miss any indices */
983:     for (i = rstart; i < rend; i++) PetscCheck(covered[i - rstart], PETSC_COMM_SELF, PETSC_ERR_ARG_NULL, "local entity %" PetscInt_FMT " was not covered by inner subdomains", i);
984:     PetscCall(PetscFree(covered));
985:   }
986:   if (iis) osm->user_subdomains = PETSC_TRUE;
987:   PetscFunctionReturn(PETSC_SUCCESS);
988: }

990: static PetscErrorCode PCGASMSetOverlap_GASM(PC pc, PetscInt ovl)
991: {
992:   PC_GASM *osm = (PC_GASM *)pc->data;

994:   PetscFunctionBegin;
995:   PetscCheck(ovl >= 0, PetscObjectComm((PetscObject)pc), PETSC_ERR_ARG_OUTOFRANGE, "Negative overlap value requested");
996:   PetscCheck(!pc->setupcalled || ovl == osm->overlap, PetscObjectComm((PetscObject)pc), PETSC_ERR_ARG_WRONGSTATE, "PCGASMSetOverlap() should be called before PCSetUp().");
997:   if (!pc->setupcalled) osm->overlap = ovl;
998:   PetscFunctionReturn(PETSC_SUCCESS);
999: }

1001: static PetscErrorCode PCGASMSetType_GASM(PC pc, PCGASMType type)
1002: {
1003:   PC_GASM *osm = (PC_GASM *)pc->data;

1005:   PetscFunctionBegin;
1006:   osm->type     = type;
1007:   osm->type_set = PETSC_TRUE;
1008:   PetscFunctionReturn(PETSC_SUCCESS);
1009: }

1011: static PetscErrorCode PCGASMSetSortIndices_GASM(PC pc, PetscBool doSort)
1012: {
1013:   PC_GASM *osm = (PC_GASM *)pc->data;

1015:   PetscFunctionBegin;
1016:   osm->sort_indices = doSort;
1017:   PetscFunctionReturn(PETSC_SUCCESS);
1018: }

1020: /*
1021:    FIXME: This routine might need to be modified now that multiple ranks per subdomain are allowed.
1022:         In particular, it would upset the global subdomain number calculation.
1023: */
1024: static PetscErrorCode PCGASMGetSubKSP_GASM(PC pc, PetscInt *n, PetscInt *first, KSP **ksp)
1025: {
1026:   PC_GASM *osm = (PC_GASM *)pc->data;

1028:   PetscFunctionBegin;
1029:   PetscCheck(osm->n >= 1, PetscObjectComm((PetscObject)pc), PETSC_ERR_ORDER, "Need to call PCSetUp() on PC (or KSPSetUp() on the outer KSP object) before calling here");

1031:   if (n) *n = osm->n;
1032:   if (first) {
1033:     PetscCallMPI(MPI_Scan(&osm->n, first, 1, MPIU_INT, MPI_SUM, PetscObjectComm((PetscObject)pc)));
1034:     *first -= osm->n;
1035:   }
1036:   if (ksp) {
1037:     /* Assume that local solves are now different; not necessarily
1038:        true, though!  This flag is used only for PCView_GASM() */
1039:     *ksp                        = osm->ksp;
1040:     osm->same_subdomain_solvers = PETSC_FALSE;
1041:   }
1042:   PetscFunctionReturn(PETSC_SUCCESS);
1043: } /* PCGASMGetSubKSP_GASM() */

1045: /*@C
1046:   PCGASMSetSubdomains - Sets the subdomains for this MPI rank
1047:   for the additive Schwarz preconditioner with multiple MPI ranks per subdomain, `PCGASM`

1049:   Collective

1051:   Input Parameters:
1052: + pc  - the preconditioner object
1053: . n   - the number of subdomains for this MPI rank
1054: . iis - the index sets that define the inner subdomains (or `NULL` for PETSc to determine subdomains)
1055: - ois - the index sets that define the outer subdomains (or `NULL` to use the same as `iis`, or to construct by expanding `iis` by
1056:           the requested overlap)

1058:   Level: advanced

1060:   Notes:
1061:   The `IS` indices use the parallel, global numbering of the vector entries.

1063:   Inner subdomains are those where the correction is applied.

1065:   Outer subdomains are those where the residual necessary to obtain the
1066:   corrections is obtained (see `PCGASMType` for the use of inner/outer subdomains).

1068:   Both inner and outer subdomains can extend over several MPI ranks.
1069:   This rank's portion of a subdomain is known as a local subdomain.

1071:   Inner subdomains can not overlap with each other, do not have any entities from remote ranks,
1072:   and  have to cover the entire local subdomain owned by the current rank. The index sets on each
1073:   rank should be ordered such that the ith local subdomain is connected to the ith remote subdomain
1074:   on another MPI rank.

1076:   By default the `PGASM` preconditioner uses 1 (local) subdomain per MPI rank.

1078:   The `iis` and `ois` arrays may be freed after this call using `PCGASMDestroySubdomains()`

1080: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetOverlap()`, `PCGASMGetSubKSP()`, `PCGASMDestroySubdomains()`,
1081:           `PCGASMCreateSubdomains2D()`, `PCGASMGetSubdomains()`
1082: @*/
1083: PetscErrorCode PCGASMSetSubdomains(PC pc, PetscInt n, IS iis[], IS ois[])
1084: {
1085:   PC_GASM *osm = (PC_GASM *)pc->data;

1087:   PetscFunctionBegin;
1089:   PetscTryMethod(pc, "PCGASMSetSubdomains_C", (PC, PetscInt, IS[], IS[]), (pc, n, iis, ois));
1090:   osm->dm_subdomains = PETSC_FALSE;
1091:   PetscFunctionReturn(PETSC_SUCCESS);
1092: }

1094: /*@
1095:   PCGASMSetOverlap - Sets the overlap between a pair of subdomains for the
1096:   additive Schwarz preconditioner `PCGASM`.  Either all or no MPI ranks in the
1097:   pc communicator must call this routine.

1099:   Logically Collective

1101:   Input Parameters:
1102: + pc  - the preconditioner context
1103: - ovl - the amount of overlap between subdomains (ovl >= 0, default value = 0)

1105:   Options Database Key:
1106: . -pc_gasm_overlap <overlap> - Sets overlap

1108:   Level: intermediate

1110:   Notes:
1111:   By default the `PCGASM` preconditioner uses 1 subdomain per rank.  To use
1112:   multiple subdomain per perocessor or "straddling" subdomains that intersect
1113:   multiple ranks use `PCGASMSetSubdomains()` (or option `-pc_gasm_total_subdomains` <n>).

1115:   The overlap defaults to 0, so if one desires that no additional
1116:   overlap be computed beyond what may have been set with a call to
1117:   `PCGASMSetSubdomains()`, then `ovl` must be set to be 0.  In particular, if one does
1118:   not explicitly set the subdomains in application code, then all overlap would be computed
1119:   internally by PETSc, and using an overlap of 0 would result in an `PCGASM`
1120:   variant that is equivalent to the block Jacobi preconditioner.

1122:   One can define initial index sets with any overlap via
1123:   `PCGASMSetSubdomains()`; the routine `PCGASMSetOverlap()` merely allows
1124:   PETSc to extend that overlap further, if desired.

1126: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetSubdomains()`, `PCGASMGetSubKSP()`,
1127:           `PCGASMCreateSubdomains2D()`, `PCGASMGetSubdomains()`
1128: @*/
1129: PetscErrorCode PCGASMSetOverlap(PC pc, PetscInt ovl)
1130: {
1131:   PC_GASM *osm = (PC_GASM *)pc->data;

1133:   PetscFunctionBegin;
1136:   PetscTryMethod(pc, "PCGASMSetOverlap_C", (PC, PetscInt), (pc, ovl));
1137:   osm->dm_subdomains = PETSC_FALSE;
1138:   PetscFunctionReturn(PETSC_SUCCESS);
1139: }

1141: /*@
1142:   PCGASMSetType - Sets the type of restriction and interpolation used
1143:   for local problems in the `PCGASM` additive Schwarz method.

1145:   Logically Collective

1147:   Input Parameters:
1148: + pc   - the preconditioner context
1149: - type - variant of `PCGASM`, one of
1150: .vb
1151:       `PC_GASM_BASIC`       - full interpolation and restriction
1152:       `PC_GASM_RESTRICT`    - full restriction, local MPI rank interpolation
1153:       `PC_GASM_INTERPOLATE` - full interpolation, local MPI rank restriction
1154:       `PC_GASM_NONE`        - local MPI rank restriction and interpolation
1155: .ve

1157:   Options Database Key:
1158: . -pc_gasm_type [basic,restrict,interpolate,none] - Sets `PCGASM` type

1160:   Level: intermediate

1162: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetSubdomains()`, `PCGASMGetSubKSP()`,
1163:           `PCGASMCreateSubdomains2D()`, `PCASM`, `PCASMSetType()`
1164: @*/
1165: PetscErrorCode PCGASMSetType(PC pc, PCGASMType type)
1166: {
1167:   PetscFunctionBegin;
1170:   PetscTryMethod(pc, "PCGASMSetType_C", (PC, PCGASMType), (pc, type));
1171:   PetscFunctionReturn(PETSC_SUCCESS);
1172: }

1174: /*@
1175:   PCGASMSetSortIndices - Determines whether subdomain indices are sorted.

1177:   Logically Collective

1179:   Input Parameters:
1180: + pc     - the preconditioner context
1181: - doSort - sort the subdomain indices

1183:   Level: intermediate

1185: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetSubdomains()`, `PCGASMGetSubKSP()`,
1186:           `PCGASMCreateSubdomains2D()`
1187: @*/
1188: PetscErrorCode PCGASMSetSortIndices(PC pc, PetscBool doSort)
1189: {
1190:   PetscFunctionBegin;
1193:   PetscTryMethod(pc, "PCGASMSetSortIndices_C", (PC, PetscBool), (pc, doSort));
1194:   PetscFunctionReturn(PETSC_SUCCESS);
1195: }

1197: /*@C
1198:   PCGASMGetSubKSP - Gets the local `KSP` contexts for all subdomains on
1199:   this MPI rank.

1201:   Collective iff first_local is requested

1203:   Input Parameter:
1204: . pc - the preconditioner context

1206:   Output Parameters:
1207: + n_local     - the number of blocks on this MPI rank or `NULL`
1208: . first_local - the global number of the first block on this rank or `NULL`,
1209:                  all ranks must request or all must pass `NULL`
1210: - ksp         - the array of `KSP` contexts

1212:   Level: advanced

1214:   Note:
1215:   After `PCGASMGetSubKSP()` the array of `KSP`es is not to be freed

1217:   Currently for some matrix implementations only 1 block per MPI process
1218:   is supported.

1220:   You must call `KSPSetUp()` before calling `PCGASMGetSubKSP()`.

1222: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetSubdomains()`, `PCGASMSetOverlap()`,
1223:           `PCGASMCreateSubdomains2D()`,
1224: @*/
1225: PetscErrorCode PCGASMGetSubKSP(PC pc, PetscInt *n_local, PetscInt *first_local, KSP *ksp[])
1226: {
1227:   PetscFunctionBegin;
1229:   PetscUseMethod(pc, "PCGASMGetSubKSP_C", (PC, PetscInt *, PetscInt *, KSP **), (pc, n_local, first_local, ksp));
1230:   PetscFunctionReturn(PETSC_SUCCESS);
1231: }

1233: /*MC
1234:    PCGASM - Use the (restricted) additive Schwarz method, each block is (approximately) solved with
1235:            its own `KSP` object on a subset of MPI processes

1237:    Options Database Keys:
1238: +  -pc_gasm_total_subdomains <n>                   - Sets total number of local subdomains to be distributed among the MPI processes
1239: .  -pc_gasm_view_subdomains                        - activates the printing of subdomain indices in `PCView()`, -ksp_view or -snes_view
1240: .  -pc_gasm_print_subdomains                       - activates the printing of subdomain indices in `PCSetUp()`
1241: .  -pc_gasm_overlap <ovl>                          - Sets overlap by which to (automatically) extend local subdomains
1242: -  -pc_gasm_type [basic,restrict,interpolate,none] - Sets `PCGASMType`

1244:    Level: beginner

1246:    Notes:
1247:    To set options on the solvers for each block append `-sub_` to all the `KSP`, and `PC`
1248:    options database keys. For example, `-sub_pc_type ilu -sub_pc_factor_levels 1 -sub_ksp_type preonly`

1250:    To set the options on the solvers separate for each block call `PCGASMGetSubKSP()`
1251:    and set the options directly on the resulting `KSP` object (you can access its `PC`
1252:    with `KSPGetPC()`)

1254:    See {cite}`dryja1987additive` and {cite}`1sbg` for details on additive Schwarz algorithms

1256: .seealso: [](ch_ksp), `PCCreate()`, `PCSetType()`, `PCType`, `PC`, `PCASM`, `PCGASMType`, `PCGASMSetType()`,
1257:           `PCBJACOBI`, `PCGASMGetSubKSP()`, `PCGASMSetSubdomains()`,
1258:           `PCSetModifySubMatrices()`, `PCGASMSetOverlap()`, `PCGASMSetType()`
1259: M*/

1261: PETSC_EXTERN PetscErrorCode PCCreate_GASM(PC pc)
1262: {
1263:   PC_GASM *osm;

1265:   PetscFunctionBegin;
1266:   PetscCall(PetscNew(&osm));

1268:   osm->N                        = PETSC_DETERMINE;
1269:   osm->n                        = PETSC_DECIDE;
1270:   osm->nmax                     = PETSC_DETERMINE;
1271:   osm->overlap                  = 0;
1272:   osm->ksp                      = NULL;
1273:   osm->gorestriction            = NULL;
1274:   osm->girestriction            = NULL;
1275:   osm->pctoouter                = NULL;
1276:   osm->gx                       = NULL;
1277:   osm->gy                       = NULL;
1278:   osm->x                        = NULL;
1279:   osm->y                        = NULL;
1280:   osm->pcx                      = NULL;
1281:   osm->pcy                      = NULL;
1282:   osm->permutationIS            = NULL;
1283:   osm->permutationP             = NULL;
1284:   osm->pcmat                    = NULL;
1285:   osm->ois                      = NULL;
1286:   osm->iis                      = NULL;
1287:   osm->pmat                     = NULL;
1288:   osm->type                     = PC_GASM_RESTRICT;
1289:   osm->same_subdomain_solvers   = PETSC_TRUE;
1290:   osm->sort_indices             = PETSC_TRUE;
1291:   osm->dm_subdomains            = PETSC_FALSE;
1292:   osm->hierarchicalpartitioning = PETSC_FALSE;

1294:   pc->data                 = (void *)osm;
1295:   pc->ops->apply           = PCApply_GASM;
1296:   pc->ops->matapply        = PCMatApply_GASM;
1297:   pc->ops->applytranspose  = PCApplyTranspose_GASM;
1298:   pc->ops->setup           = PCSetUp_GASM;
1299:   pc->ops->reset           = PCReset_GASM;
1300:   pc->ops->destroy         = PCDestroy_GASM;
1301:   pc->ops->setfromoptions  = PCSetFromOptions_GASM;
1302:   pc->ops->setuponblocks   = PCSetUpOnBlocks_GASM;
1303:   pc->ops->view            = PCView_GASM;
1304:   pc->ops->applyrichardson = NULL;

1306:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMSetSubdomains_C", PCGASMSetSubdomains_GASM));
1307:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMSetOverlap_C", PCGASMSetOverlap_GASM));
1308:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMSetType_C", PCGASMSetType_GASM));
1309:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMSetSortIndices_C", PCGASMSetSortIndices_GASM));
1310:   PetscCall(PetscObjectComposeFunction((PetscObject)pc, "PCGASMGetSubKSP_C", PCGASMGetSubKSP_GASM));
1311:   PetscFunctionReturn(PETSC_SUCCESS);
1312: }

1314: PetscErrorCode PCGASMCreateLocalSubdomains(Mat A, PetscInt nloc, IS *iis[])
1315: {
1316:   MatPartitioning mpart;
1317:   const char     *prefix;
1318:   PetscInt        i, j, rstart, rend, bs;
1319:   PetscBool       hasop, isbaij = PETSC_FALSE, foundpart = PETSC_FALSE;
1320:   Mat             Ad = NULL, adj;
1321:   IS              ispart, isnumb, *is;

1323:   PetscFunctionBegin;
1324:   PetscCheck(nloc >= 1, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "number of local subdomains must > 0, got nloc = %" PetscInt_FMT, nloc);

1326:   /* Get prefix, row distribution, and block size */
1327:   PetscCall(MatGetOptionsPrefix(A, &prefix));
1328:   PetscCall(MatGetOwnershipRange(A, &rstart, &rend));
1329:   PetscCall(MatGetBlockSize(A, &bs));
1330:   PetscCheck(rstart / bs * bs == rstart && rend / bs * bs == rend, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "bad row distribution [%" PetscInt_FMT ",%" PetscInt_FMT ") for matrix block size %" PetscInt_FMT, rstart, rend, bs);

1332:   /* Get diagonal block from matrix if possible */
1333:   PetscCall(MatHasOperation(A, MATOP_GET_DIAGONAL_BLOCK, &hasop));
1334:   if (hasop) PetscCall(MatGetDiagonalBlock(A, &Ad));
1335:   if (Ad) {
1336:     PetscCall(PetscObjectBaseTypeCompare((PetscObject)Ad, MATSEQBAIJ, &isbaij));
1337:     if (!isbaij) PetscCall(PetscObjectBaseTypeCompare((PetscObject)Ad, MATSEQSBAIJ, &isbaij));
1338:   }
1339:   if (Ad && nloc > 1) {
1340:     PetscBool match, done;
1341:     /* Try to setup a good matrix partitioning if available */
1342:     PetscCall(MatPartitioningCreate(PETSC_COMM_SELF, &mpart));
1343:     PetscCall(PetscObjectSetOptionsPrefix((PetscObject)mpart, prefix));
1344:     PetscCall(MatPartitioningSetFromOptions(mpart));
1345:     PetscCall(PetscObjectTypeCompare((PetscObject)mpart, MATPARTITIONINGCURRENT, &match));
1346:     if (!match) PetscCall(PetscObjectTypeCompare((PetscObject)mpart, MATPARTITIONINGSQUARE, &match));
1347:     if (!match) { /* assume a "good" partitioner is available */
1348:       PetscInt        na;
1349:       const PetscInt *ia, *ja;
1350:       PetscCall(MatGetRowIJ(Ad, 0, PETSC_TRUE, isbaij, &na, &ia, &ja, &done));
1351:       if (done) {
1352:         /* Build adjacency matrix by hand. Unfortunately a call to
1353:            MatConvert(Ad,MATMPIADJ,MAT_INITIAL_MATRIX,&adj) will
1354:            remove the block-aij structure and we cannot expect
1355:            MatPartitioning to split vertices as we need */
1356:         PetscInt        i, j, len, nnz, cnt, *iia = NULL, *jja = NULL;
1357:         const PetscInt *row;
1358:         nnz = 0;
1359:         for (i = 0; i < na; i++) { /* count number of nonzeros */
1360:           len = ia[i + 1] - ia[i];
1361:           row = ja + ia[i];
1362:           for (j = 0; j < len; j++) {
1363:             if (row[j] == i) { /* don't count diagonal */
1364:               len--;
1365:               break;
1366:             }
1367:           }
1368:           nnz += len;
1369:         }
1370:         PetscCall(PetscMalloc1(na + 1, &iia));
1371:         PetscCall(PetscMalloc1(nnz, &jja));
1372:         nnz    = 0;
1373:         iia[0] = 0;
1374:         for (i = 0; i < na; i++) { /* fill adjacency */
1375:           cnt = 0;
1376:           len = ia[i + 1] - ia[i];
1377:           row = ja + ia[i];
1378:           for (j = 0; j < len; j++) {
1379:             if (row[j] != i) jja[nnz + cnt++] = row[j]; /* if not diagonal */
1380:           }
1381:           nnz += cnt;
1382:           iia[i + 1] = nnz;
1383:         }
1384:         /* Partitioning of the adjacency matrix */
1385:         PetscCall(MatCreateMPIAdj(PETSC_COMM_SELF, na, na, iia, jja, NULL, &adj));
1386:         PetscCall(MatPartitioningSetAdjacency(mpart, adj));
1387:         PetscCall(MatPartitioningSetNParts(mpart, nloc));
1388:         PetscCall(MatPartitioningApply(mpart, &ispart));
1389:         PetscCall(ISPartitioningToNumbering(ispart, &isnumb));
1390:         PetscCall(MatDestroy(&adj));
1391:         foundpart = PETSC_TRUE;
1392:       }
1393:       PetscCall(MatRestoreRowIJ(Ad, 0, PETSC_TRUE, isbaij, &na, &ia, &ja, &done));
1394:     }
1395:     PetscCall(MatPartitioningDestroy(&mpart));
1396:   }
1397:   PetscCall(PetscMalloc1(nloc, &is));
1398:   if (!foundpart) {
1399:     /* Partitioning by contiguous chunks of rows */

1401:     PetscInt mbs   = (rend - rstart) / bs;
1402:     PetscInt start = rstart;
1403:     for (i = 0; i < nloc; i++) {
1404:       PetscInt count = (mbs / nloc + ((mbs % nloc) > i)) * bs;
1405:       PetscCall(ISCreateStride(PETSC_COMM_SELF, count, start, 1, &is[i]));
1406:       start += count;
1407:     }

1409:   } else {
1410:     /* Partitioning by adjacency of diagonal block  */

1412:     const PetscInt *numbering;
1413:     PetscInt       *count, nidx, *indices, *newidx, start = 0;
1414:     /* Get node count in each partition */
1415:     PetscCall(PetscMalloc1(nloc, &count));
1416:     PetscCall(ISPartitioningCount(ispart, nloc, count));
1417:     if (isbaij && bs > 1) { /* adjust for the block-aij case */
1418:       for (i = 0; i < nloc; i++) count[i] *= bs;
1419:     }
1420:     /* Build indices from node numbering */
1421:     PetscCall(ISGetLocalSize(isnumb, &nidx));
1422:     PetscCall(PetscMalloc1(nidx, &indices));
1423:     for (i = 0; i < nidx; i++) indices[i] = i; /* needs to be initialized */
1424:     PetscCall(ISGetIndices(isnumb, &numbering));
1425:     PetscCall(PetscSortIntWithPermutation(nidx, numbering, indices));
1426:     PetscCall(ISRestoreIndices(isnumb, &numbering));
1427:     if (isbaij && bs > 1) { /* adjust for the block-aij case */
1428:       PetscCall(PetscMalloc1(nidx * bs, &newidx));
1429:       for (i = 0; i < nidx; i++) {
1430:         for (j = 0; j < bs; j++) newidx[i * bs + j] = indices[i] * bs + j;
1431:       }
1432:       PetscCall(PetscFree(indices));
1433:       nidx *= bs;
1434:       indices = newidx;
1435:     }
1436:     /* Shift to get global indices */
1437:     for (i = 0; i < nidx; i++) indices[i] += rstart;

1439:     /* Build the index sets for each block */
1440:     for (i = 0; i < nloc; i++) {
1441:       PetscCall(ISCreateGeneral(PETSC_COMM_SELF, count[i], &indices[start], PETSC_COPY_VALUES, &is[i]));
1442:       PetscCall(ISSort(is[i]));
1443:       start += count[i];
1444:     }

1446:     PetscCall(PetscFree(count));
1447:     PetscCall(PetscFree(indices));
1448:     PetscCall(ISDestroy(&isnumb));
1449:     PetscCall(ISDestroy(&ispart));
1450:   }
1451:   *iis = is;
1452:   PetscFunctionReturn(PETSC_SUCCESS);
1453: }

1455: PETSC_INTERN PetscErrorCode PCGASMCreateStraddlingSubdomains(Mat A, PetscInt N, PetscInt *n, IS *iis[])
1456: {
1457:   PetscFunctionBegin;
1458:   PetscCall(MatSubdomainsCreateCoalesce(A, N, n, iis));
1459:   PetscFunctionReturn(PETSC_SUCCESS);
1460: }

1462: /*@C
1463:   PCGASMCreateSubdomains - Creates `n` index sets defining `n` nonoverlapping subdomains on this MPI process for the `PCGASM` additive
1464:   Schwarz preconditioner for a any problem based on its matrix.

1466:   Collective

1468:   Input Parameters:
1469: + A - The global matrix operator
1470: - N - the number of global subdomains requested

1472:   Output Parameters:
1473: + n   - the number of subdomains created on this MPI rank
1474: - iis - the array of index sets defining the local inner subdomains (on which the correction is applied)

1476:   Level: advanced

1478:   Notes:
1479:   When `N` >= A's communicator size, each subdomain is local -- contained within a single MPI process.
1480:   When `N` < size, the subdomains are 'straddling' (rank boundaries) and are no longer local.
1481:   The resulting subdomains can be use in `PCGASMSetSubdomains`(pc,n,iss,`NULL`).  The overlapping
1482:   outer subdomains will be automatically generated from these according to the requested amount of
1483:   overlap; this is currently supported only with local subdomains.

1485:   Use `PCGASMDestroySubdomains()` to free the array and the list of index sets.

1487: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetSubdomains()`, `PCGASMDestroySubdomains()`
1488: @*/
1489: PetscErrorCode PCGASMCreateSubdomains(Mat A, PetscInt N, PetscInt *n, IS *iis[])
1490: {
1491:   PetscMPIInt size;

1493:   PetscFunctionBegin;
1495:   PetscAssertPointer(iis, 4);

1497:   PetscCheck(N >= 1, PETSC_COMM_SELF, PETSC_ERR_ARG_WRONG, "Number of subdomains must be > 0, N = %" PetscInt_FMT, N);
1498:   PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)A), &size));
1499:   if (N >= size) {
1500:     *n = N / size + (N % size);
1501:     PetscCall(PCGASMCreateLocalSubdomains(A, *n, iis));
1502:   } else {
1503:     PetscCall(PCGASMCreateStraddlingSubdomains(A, N, n, iis));
1504:   }
1505:   PetscFunctionReturn(PETSC_SUCCESS);
1506: }

1508: /*@C
1509:   PCGASMDestroySubdomains - Destroys the index sets created with
1510:   `PCGASMCreateSubdomains()` or `PCGASMCreateSubdomains2D()`. Should be
1511:   called after setting subdomains with `PCGASMSetSubdomains()`.

1513:   Collective

1515:   Input Parameters:
1516: + n   - the number of index sets
1517: . iis - the array of inner subdomains
1518: - ois - the array of outer subdomains, can be `NULL`

1520:   Level: intermediate

1522:   Note:
1523:   This is a convenience subroutine that walks each list,
1524:   destroys each `IS` on the list, and then frees the list. At the end the
1525:   list pointers are set to `NULL`.

1527: .seealso: [](ch_ksp), `PCGASM`, `PCGASMCreateSubdomains()`, `PCGASMSetSubdomains()`
1528: @*/
1529: PetscErrorCode PCGASMDestroySubdomains(PetscInt n, IS **iis, IS **ois)
1530: {
1531:   PetscInt i;

1533:   PetscFunctionBegin;
1534:   if (n <= 0) PetscFunctionReturn(PETSC_SUCCESS);
1535:   if (ois) {
1536:     PetscAssertPointer(ois, 3);
1537:     if (*ois) {
1538:       PetscAssertPointer(*ois, 3);
1539:       for (i = 0; i < n; i++) PetscCall(ISDestroy(&(*ois)[i]));
1540:       PetscCall(PetscFree(*ois));
1541:     }
1542:   }
1543:   if (iis) {
1544:     PetscAssertPointer(iis, 2);
1545:     if (*iis) {
1546:       PetscAssertPointer(*iis, 2);
1547:       for (i = 0; i < n; i++) PetscCall(ISDestroy(&(*iis)[i]));
1548:       PetscCall(PetscFree(*iis));
1549:     }
1550:   }
1551:   PetscFunctionReturn(PETSC_SUCCESS);
1552: }

1554: #define PCGASMLocalSubdomainBounds2D(M, N, xleft, ylow, xright, yhigh, first, last, xleft_loc, ylow_loc, xright_loc, yhigh_loc, n) \
1555:   do { \
1556:     PetscInt first_row = first / M, last_row = last / M + 1; \
1557:     /*                                                                                                    \
1558:      Compute ylow_loc and yhigh_loc so that (ylow_loc,xleft) and (yhigh_loc,xright) are the corners       \
1559:      of the bounding box of the intersection of the subdomain with the local ownership range (local       \
1560:      subdomain).                                                                                          \
1561:      Also compute xleft_loc and xright_loc as the lower and upper bounds on the first and last rows       \
1562:      of the intersection.                                                                                 \
1563:     */ \
1564:     /* ylow_loc is the grid row containing the first element of the local sumbdomain */ \
1565:     *ylow_loc = PetscMax(first_row, ylow); \
1566:     /* xleft_loc is the offset of first element of the local subdomain within its grid row (might actually be outside the local subdomain) */ \
1567:     *xleft_loc = *ylow_loc == first_row ? PetscMax(first % M, xleft) : xleft; \
1568:     /* yhigh_loc is the grid row above the last local subdomain element */ \
1569:     *yhigh_loc = PetscMin(last_row, yhigh); \
1570:     /* xright is the offset of the end of the  local subdomain within its grid row (might actually be outside the local subdomain) */ \
1571:     *xright_loc = *yhigh_loc == last_row ? PetscMin(xright, last % M) : xright; \
1572:     /* Now compute the size of the local subdomain n. */ \
1573:     *n = 0; \
1574:     if (*ylow_loc < *yhigh_loc) { \
1575:       PetscInt width = xright - xleft; \
1576:       *n += width * (*yhigh_loc - *ylow_loc - 1); \
1577:       *n += PetscMin(PetscMax(*xright_loc - xleft, 0), width); \
1578:       *n -= PetscMin(PetscMax(*xleft_loc - xleft, 0), width); \
1579:     } \
1580:   } while (0)

1582: /*@C
1583:   PCGASMCreateSubdomains2D - Creates the index sets for the `PCGASM` overlapping Schwarz
1584:   preconditioner for a two-dimensional problem on a regular grid.

1586:   Collective

1588:   Input Parameters:
1589: + pc       - the preconditioner context
1590: . M        - the global number of grid points in the x direction
1591: . N        - the global number of grid points in the y direction
1592: . Mdomains - the global number of subdomains in the x direction
1593: . Ndomains - the global number of subdomains in the y direction
1594: . dof      - degrees of freedom per node
1595: - overlap  - overlap in mesh lines

1597:   Output Parameters:
1598: + nsub - the number of local subdomains created
1599: . iis  - array of index sets defining inner (nonoverlapping) subdomains
1600: - ois  - array of index sets defining outer (overlapping, if overlap > 0) subdomains

1602:   Level: advanced

1604:   Note:
1605:   Use `PCGASMDestroySubdomains()` to free the index sets and the arrays

1607:   Fortran Notes:
1608:   The `IS` must be declared as an array of length long enough to hold `Nsub` entries

1610: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetSubdomains()`, `PCGASMGetSubKSP()`, `PCGASMSetOverlap()`, `PCASMCreateSubdomains2D()`,
1611:           `PCGASMDestroySubdomains()`
1612: @*/
1613: PetscErrorCode PCGASMCreateSubdomains2D(PC pc, PetscInt M, PetscInt N, PetscInt Mdomains, PetscInt Ndomains, PetscInt dof, PetscInt overlap, PetscInt *nsub, IS **iis, IS **ois)
1614: {
1615:   PetscMPIInt size, rank;
1616:   PetscInt    i, j;
1617:   PetscInt    maxheight, maxwidth;
1618:   PetscInt    xstart, xleft, xright, xleft_loc, xright_loc;
1619:   PetscInt    ystart, ylow, yhigh, ylow_loc, yhigh_loc;
1620:   PetscInt    x[2][2], y[2][2], n[2];
1621:   PetscInt    first, last;
1622:   PetscInt    nidx, *idx;
1623:   PetscInt    ii, jj, s, q, d;
1624:   PetscInt    k, kk;
1625:   PetscMPIInt color;
1626:   MPI_Comm    comm, subcomm;
1627:   IS        **xis = NULL, **is = ois, **is_local = iis;

1629:   PetscFunctionBegin;
1630:   PetscCall(PetscObjectGetComm((PetscObject)pc, &comm));
1631:   PetscCallMPI(MPI_Comm_size(comm, &size));
1632:   PetscCallMPI(MPI_Comm_rank(comm, &rank));
1633:   PetscCall(MatGetOwnershipRange(pc->pmat, &first, &last));
1634:   PetscCheck((first % dof) == 0 && (last % dof) == 0, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE,
1635:              "Matrix row partitioning unsuitable for domain decomposition: local row range (%" PetscInt_FMT ",%" PetscInt_FMT ") "
1636:              "does not respect the number of degrees of freedom per grid point %" PetscInt_FMT,
1637:              first, last, dof);

1639:   /* Determine the number of domains with nonzero intersections with the local ownership range. */
1640:   s      = 0;
1641:   ystart = 0;
1642:   for (j = 0; j < Ndomains; ++j) {
1643:     maxheight = N / Ndomains + ((N % Ndomains) > j); /* Maximal height of subdomain */
1644:     PetscCheck(maxheight >= 2, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Too many %" PetscInt_FMT " subdomains in the vertical direction for mesh height %" PetscInt_FMT, Ndomains, N);
1645:     /* Vertical domain limits with an overlap. */
1646:     ylow   = PetscMax(ystart - overlap, 0);
1647:     yhigh  = PetscMin(ystart + maxheight + overlap, N);
1648:     xstart = 0;
1649:     for (i = 0; i < Mdomains; ++i) {
1650:       maxwidth = M / Mdomains + ((M % Mdomains) > i); /* Maximal width of subdomain */
1651:       PetscCheck(maxwidth >= 2, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Too many %" PetscInt_FMT " subdomains in the horizontal direction for mesh width %" PetscInt_FMT, Mdomains, M);
1652:       /* Horizontal domain limits with an overlap. */
1653:       xleft  = PetscMax(xstart - overlap, 0);
1654:       xright = PetscMin(xstart + maxwidth + overlap, M);
1655:       /*
1656:          Determine whether this subdomain intersects this rank's ownership range of pc->pmat.
1657:       */
1658:       PCGASMLocalSubdomainBounds2D(M, N, xleft, ylow, xright, yhigh, first, last, (&xleft_loc), (&ylow_loc), (&xright_loc), (&yhigh_loc), (&nidx));
1659:       if (nidx) ++s;
1660:       xstart += maxwidth;
1661:     } /* for (i = 0; i < Mdomains; ++i) */
1662:     ystart += maxheight;
1663:   } /* for (j = 0; j < Ndomains; ++j) */

1665:   /* Now we can allocate the necessary number of ISs. */
1666:   *nsub = s;
1667:   PetscCall(PetscMalloc1(*nsub, is));
1668:   PetscCall(PetscMalloc1(*nsub, is_local));
1669:   s      = 0;
1670:   ystart = 0;
1671:   for (j = 0; j < Ndomains; ++j) {
1672:     maxheight = N / Ndomains + ((N % Ndomains) > j); /* Maximal height of subdomain */
1673:     PetscCheck(maxheight >= 2, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Too many %" PetscInt_FMT " subdomains in the vertical direction for mesh height %" PetscInt_FMT, Ndomains, N);
1674:     /* Vertical domain limits with an overlap. */
1675:     y[0][0] = PetscMax(ystart - overlap, 0);
1676:     y[0][1] = PetscMin(ystart + maxheight + overlap, N);
1677:     /* Vertical domain limits without an overlap. */
1678:     y[1][0] = ystart;
1679:     y[1][1] = PetscMin(ystart + maxheight, N);
1680:     xstart  = 0;
1681:     for (i = 0; i < Mdomains; ++i) {
1682:       maxwidth = M / Mdomains + ((M % Mdomains) > i); /* Maximal width of subdomain */
1683:       PetscCheck(maxwidth >= 2, PETSC_COMM_SELF, PETSC_ERR_ARG_OUTOFRANGE, "Too many %" PetscInt_FMT " subdomains in the horizontal direction for mesh width %" PetscInt_FMT, Mdomains, M);
1684:       /* Horizontal domain limits with an overlap. */
1685:       x[0][0] = PetscMax(xstart - overlap, 0);
1686:       x[0][1] = PetscMin(xstart + maxwidth + overlap, M);
1687:       /* Horizontal domain limits without an overlap. */
1688:       x[1][0] = xstart;
1689:       x[1][1] = PetscMin(xstart + maxwidth, M);
1690:       /*
1691:          Determine whether this domain intersects this rank's ownership range of pc->pmat.
1692:          Do this twice: first for the domains with overlaps, and once without.
1693:          During the first pass create the subcommunicators, and use them on the second pass as well.
1694:       */
1695:       for (q = 0; q < 2; ++q) {
1696:         PetscBool split = PETSC_FALSE;
1697:         /*
1698:           domain limits, (xleft, xright) and (ylow, yheigh) are adjusted
1699:           according to whether the domain with an overlap or without is considered.
1700:         */
1701:         xleft  = x[q][0];
1702:         xright = x[q][1];
1703:         ylow   = y[q][0];
1704:         yhigh  = y[q][1];
1705:         PCGASMLocalSubdomainBounds2D(M, N, xleft, ylow, xright, yhigh, first, last, (&xleft_loc), (&ylow_loc), (&xright_loc), (&yhigh_loc), (&nidx));
1706:         nidx *= dof;
1707:         n[q] = nidx;
1708:         /*
1709:          Based on the counted number of indices in the local domain *with an overlap*,
1710:          construct a subcommunicator of all the MPI ranks supporting this domain.
1711:          Observe that a domain with an overlap might have nontrivial local support,
1712:          while the domain without an overlap might not.  Hence, the decision to participate
1713:          in the subcommunicator must be based on the domain with an overlap.
1714:          */
1715:         if (q == 0) {
1716:           if (nidx) color = 1;
1717:           else color = MPI_UNDEFINED;
1718:           PetscCallMPI(MPI_Comm_split(comm, color, rank, &subcomm));
1719:           split = PETSC_TRUE;
1720:         }
1721:         /*
1722:          Proceed only if the number of local indices *with an overlap* is nonzero.
1723:          */
1724:         if (n[0]) {
1725:           if (q == 0) xis = is;
1726:           if (q == 1) {
1727:             /*
1728:              The IS for the no-overlap subdomain shares a communicator with the overlapping domain.
1729:              Moreover, if the overlap is zero, the two ISs are identical.
1730:              */
1731:             if (overlap == 0) {
1732:               (*is_local)[s] = (*is)[s];
1733:               PetscCall(PetscObjectReference((PetscObject)(*is)[s]));
1734:               continue;
1735:             } else {
1736:               xis     = is_local;
1737:               subcomm = ((PetscObject)(*is)[s])->comm;
1738:             }
1739:           } /* if (q == 1) */
1740:           idx = NULL;
1741:           PetscCall(PetscMalloc1(nidx, &idx));
1742:           if (nidx) {
1743:             k = 0;
1744:             for (jj = ylow_loc; jj < yhigh_loc; ++jj) {
1745:               PetscInt x0 = (jj == ylow_loc) ? xleft_loc : xleft;
1746:               PetscInt x1 = (jj == yhigh_loc - 1) ? xright_loc : xright;
1747:               kk          = dof * (M * jj + x0);
1748:               for (ii = x0; ii < x1; ++ii) {
1749:                 for (d = 0; d < dof; ++d) idx[k++] = kk++;
1750:               }
1751:             }
1752:           }
1753:           PetscCall(ISCreateGeneral(subcomm, nidx, idx, PETSC_OWN_POINTER, (*xis) + s));
1754:           if (split) PetscCallMPI(MPI_Comm_free(&subcomm));
1755:         } /* if (n[0]) */
1756:       } /* for (q = 0; q < 2; ++q) */
1757:       if (n[0]) ++s;
1758:       xstart += maxwidth;
1759:     } /* for (i = 0; i < Mdomains; ++i) */
1760:     ystart += maxheight;
1761:   } /* for (j = 0; j < Ndomains; ++j) */
1762:   PetscFunctionReturn(PETSC_SUCCESS);
1763: }

1765: /*@C
1766:   PCGASMGetSubdomains - Gets the subdomains supported on this MPI rank
1767:   for the `PCGASM` additive Schwarz preconditioner.

1769:   Not Collective

1771:   Input Parameter:
1772: . pc - the preconditioner context

1774:   Output Parameters:
1775: + n   - the number of subdomains for this MPI rank (default value = 1)
1776: . iis - the index sets that define the inner subdomains (without overlap) supported on this rank (can be `NULL`)
1777: - ois - the index sets that define the outer subdomains (with overlap) supported on this rank (can be `NULL`)

1779:   Level: advanced

1781:   Notes:
1782:   The user is responsible for destroying the `IS`s and freeing the returned arrays, this can be done with
1783:   `PCGASMDestroySubdomains()`

1785:   The `IS` numbering is in the parallel, global numbering of the vector.

1787: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetOverlap()`, `PCGASMGetSubKSP()`, `PCGASMCreateSubdomains2D()`,
1788:           `PCGASMSetSubdomains()`, `PCGASMGetSubmatrices()`, `PCGASMDestroySubdomains()`
1789: @*/
1790: PetscErrorCode PCGASMGetSubdomains(PC pc, PetscInt *n, IS *iis[], IS *ois[])
1791: {
1792:   PC_GASM  *osm;
1793:   PetscBool match;
1794:   PetscInt  i;

1796:   PetscFunctionBegin;
1798:   PetscCall(PetscObjectTypeCompare((PetscObject)pc, PCGASM, &match));
1799:   PetscCheck(match, PetscObjectComm((PetscObject)pc), PETSC_ERR_ARG_WRONG, "Incorrect object type: expected %s, got %s instead", PCGASM, ((PetscObject)pc)->type_name);
1800:   osm = (PC_GASM *)pc->data;
1801:   if (n) *n = osm->n;
1802:   if (iis) PetscCall(PetscMalloc1(osm->n, iis));
1803:   if (ois) PetscCall(PetscMalloc1(osm->n, ois));
1804:   if (iis || ois) {
1805:     for (i = 0; i < osm->n; ++i) {
1806:       if (iis) (*iis)[i] = osm->iis[i];
1807:       if (ois) (*ois)[i] = osm->ois[i];
1808:     }
1809:   }
1810:   PetscFunctionReturn(PETSC_SUCCESS);
1811: }

1813: /*@C
1814:   PCGASMGetSubmatrices - Gets the local submatrices (for this MPI rank
1815:   only) for the `PCGASM` additive Schwarz preconditioner.

1817:   Not Collective

1819:   Input Parameter:
1820: . pc - the preconditioner context

1822:   Output Parameters:
1823: + n   - the number of matrices for this MPI rank (default value = 1)
1824: - mat - the matrices

1826:   Level: advanced

1828:   Note:
1829:   Matrices returned by this routine have the same communicators as the index sets (`IS`)
1830:   used to define subdomains in `PCGASMSetSubdomains()`

1832: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetOverlap()`, `PCGASMGetSubKSP()`,
1833:           `PCGASMCreateSubdomains2D()`, `PCGASMSetSubdomains()`, `PCGASMGetSubdomains()`
1834: @*/
1835: PetscErrorCode PCGASMGetSubmatrices(PC pc, PetscInt *n, Mat *mat[])
1836: {
1837:   PC_GASM  *osm;
1838:   PetscBool match;

1840:   PetscFunctionBegin;
1842:   PetscAssertPointer(n, 2);
1843:   if (mat) PetscAssertPointer(mat, 3);
1844:   PetscCheck(pc->setupcalled, PetscObjectComm((PetscObject)pc), PETSC_ERR_ARG_WRONGSTATE, "Must call after KSPSetUp() or PCSetUp().");
1845:   PetscCall(PetscObjectTypeCompare((PetscObject)pc, PCGASM, &match));
1846:   PetscCheck(match, PetscObjectComm((PetscObject)pc), PETSC_ERR_ARG_WRONG, "Expected %s, got %s instead", PCGASM, ((PetscObject)pc)->type_name);
1847:   osm = (PC_GASM *)pc->data;
1848:   if (n) *n = osm->n;
1849:   if (mat) *mat = osm->pmat;
1850:   PetscFunctionReturn(PETSC_SUCCESS);
1851: }

1853: /*@
1854:   PCGASMSetUseDMSubdomains - Indicates whether to use `DMCreateDomainDecomposition()` to define the subdomains, whenever possible for `PCGASM`

1856:   Logically Collective

1858:   Input Parameters:
1859: + pc  - the preconditioner
1860: - flg - boolean indicating whether to use subdomains defined by the `DM`

1862:   Options Database Key:
1863: + -pc_gasm_dm_subdomains    - configure subdomains
1864: . -pc_gasm_overlap          - set overlap
1865: - -pc_gasm_total_subdomains - set number of subdomains

1867:   Level: intermediate

1869:   Note:
1870:   `PCGASMSetSubdomains()`, `PCGASMSetTotalSubdomains()` or `PCGASMSetOverlap()` take precedence over `PCGASMSetUseDMSubdomains()`,
1871:   so setting `PCGASMSetSubdomains()` with nontrivial subdomain ISs or any of `PCGASMSetTotalSubdomains()` and `PCGASMSetOverlap()`
1872:   automatically turns the latter off.

1874: .seealso: [](ch_ksp), `PCGASM`, `PCGASMGetUseDMSubdomains()`, `PCGASMSetSubdomains()`, `PCGASMSetOverlap()`
1875:           `PCGASMCreateSubdomains2D()`
1876: @*/
1877: PetscErrorCode PCGASMSetUseDMSubdomains(PC pc, PetscBool flg)
1878: {
1879:   PC_GASM  *osm = (PC_GASM *)pc->data;
1880:   PetscBool match;

1882:   PetscFunctionBegin;
1885:   PetscCheck(!pc->setupcalled, ((PetscObject)pc)->comm, PETSC_ERR_ARG_WRONGSTATE, "Not for a setup PC.");
1886:   PetscCall(PetscObjectTypeCompare((PetscObject)pc, PCGASM, &match));
1887:   if (match) {
1888:     if (!osm->user_subdomains && osm->N == PETSC_DETERMINE && osm->overlap < 0) osm->dm_subdomains = flg;
1889:   }
1890:   PetscFunctionReturn(PETSC_SUCCESS);
1891: }

1893: /*@
1894:   PCGASMGetUseDMSubdomains - Returns flag indicating whether to use `DMCreateDomainDecomposition()` to define the subdomains, whenever possible with `PCGASM`

1896:   Not Collective

1898:   Input Parameter:
1899: . pc - the preconditioner

1901:   Output Parameter:
1902: . flg - boolean indicating whether to use subdomains defined by the `DM`

1904:   Level: intermediate

1906: .seealso: [](ch_ksp), `PCGASM`, `PCGASMSetUseDMSubdomains()`, `PCGASMSetOverlap()`
1907:           `PCGASMCreateSubdomains2D()`
1908: @*/
1909: PetscErrorCode PCGASMGetUseDMSubdomains(PC pc, PetscBool *flg)
1910: {
1911:   PC_GASM  *osm = (PC_GASM *)pc->data;
1912:   PetscBool match;

1914:   PetscFunctionBegin;
1916:   PetscAssertPointer(flg, 2);
1917:   PetscCall(PetscObjectTypeCompare((PetscObject)pc, PCGASM, &match));
1918:   if (match) {
1919:     if (flg) *flg = osm->dm_subdomains;
1920:   }
1921:   PetscFunctionReturn(PETSC_SUCCESS);
1922: }