Actual source code: bddcprivate.c
petsc-3.13.0 2020-03-29
1: #include <../src/mat/impls/aij/seq/aij.h>
2: #include <../src/ksp/pc/impls/bddc/bddc.h>
3: #include <../src/ksp/pc/impls/bddc/bddcprivate.h>
4: #include <../src/mat/impls/dense/seq/dense.h>
5: #include <petscdmplex.h>
6: #include <petscblaslapack.h>
7: #include <petsc/private/sfimpl.h>
8: #include <petsc/private/dmpleximpl.h>
9: #include <petscdmda.h>
11: static PetscErrorCode MatMPIAIJRestrict(Mat,MPI_Comm,Mat*);
13: /* if range is true, it returns B s.t. span{B} = range(A)
14: if range is false, it returns B s.t. range(B) _|_ range(A) */
15: PetscErrorCode MatDenseOrthogonalRangeOrComplement(Mat A, PetscBool range, PetscInt lw, PetscScalar *work, PetscReal *rwork, Mat *B)
16: {
17: #if !defined(PETSC_USE_COMPLEX)
18: PetscScalar *uwork,*data,*U, ds = 0.;
19: PetscReal *sing;
20: PetscBLASInt bM,bN,lwork,lierr,di = 1;
21: PetscInt ulw,i,nr,nc,n;
25: MatGetSize(A,&nr,&nc);
26: if (!nr || !nc) return(0);
28: /* workspace */
29: if (!work) {
30: ulw = PetscMax(PetscMax(1,5*PetscMin(nr,nc)),3*PetscMin(nr,nc)+PetscMax(nr,nc));
31: PetscMalloc1(ulw,&uwork);
32: } else {
33: ulw = lw;
34: uwork = work;
35: }
36: n = PetscMin(nr,nc);
37: if (!rwork) {
38: PetscMalloc1(n,&sing);
39: } else {
40: sing = rwork;
41: }
43: /* SVD */
44: PetscMalloc1(nr*nr,&U);
45: PetscBLASIntCast(nr,&bM);
46: PetscBLASIntCast(nc,&bN);
47: PetscBLASIntCast(ulw,&lwork);
48: MatDenseGetArray(A,&data);
49: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
50: PetscStackCallBLAS("LAPACKgesvd",LAPACKgesvd_("A","N",&bM,&bN,data,&bM,sing,U,&bM,&ds,&di,uwork,&lwork,&lierr));
51: PetscFPTrapPop();
52: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GESVD Lapack routine %d",(int)lierr);
53: MatDenseRestoreArray(A,&data);
54: for (i=0;i<n;i++) if (sing[i] < PETSC_SMALL) break;
55: if (!rwork) {
56: PetscFree(sing);
57: }
58: if (!work) {
59: PetscFree(uwork);
60: }
61: /* create B */
62: if (!range) {
63: MatCreateSeqDense(PETSC_COMM_SELF,nr,nr-i,NULL,B);
64: MatDenseGetArray(*B,&data);
65: PetscArraycpy(data,U+nr*i,(nr-i)*nr);
66: } else {
67: MatCreateSeqDense(PETSC_COMM_SELF,nr,i,NULL,B);
68: MatDenseGetArray(*B,&data);
69: PetscArraycpy(data,U,i*nr);
70: }
71: MatDenseRestoreArray(*B,&data);
72: PetscFree(U);
73: #else /* PETSC_USE_COMPLEX */
75: SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not implemented for complexes");
76: #endif
77: return(0);
78: }
80: /* TODO REMOVE */
81: #if defined(PRINT_GDET)
82: static int inc = 0;
83: static int lev = 0;
84: #endif
86: PetscErrorCode PCBDDCComputeNedelecChangeEdge(Mat lG, IS edge, IS extrow, IS extcol, IS corners, Mat* Gins, Mat* GKins, PetscScalar cvals[2], PetscScalar *work, PetscReal *rwork)
87: {
89: Mat GE,GEd;
90: PetscInt rsize,csize,esize;
91: PetscScalar *ptr;
94: ISGetSize(edge,&esize);
95: if (!esize) return(0);
96: ISGetSize(extrow,&rsize);
97: ISGetSize(extcol,&csize);
99: /* gradients */
100: ptr = work + 5*esize;
101: MatCreateSubMatrix(lG,extrow,extcol,MAT_INITIAL_MATRIX,&GE);
102: MatCreateSeqDense(PETSC_COMM_SELF,rsize,csize,ptr,Gins);
103: MatConvert(GE,MATSEQDENSE,MAT_REUSE_MATRIX,Gins);
104: MatDestroy(&GE);
106: /* constants */
107: ptr += rsize*csize;
108: MatCreateSeqDense(PETSC_COMM_SELF,esize,csize,ptr,&GEd);
109: MatCreateSubMatrix(lG,edge,extcol,MAT_INITIAL_MATRIX,&GE);
110: MatConvert(GE,MATSEQDENSE,MAT_REUSE_MATRIX,&GEd);
111: MatDestroy(&GE);
112: MatDenseOrthogonalRangeOrComplement(GEd,PETSC_FALSE,5*esize,work,rwork,GKins);
113: MatDestroy(&GEd);
115: if (corners) {
116: Mat GEc;
117: const PetscScalar *vals;
118: PetscScalar v;
120: MatCreateSubMatrix(lG,edge,corners,MAT_INITIAL_MATRIX,&GEc);
121: MatTransposeMatMult(GEc,*GKins,MAT_INITIAL_MATRIX,1.0,&GEd);
122: MatDenseGetArrayRead(GEd,&vals);
123: /* v = PetscAbsScalar(vals[0]) */;
124: v = 1.;
125: cvals[0] = vals[0]/v;
126: cvals[1] = vals[1]/v;
127: MatDenseRestoreArrayRead(GEd,&vals);
128: MatScale(*GKins,1./v);
129: #if defined(PRINT_GDET)
130: {
131: PetscViewer viewer;
132: char filename[256];
133: sprintf(filename,"Gdet_l%d_r%d_cc%d.m",lev,PetscGlobalRank,inc++);
134: PetscViewerASCIIOpen(PETSC_COMM_SELF,filename,&viewer);
135: PetscViewerPushFormat(viewer,PETSC_VIEWER_ASCII_MATLAB);
136: PetscObjectSetName((PetscObject)GEc,"GEc");
137: MatView(GEc,viewer);
138: PetscObjectSetName((PetscObject)(*GKins),"GK");
139: MatView(*GKins,viewer);
140: PetscObjectSetName((PetscObject)GEd,"Gproj");
141: MatView(GEd,viewer);
142: PetscViewerDestroy(&viewer);
143: }
144: #endif
145: MatDestroy(&GEd);
146: MatDestroy(&GEc);
147: }
149: return(0);
150: }
152: PetscErrorCode PCBDDCNedelecSupport(PC pc)
153: {
154: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
155: Mat_IS *matis = (Mat_IS*)pc->pmat->data;
156: Mat G,T,conn,lG,lGt,lGis,lGall,lGe,lGinit;
157: Vec tvec;
158: PetscSF sfv;
159: ISLocalToGlobalMapping el2g,vl2g,fl2g,al2g;
160: MPI_Comm comm;
161: IS lned,primals,allprimals,nedfieldlocal;
162: IS *eedges,*extrows,*extcols,*alleedges;
163: PetscBT btv,bte,btvc,btb,btbd,btvcand,btvi,btee,bter;
164: PetscScalar *vals,*work;
165: PetscReal *rwork;
166: const PetscInt *idxs,*ii,*jj,*iit,*jjt;
167: PetscInt ne,nv,Lv,order,n,field;
168: PetscInt n_neigh,*neigh,*n_shared,**shared;
169: PetscInt i,j,extmem,cum,maxsize,nee;
170: PetscInt *extrow,*extrowcum,*marks,*vmarks,*gidxs;
171: PetscInt *sfvleaves,*sfvroots;
172: PetscInt *corners,*cedges;
173: PetscInt *ecount,**eneighs,*vcount,**vneighs;
174: #if defined(PETSC_USE_DEBUG)
175: PetscInt *emarks;
176: #endif
177: PetscBool print,eerr,done,lrc[2],conforming,global,singular,setprimal;
178: PetscErrorCode ierr;
181: /* If the discrete gradient is defined for a subset of dofs and global is true,
182: it assumes G is given in global ordering for all the dofs.
183: Otherwise, the ordering is global for the Nedelec field */
184: order = pcbddc->nedorder;
185: conforming = pcbddc->conforming;
186: field = pcbddc->nedfield;
187: global = pcbddc->nedglobal;
188: setprimal = PETSC_FALSE;
189: print = PETSC_FALSE;
190: singular = PETSC_FALSE;
192: /* Command line customization */
193: PetscOptionsBegin(PetscObjectComm((PetscObject)pc),((PetscObject)pc)->prefix,"BDDC Nedelec options","PC");
194: PetscOptionsBool("-pc_bddc_nedelec_field_primal","All edge dofs set as primals: Toselli's algorithm C",NULL,setprimal,&setprimal,NULL);
195: PetscOptionsBool("-pc_bddc_nedelec_singular","Infer nullspace from discrete gradient",NULL,singular,&singular,NULL);
196: PetscOptionsInt("-pc_bddc_nedelec_order","Test variable order code (to be removed)",NULL,order,&order,NULL);
197: /* print debug info TODO: to be removed */
198: PetscOptionsBool("-pc_bddc_nedelec_print","Print debug info",NULL,print,&print,NULL);
199: PetscOptionsEnd();
201: /* Return if there are no edges in the decomposition and the problem is not singular */
202: MatGetLocalToGlobalMapping(pc->pmat,&al2g,NULL);
203: ISLocalToGlobalMappingGetSize(al2g,&n);
204: PetscObjectGetComm((PetscObject)pc,&comm);
205: if (!singular) {
206: VecGetArrayRead(matis->counter,(const PetscScalar**)&vals);
207: lrc[0] = PETSC_FALSE;
208: for (i=0;i<n;i++) {
209: if (PetscRealPart(vals[i]) > 2.) {
210: lrc[0] = PETSC_TRUE;
211: break;
212: }
213: }
214: VecRestoreArrayRead(matis->counter,(const PetscScalar**)&vals);
215: MPIU_Allreduce(&lrc[0],&lrc[1],1,MPIU_BOOL,MPI_LOR,comm);
216: if (!lrc[1]) return(0);
217: }
219: /* Get Nedelec field */
220: if (pcbddc->n_ISForDofsLocal && field >= pcbddc->n_ISForDofsLocal) SETERRQ2(comm,PETSC_ERR_USER,"Invalid field for Nedelec %D: number of fields is %D",field,pcbddc->n_ISForDofsLocal);
221: if (pcbddc->n_ISForDofsLocal && field >= 0) {
222: PetscObjectReference((PetscObject)pcbddc->ISForDofsLocal[field]);
223: nedfieldlocal = pcbddc->ISForDofsLocal[field];
224: ISGetLocalSize(nedfieldlocal,&ne);
225: } else if (!pcbddc->n_ISForDofsLocal && field != PETSC_DECIDE) {
226: ne = n;
227: nedfieldlocal = NULL;
228: global = PETSC_TRUE;
229: } else if (field == PETSC_DECIDE) {
230: PetscInt rst,ren,*idx;
232: PetscArrayzero(matis->sf_leafdata,n);
233: PetscArrayzero(matis->sf_rootdata,pc->pmat->rmap->n);
234: MatGetOwnershipRange(pcbddc->discretegradient,&rst,&ren);
235: for (i=rst;i<ren;i++) {
236: PetscInt nc;
238: MatGetRow(pcbddc->discretegradient,i,&nc,NULL,NULL);
239: if (nc > 1) matis->sf_rootdata[i-rst] = 1;
240: MatRestoreRow(pcbddc->discretegradient,i,&nc,NULL,NULL);
241: }
242: PetscSFBcastBegin(matis->sf,MPIU_INT,matis->sf_rootdata,matis->sf_leafdata);
243: PetscSFBcastEnd(matis->sf,MPIU_INT,matis->sf_rootdata,matis->sf_leafdata);
244: PetscMalloc1(n,&idx);
245: for (i=0,ne=0;i<n;i++) if (matis->sf_leafdata[i]) idx[ne++] = i;
246: ISCreateGeneral(comm,ne,idx,PETSC_OWN_POINTER,&nedfieldlocal);
247: } else {
248: SETERRQ(comm,PETSC_ERR_USER,"When multiple fields are present, the Nedelec field has to be specified");
249: }
251: /* Sanity checks */
252: if (!order && !conforming) SETERRQ(comm,PETSC_ERR_SUP,"Variable order and non-conforming spaces are not supported at the same time");
253: if (pcbddc->user_ChangeOfBasisMatrix) SETERRQ(comm,PETSC_ERR_SUP,"Cannot generate Nedelec support with user defined change of basis");
254: if (order && ne%order) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_USER,"The number of local edge dofs %D it's not a multiple of the order %D",ne,order);
256: /* Just set primal dofs and return */
257: if (setprimal) {
258: IS enedfieldlocal;
259: PetscInt *eidxs;
261: PetscMalloc1(ne,&eidxs);
262: VecGetArrayRead(matis->counter,(const PetscScalar**)&vals);
263: if (nedfieldlocal) {
264: ISGetIndices(nedfieldlocal,&idxs);
265: for (i=0,cum=0;i<ne;i++) {
266: if (PetscRealPart(vals[idxs[i]]) > 2.) {
267: eidxs[cum++] = idxs[i];
268: }
269: }
270: ISRestoreIndices(nedfieldlocal,&idxs);
271: } else {
272: for (i=0,cum=0;i<ne;i++) {
273: if (PetscRealPart(vals[i]) > 2.) {
274: eidxs[cum++] = i;
275: }
276: }
277: }
278: VecRestoreArrayRead(matis->counter,(const PetscScalar**)&vals);
279: ISCreateGeneral(comm,cum,eidxs,PETSC_COPY_VALUES,&enedfieldlocal);
280: PCBDDCSetPrimalVerticesLocalIS(pc,enedfieldlocal);
281: PetscFree(eidxs);
282: ISDestroy(&nedfieldlocal);
283: ISDestroy(&enedfieldlocal);
284: return(0);
285: }
287: /* Compute some l2g maps */
288: if (nedfieldlocal) {
289: IS is;
291: /* need to map from the local Nedelec field to local numbering */
292: ISLocalToGlobalMappingCreateIS(nedfieldlocal,&fl2g);
293: /* need to map from the local Nedelec field to global numbering for the whole dofs*/
294: ISLocalToGlobalMappingApplyIS(al2g,nedfieldlocal,&is);
295: ISLocalToGlobalMappingCreateIS(is,&al2g);
296: /* need to map from the local Nedelec field to global numbering (for Nedelec only) */
297: if (global) {
298: PetscObjectReference((PetscObject)al2g);
299: el2g = al2g;
300: } else {
301: IS gis;
303: ISRenumber(is,NULL,NULL,&gis);
304: ISLocalToGlobalMappingCreateIS(gis,&el2g);
305: ISDestroy(&gis);
306: }
307: ISDestroy(&is);
308: } else {
309: /* restore default */
310: pcbddc->nedfield = -1;
311: /* one ref for the destruction of al2g, one for el2g */
312: PetscObjectReference((PetscObject)al2g);
313: PetscObjectReference((PetscObject)al2g);
314: el2g = al2g;
315: fl2g = NULL;
316: }
318: /* Start communication to drop connections for interior edges (for cc analysis only) */
319: PetscArrayzero(matis->sf_leafdata,n);
320: PetscArrayzero(matis->sf_rootdata,pc->pmat->rmap->n);
321: if (nedfieldlocal) {
322: ISGetIndices(nedfieldlocal,&idxs);
323: for (i=0;i<ne;i++) matis->sf_leafdata[idxs[i]] = 1;
324: ISRestoreIndices(nedfieldlocal,&idxs);
325: } else {
326: for (i=0;i<ne;i++) matis->sf_leafdata[i] = 1;
327: }
328: PetscSFReduceBegin(matis->sf,MPIU_INT,matis->sf_leafdata,matis->sf_rootdata,MPI_SUM);
329: PetscSFReduceEnd(matis->sf,MPIU_INT,matis->sf_leafdata,matis->sf_rootdata,MPI_SUM);
331: if (!singular) { /* drop connections with interior edges to avoid unneeded communications and memory movements */
332: MatDuplicate(pcbddc->discretegradient,MAT_COPY_VALUES,&G);
333: MatSetOption(G,MAT_KEEP_NONZERO_PATTERN,PETSC_FALSE);
334: if (global) {
335: PetscInt rst;
337: MatGetOwnershipRange(G,&rst,NULL);
338: for (i=0,cum=0;i<pc->pmat->rmap->n;i++) {
339: if (matis->sf_rootdata[i] < 2) {
340: matis->sf_rootdata[cum++] = i + rst;
341: }
342: }
343: MatSetOption(G,MAT_NO_OFF_PROC_ZERO_ROWS,PETSC_TRUE);
344: MatZeroRows(G,cum,matis->sf_rootdata,0.,NULL,NULL);
345: } else {
346: PetscInt *tbz;
348: PetscMalloc1(ne,&tbz);
349: PetscSFBcastBegin(matis->sf,MPIU_INT,matis->sf_rootdata,matis->sf_leafdata);
350: PetscSFBcastEnd(matis->sf,MPIU_INT,matis->sf_rootdata,matis->sf_leafdata);
351: ISGetIndices(nedfieldlocal,&idxs);
352: for (i=0,cum=0;i<ne;i++)
353: if (matis->sf_leafdata[idxs[i]] == 1)
354: tbz[cum++] = i;
355: ISRestoreIndices(nedfieldlocal,&idxs);
356: ISLocalToGlobalMappingApply(el2g,cum,tbz,tbz);
357: MatZeroRows(G,cum,tbz,0.,NULL,NULL);
358: PetscFree(tbz);
359: }
360: } else { /* we need the entire G to infer the nullspace */
361: PetscObjectReference((PetscObject)pcbddc->discretegradient);
362: G = pcbddc->discretegradient;
363: }
365: /* Extract subdomain relevant rows of G */
366: ISLocalToGlobalMappingGetIndices(el2g,&idxs);
367: ISCreateGeneral(comm,ne,idxs,PETSC_USE_POINTER,&lned);
368: MatCreateSubMatrix(G,lned,NULL,MAT_INITIAL_MATRIX,&lGall);
369: ISLocalToGlobalMappingRestoreIndices(el2g,&idxs);
370: ISDestroy(&lned);
371: MatConvert(lGall,MATIS,MAT_INITIAL_MATRIX,&lGis);
372: MatDestroy(&lGall);
373: MatISGetLocalMat(lGis,&lG);
375: /* SF for nodal dofs communications */
376: MatGetLocalSize(G,NULL,&Lv);
377: MatGetLocalToGlobalMapping(lGis,NULL,&vl2g);
378: PetscObjectReference((PetscObject)vl2g);
379: ISLocalToGlobalMappingGetSize(vl2g,&nv);
380: PetscSFCreate(comm,&sfv);
381: ISLocalToGlobalMappingGetIndices(vl2g,&idxs);
382: PetscSFSetGraphLayout(sfv,lGis->cmap,nv,NULL,PETSC_OWN_POINTER,idxs);
383: ISLocalToGlobalMappingRestoreIndices(vl2g,&idxs);
384: i = singular ? 2 : 1;
385: PetscMalloc2(i*nv,&sfvleaves,i*Lv,&sfvroots);
387: /* Destroy temporary G created in MATIS format and modified G */
388: PetscObjectReference((PetscObject)lG);
389: MatDestroy(&lGis);
390: MatDestroy(&G);
392: if (print) {
393: PetscObjectSetName((PetscObject)lG,"initial_lG");
394: MatView(lG,NULL);
395: }
397: /* Save lG for values insertion in change of basis */
398: MatDuplicate(lG,MAT_COPY_VALUES,&lGinit);
400: /* Analyze the edge-nodes connections (duplicate lG) */
401: MatDuplicate(lG,MAT_COPY_VALUES,&lGe);
402: MatSetOption(lGe,MAT_KEEP_NONZERO_PATTERN,PETSC_FALSE);
403: PetscBTCreate(nv,&btv);
404: PetscBTCreate(ne,&bte);
405: PetscBTCreate(ne,&btb);
406: PetscBTCreate(ne,&btbd);
407: PetscBTCreate(nv,&btvcand);
408: /* need to import the boundary specification to ensure the
409: proper detection of coarse edges' endpoints */
410: if (pcbddc->DirichletBoundariesLocal) {
411: IS is;
413: if (fl2g) {
414: ISGlobalToLocalMappingApplyIS(fl2g,IS_GTOLM_MASK,pcbddc->DirichletBoundariesLocal,&is);
415: } else {
416: is = pcbddc->DirichletBoundariesLocal;
417: }
418: ISGetLocalSize(is,&cum);
419: ISGetIndices(is,&idxs);
420: for (i=0;i<cum;i++) {
421: if (idxs[i] >= 0) {
422: PetscBTSet(btb,idxs[i]);
423: PetscBTSet(btbd,idxs[i]);
424: }
425: }
426: ISRestoreIndices(is,&idxs);
427: if (fl2g) {
428: ISDestroy(&is);
429: }
430: }
431: if (pcbddc->NeumannBoundariesLocal) {
432: IS is;
434: if (fl2g) {
435: ISGlobalToLocalMappingApplyIS(fl2g,IS_GTOLM_MASK,pcbddc->NeumannBoundariesLocal,&is);
436: } else {
437: is = pcbddc->NeumannBoundariesLocal;
438: }
439: ISGetLocalSize(is,&cum);
440: ISGetIndices(is,&idxs);
441: for (i=0;i<cum;i++) {
442: if (idxs[i] >= 0) {
443: PetscBTSet(btb,idxs[i]);
444: }
445: }
446: ISRestoreIndices(is,&idxs);
447: if (fl2g) {
448: ISDestroy(&is);
449: }
450: }
452: /* Count neighs per dof */
453: ISLocalToGlobalMappingGetNodeInfo(el2g,NULL,&ecount,&eneighs);
454: ISLocalToGlobalMappingGetNodeInfo(vl2g,NULL,&vcount,&vneighs);
456: /* need to remove coarse faces' dofs and coarse edges' dirichlet dofs
457: for proper detection of coarse edges' endpoints */
458: PetscBTCreate(ne,&btee);
459: for (i=0;i<ne;i++) {
460: if ((ecount[i] > 2 && !PetscBTLookup(btbd,i)) || (ecount[i] == 2 && PetscBTLookup(btb,i))) {
461: PetscBTSet(btee,i);
462: }
463: }
464: PetscMalloc1(ne,&marks);
465: if (!conforming) {
466: MatTranspose(lGe,MAT_INITIAL_MATRIX,&lGt);
467: MatGetRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&iit,&jjt,&done);
468: }
469: MatGetRowIJ(lGe,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
470: MatSeqAIJGetArray(lGe,&vals);
471: cum = 0;
472: for (i=0;i<ne;i++) {
473: /* eliminate rows corresponding to edge dofs belonging to coarse faces */
474: if (!PetscBTLookup(btee,i)) {
475: marks[cum++] = i;
476: continue;
477: }
478: /* set badly connected edge dofs as primal */
479: if (!conforming) {
480: if (ii[i+1]-ii[i] != order + 1) { /* every row of G on the coarse edge should list order+1 nodal dofs */
481: marks[cum++] = i;
482: PetscBTSet(bte,i);
483: for (j=ii[i];j<ii[i+1];j++) {
484: PetscBTSet(btv,jj[j]);
485: }
486: } else {
487: /* every edge dofs should be connected trough a certain number of nodal dofs
488: to other edge dofs belonging to coarse edges
489: - at most 2 endpoints
490: - order-1 interior nodal dofs
491: - no undefined nodal dofs (nconn < order)
492: */
493: PetscInt ends = 0,ints = 0, undef = 0;
494: for (j=ii[i];j<ii[i+1];j++) {
495: PetscInt v = jj[j],k;
496: PetscInt nconn = iit[v+1]-iit[v];
497: for (k=iit[v];k<iit[v+1];k++) if (!PetscBTLookup(btee,jjt[k])) nconn--;
498: if (nconn > order) ends++;
499: else if (nconn == order) ints++;
500: else undef++;
501: }
502: if (undef || ends > 2 || ints != order -1) {
503: marks[cum++] = i;
504: PetscBTSet(bte,i);
505: for (j=ii[i];j<ii[i+1];j++) {
506: PetscBTSet(btv,jj[j]);
507: }
508: }
509: }
510: }
511: /* We assume the order on the element edge is ii[i+1]-ii[i]-1 */
512: if (!order && ii[i+1] != ii[i]) {
513: PetscScalar val = 1./(ii[i+1]-ii[i]-1);
514: for (j=ii[i];j<ii[i+1];j++) vals[j] = val;
515: }
516: }
517: PetscBTDestroy(&btee);
518: MatSeqAIJRestoreArray(lGe,&vals);
519: MatRestoreRowIJ(lGe,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
520: if (!conforming) {
521: MatRestoreRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&iit,&jjt,&done);
522: MatDestroy(&lGt);
523: }
524: MatZeroRows(lGe,cum,marks,0.,NULL,NULL);
526: /* identify splitpoints and corner candidates */
527: MatTranspose(lGe,MAT_INITIAL_MATRIX,&lGt);
528: if (print) {
529: PetscObjectSetName((PetscObject)lGe,"edgerestr_lG");
530: MatView(lGe,NULL);
531: PetscObjectSetName((PetscObject)lGt,"edgerestr_lGt");
532: MatView(lGt,NULL);
533: }
534: MatGetRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
535: MatSeqAIJGetArray(lGt,&vals);
536: for (i=0;i<nv;i++) {
537: PetscInt ord = order, test = ii[i+1]-ii[i], vc = vcount[i];
538: PetscBool sneighs = PETSC_TRUE, bdir = PETSC_FALSE;
539: if (!order) { /* variable order */
540: PetscReal vorder = 0.;
542: for (j=ii[i];j<ii[i+1];j++) vorder += PetscRealPart(vals[j]);
543: test = PetscFloorReal(vorder+10.*PETSC_SQRT_MACHINE_EPSILON);
544: if (vorder-test > PETSC_SQRT_MACHINE_EPSILON) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Unexpected value for vorder: %g (%D)",vorder,test);
545: ord = 1;
546: }
547: #if defined(PETSC_USE_DEBUG)
548: if (test%ord) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Unexpected number of edge dofs %D connected with nodal dof %D with order %D",test,i,ord);
549: #endif
550: for (j=ii[i];j<ii[i+1] && sneighs;j++) {
551: if (PetscBTLookup(btbd,jj[j])) {
552: bdir = PETSC_TRUE;
553: break;
554: }
555: if (vc != ecount[jj[j]]) {
556: sneighs = PETSC_FALSE;
557: } else {
558: PetscInt k,*vn = vneighs[i], *en = eneighs[jj[j]];
559: for (k=0;k<vc;k++) {
560: if (vn[k] != en[k]) {
561: sneighs = PETSC_FALSE;
562: break;
563: }
564: }
565: }
566: }
567: if (!sneighs || test >= 3*ord || bdir) { /* splitpoints */
568: if (print) PetscPrintf(PETSC_COMM_SELF,"SPLITPOINT %D (%D %D %D)\n",i,!sneighs,test >= 3*ord,bdir);
569: PetscBTSet(btv,i);
570: } else if (test == ord) {
571: if (order == 1 || (!order && ii[i+1]-ii[i] == 1)) {
572: if (print) PetscPrintf(PETSC_COMM_SELF,"ENDPOINT %D\n",i);
573: PetscBTSet(btv,i);
574: } else {
575: if (print) PetscPrintf(PETSC_COMM_SELF,"CORNER CANDIDATE %D\n",i);
576: PetscBTSet(btvcand,i);
577: }
578: }
579: }
580: ISLocalToGlobalMappingRestoreNodeInfo(el2g,NULL,&ecount,&eneighs);
581: ISLocalToGlobalMappingRestoreNodeInfo(vl2g,NULL,&vcount,&vneighs);
582: PetscBTDestroy(&btbd);
584: /* a candidate is valid if it is connected to another candidate via a non-primal edge dof */
585: if (order != 1) {
586: if (print) PetscPrintf(PETSC_COMM_SELF,"INSPECTING CANDIDATES\n");
587: MatGetRowIJ(lGe,0,PETSC_FALSE,PETSC_FALSE,&i,&iit,&jjt,&done);
588: for (i=0;i<nv;i++) {
589: if (PetscBTLookup(btvcand,i)) {
590: PetscBool found = PETSC_FALSE;
591: for (j=ii[i];j<ii[i+1] && !found;j++) {
592: PetscInt k,e = jj[j];
593: if (PetscBTLookup(bte,e)) continue;
594: for (k=iit[e];k<iit[e+1];k++) {
595: PetscInt v = jjt[k];
596: if (v != i && PetscBTLookup(btvcand,v)) {
597: found = PETSC_TRUE;
598: break;
599: }
600: }
601: }
602: if (!found) {
603: if (print) PetscPrintf(PETSC_COMM_SELF," CANDIDATE %D CLEARED\n",i);
604: PetscBTClear(btvcand,i);
605: } else {
606: if (print) PetscPrintf(PETSC_COMM_SELF," CANDIDATE %D ACCEPTED\n",i);
607: }
608: }
609: }
610: MatRestoreRowIJ(lGe,0,PETSC_FALSE,PETSC_FALSE,&i,&iit,&jjt,&done);
611: }
612: MatSeqAIJRestoreArray(lGt,&vals);
613: MatRestoreRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
614: MatDestroy(&lGe);
616: /* Get the local G^T explicitly */
617: MatDestroy(&lGt);
618: MatTranspose(lG,MAT_INITIAL_MATRIX,&lGt);
619: MatSetOption(lGt,MAT_KEEP_NONZERO_PATTERN,PETSC_FALSE);
621: /* Mark interior nodal dofs */
622: ISLocalToGlobalMappingGetInfo(vl2g,&n_neigh,&neigh,&n_shared,&shared);
623: PetscBTCreate(nv,&btvi);
624: for (i=1;i<n_neigh;i++) {
625: for (j=0;j<n_shared[i];j++) {
626: PetscBTSet(btvi,shared[i][j]);
627: }
628: }
629: ISLocalToGlobalMappingRestoreInfo(vl2g,&n_neigh,&neigh,&n_shared,&shared);
631: /* communicate corners and splitpoints */
632: PetscMalloc1(nv,&vmarks);
633: PetscArrayzero(sfvleaves,nv);
634: PetscArrayzero(sfvroots,Lv);
635: for (i=0;i<nv;i++) if (PetscUnlikely(PetscBTLookup(btv,i))) sfvleaves[i] = 1;
637: if (print) {
638: IS tbz;
640: cum = 0;
641: for (i=0;i<nv;i++)
642: if (sfvleaves[i])
643: vmarks[cum++] = i;
645: ISCreateGeneral(PETSC_COMM_SELF,cum,vmarks,PETSC_COPY_VALUES,&tbz);
646: PetscObjectSetName((PetscObject)tbz,"corners_to_be_zeroed_local");
647: ISView(tbz,NULL);
648: ISDestroy(&tbz);
649: }
651: PetscSFReduceBegin(sfv,MPIU_INT,sfvleaves,sfvroots,MPI_SUM);
652: PetscSFReduceEnd(sfv,MPIU_INT,sfvleaves,sfvroots,MPI_SUM);
653: PetscSFBcastBegin(sfv,MPIU_INT,sfvroots,sfvleaves);
654: PetscSFBcastEnd(sfv,MPIU_INT,sfvroots,sfvleaves);
656: /* Zero rows of lGt corresponding to identified corners
657: and interior nodal dofs */
658: cum = 0;
659: for (i=0;i<nv;i++) {
660: if (sfvleaves[i]) {
661: vmarks[cum++] = i;
662: PetscBTSet(btv,i);
663: }
664: if (!PetscBTLookup(btvi,i)) vmarks[cum++] = i;
665: }
666: PetscBTDestroy(&btvi);
667: if (print) {
668: IS tbz;
670: ISCreateGeneral(PETSC_COMM_SELF,cum,vmarks,PETSC_COPY_VALUES,&tbz);
671: PetscObjectSetName((PetscObject)tbz,"corners_to_be_zeroed_with_interior");
672: ISView(tbz,NULL);
673: ISDestroy(&tbz);
674: }
675: MatZeroRows(lGt,cum,vmarks,0.,NULL,NULL);
676: PetscFree(vmarks);
677: PetscSFDestroy(&sfv);
678: PetscFree2(sfvleaves,sfvroots);
680: /* Recompute G */
681: MatDestroy(&lG);
682: MatTranspose(lGt,MAT_INITIAL_MATRIX,&lG);
683: if (print) {
684: PetscObjectSetName((PetscObject)lG,"used_lG");
685: MatView(lG,NULL);
686: PetscObjectSetName((PetscObject)lGt,"used_lGt");
687: MatView(lGt,NULL);
688: }
690: /* Get primal dofs (if any) */
691: cum = 0;
692: for (i=0;i<ne;i++) {
693: if (PetscUnlikely(PetscBTLookup(bte,i))) marks[cum++] = i;
694: }
695: if (fl2g) {
696: ISLocalToGlobalMappingApply(fl2g,cum,marks,marks);
697: }
698: ISCreateGeneral(comm,cum,marks,PETSC_COPY_VALUES,&primals);
699: if (print) {
700: PetscObjectSetName((PetscObject)primals,"prescribed_primal_dofs");
701: ISView(primals,NULL);
702: }
703: PetscBTDestroy(&bte);
704: /* TODO: what if the user passed in some of them ? */
705: PCBDDCSetPrimalVerticesLocalIS(pc,primals);
706: ISDestroy(&primals);
708: /* Compute edge connectivity */
709: PetscObjectSetOptionsPrefix((PetscObject)lG,"econn_");
711: /* Symbolic conn = lG*lGt */
712: MatProductCreate(lG,lGt,NULL,&conn);
713: MatProductSetType(conn,MATPRODUCT_AB);
714: MatProductSetAlgorithm(conn,"default");
715: MatProductSetFill(conn,PETSC_DEFAULT);
716: PetscObjectSetOptionsPrefix((PetscObject)conn,"econn_");
717: MatProductSetFromOptions(conn);
718: MatProductSymbolic(conn);
720: MatGetRowIJ(conn,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
721: if (fl2g) {
722: PetscBT btf;
723: PetscInt *iia,*jja,*iiu,*jju;
724: PetscBool rest = PETSC_FALSE,free = PETSC_FALSE;
726: /* create CSR for all local dofs */
727: PetscMalloc1(n+1,&iia);
728: if (pcbddc->mat_graph->nvtxs_csr) { /* the user has passed in a CSR graph */
729: if (pcbddc->mat_graph->nvtxs_csr != n) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_USER,"Invalid size of CSR graph %D. Should be %D",pcbddc->mat_graph->nvtxs_csr,n);
730: iiu = pcbddc->mat_graph->xadj;
731: jju = pcbddc->mat_graph->adjncy;
732: } else if (pcbddc->use_local_adj) {
733: rest = PETSC_TRUE;
734: MatGetRowIJ(matis->A,0,PETSC_TRUE,PETSC_FALSE,&i,(const PetscInt**)&iiu,(const PetscInt**)&jju,&done);
735: } else {
736: free = PETSC_TRUE;
737: PetscMalloc2(n+1,&iiu,n,&jju);
738: iiu[0] = 0;
739: for (i=0;i<n;i++) {
740: iiu[i+1] = i+1;
741: jju[i] = -1;
742: }
743: }
745: /* import sizes of CSR */
746: iia[0] = 0;
747: for (i=0;i<n;i++) iia[i+1] = iiu[i+1]-iiu[i];
749: /* overwrite entries corresponding to the Nedelec field */
750: PetscBTCreate(n,&btf);
751: ISGetIndices(nedfieldlocal,&idxs);
752: for (i=0;i<ne;i++) {
753: PetscBTSet(btf,idxs[i]);
754: iia[idxs[i]+1] = ii[i+1]-ii[i];
755: }
757: /* iia in CSR */
758: for (i=0;i<n;i++) iia[i+1] += iia[i];
760: /* jja in CSR */
761: PetscMalloc1(iia[n],&jja);
762: for (i=0;i<n;i++)
763: if (!PetscBTLookup(btf,i))
764: for (j=0;j<iiu[i+1]-iiu[i];j++)
765: jja[iia[i]+j] = jju[iiu[i]+j];
767: /* map edge dofs connectivity */
768: if (jj) {
769: ISLocalToGlobalMappingApply(fl2g,ii[ne],jj,(PetscInt *)jj);
770: for (i=0;i<ne;i++) {
771: PetscInt e = idxs[i];
772: for (j=0;j<ii[i+1]-ii[i];j++) jja[iia[e]+j] = jj[ii[i]+j];
773: }
774: }
775: ISRestoreIndices(nedfieldlocal,&idxs);
776: PCBDDCSetLocalAdjacencyGraph(pc,n,iia,jja,PETSC_OWN_POINTER);
777: if (rest) {
778: MatRestoreRowIJ(matis->A,0,PETSC_TRUE,PETSC_FALSE,&i,(const PetscInt**)&iiu,(const PetscInt**)&jju,&done);
779: }
780: if (free) {
781: PetscFree2(iiu,jju);
782: }
783: PetscBTDestroy(&btf);
784: } else {
785: PCBDDCSetLocalAdjacencyGraph(pc,n,ii,jj,PETSC_USE_POINTER);
786: }
788: /* Analyze interface for edge dofs */
789: PCBDDCAnalyzeInterface(pc);
790: pcbddc->mat_graph->twodim = PETSC_FALSE;
792: /* Get coarse edges in the edge space */
793: PCBDDCGraphGetCandidatesIS(pcbddc->mat_graph,NULL,NULL,&nee,&alleedges,&allprimals);
794: MatRestoreRowIJ(conn,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
796: if (fl2g) {
797: ISGlobalToLocalMappingApplyIS(fl2g,IS_GTOLM_DROP,allprimals,&primals);
798: PetscMalloc1(nee,&eedges);
799: for (i=0;i<nee;i++) {
800: ISGlobalToLocalMappingApplyIS(fl2g,IS_GTOLM_DROP,alleedges[i],&eedges[i]);
801: }
802: } else {
803: eedges = alleedges;
804: primals = allprimals;
805: }
807: /* Mark fine edge dofs with their coarse edge id */
808: PetscArrayzero(marks,ne);
809: ISGetLocalSize(primals,&cum);
810: ISGetIndices(primals,&idxs);
811: for (i=0;i<cum;i++) marks[idxs[i]] = nee+1;
812: ISRestoreIndices(primals,&idxs);
813: if (print) {
814: PetscObjectSetName((PetscObject)primals,"obtained_primal_dofs");
815: ISView(primals,NULL);
816: }
818: maxsize = 0;
819: for (i=0;i<nee;i++) {
820: PetscInt size,mark = i+1;
822: ISGetLocalSize(eedges[i],&size);
823: ISGetIndices(eedges[i],&idxs);
824: for (j=0;j<size;j++) marks[idxs[j]] = mark;
825: ISRestoreIndices(eedges[i],&idxs);
826: maxsize = PetscMax(maxsize,size);
827: }
829: /* Find coarse edge endpoints */
830: MatGetRowIJ(lG,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
831: MatGetRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&iit,&jjt,&done);
832: for (i=0;i<nee;i++) {
833: PetscInt mark = i+1,size;
835: ISGetLocalSize(eedges[i],&size);
836: if (!size && nedfieldlocal) continue;
837: if (!size) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Unexpected zero sized edge %D",i);
838: ISGetIndices(eedges[i],&idxs);
839: if (print) {
840: PetscPrintf(PETSC_COMM_SELF,"ENDPOINTS ANALYSIS EDGE %D\n",i);
841: ISView(eedges[i],NULL);
842: }
843: for (j=0;j<size;j++) {
844: PetscInt k, ee = idxs[j];
845: if (print) PetscPrintf(PETSC_COMM_SELF," idx %D\n",ee);
846: for (k=ii[ee];k<ii[ee+1];k++) {
847: if (print) PetscPrintf(PETSC_COMM_SELF," inspect %D\n",jj[k]);
848: if (PetscBTLookup(btv,jj[k])) {
849: if (print) PetscPrintf(PETSC_COMM_SELF," corner found (already set) %D\n",jj[k]);
850: } else if (PetscBTLookup(btvcand,jj[k])) { /* is it ok? */
851: PetscInt k2;
852: PetscBool corner = PETSC_FALSE;
853: for (k2 = iit[jj[k]];k2 < iit[jj[k]+1];k2++) {
854: if (print) PetscPrintf(PETSC_COMM_SELF," INSPECTING %D: mark %D (ref mark %D), boundary %D\n",jjt[k2],marks[jjt[k2]],mark,!!PetscBTLookup(btb,jjt[k2]));
855: /* it's a corner if either is connected with an edge dof belonging to a different cc or
856: if the edge dof lie on the natural part of the boundary */
857: if ((marks[jjt[k2]] && marks[jjt[k2]] != mark) || (!marks[jjt[k2]] && PetscBTLookup(btb,jjt[k2]))) {
858: corner = PETSC_TRUE;
859: break;
860: }
861: }
862: if (corner) { /* found the nodal dof corresponding to the endpoint of the edge */
863: if (print) PetscPrintf(PETSC_COMM_SELF," corner found %D\n",jj[k]);
864: PetscBTSet(btv,jj[k]);
865: } else {
866: if (print) PetscPrintf(PETSC_COMM_SELF," no corners found\n");
867: }
868: }
869: }
870: }
871: ISRestoreIndices(eedges[i],&idxs);
872: }
873: MatRestoreRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&iit,&jjt,&done);
874: MatRestoreRowIJ(lG,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
875: PetscBTDestroy(&btb);
877: /* Reset marked primal dofs */
878: ISGetLocalSize(primals,&cum);
879: ISGetIndices(primals,&idxs);
880: for (i=0;i<cum;i++) marks[idxs[i]] = 0;
881: ISRestoreIndices(primals,&idxs);
883: /* Now use the initial lG */
884: MatDestroy(&lG);
885: MatDestroy(&lGt);
886: lG = lGinit;
887: MatTranspose(lG,MAT_INITIAL_MATRIX,&lGt);
889: /* Compute extended cols indices */
890: PetscBTCreate(nv,&btvc);
891: PetscBTCreate(nee,&bter);
892: MatGetRowIJ(lG,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
893: MatSeqAIJGetMaxRowNonzeros(lG,&i);
894: i *= maxsize;
895: PetscCalloc1(nee,&extcols);
896: PetscMalloc2(i,&extrow,i,&gidxs);
897: eerr = PETSC_FALSE;
898: for (i=0;i<nee;i++) {
899: PetscInt size,found = 0;
901: cum = 0;
902: ISGetLocalSize(eedges[i],&size);
903: if (!size && nedfieldlocal) continue;
904: if (!size) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Unexpected zero sized edge %D",i);
905: ISGetIndices(eedges[i],&idxs);
906: PetscBTMemzero(nv,btvc);
907: for (j=0;j<size;j++) {
908: PetscInt k,ee = idxs[j];
909: for (k=ii[ee];k<ii[ee+1];k++) {
910: PetscInt vv = jj[k];
911: if (!PetscBTLookup(btv,vv)) extrow[cum++] = vv;
912: else if (!PetscBTLookupSet(btvc,vv)) found++;
913: }
914: }
915: ISRestoreIndices(eedges[i],&idxs);
916: PetscSortRemoveDupsInt(&cum,extrow);
917: ISLocalToGlobalMappingApply(vl2g,cum,extrow,gidxs);
918: PetscSortIntWithArray(cum,gidxs,extrow);
919: ISCreateGeneral(PETSC_COMM_SELF,cum,extrow,PETSC_COPY_VALUES,&extcols[i]);
920: /* it may happen that endpoints are not defined at this point
921: if it is the case, mark this edge for a second pass */
922: if (cum != size -1 || found != 2) {
923: PetscBTSet(bter,i);
924: if (print) {
925: PetscObjectSetName((PetscObject)eedges[i],"error_edge");
926: ISView(eedges[i],NULL);
927: PetscObjectSetName((PetscObject)extcols[i],"error_extcol");
928: ISView(extcols[i],NULL);
929: }
930: eerr = PETSC_TRUE;
931: }
932: }
933: /* if (eerr) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Unexpected SIZE OF EDGE > EXTCOL FIRST PASS"); */
934: MPIU_Allreduce(&eerr,&done,1,MPIU_BOOL,MPI_LOR,comm);
935: if (done) {
936: PetscInt *newprimals;
938: PetscMalloc1(ne,&newprimals);
939: ISGetLocalSize(primals,&cum);
940: ISGetIndices(primals,&idxs);
941: PetscArraycpy(newprimals,idxs,cum);
942: ISRestoreIndices(primals,&idxs);
943: MatGetRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&iit,&jjt,&done);
944: if (print) PetscPrintf(PETSC_COMM_SELF,"DOING SECOND PASS (eerr %D)\n",eerr);
945: for (i=0;i<nee;i++) {
946: PetscBool has_candidates = PETSC_FALSE;
947: if (PetscBTLookup(bter,i)) {
948: PetscInt size,mark = i+1;
950: ISGetLocalSize(eedges[i],&size);
951: ISGetIndices(eedges[i],&idxs);
952: /* for (j=0;j<size;j++) newprimals[cum++] = idxs[j]; */
953: for (j=0;j<size;j++) {
954: PetscInt k,ee = idxs[j];
955: if (print) PetscPrintf(PETSC_COMM_SELF,"Inspecting edge dof %D [%D %D)\n",ee,ii[ee],ii[ee+1]);
956: for (k=ii[ee];k<ii[ee+1];k++) {
957: /* set all candidates located on the edge as corners */
958: if (PetscBTLookup(btvcand,jj[k])) {
959: PetscInt k2,vv = jj[k];
960: has_candidates = PETSC_TRUE;
961: if (print) PetscPrintf(PETSC_COMM_SELF," Candidate set to vertex %D\n",vv);
962: PetscBTSet(btv,vv);
963: /* set all edge dofs connected to candidate as primals */
964: for (k2=iit[vv];k2<iit[vv+1];k2++) {
965: if (marks[jjt[k2]] == mark) {
966: PetscInt k3,ee2 = jjt[k2];
967: if (print) PetscPrintf(PETSC_COMM_SELF," Connected edge dof set to primal %D\n",ee2);
968: newprimals[cum++] = ee2;
969: /* finally set the new corners */
970: for (k3=ii[ee2];k3<ii[ee2+1];k3++) {
971: if (print) PetscPrintf(PETSC_COMM_SELF," Connected nodal dof set to vertex %D\n",jj[k3]);
972: PetscBTSet(btv,jj[k3]);
973: }
974: }
975: }
976: } else {
977: if (print) PetscPrintf(PETSC_COMM_SELF," Not a candidate vertex %D\n",jj[k]);
978: }
979: }
980: }
981: if (!has_candidates) { /* circular edge */
982: PetscInt k, ee = idxs[0],*tmarks;
984: PetscCalloc1(ne,&tmarks);
985: if (print) PetscPrintf(PETSC_COMM_SELF," Circular edge %D\n",i);
986: for (k=ii[ee];k<ii[ee+1];k++) {
987: PetscInt k2;
988: if (print) PetscPrintf(PETSC_COMM_SELF," Set to corner %D\n",jj[k]);
989: PetscBTSet(btv,jj[k]);
990: for (k2=iit[jj[k]];k2<iit[jj[k]+1];k2++) tmarks[jjt[k2]]++;
991: }
992: for (j=0;j<size;j++) {
993: if (tmarks[idxs[j]] > 1) {
994: if (print) PetscPrintf(PETSC_COMM_SELF," Edge dof set to primal %D\n",idxs[j]);
995: newprimals[cum++] = idxs[j];
996: }
997: }
998: PetscFree(tmarks);
999: }
1000: ISRestoreIndices(eedges[i],&idxs);
1001: }
1002: ISDestroy(&extcols[i]);
1003: }
1004: PetscFree(extcols);
1005: MatRestoreRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&iit,&jjt,&done);
1006: PetscSortRemoveDupsInt(&cum,newprimals);
1007: if (fl2g) {
1008: ISLocalToGlobalMappingApply(fl2g,cum,newprimals,newprimals);
1009: ISDestroy(&primals);
1010: for (i=0;i<nee;i++) {
1011: ISDestroy(&eedges[i]);
1012: }
1013: PetscFree(eedges);
1014: }
1015: PCBDDCGraphRestoreCandidatesIS(pcbddc->mat_graph,NULL,NULL,&nee,&alleedges,&allprimals);
1016: ISCreateGeneral(comm,cum,newprimals,PETSC_COPY_VALUES,&primals);
1017: PetscFree(newprimals);
1018: PCBDDCSetPrimalVerticesLocalIS(pc,primals);
1019: ISDestroy(&primals);
1020: PCBDDCAnalyzeInterface(pc);
1021: pcbddc->mat_graph->twodim = PETSC_FALSE;
1022: PCBDDCGraphGetCandidatesIS(pcbddc->mat_graph,NULL,NULL,&nee,&alleedges,&allprimals);
1023: if (fl2g) {
1024: ISGlobalToLocalMappingApplyIS(fl2g,IS_GTOLM_DROP,allprimals,&primals);
1025: PetscMalloc1(nee,&eedges);
1026: for (i=0;i<nee;i++) {
1027: ISGlobalToLocalMappingApplyIS(fl2g,IS_GTOLM_DROP,alleedges[i],&eedges[i]);
1028: }
1029: } else {
1030: eedges = alleedges;
1031: primals = allprimals;
1032: }
1033: PetscCalloc1(nee,&extcols);
1035: /* Mark again */
1036: PetscArrayzero(marks,ne);
1037: for (i=0;i<nee;i++) {
1038: PetscInt size,mark = i+1;
1040: ISGetLocalSize(eedges[i],&size);
1041: ISGetIndices(eedges[i],&idxs);
1042: for (j=0;j<size;j++) marks[idxs[j]] = mark;
1043: ISRestoreIndices(eedges[i],&idxs);
1044: }
1045: if (print) {
1046: PetscObjectSetName((PetscObject)primals,"obtained_primal_dofs_secondpass");
1047: ISView(primals,NULL);
1048: }
1050: /* Recompute extended cols */
1051: eerr = PETSC_FALSE;
1052: for (i=0;i<nee;i++) {
1053: PetscInt size;
1055: cum = 0;
1056: ISGetLocalSize(eedges[i],&size);
1057: if (!size && nedfieldlocal) continue;
1058: if (!size) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Unexpected zero sized edge %D",i);
1059: ISGetIndices(eedges[i],&idxs);
1060: for (j=0;j<size;j++) {
1061: PetscInt k,ee = idxs[j];
1062: for (k=ii[ee];k<ii[ee+1];k++) if (!PetscBTLookup(btv,jj[k])) extrow[cum++] = jj[k];
1063: }
1064: ISRestoreIndices(eedges[i],&idxs);
1065: PetscSortRemoveDupsInt(&cum,extrow);
1066: ISLocalToGlobalMappingApply(vl2g,cum,extrow,gidxs);
1067: PetscSortIntWithArray(cum,gidxs,extrow);
1068: ISCreateGeneral(PETSC_COMM_SELF,cum,extrow,PETSC_COPY_VALUES,&extcols[i]);
1069: if (cum != size -1) {
1070: if (print) {
1071: PetscObjectSetName((PetscObject)eedges[i],"error_edge_secondpass");
1072: ISView(eedges[i],NULL);
1073: PetscObjectSetName((PetscObject)extcols[i],"error_extcol_secondpass");
1074: ISView(extcols[i],NULL);
1075: }
1076: eerr = PETSC_TRUE;
1077: }
1078: }
1079: }
1080: MatRestoreRowIJ(lG,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
1081: PetscFree2(extrow,gidxs);
1082: PetscBTDestroy(&bter);
1083: if (print) { PCBDDCGraphASCIIView(pcbddc->mat_graph,5,PETSC_VIEWER_STDOUT_SELF); }
1084: /* an error should not occur at this point */
1085: if (eerr) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Unexpected SIZE OF EDGE > EXTCOL SECOND PASS");
1087: /* Check the number of endpoints */
1088: MatGetRowIJ(lG,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
1089: PetscMalloc1(2*nee,&corners);
1090: PetscMalloc1(nee,&cedges);
1091: for (i=0;i<nee;i++) {
1092: PetscInt size, found = 0, gc[2];
1094: /* init with defaults */
1095: cedges[i] = corners[i*2] = corners[i*2+1] = -1;
1096: ISGetLocalSize(eedges[i],&size);
1097: if (!size && nedfieldlocal) continue;
1098: if (!size) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Unexpected zero sized edge %D",i);
1099: ISGetIndices(eedges[i],&idxs);
1100: PetscBTMemzero(nv,btvc);
1101: for (j=0;j<size;j++) {
1102: PetscInt k,ee = idxs[j];
1103: for (k=ii[ee];k<ii[ee+1];k++) {
1104: PetscInt vv = jj[k];
1105: if (PetscBTLookup(btv,vv) && !PetscBTLookupSet(btvc,vv)) {
1106: if (found == 2) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Found more then two corners for edge %D",i);
1107: corners[i*2+found++] = vv;
1108: }
1109: }
1110: }
1111: if (found != 2) {
1112: PetscInt e;
1113: if (fl2g) {
1114: ISLocalToGlobalMappingApply(fl2g,1,idxs,&e);
1115: } else {
1116: e = idxs[0];
1117: }
1118: SETERRQ4(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Found %D corners for edge %D (astart %D, estart %D)",found,i,e,idxs[0]);
1119: }
1121: /* get primal dof index on this coarse edge */
1122: ISLocalToGlobalMappingApply(vl2g,2,corners+2*i,gc);
1123: if (gc[0] > gc[1]) {
1124: PetscInt swap = corners[2*i];
1125: corners[2*i] = corners[2*i+1];
1126: corners[2*i+1] = swap;
1127: }
1128: cedges[i] = idxs[size-1];
1129: ISRestoreIndices(eedges[i],&idxs);
1130: if (print) PetscPrintf(PETSC_COMM_SELF,"EDGE %D: ce %D, corners (%D,%D)\n",i,cedges[i],corners[2*i],corners[2*i+1]);
1131: }
1132: MatRestoreRowIJ(lG,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
1133: PetscBTDestroy(&btvc);
1135: #if defined(PETSC_USE_DEBUG)
1136: /* Inspects columns of lG (rows of lGt) and make sure the change of basis will
1137: not interfere with neighbouring coarse edges */
1138: PetscMalloc1(nee+1,&emarks);
1139: MatGetRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
1140: for (i=0;i<nv;i++) {
1141: PetscInt emax = 0,eemax = 0;
1143: if (ii[i+1]==ii[i] || PetscBTLookup(btv,i)) continue;
1144: PetscArrayzero(emarks,nee+1);
1145: for (j=ii[i];j<ii[i+1];j++) emarks[marks[jj[j]]]++;
1146: for (j=1;j<nee+1;j++) {
1147: if (emax < emarks[j]) {
1148: emax = emarks[j];
1149: eemax = j;
1150: }
1151: }
1152: /* not relevant for edges */
1153: if (!eemax) continue;
1155: for (j=ii[i];j<ii[i+1];j++) {
1156: if (marks[jj[j]] && marks[jj[j]] != eemax) {
1157: SETERRQ4(PETSC_COMM_SELF,PETSC_ERR_SUP,"Found 2 coarse edges (id %D and %D) connected through the %D nodal dof at edge dof %D",marks[jj[j]]-1,eemax,i,jj[j]);
1158: }
1159: }
1160: }
1161: PetscFree(emarks);
1162: MatRestoreRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
1163: #endif
1165: /* Compute extended rows indices for edge blocks of the change of basis */
1166: MatGetRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
1167: MatSeqAIJGetMaxRowNonzeros(lGt,&extmem);
1168: extmem *= maxsize;
1169: PetscMalloc1(extmem*nee,&extrow);
1170: PetscMalloc1(nee,&extrows);
1171: PetscCalloc1(nee,&extrowcum);
1172: for (i=0;i<nv;i++) {
1173: PetscInt mark = 0,size,start;
1175: if (ii[i+1]==ii[i] || PetscBTLookup(btv,i)) continue;
1176: for (j=ii[i];j<ii[i+1];j++)
1177: if (marks[jj[j]] && !mark)
1178: mark = marks[jj[j]];
1180: /* not relevant */
1181: if (!mark) continue;
1183: /* import extended row */
1184: mark--;
1185: start = mark*extmem+extrowcum[mark];
1186: size = ii[i+1]-ii[i];
1187: if (extrowcum[mark] + size > extmem) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Not enough memory allocated %D > %D",extrowcum[mark] + size,extmem);
1188: PetscArraycpy(extrow+start,jj+ii[i],size);
1189: extrowcum[mark] += size;
1190: }
1191: MatRestoreRowIJ(lGt,0,PETSC_FALSE,PETSC_FALSE,&i,&ii,&jj,&done);
1192: MatDestroy(&lGt);
1193: PetscFree(marks);
1195: /* Compress extrows */
1196: cum = 0;
1197: for (i=0;i<nee;i++) {
1198: PetscInt size = extrowcum[i],*start = extrow + i*extmem;
1199: PetscSortRemoveDupsInt(&size,start);
1200: ISCreateGeneral(PETSC_COMM_SELF,size,start,PETSC_USE_POINTER,&extrows[i]);
1201: cum = PetscMax(cum,size);
1202: }
1203: PetscFree(extrowcum);
1204: PetscBTDestroy(&btv);
1205: PetscBTDestroy(&btvcand);
1207: /* Workspace for lapack inner calls and VecSetValues */
1208: PetscMalloc2((5+cum+maxsize)*maxsize,&work,maxsize,&rwork);
1210: /* Create change of basis matrix (preallocation can be improved) */
1211: MatCreate(comm,&T);
1212: MatSetSizes(T,pc->pmat->rmap->n,pc->pmat->rmap->n,
1213: pc->pmat->rmap->N,pc->pmat->rmap->N);
1214: MatSetType(T,MATAIJ);
1215: MatSeqAIJSetPreallocation(T,10,NULL);
1216: MatMPIAIJSetPreallocation(T,10,NULL,10,NULL);
1217: MatSetLocalToGlobalMapping(T,al2g,al2g);
1218: MatSetOption(T,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_FALSE);
1219: MatSetOption(T,MAT_ROW_ORIENTED,PETSC_FALSE);
1220: ISLocalToGlobalMappingDestroy(&al2g);
1222: /* Defaults to identity */
1223: MatCreateVecs(pc->pmat,&tvec,NULL);
1224: VecSet(tvec,1.0);
1225: MatDiagonalSet(T,tvec,INSERT_VALUES);
1226: VecDestroy(&tvec);
1228: /* Create discrete gradient for the coarser level if needed */
1229: MatDestroy(&pcbddc->nedcG);
1230: ISDestroy(&pcbddc->nedclocal);
1231: if (pcbddc->current_level < pcbddc->max_levels) {
1232: ISLocalToGlobalMapping cel2g,cvl2g;
1233: IS wis,gwis;
1234: PetscInt cnv,cne;
1236: ISCreateGeneral(comm,nee,cedges,PETSC_COPY_VALUES,&wis);
1237: if (fl2g) {
1238: ISLocalToGlobalMappingApplyIS(fl2g,wis,&pcbddc->nedclocal);
1239: } else {
1240: PetscObjectReference((PetscObject)wis);
1241: pcbddc->nedclocal = wis;
1242: }
1243: ISLocalToGlobalMappingApplyIS(el2g,wis,&gwis);
1244: ISDestroy(&wis);
1245: ISRenumber(gwis,NULL,&cne,&wis);
1246: ISLocalToGlobalMappingCreateIS(wis,&cel2g);
1247: ISDestroy(&wis);
1248: ISDestroy(&gwis);
1250: ISCreateGeneral(comm,2*nee,corners,PETSC_USE_POINTER,&wis);
1251: ISLocalToGlobalMappingApplyIS(vl2g,wis,&gwis);
1252: ISDestroy(&wis);
1253: ISRenumber(gwis,NULL,&cnv,&wis);
1254: ISLocalToGlobalMappingCreateIS(wis,&cvl2g);
1255: ISDestroy(&wis);
1256: ISDestroy(&gwis);
1258: MatCreate(comm,&pcbddc->nedcG);
1259: MatSetSizes(pcbddc->nedcG,PETSC_DECIDE,PETSC_DECIDE,cne,cnv);
1260: MatSetType(pcbddc->nedcG,MATAIJ);
1261: MatSeqAIJSetPreallocation(pcbddc->nedcG,2,NULL);
1262: MatMPIAIJSetPreallocation(pcbddc->nedcG,2,NULL,2,NULL);
1263: MatSetLocalToGlobalMapping(pcbddc->nedcG,cel2g,cvl2g);
1264: ISLocalToGlobalMappingDestroy(&cel2g);
1265: ISLocalToGlobalMappingDestroy(&cvl2g);
1266: }
1267: ISLocalToGlobalMappingDestroy(&vl2g);
1269: #if defined(PRINT_GDET)
1270: inc = 0;
1271: lev = pcbddc->current_level;
1272: #endif
1274: /* Insert values in the change of basis matrix */
1275: for (i=0;i<nee;i++) {
1276: Mat Gins = NULL, GKins = NULL;
1277: IS cornersis = NULL;
1278: PetscScalar cvals[2];
1280: if (pcbddc->nedcG) {
1281: ISCreateGeneral(PETSC_COMM_SELF,2,corners+2*i,PETSC_USE_POINTER,&cornersis);
1282: }
1283: PCBDDCComputeNedelecChangeEdge(lG,eedges[i],extrows[i],extcols[i],cornersis,&Gins,&GKins,cvals,work,rwork);
1284: if (Gins && GKins) {
1285: const PetscScalar *data;
1286: const PetscInt *rows,*cols;
1287: PetscInt nrh,nch,nrc,ncc;
1289: ISGetIndices(eedges[i],&cols);
1290: /* H1 */
1291: ISGetIndices(extrows[i],&rows);
1292: MatGetSize(Gins,&nrh,&nch);
1293: MatDenseGetArrayRead(Gins,&data);
1294: MatSetValuesLocal(T,nrh,rows,nch,cols,data,INSERT_VALUES);
1295: MatDenseRestoreArrayRead(Gins,&data);
1296: ISRestoreIndices(extrows[i],&rows);
1297: /* complement */
1298: MatGetSize(GKins,&nrc,&ncc);
1299: if (!ncc) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Constant function has not been generated for coarse edge %D",i);
1300: if (ncc + nch != nrc) SETERRQ4(PETSC_COMM_SELF,PETSC_ERR_PLIB,"The sum of the number of columns of GKins %D and Gins %D does not match %D for coarse edge %D",ncc,nch,nrc,i);
1301: if (ncc != 1 && pcbddc->nedcG) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_SUP,"Cannot generate the coarse discrete gradient for coarse edge %D with ncc %D",i,ncc);
1302: MatDenseGetArrayRead(GKins,&data);
1303: MatSetValuesLocal(T,nrc,cols,ncc,cols+nch,data,INSERT_VALUES);
1304: MatDenseRestoreArrayRead(GKins,&data);
1306: /* coarse discrete gradient */
1307: if (pcbddc->nedcG) {
1308: PetscInt cols[2];
1310: cols[0] = 2*i;
1311: cols[1] = 2*i+1;
1312: MatSetValuesLocal(pcbddc->nedcG,1,&i,2,cols,cvals,INSERT_VALUES);
1313: }
1314: ISRestoreIndices(eedges[i],&cols);
1315: }
1316: ISDestroy(&extrows[i]);
1317: ISDestroy(&extcols[i]);
1318: ISDestroy(&cornersis);
1319: MatDestroy(&Gins);
1320: MatDestroy(&GKins);
1321: }
1322: ISLocalToGlobalMappingDestroy(&el2g);
1324: /* Start assembling */
1325: MatAssemblyBegin(T,MAT_FINAL_ASSEMBLY);
1326: if (pcbddc->nedcG) {
1327: MatAssemblyBegin(pcbddc->nedcG,MAT_FINAL_ASSEMBLY);
1328: }
1330: /* Free */
1331: if (fl2g) {
1332: ISDestroy(&primals);
1333: for (i=0;i<nee;i++) {
1334: ISDestroy(&eedges[i]);
1335: }
1336: PetscFree(eedges);
1337: }
1339: /* hack mat_graph with primal dofs on the coarse edges */
1340: {
1341: PCBDDCGraph graph = pcbddc->mat_graph;
1342: PetscInt *oqueue = graph->queue;
1343: PetscInt *ocptr = graph->cptr;
1344: PetscInt ncc,*idxs;
1346: /* find first primal edge */
1347: if (pcbddc->nedclocal) {
1348: ISGetIndices(pcbddc->nedclocal,(const PetscInt**)&idxs);
1349: } else {
1350: if (fl2g) {
1351: ISLocalToGlobalMappingApply(fl2g,nee,cedges,cedges);
1352: }
1353: idxs = cedges;
1354: }
1355: cum = 0;
1356: while (cum < nee && cedges[cum] < 0) cum++;
1358: /* adapt connected components */
1359: PetscMalloc2(graph->nvtxs+1,&graph->cptr,ocptr[graph->ncc],&graph->queue);
1360: graph->cptr[0] = 0;
1361: for (i=0,ncc=0;i<graph->ncc;i++) {
1362: PetscInt lc = ocptr[i+1]-ocptr[i];
1363: if (cum != nee && oqueue[ocptr[i+1]-1] == cedges[cum]) { /* this cc has a primal dof */
1364: graph->cptr[ncc+1] = graph->cptr[ncc]+1;
1365: graph->queue[graph->cptr[ncc]] = cedges[cum];
1366: ncc++;
1367: lc--;
1368: cum++;
1369: while (cum < nee && cedges[cum] < 0) cum++;
1370: }
1371: graph->cptr[ncc+1] = graph->cptr[ncc] + lc;
1372: for (j=0;j<lc;j++) graph->queue[graph->cptr[ncc]+j] = oqueue[ocptr[i]+j];
1373: ncc++;
1374: }
1375: graph->ncc = ncc;
1376: if (pcbddc->nedclocal) {
1377: ISRestoreIndices(pcbddc->nedclocal,(const PetscInt**)&idxs);
1378: }
1379: PetscFree2(ocptr,oqueue);
1380: }
1381: ISLocalToGlobalMappingDestroy(&fl2g);
1382: PCBDDCGraphRestoreCandidatesIS(pcbddc->mat_graph,NULL,NULL,&nee,&alleedges,&allprimals);
1383: PCBDDCGraphResetCSR(pcbddc->mat_graph);
1384: MatDestroy(&conn);
1386: ISDestroy(&nedfieldlocal);
1387: PetscFree(extrow);
1388: PetscFree2(work,rwork);
1389: PetscFree(corners);
1390: PetscFree(cedges);
1391: PetscFree(extrows);
1392: PetscFree(extcols);
1393: MatDestroy(&lG);
1395: /* Complete assembling */
1396: MatAssemblyEnd(T,MAT_FINAL_ASSEMBLY);
1397: if (pcbddc->nedcG) {
1398: MatAssemblyEnd(pcbddc->nedcG,MAT_FINAL_ASSEMBLY);
1399: #if 0
1400: PetscObjectSetName((PetscObject)pcbddc->nedcG,"coarse_G");
1401: MatView(pcbddc->nedcG,NULL);
1402: #endif
1403: }
1405: /* set change of basis */
1406: PCBDDCSetChangeOfBasisMat(pc,T,singular);
1407: MatDestroy(&T);
1409: return(0);
1410: }
1412: /* the near-null space of BDDC carries information on quadrature weights,
1413: and these can be collinear -> so cheat with MatNullSpaceCreate
1414: and create a suitable set of basis vectors first */
1415: PetscErrorCode PCBDDCNullSpaceCreate(MPI_Comm comm, PetscBool has_const, PetscInt nvecs, Vec quad_vecs[], MatNullSpace *nnsp)
1416: {
1418: PetscInt i;
1421: for (i=0;i<nvecs;i++) {
1422: PetscInt first,last;
1424: VecGetOwnershipRange(quad_vecs[i],&first,&last);
1425: if (last-first < 2*nvecs && has_const) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not implemented");
1426: if (i>=first && i < last) {
1427: PetscScalar *data;
1428: VecGetArray(quad_vecs[i],&data);
1429: if (!has_const) {
1430: data[i-first] = 1.;
1431: } else {
1432: data[2*i-first] = 1./PetscSqrtReal(2.);
1433: data[2*i-first+1] = -1./PetscSqrtReal(2.);
1434: }
1435: VecRestoreArray(quad_vecs[i],&data);
1436: }
1437: PetscObjectStateIncrease((PetscObject)quad_vecs[i]);
1438: }
1439: MatNullSpaceCreate(comm,has_const,nvecs,quad_vecs,nnsp);
1440: for (i=0;i<nvecs;i++) { /* reset vectors */
1441: PetscInt first,last;
1442: VecLockReadPop(quad_vecs[i]);
1443: VecGetOwnershipRange(quad_vecs[i],&first,&last);
1444: if (i>=first && i < last) {
1445: PetscScalar *data;
1446: VecGetArray(quad_vecs[i],&data);
1447: if (!has_const) {
1448: data[i-first] = 0.;
1449: } else {
1450: data[2*i-first] = 0.;
1451: data[2*i-first+1] = 0.;
1452: }
1453: VecRestoreArray(quad_vecs[i],&data);
1454: }
1455: PetscObjectStateIncrease((PetscObject)quad_vecs[i]);
1456: VecLockReadPush(quad_vecs[i]);
1457: }
1458: return(0);
1459: }
1461: PetscErrorCode PCBDDCComputeNoNetFlux(Mat A, Mat divudotp, PetscBool transpose, IS vl2l, PCBDDCGraph graph, MatNullSpace *nnsp)
1462: {
1463: Mat loc_divudotp;
1464: Vec p,v,vins,quad_vec,*quad_vecs;
1465: ISLocalToGlobalMapping map;
1466: PetscScalar *vals;
1467: const PetscScalar *array;
1468: PetscInt i,maxneighs,maxsize,*gidxs;
1469: PetscInt n_neigh,*neigh,*n_shared,**shared;
1470: PetscMPIInt rank;
1471: PetscErrorCode ierr;
1474: ISLocalToGlobalMappingGetInfo(graph->l2gmap,&n_neigh,&neigh,&n_shared,&shared);
1475: MPIU_Allreduce(&n_neigh,&maxneighs,1,MPIU_INT,MPI_MAX,PetscObjectComm((PetscObject)A));
1476: if (!maxneighs) {
1477: ISLocalToGlobalMappingRestoreInfo(graph->l2gmap,&n_neigh,&neigh,&n_shared,&shared);
1478: *nnsp = NULL;
1479: return(0);
1480: }
1481: maxsize = 0;
1482: for (i=0;i<n_neigh;i++) maxsize = PetscMax(n_shared[i],maxsize);
1483: PetscMalloc2(maxsize,&gidxs,maxsize,&vals);
1484: /* create vectors to hold quadrature weights */
1485: MatCreateVecs(A,&quad_vec,NULL);
1486: if (!transpose) {
1487: MatGetLocalToGlobalMapping(A,&map,NULL);
1488: } else {
1489: MatGetLocalToGlobalMapping(A,NULL,&map);
1490: }
1491: VecDuplicateVecs(quad_vec,maxneighs,&quad_vecs);
1492: VecDestroy(&quad_vec);
1493: PCBDDCNullSpaceCreate(PetscObjectComm((PetscObject)A),PETSC_FALSE,maxneighs,quad_vecs,nnsp);
1494: for (i=0;i<maxneighs;i++) {
1495: VecLockReadPop(quad_vecs[i]);
1496: }
1498: /* compute local quad vec */
1499: MatISGetLocalMat(divudotp,&loc_divudotp);
1500: if (!transpose) {
1501: MatCreateVecs(loc_divudotp,&v,&p);
1502: } else {
1503: MatCreateVecs(loc_divudotp,&p,&v);
1504: }
1505: VecSet(p,1.);
1506: if (!transpose) {
1507: MatMultTranspose(loc_divudotp,p,v);
1508: } else {
1509: MatMult(loc_divudotp,p,v);
1510: }
1511: if (vl2l) {
1512: Mat lA;
1513: VecScatter sc;
1515: MatISGetLocalMat(A,&lA);
1516: MatCreateVecs(lA,&vins,NULL);
1517: VecScatterCreate(v,NULL,vins,vl2l,&sc);
1518: VecScatterBegin(sc,v,vins,INSERT_VALUES,SCATTER_FORWARD);
1519: VecScatterEnd(sc,v,vins,INSERT_VALUES,SCATTER_FORWARD);
1520: VecScatterDestroy(&sc);
1521: } else {
1522: vins = v;
1523: }
1524: VecGetArrayRead(vins,&array);
1525: VecDestroy(&p);
1527: /* insert in global quadrature vecs */
1528: MPI_Comm_rank(PetscObjectComm((PetscObject)A),&rank);
1529: for (i=0;i<n_neigh;i++) {
1530: const PetscInt *idxs;
1531: PetscInt idx,nn,j;
1533: idxs = shared[i];
1534: nn = n_shared[i];
1535: for (j=0;j<nn;j++) vals[j] = array[idxs[j]];
1536: PetscFindInt(rank,graph->count[idxs[0]],graph->neighbours_set[idxs[0]],&idx);
1537: idx = -(idx+1);
1538: ISLocalToGlobalMappingApply(map,nn,idxs,gidxs);
1539: VecSetValues(quad_vecs[idx],nn,gidxs,vals,INSERT_VALUES);
1540: }
1541: ISLocalToGlobalMappingRestoreInfo(graph->l2gmap,&n_neigh,&neigh,&n_shared,&shared);
1542: VecRestoreArrayRead(vins,&array);
1543: if (vl2l) {
1544: VecDestroy(&vins);
1545: }
1546: VecDestroy(&v);
1547: PetscFree2(gidxs,vals);
1549: /* assemble near null space */
1550: for (i=0;i<maxneighs;i++) {
1551: VecAssemblyBegin(quad_vecs[i]);
1552: }
1553: for (i=0;i<maxneighs;i++) {
1554: VecAssemblyEnd(quad_vecs[i]);
1555: VecViewFromOptions(quad_vecs[i],NULL,"-pc_bddc_quad_vecs_view");
1556: VecLockReadPush(quad_vecs[i]);
1557: }
1558: VecDestroyVecs(maxneighs,&quad_vecs);
1559: return(0);
1560: }
1562: PetscErrorCode PCBDDCAddPrimalVerticesLocalIS(PC pc, IS primalv)
1563: {
1564: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
1568: if (primalv) {
1569: if (pcbddc->user_primal_vertices_local) {
1570: IS list[2], newp;
1572: list[0] = primalv;
1573: list[1] = pcbddc->user_primal_vertices_local;
1574: ISConcatenate(PetscObjectComm((PetscObject)pc),2,list,&newp);
1575: ISSortRemoveDups(newp);
1576: ISDestroy(&list[1]);
1577: pcbddc->user_primal_vertices_local = newp;
1578: } else {
1579: PCBDDCSetPrimalVerticesLocalIS(pc,primalv);
1580: }
1581: }
1582: return(0);
1583: }
1585: static PetscErrorCode func_coords_private(PetscInt dim, PetscReal t, const PetscReal X[], PetscInt Nf, PetscScalar *out, void *ctx)
1586: {
1587: PetscInt f, *comp = (PetscInt *)ctx;
1590: for (f=0;f<Nf;f++) out[f] = X[*comp];
1591: return(0);
1592: }
1594: PetscErrorCode PCBDDCComputeLocalTopologyInfo(PC pc)
1595: {
1597: Vec local,global;
1598: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
1599: Mat_IS *matis = (Mat_IS*)pc->pmat->data;
1600: PetscBool monolithic = PETSC_FALSE;
1603: PetscOptionsBegin(PetscObjectComm((PetscObject)pc),((PetscObject)pc)->prefix,"BDDC topology options","PC");
1604: PetscOptionsBool("-pc_bddc_monolithic","Discard any information on dofs splitting",NULL,monolithic,&monolithic,NULL);
1605: PetscOptionsEnd();
1606: /* need to convert from global to local topology information and remove references to information in global ordering */
1607: MatCreateVecs(pc->pmat,&global,NULL);
1608: MatCreateVecs(matis->A,&local,NULL);
1609: VecBindToCPU(global,PETSC_TRUE);
1610: VecBindToCPU(local,PETSC_TRUE);
1611: if (monolithic) { /* just get block size to properly compute vertices */
1612: if (pcbddc->vertex_size == 1) {
1613: MatGetBlockSize(pc->pmat,&pcbddc->vertex_size);
1614: }
1615: goto boundary;
1616: }
1618: if (pcbddc->user_provided_isfordofs) {
1619: if (pcbddc->n_ISForDofs) {
1620: PetscInt i;
1622: PetscMalloc1(pcbddc->n_ISForDofs,&pcbddc->ISForDofsLocal);
1623: for (i=0;i<pcbddc->n_ISForDofs;i++) {
1624: PetscInt bs;
1626: PCBDDCGlobalToLocal(matis->rctx,global,local,pcbddc->ISForDofs[i],&pcbddc->ISForDofsLocal[i]);
1627: ISGetBlockSize(pcbddc->ISForDofs[i],&bs);
1628: ISSetBlockSize(pcbddc->ISForDofsLocal[i],bs);
1629: ISDestroy(&pcbddc->ISForDofs[i]);
1630: }
1631: pcbddc->n_ISForDofsLocal = pcbddc->n_ISForDofs;
1632: pcbddc->n_ISForDofs = 0;
1633: PetscFree(pcbddc->ISForDofs);
1634: }
1635: } else {
1636: if (!pcbddc->n_ISForDofsLocal) { /* field split not present */
1637: DM dm;
1639: MatGetDM(pc->pmat, &dm);
1640: if (!dm) {
1641: PCGetDM(pc, &dm);
1642: }
1643: if (dm) {
1644: IS *fields;
1645: PetscInt nf,i;
1647: DMCreateFieldDecomposition(dm,&nf,NULL,&fields,NULL);
1648: PetscMalloc1(nf,&pcbddc->ISForDofsLocal);
1649: for (i=0;i<nf;i++) {
1650: PetscInt bs;
1652: PCBDDCGlobalToLocal(matis->rctx,global,local,fields[i],&pcbddc->ISForDofsLocal[i]);
1653: ISGetBlockSize(fields[i],&bs);
1654: ISSetBlockSize(pcbddc->ISForDofsLocal[i],bs);
1655: ISDestroy(&fields[i]);
1656: }
1657: PetscFree(fields);
1658: pcbddc->n_ISForDofsLocal = nf;
1659: } else { /* See if MATIS has fields attached by the conversion from MatNest */
1660: PetscContainer c;
1662: PetscObjectQuery((PetscObject)pc->pmat,"_convert_nest_lfields",(PetscObject*)&c);
1663: if (c) {
1664: MatISLocalFields lf;
1665: PetscContainerGetPointer(c,(void**)&lf);
1666: PCBDDCSetDofsSplittingLocal(pc,lf->nr,lf->rf);
1667: } else { /* fallback, create the default fields if bs > 1 */
1668: PetscInt i, n = matis->A->rmap->n;
1669: MatGetBlockSize(pc->pmat,&i);
1670: if (i > 1) {
1671: pcbddc->n_ISForDofsLocal = i;
1672: PetscMalloc1(pcbddc->n_ISForDofsLocal,&pcbddc->ISForDofsLocal);
1673: for (i=0;i<pcbddc->n_ISForDofsLocal;i++) {
1674: ISCreateStride(PetscObjectComm((PetscObject)pc),n/pcbddc->n_ISForDofsLocal,i,pcbddc->n_ISForDofsLocal,&pcbddc->ISForDofsLocal[i]);
1675: }
1676: }
1677: }
1678: }
1679: } else {
1680: PetscInt i;
1681: for (i=0;i<pcbddc->n_ISForDofsLocal;i++) {
1682: PCBDDCConsistencyCheckIS(pc,MPI_LAND,&pcbddc->ISForDofsLocal[i]);
1683: }
1684: }
1685: }
1687: boundary:
1688: if (!pcbddc->DirichletBoundariesLocal && pcbddc->DirichletBoundaries) {
1689: PCBDDCGlobalToLocal(matis->rctx,global,local,pcbddc->DirichletBoundaries,&pcbddc->DirichletBoundariesLocal);
1690: } else if (pcbddc->DirichletBoundariesLocal) {
1691: PCBDDCConsistencyCheckIS(pc,MPI_LAND,&pcbddc->DirichletBoundariesLocal);
1692: }
1693: if (!pcbddc->NeumannBoundariesLocal && pcbddc->NeumannBoundaries) {
1694: PCBDDCGlobalToLocal(matis->rctx,global,local,pcbddc->NeumannBoundaries,&pcbddc->NeumannBoundariesLocal);
1695: } else if (pcbddc->NeumannBoundariesLocal) {
1696: PCBDDCConsistencyCheckIS(pc,MPI_LOR,&pcbddc->NeumannBoundariesLocal);
1697: }
1698: if (!pcbddc->user_primal_vertices_local && pcbddc->user_primal_vertices) {
1699: PCBDDCGlobalToLocal(matis->rctx,global,local,pcbddc->user_primal_vertices,&pcbddc->user_primal_vertices_local);
1700: }
1701: VecDestroy(&global);
1702: VecDestroy(&local);
1703: /* detect local disconnected subdomains if requested (use matis->A) */
1704: if (pcbddc->detect_disconnected) {
1705: IS primalv = NULL;
1706: PetscInt i;
1707: PetscBool filter = pcbddc->detect_disconnected_filter;
1709: for (i=0;i<pcbddc->n_local_subs;i++) {
1710: ISDestroy(&pcbddc->local_subs[i]);
1711: }
1712: PetscFree(pcbddc->local_subs);
1713: PCBDDCDetectDisconnectedComponents(pc,filter,&pcbddc->n_local_subs,&pcbddc->local_subs,&primalv);
1714: PCBDDCAddPrimalVerticesLocalIS(pc,primalv);
1715: ISDestroy(&primalv);
1716: }
1717: /* early stage corner detection */
1718: {
1719: DM dm;
1721: MatGetDM(pc->pmat,&dm);
1722: if (!dm) {
1723: PCGetDM(pc,&dm);
1724: }
1725: if (dm) {
1726: PetscBool isda;
1728: PetscObjectTypeCompare((PetscObject)dm,DMDA,&isda);
1729: if (isda) {
1730: ISLocalToGlobalMapping l2l;
1731: IS corners;
1732: Mat lA;
1733: PetscBool gl,lo;
1735: {
1736: Vec cvec;
1737: const PetscScalar *coords;
1738: PetscInt dof,n,cdim;
1739: PetscBool memc = PETSC_TRUE;
1741: DMDAGetInfo(dm,NULL,NULL,NULL,NULL,NULL,NULL,NULL,&dof,NULL,NULL,NULL,NULL,NULL);
1742: DMGetCoordinates(dm,&cvec);
1743: VecGetLocalSize(cvec,&n);
1744: VecGetBlockSize(cvec,&cdim);
1745: n /= cdim;
1746: PetscFree(pcbddc->mat_graph->coords);
1747: PetscMalloc1(dof*n*cdim,&pcbddc->mat_graph->coords);
1748: VecGetArrayRead(cvec,&coords);
1749: #if defined(PETSC_USE_COMPLEX)
1750: memc = PETSC_FALSE;
1751: #endif
1752: if (dof != 1) memc = PETSC_FALSE;
1753: if (memc) {
1754: PetscArraycpy(pcbddc->mat_graph->coords,coords,cdim*n*dof);
1755: } else { /* BDDC graph does not use any blocked information, we need to replicate the data */
1756: PetscReal *bcoords = pcbddc->mat_graph->coords;
1757: PetscInt i, b, d;
1759: for (i=0;i<n;i++) {
1760: for (b=0;b<dof;b++) {
1761: for (d=0;d<cdim;d++) {
1762: bcoords[i*dof*cdim + b*cdim + d] = PetscRealPart(coords[i*cdim+d]);
1763: }
1764: }
1765: }
1766: }
1767: VecRestoreArrayRead(cvec,&coords);
1768: pcbddc->mat_graph->cdim = cdim;
1769: pcbddc->mat_graph->cnloc = dof*n;
1770: pcbddc->mat_graph->cloc = PETSC_FALSE;
1771: }
1772: DMDAGetSubdomainCornersIS(dm,&corners);
1773: MatISGetLocalMat(pc->pmat,&lA);
1774: MatGetLocalToGlobalMapping(lA,&l2l,NULL);
1775: MatISRestoreLocalMat(pc->pmat,&lA);
1776: lo = (PetscBool)(l2l && corners);
1777: MPIU_Allreduce(&lo,&gl,1,MPIU_BOOL,MPI_LAND,PetscObjectComm((PetscObject)pc));
1778: if (gl) { /* From PETSc's DMDA */
1779: const PetscInt *idx;
1780: PetscInt dof,bs,*idxout,n;
1782: DMDAGetInfo(dm,NULL,NULL,NULL,NULL,NULL,NULL,NULL,&dof,NULL,NULL,NULL,NULL,NULL);
1783: ISLocalToGlobalMappingGetBlockSize(l2l,&bs);
1784: ISGetLocalSize(corners,&n);
1785: ISGetIndices(corners,&idx);
1786: if (bs == dof) {
1787: PetscMalloc1(n,&idxout);
1788: ISLocalToGlobalMappingApplyBlock(l2l,n,idx,idxout);
1789: } else { /* the original DMDA local-to-local map have been modified */
1790: PetscInt i,d;
1792: PetscMalloc1(dof*n,&idxout);
1793: for (i=0;i<n;i++) for (d=0;d<dof;d++) idxout[dof*i+d] = dof*idx[i]+d;
1794: ISLocalToGlobalMappingApply(l2l,dof*n,idxout,idxout);
1796: bs = 1;
1797: n *= dof;
1798: }
1799: ISRestoreIndices(corners,&idx);
1800: DMDARestoreSubdomainCornersIS(dm,&corners);
1801: ISCreateBlock(PetscObjectComm((PetscObject)pc),bs,n,idxout,PETSC_OWN_POINTER,&corners);
1802: PCBDDCAddPrimalVerticesLocalIS(pc,corners);
1803: ISDestroy(&corners);
1804: pcbddc->corner_selected = PETSC_TRUE;
1805: pcbddc->corner_selection = PETSC_TRUE;
1806: }
1807: if (corners) {
1808: DMDARestoreSubdomainCornersIS(dm,&corners);
1809: }
1810: }
1811: }
1812: }
1813: if (pcbddc->corner_selection && !pcbddc->mat_graph->cdim) {
1814: DM dm;
1816: MatGetDM(pc->pmat,&dm);
1817: if (!dm) {
1818: PCGetDM(pc,&dm);
1819: }
1820: if (dm) { /* this can get very expensive, I need to find a faster alternative */
1821: Vec vcoords;
1822: PetscSection section;
1823: PetscReal *coords;
1824: PetscInt d,cdim,nl,nf,**ctxs;
1825: PetscErrorCode (**funcs)(PetscInt, PetscReal, const PetscReal *, PetscInt, PetscScalar *, void *);
1827: DMGetCoordinateDim(dm,&cdim);
1828: DMGetLocalSection(dm,§ion);
1829: PetscSectionGetNumFields(section,&nf);
1830: DMCreateGlobalVector(dm,&vcoords);
1831: VecGetLocalSize(vcoords,&nl);
1832: PetscMalloc1(nl*cdim,&coords);
1833: PetscMalloc2(nf,&funcs,nf,&ctxs);
1834: PetscMalloc1(nf,&ctxs[0]);
1835: for (d=0;d<nf;d++) funcs[d] = func_coords_private;
1836: for (d=1;d<nf;d++) ctxs[d] = ctxs[d-1] + 1;
1837: for (d=0;d<cdim;d++) {
1838: PetscInt i;
1839: const PetscScalar *v;
1841: for (i=0;i<nf;i++) ctxs[i][0] = d;
1842: DMProjectFunction(dm,0.0,funcs,(void**)ctxs,INSERT_VALUES,vcoords);
1843: VecGetArrayRead(vcoords,&v);
1844: for (i=0;i<nl;i++) coords[i*cdim+d] = PetscRealPart(v[i]);
1845: VecRestoreArrayRead(vcoords,&v);
1846: }
1847: VecDestroy(&vcoords);
1848: PCSetCoordinates(pc,cdim,nl,coords);
1849: PetscFree(coords);
1850: PetscFree(ctxs[0]);
1851: PetscFree2(funcs,ctxs);
1852: }
1853: }
1854: return(0);
1855: }
1857: PetscErrorCode PCBDDCConsistencyCheckIS(PC pc, MPI_Op mop, IS *is)
1858: {
1859: Mat_IS *matis = (Mat_IS*)(pc->pmat->data);
1860: PetscErrorCode ierr;
1861: IS nis;
1862: const PetscInt *idxs;
1863: PetscInt i,nd,n = matis->A->rmap->n,*nidxs,nnd;
1864: PetscBool *ld;
1867: if (mop != MPI_LAND && mop != MPI_LOR) SETERRQ(PetscObjectComm((PetscObject)(pc)),PETSC_ERR_SUP,"Supported are MPI_LAND and MPI_LOR");
1868: if (mop == MPI_LAND) {
1869: /* init rootdata with true */
1870: ld = (PetscBool*) matis->sf_rootdata;
1871: for (i=0;i<pc->pmat->rmap->n;i++) ld[i] = PETSC_TRUE;
1872: } else {
1873: PetscArrayzero(matis->sf_rootdata,pc->pmat->rmap->n);
1874: }
1875: PetscArrayzero(matis->sf_leafdata,n);
1876: ISGetLocalSize(*is,&nd);
1877: ISGetIndices(*is,&idxs);
1878: ld = (PetscBool*) matis->sf_leafdata;
1879: for (i=0;i<nd;i++)
1880: if (-1 < idxs[i] && idxs[i] < n)
1881: ld[idxs[i]] = PETSC_TRUE;
1882: ISRestoreIndices(*is,&idxs);
1883: PetscSFReduceBegin(matis->sf,MPIU_BOOL,matis->sf_leafdata,matis->sf_rootdata,mop);
1884: PetscSFReduceEnd(matis->sf,MPIU_BOOL,matis->sf_leafdata,matis->sf_rootdata,mop);
1885: PetscSFBcastBegin(matis->sf,MPIU_BOOL,matis->sf_rootdata,matis->sf_leafdata);
1886: PetscSFBcastEnd(matis->sf,MPIU_BOOL,matis->sf_rootdata,matis->sf_leafdata);
1887: if (mop == MPI_LAND) {
1888: PetscMalloc1(nd,&nidxs);
1889: } else {
1890: PetscMalloc1(n,&nidxs);
1891: }
1892: for (i=0,nnd=0;i<n;i++)
1893: if (ld[i])
1894: nidxs[nnd++] = i;
1895: ISCreateGeneral(PetscObjectComm((PetscObject)(*is)),nnd,nidxs,PETSC_OWN_POINTER,&nis);
1896: ISDestroy(is);
1897: *is = nis;
1898: return(0);
1899: }
1901: PetscErrorCode PCBDDCBenignRemoveInterior(PC pc,Vec r,Vec z)
1902: {
1903: PC_IS *pcis = (PC_IS*)(pc->data);
1904: PC_BDDC *pcbddc = (PC_BDDC*)(pc->data);
1905: PetscErrorCode ierr;
1908: if (!pcbddc->benign_have_null) {
1909: return(0);
1910: }
1911: if (pcbddc->ChangeOfBasisMatrix) {
1912: Vec swap;
1914: MatMultTranspose(pcbddc->ChangeOfBasisMatrix,r,pcbddc->work_change);
1915: swap = pcbddc->work_change;
1916: pcbddc->work_change = r;
1917: r = swap;
1918: }
1919: VecScatterBegin(pcis->global_to_D,r,pcis->vec1_D,INSERT_VALUES,SCATTER_FORWARD);
1920: VecScatterEnd(pcis->global_to_D,r,pcis->vec1_D,INSERT_VALUES,SCATTER_FORWARD);
1921: KSPSolve(pcbddc->ksp_D,pcis->vec1_D,pcis->vec2_D);
1922: KSPCheckSolve(pcbddc->ksp_D,pc,pcis->vec2_D);
1923: VecSet(z,0.);
1924: VecScatterBegin(pcis->global_to_D,pcis->vec2_D,z,INSERT_VALUES,SCATTER_REVERSE);
1925: VecScatterEnd(pcis->global_to_D,pcis->vec2_D,z,INSERT_VALUES,SCATTER_REVERSE);
1926: if (pcbddc->ChangeOfBasisMatrix) {
1927: pcbddc->work_change = r;
1928: VecCopy(z,pcbddc->work_change);
1929: MatMult(pcbddc->ChangeOfBasisMatrix,pcbddc->work_change,z);
1930: }
1931: return(0);
1932: }
1934: PetscErrorCode PCBDDCBenignMatMult_Private_Private(Mat A, Vec x, Vec y, PetscBool transpose)
1935: {
1936: PCBDDCBenignMatMult_ctx ctx;
1937: PetscErrorCode ierr;
1938: PetscBool apply_right,apply_left,reset_x;
1941: MatShellGetContext(A,&ctx);
1942: if (transpose) {
1943: apply_right = ctx->apply_left;
1944: apply_left = ctx->apply_right;
1945: } else {
1946: apply_right = ctx->apply_right;
1947: apply_left = ctx->apply_left;
1948: }
1949: reset_x = PETSC_FALSE;
1950: if (apply_right) {
1951: const PetscScalar *ax;
1952: PetscInt nl,i;
1954: VecGetLocalSize(x,&nl);
1955: VecGetArrayRead(x,&ax);
1956: PetscArraycpy(ctx->work,ax,nl);
1957: VecRestoreArrayRead(x,&ax);
1958: for (i=0;i<ctx->benign_n;i++) {
1959: PetscScalar sum,val;
1960: const PetscInt *idxs;
1961: PetscInt nz,j;
1962: ISGetLocalSize(ctx->benign_zerodiag_subs[i],&nz);
1963: ISGetIndices(ctx->benign_zerodiag_subs[i],&idxs);
1964: sum = 0.;
1965: if (ctx->apply_p0) {
1966: val = ctx->work[idxs[nz-1]];
1967: for (j=0;j<nz-1;j++) {
1968: sum += ctx->work[idxs[j]];
1969: ctx->work[idxs[j]] += val;
1970: }
1971: } else {
1972: for (j=0;j<nz-1;j++) {
1973: sum += ctx->work[idxs[j]];
1974: }
1975: }
1976: ctx->work[idxs[nz-1]] -= sum;
1977: ISRestoreIndices(ctx->benign_zerodiag_subs[i],&idxs);
1978: }
1979: VecPlaceArray(x,ctx->work);
1980: reset_x = PETSC_TRUE;
1981: }
1982: if (transpose) {
1983: MatMultTranspose(ctx->A,x,y);
1984: } else {
1985: MatMult(ctx->A,x,y);
1986: }
1987: if (reset_x) {
1988: VecResetArray(x);
1989: }
1990: if (apply_left) {
1991: PetscScalar *ay;
1992: PetscInt i;
1994: VecGetArray(y,&ay);
1995: for (i=0;i<ctx->benign_n;i++) {
1996: PetscScalar sum,val;
1997: const PetscInt *idxs;
1998: PetscInt nz,j;
1999: ISGetLocalSize(ctx->benign_zerodiag_subs[i],&nz);
2000: ISGetIndices(ctx->benign_zerodiag_subs[i],&idxs);
2001: val = -ay[idxs[nz-1]];
2002: if (ctx->apply_p0) {
2003: sum = 0.;
2004: for (j=0;j<nz-1;j++) {
2005: sum += ay[idxs[j]];
2006: ay[idxs[j]] += val;
2007: }
2008: ay[idxs[nz-1]] += sum;
2009: } else {
2010: for (j=0;j<nz-1;j++) {
2011: ay[idxs[j]] += val;
2012: }
2013: ay[idxs[nz-1]] = 0.;
2014: }
2015: ISRestoreIndices(ctx->benign_zerodiag_subs[i],&idxs);
2016: }
2017: VecRestoreArray(y,&ay);
2018: }
2019: return(0);
2020: }
2022: PetscErrorCode PCBDDCBenignMatMultTranspose_Private(Mat A, Vec x, Vec y)
2023: {
2027: PCBDDCBenignMatMult_Private_Private(A,x,y,PETSC_TRUE);
2028: return(0);
2029: }
2031: PetscErrorCode PCBDDCBenignMatMult_Private(Mat A, Vec x, Vec y)
2032: {
2036: PCBDDCBenignMatMult_Private_Private(A,x,y,PETSC_FALSE);
2037: return(0);
2038: }
2040: PetscErrorCode PCBDDCBenignShellMat(PC pc, PetscBool restore)
2041: {
2042: PC_IS *pcis = (PC_IS*)pc->data;
2043: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
2044: PCBDDCBenignMatMult_ctx ctx;
2045: PetscErrorCode ierr;
2048: if (!restore) {
2049: Mat A_IB,A_BI;
2050: PetscScalar *work;
2051: PCBDDCReuseSolvers reuse = pcbddc->sub_schurs ? pcbddc->sub_schurs->reuse_solver : NULL;
2053: if (pcbddc->benign_original_mat) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Benign original mat has not been restored");
2054: if (!pcbddc->benign_change || !pcbddc->benign_n || pcbddc->benign_change_explicit) return(0);
2055: PetscMalloc1(pcis->n,&work);
2056: MatCreate(PETSC_COMM_SELF,&A_IB);
2057: MatSetSizes(A_IB,pcis->n-pcis->n_B,pcis->n_B,PETSC_DECIDE,PETSC_DECIDE);
2058: MatSetType(A_IB,MATSHELL);
2059: MatShellSetOperation(A_IB,MATOP_MULT,(void (*)(void))PCBDDCBenignMatMult_Private);
2060: MatShellSetOperation(A_IB,MATOP_MULT_TRANSPOSE,(void (*)(void))PCBDDCBenignMatMultTranspose_Private);
2061: PetscNew(&ctx);
2062: MatShellSetContext(A_IB,ctx);
2063: ctx->apply_left = PETSC_TRUE;
2064: ctx->apply_right = PETSC_FALSE;
2065: ctx->apply_p0 = PETSC_FALSE;
2066: ctx->benign_n = pcbddc->benign_n;
2067: if (reuse) {
2068: ctx->benign_zerodiag_subs = reuse->benign_zerodiag_subs;
2069: ctx->free = PETSC_FALSE;
2070: } else { /* TODO: could be optimized for successive solves */
2071: ISLocalToGlobalMapping N_to_D;
2072: PetscInt i;
2074: ISLocalToGlobalMappingCreateIS(pcis->is_I_local,&N_to_D);
2075: PetscMalloc1(pcbddc->benign_n,&ctx->benign_zerodiag_subs);
2076: for (i=0;i<pcbddc->benign_n;i++) {
2077: ISGlobalToLocalMappingApplyIS(N_to_D,IS_GTOLM_DROP,pcbddc->benign_zerodiag_subs[i],&ctx->benign_zerodiag_subs[i]);
2078: }
2079: ISLocalToGlobalMappingDestroy(&N_to_D);
2080: ctx->free = PETSC_TRUE;
2081: }
2082: ctx->A = pcis->A_IB;
2083: ctx->work = work;
2084: MatSetUp(A_IB);
2085: MatAssemblyBegin(A_IB,MAT_FINAL_ASSEMBLY);
2086: MatAssemblyEnd(A_IB,MAT_FINAL_ASSEMBLY);
2087: pcis->A_IB = A_IB;
2089: /* A_BI as A_IB^T */
2090: MatCreateTranspose(A_IB,&A_BI);
2091: pcbddc->benign_original_mat = pcis->A_BI;
2092: pcis->A_BI = A_BI;
2093: } else {
2094: if (!pcbddc->benign_original_mat) {
2095: return(0);
2096: }
2097: MatShellGetContext(pcis->A_IB,&ctx);
2098: MatDestroy(&pcis->A_IB);
2099: pcis->A_IB = ctx->A;
2100: ctx->A = NULL;
2101: MatDestroy(&pcis->A_BI);
2102: pcis->A_BI = pcbddc->benign_original_mat;
2103: pcbddc->benign_original_mat = NULL;
2104: if (ctx->free) {
2105: PetscInt i;
2106: for (i=0;i<ctx->benign_n;i++) {
2107: ISDestroy(&ctx->benign_zerodiag_subs[i]);
2108: }
2109: PetscFree(ctx->benign_zerodiag_subs);
2110: }
2111: PetscFree(ctx->work);
2112: PetscFree(ctx);
2113: }
2114: return(0);
2115: }
2117: /* used just in bddc debug mode */
2118: PetscErrorCode PCBDDCBenignProject(PC pc, IS is1, IS is2, Mat *B)
2119: {
2120: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
2121: Mat_IS *matis = (Mat_IS*)pc->pmat->data;
2122: Mat An;
2126: MatPtAP(matis->A,pcbddc->benign_change,MAT_INITIAL_MATRIX,2.0,&An);
2127: MatZeroRowsColumns(An,pcbddc->benign_n,pcbddc->benign_p0_lidx,1.0,NULL,NULL);
2128: if (is1) {
2129: MatCreateSubMatrix(An,is1,is2,MAT_INITIAL_MATRIX,B);
2130: MatDestroy(&An);
2131: } else {
2132: *B = An;
2133: }
2134: return(0);
2135: }
2137: /* TODO: add reuse flag */
2138: PetscErrorCode MatSeqAIJCompress(Mat A, Mat *B)
2139: {
2140: Mat Bt;
2141: PetscScalar *a,*bdata;
2142: const PetscInt *ii,*ij;
2143: PetscInt m,n,i,nnz,*bii,*bij;
2144: PetscBool flg_row;
2148: MatGetSize(A,&n,&m);
2149: MatGetRowIJ(A,0,PETSC_FALSE,PETSC_FALSE,&n,&ii,&ij,&flg_row);
2150: MatSeqAIJGetArray(A,&a);
2151: nnz = n;
2152: for (i=0;i<ii[n];i++) {
2153: if (PetscLikely(PetscAbsScalar(a[i]) > PETSC_SMALL)) nnz++;
2154: }
2155: PetscMalloc1(n+1,&bii);
2156: PetscMalloc1(nnz,&bij);
2157: PetscMalloc1(nnz,&bdata);
2158: nnz = 0;
2159: bii[0] = 0;
2160: for (i=0;i<n;i++) {
2161: PetscInt j;
2162: for (j=ii[i];j<ii[i+1];j++) {
2163: PetscScalar entry = a[j];
2164: if (PetscLikely(PetscAbsScalar(entry) > PETSC_SMALL) || (n == m && ij[j] == i)) {
2165: bij[nnz] = ij[j];
2166: bdata[nnz] = entry;
2167: nnz++;
2168: }
2169: }
2170: bii[i+1] = nnz;
2171: }
2172: MatSeqAIJRestoreArray(A,&a);
2173: MatCreateSeqAIJWithArrays(PetscObjectComm((PetscObject)A),n,m,bii,bij,bdata,&Bt);
2174: MatRestoreRowIJ(A,0,PETSC_FALSE,PETSC_FALSE,&n,&ii,&ij,&flg_row);
2175: {
2176: Mat_SeqAIJ *b = (Mat_SeqAIJ*)(Bt->data);
2177: b->free_a = PETSC_TRUE;
2178: b->free_ij = PETSC_TRUE;
2179: }
2180: if (*B == A) {
2181: MatDestroy(&A);
2182: }
2183: *B = Bt;
2184: return(0);
2185: }
2187: PetscErrorCode PCBDDCDetectDisconnectedComponents(PC pc, PetscBool filter, PetscInt *ncc, IS* cc[], IS* primalv)
2188: {
2189: Mat B = NULL;
2190: DM dm;
2191: IS is_dummy,*cc_n;
2192: ISLocalToGlobalMapping l2gmap_dummy;
2193: PCBDDCGraph graph;
2194: PetscInt *xadj_filtered = NULL,*adjncy_filtered = NULL;
2195: PetscInt i,n;
2196: PetscInt *xadj,*adjncy;
2197: PetscBool isplex = PETSC_FALSE;
2198: PetscErrorCode ierr;
2201: if (ncc) *ncc = 0;
2202: if (cc) *cc = NULL;
2203: if (primalv) *primalv = NULL;
2204: PCBDDCGraphCreate(&graph);
2205: MatGetDM(pc->pmat,&dm);
2206: if (!dm) {
2207: PCGetDM(pc,&dm);
2208: }
2209: if (dm) {
2210: PetscObjectTypeCompare((PetscObject)dm,DMPLEX,&isplex);
2211: }
2212: if (filter) isplex = PETSC_FALSE;
2214: if (isplex) { /* this code has been modified from plexpartition.c */
2215: PetscInt p, pStart, pEnd, a, adjSize, idx, size, nroots;
2216: PetscInt *adj = NULL;
2217: IS cellNumbering;
2218: const PetscInt *cellNum;
2219: PetscBool useCone, useClosure;
2220: PetscSection section;
2221: PetscSegBuffer adjBuffer;
2222: PetscSF sfPoint;
2226: DMPlexGetHeightStratum(dm, 0, &pStart, &pEnd);
2227: DMGetPointSF(dm, &sfPoint);
2228: PetscSFGetGraph(sfPoint, &nroots, NULL, NULL, NULL);
2229: /* Build adjacency graph via a section/segbuffer */
2230: PetscSectionCreate(PetscObjectComm((PetscObject) dm), §ion);
2231: PetscSectionSetChart(section, pStart, pEnd);
2232: PetscSegBufferCreate(sizeof(PetscInt),1000,&adjBuffer);
2233: /* Always use FVM adjacency to create partitioner graph */
2234: DMGetBasicAdjacency(dm, &useCone, &useClosure);
2235: DMSetBasicAdjacency(dm, PETSC_TRUE, PETSC_FALSE);
2236: DMPlexGetCellNumbering(dm, &cellNumbering);
2237: ISGetIndices(cellNumbering, &cellNum);
2238: for (n = 0, p = pStart; p < pEnd; p++) {
2239: /* Skip non-owned cells in parallel (ParMetis expects no overlap) */
2240: if (nroots > 0) {if (cellNum[p] < 0) continue;}
2241: adjSize = PETSC_DETERMINE;
2242: DMPlexGetAdjacency(dm, p, &adjSize, &adj);
2243: for (a = 0; a < adjSize; ++a) {
2244: const PetscInt point = adj[a];
2245: if (pStart <= point && point < pEnd) {
2246: PetscInt *PETSC_RESTRICT pBuf;
2247: PetscSectionAddDof(section, p, 1);
2248: PetscSegBufferGetInts(adjBuffer, 1, &pBuf);
2249: *pBuf = point;
2250: }
2251: }
2252: n++;
2253: }
2254: DMSetBasicAdjacency(dm, useCone, useClosure);
2255: /* Derive CSR graph from section/segbuffer */
2256: PetscSectionSetUp(section);
2257: PetscSectionGetStorageSize(section, &size);
2258: PetscMalloc1(n+1, &xadj);
2259: for (idx = 0, p = pStart; p < pEnd; p++) {
2260: if (nroots > 0) {if (cellNum[p] < 0) continue;}
2261: PetscSectionGetOffset(section, p, &(xadj[idx++]));
2262: }
2263: xadj[n] = size;
2264: PetscSegBufferExtractAlloc(adjBuffer, &adjncy);
2265: /* Clean up */
2266: PetscSegBufferDestroy(&adjBuffer);
2267: PetscSectionDestroy(§ion);
2268: PetscFree(adj);
2269: graph->xadj = xadj;
2270: graph->adjncy = adjncy;
2271: } else {
2272: Mat A;
2273: PetscBool isseqaij, flg_row;
2275: MatISGetLocalMat(pc->pmat,&A);
2276: if (!A->rmap->N || !A->cmap->N) {
2277: PCBDDCGraphDestroy(&graph);
2278: return(0);
2279: }
2280: PetscObjectBaseTypeCompare((PetscObject)A,MATSEQAIJ,&isseqaij);
2281: if (!isseqaij && filter) {
2282: PetscBool isseqdense;
2284: PetscObjectTypeCompare((PetscObject)A,MATSEQDENSE,&isseqdense);
2285: if (!isseqdense) {
2286: MatConvert(A,MATSEQAIJ,MAT_INITIAL_MATRIX,&B);
2287: } else { /* TODO: rectangular case and LDA */
2288: PetscScalar *array;
2289: PetscReal chop=1.e-6;
2291: MatDuplicate(A,MAT_COPY_VALUES,&B);
2292: MatDenseGetArray(B,&array);
2293: MatGetSize(B,&n,NULL);
2294: for (i=0;i<n;i++) {
2295: PetscInt j;
2296: for (j=i+1;j<n;j++) {
2297: PetscReal thresh = chop*(PetscAbsScalar(array[i*(n+1)])+PetscAbsScalar(array[j*(n+1)]));
2298: if (PetscAbsScalar(array[i*n+j]) < thresh) array[i*n+j] = 0.;
2299: if (PetscAbsScalar(array[j*n+i]) < thresh) array[j*n+i] = 0.;
2300: }
2301: }
2302: MatDenseRestoreArray(B,&array);
2303: MatConvert(B,MATSEQAIJ,MAT_INPLACE_MATRIX,&B);
2304: }
2305: } else {
2306: PetscObjectReference((PetscObject)A);
2307: B = A;
2308: }
2309: MatGetRowIJ(B,0,PETSC_TRUE,PETSC_FALSE,&n,(const PetscInt**)&xadj,(const PetscInt**)&adjncy,&flg_row);
2311: /* if filter is true, then removes entries lower than PETSC_SMALL in magnitude */
2312: if (filter) {
2313: PetscScalar *data;
2314: PetscInt j,cum;
2316: PetscCalloc2(n+1,&xadj_filtered,xadj[n],&adjncy_filtered);
2317: MatSeqAIJGetArray(B,&data);
2318: cum = 0;
2319: for (i=0;i<n;i++) {
2320: PetscInt t;
2322: for (j=xadj[i];j<xadj[i+1];j++) {
2323: if (PetscUnlikely(PetscAbsScalar(data[j]) < PETSC_SMALL)) {
2324: continue;
2325: }
2326: adjncy_filtered[cum+xadj_filtered[i]++] = adjncy[j];
2327: }
2328: t = xadj_filtered[i];
2329: xadj_filtered[i] = cum;
2330: cum += t;
2331: }
2332: MatSeqAIJRestoreArray(B,&data);
2333: graph->xadj = xadj_filtered;
2334: graph->adjncy = adjncy_filtered;
2335: } else {
2336: graph->xadj = xadj;
2337: graph->adjncy = adjncy;
2338: }
2339: }
2340: /* compute local connected components using PCBDDCGraph */
2341: ISCreateStride(PETSC_COMM_SELF,n,0,1,&is_dummy);
2342: ISLocalToGlobalMappingCreateIS(is_dummy,&l2gmap_dummy);
2343: ISDestroy(&is_dummy);
2344: PCBDDCGraphInit(graph,l2gmap_dummy,n,PETSC_MAX_INT);
2345: ISLocalToGlobalMappingDestroy(&l2gmap_dummy);
2346: PCBDDCGraphSetUp(graph,1,NULL,NULL,0,NULL,NULL);
2347: PCBDDCGraphComputeConnectedComponents(graph);
2349: /* partial clean up */
2350: PetscFree2(xadj_filtered,adjncy_filtered);
2351: if (B) {
2352: PetscBool flg_row;
2353: MatRestoreRowIJ(B,0,PETSC_TRUE,PETSC_FALSE,&n,(const PetscInt**)&xadj,(const PetscInt**)&adjncy,&flg_row);
2354: MatDestroy(&B);
2355: }
2356: if (isplex) {
2357: PetscFree(xadj);
2358: PetscFree(adjncy);
2359: }
2361: /* get back data */
2362: if (isplex) {
2363: if (ncc) *ncc = graph->ncc;
2364: if (cc || primalv) {
2365: Mat A;
2366: PetscBT btv,btvt;
2367: PetscSection subSection;
2368: PetscInt *ids,cum,cump,*cids,*pids;
2370: DMPlexGetSubdomainSection(dm,&subSection);
2371: MatISGetLocalMat(pc->pmat,&A);
2372: PetscMalloc3(A->rmap->n,&ids,graph->ncc+1,&cids,A->rmap->n,&pids);
2373: PetscBTCreate(A->rmap->n,&btv);
2374: PetscBTCreate(A->rmap->n,&btvt);
2376: cids[0] = 0;
2377: for (i = 0, cump = 0, cum = 0; i < graph->ncc; i++) {
2378: PetscInt j;
2380: PetscBTMemzero(A->rmap->n,btvt);
2381: for (j = graph->cptr[i]; j < graph->cptr[i+1]; j++) {
2382: PetscInt k, size, *closure = NULL, cell = graph->queue[j];
2384: DMPlexGetTransitiveClosure(dm,cell,PETSC_TRUE,&size,&closure);
2385: for (k = 0; k < 2*size; k += 2) {
2386: PetscInt s, pp, p = closure[k], off, dof, cdof;
2388: PetscSectionGetConstraintDof(subSection,p,&cdof);
2389: PetscSectionGetOffset(subSection,p,&off);
2390: PetscSectionGetDof(subSection,p,&dof);
2391: for (s = 0; s < dof-cdof; s++) {
2392: if (PetscBTLookupSet(btvt,off+s)) continue;
2393: if (!PetscBTLookup(btv,off+s)) {
2394: ids[cum++] = off+s;
2395: } else { /* cross-vertex */
2396: pids[cump++] = off+s;
2397: }
2398: }
2399: DMPlexGetTreeParent(dm,p,&pp,NULL);
2400: if (pp != p) {
2401: PetscSectionGetConstraintDof(subSection,pp,&cdof);
2402: PetscSectionGetOffset(subSection,pp,&off);
2403: PetscSectionGetDof(subSection,pp,&dof);
2404: for (s = 0; s < dof-cdof; s++) {
2405: if (PetscBTLookupSet(btvt,off+s)) continue;
2406: if (!PetscBTLookup(btv,off+s)) {
2407: ids[cum++] = off+s;
2408: } else { /* cross-vertex */
2409: pids[cump++] = off+s;
2410: }
2411: }
2412: }
2413: }
2414: DMPlexRestoreTransitiveClosure(dm,cell,PETSC_TRUE,&size,&closure);
2415: }
2416: cids[i+1] = cum;
2417: /* mark dofs as already assigned */
2418: for (j = cids[i]; j < cids[i+1]; j++) {
2419: PetscBTSet(btv,ids[j]);
2420: }
2421: }
2422: if (cc) {
2423: PetscMalloc1(graph->ncc,&cc_n);
2424: for (i = 0; i < graph->ncc; i++) {
2425: ISCreateGeneral(PETSC_COMM_SELF,cids[i+1]-cids[i],ids+cids[i],PETSC_COPY_VALUES,&cc_n[i]);
2426: }
2427: *cc = cc_n;
2428: }
2429: if (primalv) {
2430: ISCreateGeneral(PetscObjectComm((PetscObject)pc),cump,pids,PETSC_COPY_VALUES,primalv);
2431: }
2432: PetscFree3(ids,cids,pids);
2433: PetscBTDestroy(&btv);
2434: PetscBTDestroy(&btvt);
2435: }
2436: } else {
2437: if (ncc) *ncc = graph->ncc;
2438: if (cc) {
2439: PetscMalloc1(graph->ncc,&cc_n);
2440: for (i=0;i<graph->ncc;i++) {
2441: ISCreateGeneral(PETSC_COMM_SELF,graph->cptr[i+1]-graph->cptr[i],graph->queue+graph->cptr[i],PETSC_COPY_VALUES,&cc_n[i]);
2442: }
2443: *cc = cc_n;
2444: }
2445: }
2446: /* clean up graph */
2447: graph->xadj = 0;
2448: graph->adjncy = 0;
2449: PCBDDCGraphDestroy(&graph);
2450: return(0);
2451: }
2453: PetscErrorCode PCBDDCBenignCheck(PC pc, IS zerodiag)
2454: {
2455: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
2456: PC_IS* pcis = (PC_IS*)(pc->data);
2457: IS dirIS = NULL;
2458: PetscInt i;
2462: PCBDDCGraphGetDirichletDofs(pcbddc->mat_graph,&dirIS);
2463: if (zerodiag) {
2464: Mat A;
2465: Vec vec3_N;
2466: PetscScalar *vals;
2467: const PetscInt *idxs;
2468: PetscInt nz,*count;
2470: /* p0 */
2471: VecSet(pcis->vec1_N,0.);
2472: PetscMalloc1(pcis->n,&vals);
2473: ISGetLocalSize(zerodiag,&nz);
2474: ISGetIndices(zerodiag,&idxs);
2475: for (i=0;i<nz;i++) vals[i] = 1.;
2476: VecSetValues(pcis->vec1_N,nz,idxs,vals,INSERT_VALUES);
2477: VecAssemblyBegin(pcis->vec1_N);
2478: VecAssemblyEnd(pcis->vec1_N);
2479: /* v_I */
2480: VecSetRandom(pcis->vec2_N,NULL);
2481: for (i=0;i<nz;i++) vals[i] = 0.;
2482: VecSetValues(pcis->vec2_N,nz,idxs,vals,INSERT_VALUES);
2483: ISRestoreIndices(zerodiag,&idxs);
2484: ISGetIndices(pcis->is_B_local,&idxs);
2485: for (i=0;i<pcis->n_B;i++) vals[i] = 0.;
2486: VecSetValues(pcis->vec2_N,pcis->n_B,idxs,vals,INSERT_VALUES);
2487: ISRestoreIndices(pcis->is_B_local,&idxs);
2488: if (dirIS) {
2489: PetscInt n;
2491: ISGetLocalSize(dirIS,&n);
2492: ISGetIndices(dirIS,&idxs);
2493: for (i=0;i<n;i++) vals[i] = 0.;
2494: VecSetValues(pcis->vec2_N,n,idxs,vals,INSERT_VALUES);
2495: ISRestoreIndices(dirIS,&idxs);
2496: }
2497: VecAssemblyBegin(pcis->vec2_N);
2498: VecAssemblyEnd(pcis->vec2_N);
2499: VecDuplicate(pcis->vec1_N,&vec3_N);
2500: VecSet(vec3_N,0.);
2501: MatISGetLocalMat(pc->pmat,&A);
2502: MatMult(A,pcis->vec1_N,vec3_N);
2503: VecDot(vec3_N,pcis->vec2_N,&vals[0]);
2504: if (PetscAbsScalar(vals[0]) > 1.e-1) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_SUP,"Benign trick can not be applied! b(v_I,p_0) = %1.6e (should be numerically 0.)",PetscAbsScalar(vals[0]));
2505: PetscFree(vals);
2506: VecDestroy(&vec3_N);
2508: /* there should not be any pressure dofs lying on the interface */
2509: PetscCalloc1(pcis->n,&count);
2510: ISGetIndices(pcis->is_B_local,&idxs);
2511: for (i=0;i<pcis->n_B;i++) count[idxs[i]]++;
2512: ISRestoreIndices(pcis->is_B_local,&idxs);
2513: ISGetIndices(zerodiag,&idxs);
2514: for (i=0;i<nz;i++) if (count[idxs[i]]) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_SUP,"Benign trick can not be applied! pressure dof %D is an interface dof",idxs[i]);
2515: ISRestoreIndices(zerodiag,&idxs);
2516: PetscFree(count);
2517: }
2518: ISDestroy(&dirIS);
2520: /* check PCBDDCBenignGetOrSetP0 */
2521: VecSetRandom(pcis->vec1_global,NULL);
2522: for (i=0;i<pcbddc->benign_n;i++) pcbddc->benign_p0[i] = -PetscGlobalRank-i;
2523: PCBDDCBenignGetOrSetP0(pc,pcis->vec1_global,PETSC_FALSE);
2524: for (i=0;i<pcbddc->benign_n;i++) pcbddc->benign_p0[i] = 1;
2525: PCBDDCBenignGetOrSetP0(pc,pcis->vec1_global,PETSC_TRUE);
2526: for (i=0;i<pcbddc->benign_n;i++) {
2527: PetscInt val = PetscRealPart(pcbddc->benign_p0[i]);
2528: if (val != -PetscGlobalRank-i) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error testing PCBDDCBenignGetOrSetP0! Found %g at %D instead of %g",PetscRealPart(pcbddc->benign_p0[i]),i,-PetscGlobalRank-i);
2529: }
2530: return(0);
2531: }
2533: PetscErrorCode PCBDDCBenignDetectSaddlePoint(PC pc, PetscBool reuse, IS *zerodiaglocal)
2534: {
2535: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
2536: IS pressures = NULL,zerodiag = NULL,*bzerodiag = NULL,zerodiag_save,*zerodiag_subs;
2537: PetscInt nz,n,benign_n,bsp = 1;
2538: PetscInt *interior_dofs,n_interior_dofs,nneu;
2539: PetscBool sorted,have_null,has_null_pressures,recompute_zerodiag,checkb;
2543: if (reuse) goto project_b0;
2544: PetscSFDestroy(&pcbddc->benign_sf);
2545: MatDestroy(&pcbddc->benign_B0);
2546: for (n=0;n<pcbddc->benign_n;n++) {
2547: ISDestroy(&pcbddc->benign_zerodiag_subs[n]);
2548: }
2549: PetscFree(pcbddc->benign_zerodiag_subs);
2550: has_null_pressures = PETSC_TRUE;
2551: have_null = PETSC_TRUE;
2552: /* if a local information on dofs is present, gets pressure dofs from command line (uses the last field is not provided)
2553: Without local information, it uses only the zerodiagonal dofs (ok if the pressure block is all zero and it is a scalar field)
2554: Checks if all the pressure dofs in each subdomain have a zero diagonal
2555: If not, a change of basis on pressures is not needed
2556: since the local Schur complements are already SPD
2557: */
2558: if (pcbddc->n_ISForDofsLocal) {
2559: IS iP = NULL;
2560: PetscInt p,*pp;
2561: PetscBool flg;
2563: PetscMalloc1(pcbddc->n_ISForDofsLocal,&pp);
2564: n = pcbddc->n_ISForDofsLocal;
2565: PetscOptionsBegin(PetscObjectComm((PetscObject)pc),((PetscObject)pc)->prefix,"BDDC benign options","PC");
2566: PetscOptionsIntArray("-pc_bddc_pressure_field","Field id for pressures",NULL,pp,&n,&flg);
2567: PetscOptionsEnd();
2568: if (!flg) {
2569: n = 1;
2570: pp[0] = pcbddc->n_ISForDofsLocal-1;
2571: }
2573: bsp = 0;
2574: for (p=0;p<n;p++) {
2575: PetscInt bs;
2577: if (pp[p] < 0 || pp[p] > pcbddc->n_ISForDofsLocal-1) SETERRQ1(PetscObjectComm((PetscObject)pc),PETSC_ERR_USER,"Invalid field id for pressures %D",pp[p]);
2578: ISGetBlockSize(pcbddc->ISForDofsLocal[pp[p]],&bs);
2579: bsp += bs;
2580: }
2581: PetscMalloc1(bsp,&bzerodiag);
2582: bsp = 0;
2583: for (p=0;p<n;p++) {
2584: const PetscInt *idxs;
2585: PetscInt b,bs,npl,*bidxs;
2587: ISGetBlockSize(pcbddc->ISForDofsLocal[pp[p]],&bs);
2588: ISGetLocalSize(pcbddc->ISForDofsLocal[pp[p]],&npl);
2589: ISGetIndices(pcbddc->ISForDofsLocal[pp[p]],&idxs);
2590: PetscMalloc1(npl/bs,&bidxs);
2591: for (b=0;b<bs;b++) {
2592: PetscInt i;
2594: for (i=0;i<npl/bs;i++) bidxs[i] = idxs[bs*i+b];
2595: ISCreateGeneral(PETSC_COMM_SELF,npl/bs,bidxs,PETSC_COPY_VALUES,&bzerodiag[bsp]);
2596: bsp++;
2597: }
2598: PetscFree(bidxs);
2599: ISRestoreIndices(pcbddc->ISForDofsLocal[pp[p]],&idxs);
2600: }
2601: ISConcatenate(PETSC_COMM_SELF,bsp,bzerodiag,&pressures);
2603: /* remove zeroed out pressures if we are setting up a BDDC solver for a saddle-point FETI-DP */
2604: PetscObjectQuery((PetscObject)pc,"__KSPFETIDP_lP",(PetscObject*)&iP);
2605: if (iP) {
2606: IS newpressures;
2608: ISDifference(pressures,iP,&newpressures);
2609: ISDestroy(&pressures);
2610: pressures = newpressures;
2611: }
2612: ISSorted(pressures,&sorted);
2613: if (!sorted) {
2614: ISSort(pressures);
2615: }
2616: PetscFree(pp);
2617: }
2619: /* pcis has not been setup yet, so get the local size from the subdomain matrix */
2620: MatGetLocalSize(pcbddc->local_mat,&n,NULL);
2621: if (!n) pcbddc->benign_change_explicit = PETSC_TRUE;
2622: MatFindZeroDiagonals(pcbddc->local_mat,&zerodiag);
2623: ISSorted(zerodiag,&sorted);
2624: if (!sorted) {
2625: ISSort(zerodiag);
2626: }
2627: PetscObjectReference((PetscObject)zerodiag);
2628: zerodiag_save = zerodiag;
2629: ISGetLocalSize(zerodiag,&nz);
2630: if (!nz) {
2631: if (n) have_null = PETSC_FALSE;
2632: has_null_pressures = PETSC_FALSE;
2633: ISDestroy(&zerodiag);
2634: }
2635: recompute_zerodiag = PETSC_FALSE;
2637: /* in case disconnected subdomains info is present, split the pressures accordingly (otherwise the benign trick could fail) */
2638: zerodiag_subs = NULL;
2639: benign_n = 0;
2640: n_interior_dofs = 0;
2641: interior_dofs = NULL;
2642: nneu = 0;
2643: if (pcbddc->NeumannBoundariesLocal) {
2644: ISGetLocalSize(pcbddc->NeumannBoundariesLocal,&nneu);
2645: }
2646: checkb = (PetscBool)(!pcbddc->NeumannBoundariesLocal || pcbddc->current_level);
2647: if (checkb) { /* need to compute interior nodes */
2648: PetscInt n,i,j;
2649: PetscInt n_neigh,*neigh,*n_shared,**shared;
2650: PetscInt *iwork;
2652: ISLocalToGlobalMappingGetSize(pc->pmat->rmap->mapping,&n);
2653: ISLocalToGlobalMappingGetInfo(pc->pmat->rmap->mapping,&n_neigh,&neigh,&n_shared,&shared);
2654: PetscCalloc1(n,&iwork);
2655: PetscMalloc1(n,&interior_dofs);
2656: for (i=1;i<n_neigh;i++)
2657: for (j=0;j<n_shared[i];j++)
2658: iwork[shared[i][j]] += 1;
2659: for (i=0;i<n;i++)
2660: if (!iwork[i])
2661: interior_dofs[n_interior_dofs++] = i;
2662: PetscFree(iwork);
2663: ISLocalToGlobalMappingRestoreInfo(pc->pmat->rmap->mapping,&n_neigh,&neigh,&n_shared,&shared);
2664: }
2665: if (has_null_pressures) {
2666: IS *subs;
2667: PetscInt nsubs,i,j,nl;
2668: const PetscInt *idxs;
2669: PetscScalar *array;
2670: Vec *work;
2671: Mat_IS* matis = (Mat_IS*)(pc->pmat->data);
2673: subs = pcbddc->local_subs;
2674: nsubs = pcbddc->n_local_subs;
2675: /* these vectors are needed to check if the constant on pressures is in the kernel of the local operator B (i.e. B(v_I,p0) should be zero) */
2676: if (checkb) {
2677: VecDuplicateVecs(matis->y,2,&work);
2678: ISGetLocalSize(zerodiag,&nl);
2679: ISGetIndices(zerodiag,&idxs);
2680: /* work[0] = 1_p */
2681: VecSet(work[0],0.);
2682: VecGetArray(work[0],&array);
2683: for (j=0;j<nl;j++) array[idxs[j]] = 1.;
2684: VecRestoreArray(work[0],&array);
2685: /* work[0] = 1_v */
2686: VecSet(work[1],1.);
2687: VecGetArray(work[1],&array);
2688: for (j=0;j<nl;j++) array[idxs[j]] = 0.;
2689: VecRestoreArray(work[1],&array);
2690: ISRestoreIndices(zerodiag,&idxs);
2691: }
2693: if (nsubs > 1 || bsp > 1) {
2694: IS *is;
2695: PetscInt b,totb;
2697: totb = bsp;
2698: is = bsp > 1 ? bzerodiag : &zerodiag;
2699: nsubs = PetscMax(nsubs,1);
2700: PetscCalloc1(nsubs*totb,&zerodiag_subs);
2701: for (b=0;b<totb;b++) {
2702: for (i=0;i<nsubs;i++) {
2703: ISLocalToGlobalMapping l2g;
2704: IS t_zerodiag_subs;
2705: PetscInt nl;
2707: if (subs) {
2708: ISLocalToGlobalMappingCreateIS(subs[i],&l2g);
2709: } else {
2710: IS tis;
2712: MatGetLocalSize(pcbddc->local_mat,&nl,NULL);
2713: ISCreateStride(PETSC_COMM_SELF,nl,0,1,&tis);
2714: ISLocalToGlobalMappingCreateIS(tis,&l2g);
2715: ISDestroy(&tis);
2716: }
2717: ISGlobalToLocalMappingApplyIS(l2g,IS_GTOLM_DROP,is[b],&t_zerodiag_subs);
2718: ISGetLocalSize(t_zerodiag_subs,&nl);
2719: if (nl) {
2720: PetscBool valid = PETSC_TRUE;
2722: if (checkb) {
2723: VecSet(matis->x,0);
2724: ISGetLocalSize(subs[i],&nl);
2725: ISGetIndices(subs[i],&idxs);
2726: VecGetArray(matis->x,&array);
2727: for (j=0;j<nl;j++) array[idxs[j]] = 1.;
2728: VecRestoreArray(matis->x,&array);
2729: ISRestoreIndices(subs[i],&idxs);
2730: VecPointwiseMult(matis->x,work[0],matis->x);
2731: MatMult(matis->A,matis->x,matis->y);
2732: VecPointwiseMult(matis->y,work[1],matis->y);
2733: VecGetArray(matis->y,&array);
2734: for (j=0;j<n_interior_dofs;j++) {
2735: if (PetscAbsScalar(array[interior_dofs[j]]) > PETSC_SMALL) {
2736: valid = PETSC_FALSE;
2737: break;
2738: }
2739: }
2740: VecRestoreArray(matis->y,&array);
2741: }
2742: if (valid && nneu) {
2743: const PetscInt *idxs;
2744: PetscInt nzb;
2746: ISGetIndices(pcbddc->NeumannBoundariesLocal,&idxs);
2747: ISGlobalToLocalMappingApply(l2g,IS_GTOLM_DROP,nneu,idxs,&nzb,NULL);
2748: ISRestoreIndices(pcbddc->NeumannBoundariesLocal,&idxs);
2749: if (nzb) valid = PETSC_FALSE;
2750: }
2751: if (valid && pressures) {
2752: IS t_pressure_subs,tmp;
2753: PetscInt i1,i2;
2755: ISGlobalToLocalMappingApplyIS(l2g,IS_GTOLM_DROP,pressures,&t_pressure_subs);
2756: ISEmbed(t_zerodiag_subs,t_pressure_subs,PETSC_TRUE,&tmp);
2757: ISGetLocalSize(tmp,&i1);
2758: ISGetLocalSize(t_zerodiag_subs,&i2);
2759: if (i2 != i1) valid = PETSC_FALSE;
2760: ISDestroy(&t_pressure_subs);
2761: ISDestroy(&tmp);
2762: }
2763: if (valid) {
2764: ISLocalToGlobalMappingApplyIS(l2g,t_zerodiag_subs,&zerodiag_subs[benign_n]);
2765: benign_n++;
2766: } else recompute_zerodiag = PETSC_TRUE;
2767: }
2768: ISDestroy(&t_zerodiag_subs);
2769: ISLocalToGlobalMappingDestroy(&l2g);
2770: }
2771: }
2772: } else { /* there's just one subdomain (or zero if they have not been detected */
2773: PetscBool valid = PETSC_TRUE;
2775: if (nneu) valid = PETSC_FALSE;
2776: if (valid && pressures) {
2777: ISEqual(pressures,zerodiag,&valid);
2778: }
2779: if (valid && checkb) {
2780: MatMult(matis->A,work[0],matis->x);
2781: VecPointwiseMult(matis->x,work[1],matis->x);
2782: VecGetArray(matis->x,&array);
2783: for (j=0;j<n_interior_dofs;j++) {
2784: if (PetscAbsScalar(array[interior_dofs[j]]) > PETSC_SMALL) {
2785: valid = PETSC_FALSE;
2786: break;
2787: }
2788: }
2789: VecRestoreArray(matis->x,&array);
2790: }
2791: if (valid) {
2792: benign_n = 1;
2793: PetscMalloc1(benign_n,&zerodiag_subs);
2794: PetscObjectReference((PetscObject)zerodiag);
2795: zerodiag_subs[0] = zerodiag;
2796: }
2797: }
2798: if (checkb) {
2799: VecDestroyVecs(2,&work);
2800: }
2801: }
2802: PetscFree(interior_dofs);
2804: if (!benign_n) {
2805: PetscInt n;
2807: ISDestroy(&zerodiag);
2808: recompute_zerodiag = PETSC_FALSE;
2809: MatGetLocalSize(pcbddc->local_mat,&n,NULL);
2810: if (n) have_null = PETSC_FALSE;
2811: }
2813: /* final check for null pressures */
2814: if (zerodiag && pressures) {
2815: ISEqual(pressures,zerodiag,&have_null);
2816: }
2818: if (recompute_zerodiag) {
2819: ISDestroy(&zerodiag);
2820: if (benign_n == 1) {
2821: PetscObjectReference((PetscObject)zerodiag_subs[0]);
2822: zerodiag = zerodiag_subs[0];
2823: } else {
2824: PetscInt i,nzn,*new_idxs;
2826: nzn = 0;
2827: for (i=0;i<benign_n;i++) {
2828: PetscInt ns;
2829: ISGetLocalSize(zerodiag_subs[i],&ns);
2830: nzn += ns;
2831: }
2832: PetscMalloc1(nzn,&new_idxs);
2833: nzn = 0;
2834: for (i=0;i<benign_n;i++) {
2835: PetscInt ns,*idxs;
2836: ISGetLocalSize(zerodiag_subs[i],&ns);
2837: ISGetIndices(zerodiag_subs[i],(const PetscInt**)&idxs);
2838: PetscArraycpy(new_idxs+nzn,idxs,ns);
2839: ISRestoreIndices(zerodiag_subs[i],(const PetscInt**)&idxs);
2840: nzn += ns;
2841: }
2842: PetscSortInt(nzn,new_idxs);
2843: ISCreateGeneral(PETSC_COMM_SELF,nzn,new_idxs,PETSC_OWN_POINTER,&zerodiag);
2844: }
2845: have_null = PETSC_FALSE;
2846: }
2848: /* determines if the coarse solver will be singular or not */
2849: MPIU_Allreduce(&have_null,&pcbddc->benign_null,1,MPIU_BOOL,MPI_LAND,PetscObjectComm((PetscObject)pc));
2851: /* Prepare matrix to compute no-net-flux */
2852: if (pcbddc->compute_nonetflux && !pcbddc->divudotp) {
2853: Mat A,loc_divudotp;
2854: ISLocalToGlobalMapping rl2g,cl2g,l2gmap;
2855: IS row,col,isused = NULL;
2856: PetscInt M,N,n,st,n_isused;
2858: if (pressures) {
2859: isused = pressures;
2860: } else {
2861: isused = zerodiag_save;
2862: }
2863: MatGetLocalToGlobalMapping(pc->pmat,&l2gmap,NULL);
2864: MatISGetLocalMat(pc->pmat,&A);
2865: MatGetLocalSize(A,&n,NULL);
2866: if (!isused && n) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_USER,"Don't know how to extract div u dot p! Please provide the pressure field");
2867: n_isused = 0;
2868: if (isused) {
2869: ISGetLocalSize(isused,&n_isused);
2870: }
2871: MPI_Scan(&n_isused,&st,1,MPIU_INT,MPI_SUM,PetscObjectComm((PetscObject)pc));
2872: st = st-n_isused;
2873: if (n) {
2874: const PetscInt *gidxs;
2876: MatCreateSubMatrix(A,isused,NULL,MAT_INITIAL_MATRIX,&loc_divudotp);
2877: ISLocalToGlobalMappingGetIndices(l2gmap,&gidxs);
2878: /* TODO: extend ISCreateStride with st = PETSC_DECIDE */
2879: ISCreateStride(PetscObjectComm((PetscObject)pc),n_isused,st,1,&row);
2880: ISCreateGeneral(PetscObjectComm((PetscObject)pc),n,gidxs,PETSC_COPY_VALUES,&col);
2881: ISLocalToGlobalMappingRestoreIndices(l2gmap,&gidxs);
2882: } else {
2883: MatCreateSeqAIJ(PETSC_COMM_SELF,0,0,1,NULL,&loc_divudotp);
2884: ISCreateStride(PetscObjectComm((PetscObject)pc),n_isused,st,1,&row);
2885: ISCreateGeneral(PetscObjectComm((PetscObject)pc),0,NULL,PETSC_COPY_VALUES,&col);
2886: }
2887: MatGetSize(pc->pmat,NULL,&N);
2888: ISGetSize(row,&M);
2889: ISLocalToGlobalMappingCreateIS(row,&rl2g);
2890: ISLocalToGlobalMappingCreateIS(col,&cl2g);
2891: ISDestroy(&row);
2892: ISDestroy(&col);
2893: MatCreate(PetscObjectComm((PetscObject)pc),&pcbddc->divudotp);
2894: MatSetType(pcbddc->divudotp,MATIS);
2895: MatSetSizes(pcbddc->divudotp,PETSC_DECIDE,PETSC_DECIDE,M,N);
2896: MatSetLocalToGlobalMapping(pcbddc->divudotp,rl2g,cl2g);
2897: ISLocalToGlobalMappingDestroy(&rl2g);
2898: ISLocalToGlobalMappingDestroy(&cl2g);
2899: MatISSetLocalMat(pcbddc->divudotp,loc_divudotp);
2900: MatDestroy(&loc_divudotp);
2901: MatAssemblyBegin(pcbddc->divudotp,MAT_FINAL_ASSEMBLY);
2902: MatAssemblyEnd(pcbddc->divudotp,MAT_FINAL_ASSEMBLY);
2903: }
2904: ISDestroy(&zerodiag_save);
2905: ISDestroy(&pressures);
2906: if (bzerodiag) {
2907: PetscInt i;
2909: for (i=0;i<bsp;i++) {
2910: ISDestroy(&bzerodiag[i]);
2911: }
2912: PetscFree(bzerodiag);
2913: }
2914: pcbddc->benign_n = benign_n;
2915: pcbddc->benign_zerodiag_subs = zerodiag_subs;
2917: /* determines if the problem has subdomains with 0 pressure block */
2918: have_null = (PetscBool)(!!pcbddc->benign_n);
2919: MPIU_Allreduce(&have_null,&pcbddc->benign_have_null,1,MPIU_BOOL,MPI_LOR,PetscObjectComm((PetscObject)pc));
2921: project_b0:
2922: MatGetLocalSize(pcbddc->local_mat,&n,NULL);
2923: /* change of basis and p0 dofs */
2924: if (pcbddc->benign_n) {
2925: PetscInt i,s,*nnz;
2927: /* local change of basis for pressures */
2928: MatDestroy(&pcbddc->benign_change);
2929: MatCreate(PetscObjectComm((PetscObject)pcbddc->local_mat),&pcbddc->benign_change);
2930: MatSetType(pcbddc->benign_change,MATAIJ);
2931: MatSetSizes(pcbddc->benign_change,n,n,PETSC_DECIDE,PETSC_DECIDE);
2932: PetscMalloc1(n,&nnz);
2933: for (i=0;i<n;i++) nnz[i] = 1; /* defaults to identity */
2934: for (i=0;i<pcbddc->benign_n;i++) {
2935: const PetscInt *idxs;
2936: PetscInt nzs,j;
2938: ISGetLocalSize(pcbddc->benign_zerodiag_subs[i],&nzs);
2939: ISGetIndices(pcbddc->benign_zerodiag_subs[i],&idxs);
2940: for (j=0;j<nzs-1;j++) nnz[idxs[j]] = 2; /* change on pressures */
2941: nnz[idxs[nzs-1]] = nzs; /* last local pressure dof in subdomain */
2942: ISRestoreIndices(pcbddc->benign_zerodiag_subs[i],&idxs);
2943: }
2944: MatSeqAIJSetPreallocation(pcbddc->benign_change,0,nnz);
2945: MatSetOption(pcbddc->benign_change,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_TRUE);
2946: PetscFree(nnz);
2947: /* set identity by default */
2948: for (i=0;i<n;i++) {
2949: MatSetValue(pcbddc->benign_change,i,i,1.,INSERT_VALUES);
2950: }
2951: PetscFree3(pcbddc->benign_p0_lidx,pcbddc->benign_p0_gidx,pcbddc->benign_p0);
2952: PetscMalloc3(pcbddc->benign_n,&pcbddc->benign_p0_lidx,pcbddc->benign_n,&pcbddc->benign_p0_gidx,pcbddc->benign_n,&pcbddc->benign_p0);
2953: /* set change on pressures */
2954: for (s=0;s<pcbddc->benign_n;s++) {
2955: PetscScalar *array;
2956: const PetscInt *idxs;
2957: PetscInt nzs;
2959: ISGetLocalSize(pcbddc->benign_zerodiag_subs[s],&nzs);
2960: ISGetIndices(pcbddc->benign_zerodiag_subs[s],&idxs);
2961: for (i=0;i<nzs-1;i++) {
2962: PetscScalar vals[2];
2963: PetscInt cols[2];
2965: cols[0] = idxs[i];
2966: cols[1] = idxs[nzs-1];
2967: vals[0] = 1.;
2968: vals[1] = 1.;
2969: MatSetValues(pcbddc->benign_change,1,cols,2,cols,vals,INSERT_VALUES);
2970: }
2971: PetscMalloc1(nzs,&array);
2972: for (i=0;i<nzs-1;i++) array[i] = -1.;
2973: array[nzs-1] = 1.;
2974: MatSetValues(pcbddc->benign_change,1,idxs+nzs-1,nzs,idxs,array,INSERT_VALUES);
2975: /* store local idxs for p0 */
2976: pcbddc->benign_p0_lidx[s] = idxs[nzs-1];
2977: ISRestoreIndices(pcbddc->benign_zerodiag_subs[s],&idxs);
2978: PetscFree(array);
2979: }
2980: MatAssemblyBegin(pcbddc->benign_change,MAT_FINAL_ASSEMBLY);
2981: MatAssemblyEnd(pcbddc->benign_change,MAT_FINAL_ASSEMBLY);
2983: /* project if needed */
2984: if (pcbddc->benign_change_explicit) {
2985: Mat M;
2987: MatPtAP(pcbddc->local_mat,pcbddc->benign_change,MAT_INITIAL_MATRIX,2.0,&M);
2988: MatDestroy(&pcbddc->local_mat);
2989: MatSeqAIJCompress(M,&pcbddc->local_mat);
2990: MatDestroy(&M);
2991: }
2992: /* store global idxs for p0 */
2993: ISLocalToGlobalMappingApply(pc->pmat->rmap->mapping,pcbddc->benign_n,pcbddc->benign_p0_lidx,pcbddc->benign_p0_gidx);
2994: }
2995: *zerodiaglocal = zerodiag;
2996: return(0);
2997: }
2999: PetscErrorCode PCBDDCBenignGetOrSetP0(PC pc, Vec v, PetscBool get)
3000: {
3001: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
3002: PetscScalar *array;
3006: if (!pcbddc->benign_sf) {
3007: PetscSFCreate(PetscObjectComm((PetscObject)pc),&pcbddc->benign_sf);
3008: PetscSFSetGraphLayout(pcbddc->benign_sf,pc->pmat->rmap,pcbddc->benign_n,NULL,PETSC_OWN_POINTER,pcbddc->benign_p0_gidx);
3009: }
3010: if (get) {
3011: VecGetArrayRead(v,(const PetscScalar**)&array);
3012: PetscSFBcastBegin(pcbddc->benign_sf,MPIU_SCALAR,array,pcbddc->benign_p0);
3013: PetscSFBcastEnd(pcbddc->benign_sf,MPIU_SCALAR,array,pcbddc->benign_p0);
3014: VecRestoreArrayRead(v,(const PetscScalar**)&array);
3015: } else {
3016: VecGetArray(v,&array);
3017: PetscSFReduceBegin(pcbddc->benign_sf,MPIU_SCALAR,pcbddc->benign_p0,array,MPIU_REPLACE);
3018: PetscSFReduceEnd(pcbddc->benign_sf,MPIU_SCALAR,pcbddc->benign_p0,array,MPIU_REPLACE);
3019: VecRestoreArray(v,&array);
3020: }
3021: return(0);
3022: }
3024: PetscErrorCode PCBDDCBenignPopOrPushB0(PC pc, PetscBool pop)
3025: {
3026: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
3030: /* TODO: add error checking
3031: - avoid nested pop (or push) calls.
3032: - cannot push before pop.
3033: - cannot call this if pcbddc->local_mat is NULL
3034: */
3035: if (!pcbddc->benign_n) {
3036: return(0);
3037: }
3038: if (pop) {
3039: if (pcbddc->benign_change_explicit) {
3040: IS is_p0;
3041: MatReuse reuse;
3043: /* extract B_0 */
3044: reuse = MAT_INITIAL_MATRIX;
3045: if (pcbddc->benign_B0) {
3046: reuse = MAT_REUSE_MATRIX;
3047: }
3048: ISCreateGeneral(PETSC_COMM_SELF,pcbddc->benign_n,pcbddc->benign_p0_lidx,PETSC_COPY_VALUES,&is_p0);
3049: MatCreateSubMatrix(pcbddc->local_mat,is_p0,NULL,reuse,&pcbddc->benign_B0);
3050: /* remove rows and cols from local problem */
3051: MatSetOption(pcbddc->local_mat,MAT_KEEP_NONZERO_PATTERN,PETSC_TRUE);
3052: MatSetOption(pcbddc->local_mat,MAT_NEW_NONZERO_LOCATION_ERR,PETSC_FALSE);
3053: MatZeroRowsColumnsIS(pcbddc->local_mat,is_p0,1.0,NULL,NULL);
3054: ISDestroy(&is_p0);
3055: } else {
3056: Mat_IS *matis = (Mat_IS*)pc->pmat->data;
3057: PetscScalar *vals;
3058: PetscInt i,n,*idxs_ins;
3060: VecGetLocalSize(matis->y,&n);
3061: PetscMalloc2(n,&idxs_ins,n,&vals);
3062: if (!pcbddc->benign_B0) {
3063: PetscInt *nnz;
3064: MatCreate(PetscObjectComm((PetscObject)pcbddc->local_mat),&pcbddc->benign_B0);
3065: MatSetType(pcbddc->benign_B0,MATAIJ);
3066: MatSetSizes(pcbddc->benign_B0,pcbddc->benign_n,n,PETSC_DECIDE,PETSC_DECIDE);
3067: PetscMalloc1(pcbddc->benign_n,&nnz);
3068: for (i=0;i<pcbddc->benign_n;i++) {
3069: ISGetLocalSize(pcbddc->benign_zerodiag_subs[i],&nnz[i]);
3070: nnz[i] = n - nnz[i];
3071: }
3072: MatSeqAIJSetPreallocation(pcbddc->benign_B0,0,nnz);
3073: MatSetOption(pcbddc->benign_B0,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_TRUE);
3074: PetscFree(nnz);
3075: }
3077: for (i=0;i<pcbddc->benign_n;i++) {
3078: PetscScalar *array;
3079: PetscInt *idxs,j,nz,cum;
3081: VecSet(matis->x,0.);
3082: ISGetLocalSize(pcbddc->benign_zerodiag_subs[i],&nz);
3083: ISGetIndices(pcbddc->benign_zerodiag_subs[i],(const PetscInt**)&idxs);
3084: for (j=0;j<nz;j++) vals[j] = 1.;
3085: VecSetValues(matis->x,nz,idxs,vals,INSERT_VALUES);
3086: VecAssemblyBegin(matis->x);
3087: VecAssemblyEnd(matis->x);
3088: VecSet(matis->y,0.);
3089: MatMult(matis->A,matis->x,matis->y);
3090: VecGetArray(matis->y,&array);
3091: cum = 0;
3092: for (j=0;j<n;j++) {
3093: if (PetscUnlikely(PetscAbsScalar(array[j]) > PETSC_SMALL)) {
3094: vals[cum] = array[j];
3095: idxs_ins[cum] = j;
3096: cum++;
3097: }
3098: }
3099: MatSetValues(pcbddc->benign_B0,1,&i,cum,idxs_ins,vals,INSERT_VALUES);
3100: VecRestoreArray(matis->y,&array);
3101: ISRestoreIndices(pcbddc->benign_zerodiag_subs[i],(const PetscInt**)&idxs);
3102: }
3103: MatAssemblyBegin(pcbddc->benign_B0,MAT_FINAL_ASSEMBLY);
3104: MatAssemblyEnd(pcbddc->benign_B0,MAT_FINAL_ASSEMBLY);
3105: PetscFree2(idxs_ins,vals);
3106: }
3107: } else { /* push */
3108: if (pcbddc->benign_change_explicit) {
3109: PetscInt i;
3111: for (i=0;i<pcbddc->benign_n;i++) {
3112: PetscScalar *B0_vals;
3113: PetscInt *B0_cols,B0_ncol;
3115: MatGetRow(pcbddc->benign_B0,i,&B0_ncol,(const PetscInt**)&B0_cols,(const PetscScalar**)&B0_vals);
3116: MatSetValues(pcbddc->local_mat,1,pcbddc->benign_p0_lidx+i,B0_ncol,B0_cols,B0_vals,INSERT_VALUES);
3117: MatSetValues(pcbddc->local_mat,B0_ncol,B0_cols,1,pcbddc->benign_p0_lidx+i,B0_vals,INSERT_VALUES);
3118: MatSetValue(pcbddc->local_mat,pcbddc->benign_p0_lidx[i],pcbddc->benign_p0_lidx[i],0.0,INSERT_VALUES);
3119: MatRestoreRow(pcbddc->benign_B0,i,&B0_ncol,(const PetscInt**)&B0_cols,(const PetscScalar**)&B0_vals);
3120: }
3121: MatAssemblyBegin(pcbddc->local_mat,MAT_FINAL_ASSEMBLY);
3122: MatAssemblyEnd(pcbddc->local_mat,MAT_FINAL_ASSEMBLY);
3123: } else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cannot push B0!");
3124: }
3125: return(0);
3126: }
3128: PetscErrorCode PCBDDCAdaptiveSelection(PC pc)
3129: {
3130: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
3131: PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs;
3132: PetscBLASInt B_dummyint,B_neigs,B_ierr,B_lwork;
3133: PetscBLASInt *B_iwork,*B_ifail;
3134: PetscScalar *work,lwork;
3135: PetscScalar *St,*S,*eigv;
3136: PetscScalar *Sarray,*Starray;
3137: PetscReal *eigs,thresh,lthresh,uthresh;
3138: PetscInt i,nmax,nmin,nv,cum,mss,cum2,cumarray,maxneigs;
3139: PetscBool allocated_S_St;
3140: #if defined(PETSC_USE_COMPLEX)
3141: PetscReal *rwork;
3142: #endif
3143: PetscErrorCode ierr;
3146: if (!sub_schurs) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Adaptive selection of constraints requires SubSchurs data");
3147: if (!sub_schurs->schur_explicit) SETERRQ(PetscObjectComm((PetscObject)pc),PETSC_ERR_SUP,"Adaptive selection of constraints requires MUMPS and/or MKL_CPARDISO");
3148: if (sub_schurs->n_subs && (!sub_schurs->is_symmetric)) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_SUP,"Adaptive selection not yet implemented for this matrix pencil (herm %d, symm %d, posdef %d)",sub_schurs->is_hermitian,sub_schurs->is_symmetric,sub_schurs->is_posdef);
3149: PetscLogEventBegin(PC_BDDC_AdaptiveSetUp[pcbddc->current_level],pc,0,0,0);
3151: if (pcbddc->dbg_flag) {
3152: PetscViewerFlush(pcbddc->dbg_viewer);
3153: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"--------------------------------------------------\n");
3154: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Check adaptive selection of constraints\n");
3155: PetscViewerASCIIPushSynchronized(pcbddc->dbg_viewer);
3156: }
3158: if (pcbddc->dbg_flag) {
3159: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d cc %D (%d,%d).\n",PetscGlobalRank,sub_schurs->n_subs,sub_schurs->is_hermitian,sub_schurs->is_posdef);
3160: }
3162: /* max size of subsets */
3163: mss = 0;
3164: for (i=0;i<sub_schurs->n_subs;i++) {
3165: PetscInt subset_size;
3167: ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);
3168: mss = PetscMax(mss,subset_size);
3169: }
3171: /* min/max and threshold */
3172: nmax = pcbddc->adaptive_nmax > 0 ? pcbddc->adaptive_nmax : mss;
3173: nmin = pcbddc->adaptive_nmin > 0 ? pcbddc->adaptive_nmin : 0;
3174: nmax = PetscMax(nmin,nmax);
3175: allocated_S_St = PETSC_FALSE;
3176: if (nmin || !sub_schurs->is_posdef) { /* XXX */
3177: allocated_S_St = PETSC_TRUE;
3178: }
3180: /* allocate lapack workspace */
3181: cum = cum2 = 0;
3182: maxneigs = 0;
3183: for (i=0;i<sub_schurs->n_subs;i++) {
3184: PetscInt n,subset_size;
3186: ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);
3187: n = PetscMin(subset_size,nmax);
3188: cum += subset_size;
3189: cum2 += subset_size*n;
3190: maxneigs = PetscMax(maxneigs,n);
3191: }
3192: lwork = 0;
3193: if (mss) {
3194: if (sub_schurs->is_symmetric) {
3195: PetscScalar sdummy = 0.;
3196: PetscBLASInt B_itype = 1;
3197: PetscBLASInt B_N = mss, idummy = 0;
3198: PetscReal rdummy = 0.,zero = 0.0;
3199: PetscReal eps = 0.0; /* dlamch? */
3201: B_lwork = -1;
3202: /* some implementations may complain about NULL pointers, even if we are querying */
3203: S = &sdummy;
3204: St = &sdummy;
3205: eigs = &rdummy;
3206: eigv = &sdummy;
3207: B_iwork = &idummy;
3208: B_ifail = &idummy;
3209: #if defined(PETSC_USE_COMPLEX)
3210: rwork = &rdummy;
3211: #endif
3212: thresh = 1.0;
3213: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
3214: #if defined(PETSC_USE_COMPLEX)
3215: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&zero,&thresh,&B_dummyint,&B_dummyint,&eps,&B_neigs,eigs,eigv,&B_N,&lwork,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3216: #else
3217: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&zero,&thresh,&B_dummyint,&B_dummyint,&eps,&B_neigs,eigs,eigv,&B_N,&lwork,&B_lwork,B_iwork,B_ifail,&B_ierr));
3218: #endif
3219: if (B_ierr != 0) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in query to SYGVX Lapack routine %d",(int)B_ierr);
3220: PetscFPTrapPop();
3221: } else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not yet implemented");
3222: }
3224: nv = 0;
3225: if (sub_schurs->is_vertices && pcbddc->use_vertices) { /* complement set of active subsets, each entry is a vertex (boundary made by active subsets, vertices and dirichlet dofs) */
3226: ISGetLocalSize(sub_schurs->is_vertices,&nv);
3227: }
3228: PetscBLASIntCast((PetscInt)PetscRealPart(lwork),&B_lwork);
3229: if (allocated_S_St) {
3230: PetscMalloc2(mss*mss,&S,mss*mss,&St);
3231: }
3232: PetscMalloc5(mss*mss,&eigv,mss,&eigs,B_lwork,&work,5*mss,&B_iwork,mss,&B_ifail);
3233: #if defined(PETSC_USE_COMPLEX)
3234: PetscMalloc1(7*mss,&rwork);
3235: #endif
3236: PetscMalloc5(nv+sub_schurs->n_subs,&pcbddc->adaptive_constraints_n,
3237: nv+sub_schurs->n_subs+1,&pcbddc->adaptive_constraints_idxs_ptr,
3238: nv+sub_schurs->n_subs+1,&pcbddc->adaptive_constraints_data_ptr,
3239: nv+cum,&pcbddc->adaptive_constraints_idxs,
3240: nv+cum2,&pcbddc->adaptive_constraints_data);
3241: PetscArrayzero(pcbddc->adaptive_constraints_n,nv+sub_schurs->n_subs);
3243: maxneigs = 0;
3244: cum = cumarray = 0;
3245: pcbddc->adaptive_constraints_idxs_ptr[0] = 0;
3246: pcbddc->adaptive_constraints_data_ptr[0] = 0;
3247: if (sub_schurs->is_vertices && pcbddc->use_vertices) {
3248: const PetscInt *idxs;
3250: ISGetIndices(sub_schurs->is_vertices,&idxs);
3251: for (cum=0;cum<nv;cum++) {
3252: pcbddc->adaptive_constraints_n[cum] = 1;
3253: pcbddc->adaptive_constraints_idxs[cum] = idxs[cum];
3254: pcbddc->adaptive_constraints_data[cum] = 1.0;
3255: pcbddc->adaptive_constraints_idxs_ptr[cum+1] = pcbddc->adaptive_constraints_idxs_ptr[cum]+1;
3256: pcbddc->adaptive_constraints_data_ptr[cum+1] = pcbddc->adaptive_constraints_data_ptr[cum]+1;
3257: }
3258: ISRestoreIndices(sub_schurs->is_vertices,&idxs);
3259: }
3261: if (mss) { /* multilevel */
3262: MatSeqAIJGetArray(sub_schurs->sum_S_Ej_inv_all,&Sarray);
3263: MatSeqAIJGetArray(sub_schurs->sum_S_Ej_tilda_all,&Starray);
3264: }
3266: lthresh = pcbddc->adaptive_threshold[0];
3267: uthresh = pcbddc->adaptive_threshold[1];
3268: for (i=0;i<sub_schurs->n_subs;i++) {
3269: const PetscInt *idxs;
3270: PetscReal upper,lower;
3271: PetscInt j,subset_size,eigs_start = 0;
3272: PetscBLASInt B_N;
3273: PetscBool same_data = PETSC_FALSE;
3274: PetscBool scal = PETSC_FALSE;
3276: if (pcbddc->use_deluxe_scaling) {
3277: upper = PETSC_MAX_REAL;
3278: lower = uthresh;
3279: } else {
3280: if (!sub_schurs->is_posdef) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not yet implemented without deluxe scaling");
3281: upper = 1./uthresh;
3282: lower = 0.;
3283: }
3284: ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);
3285: ISGetIndices(sub_schurs->is_subs[i],&idxs);
3286: PetscBLASIntCast(subset_size,&B_N);
3287: /* this is experimental: we assume the dofs have been properly grouped to have
3288: the diagonal blocks Schur complements either positive or negative definite (true for Stokes) */
3289: if (!sub_schurs->is_posdef) {
3290: Mat T;
3292: for (j=0;j<subset_size;j++) {
3293: if (PetscRealPart(*(Sarray+cumarray+j*(subset_size+1))) < 0.0) {
3294: MatCreateSeqDense(PETSC_COMM_SELF,subset_size,subset_size,Sarray+cumarray,&T);
3295: MatScale(T,-1.0);
3296: MatDestroy(&T);
3297: MatCreateSeqDense(PETSC_COMM_SELF,subset_size,subset_size,Starray+cumarray,&T);
3298: MatScale(T,-1.0);
3299: MatDestroy(&T);
3300: if (sub_schurs->change_primal_sub) {
3301: PetscInt nz,k;
3302: const PetscInt *idxs;
3304: ISGetLocalSize(sub_schurs->change_primal_sub[i],&nz);
3305: ISGetIndices(sub_schurs->change_primal_sub[i],&idxs);
3306: for (k=0;k<nz;k++) {
3307: *( Sarray + cumarray + idxs[k]*(subset_size+1)) *= -1.0;
3308: *(Starray + cumarray + idxs[k]*(subset_size+1)) = 0.0;
3309: }
3310: ISRestoreIndices(sub_schurs->change_primal_sub[i],&idxs);
3311: }
3312: scal = PETSC_TRUE;
3313: break;
3314: }
3315: }
3316: }
3318: if (allocated_S_St) { /* S and S_t should be copied since we could need them later */
3319: if (sub_schurs->is_symmetric) {
3320: PetscInt j,k;
3321: if (sub_schurs->n_subs == 1) { /* zeroing memory to use PetscArraycmp() later */
3322: PetscArrayzero(S,subset_size*subset_size);
3323: PetscArrayzero(St,subset_size*subset_size);
3324: }
3325: for (j=0;j<subset_size;j++) {
3326: for (k=j;k<subset_size;k++) {
3327: S [j*subset_size+k] = Sarray [cumarray+j*subset_size+k];
3328: St[j*subset_size+k] = Starray[cumarray+j*subset_size+k];
3329: }
3330: }
3331: } else {
3332: PetscArraycpy(S,Sarray+cumarray,subset_size*subset_size);
3333: PetscArraycpy(St,Starray+cumarray,subset_size*subset_size);
3334: }
3335: } else {
3336: S = Sarray + cumarray;
3337: St = Starray + cumarray;
3338: }
3339: /* see if we can save some work */
3340: if (sub_schurs->n_subs == 1 && pcbddc->use_deluxe_scaling) {
3341: PetscArraycmp(S,St,subset_size*subset_size,&same_data);
3342: }
3344: if (same_data && !sub_schurs->change) { /* there's no need of constraints here */
3345: B_neigs = 0;
3346: } else {
3347: if (sub_schurs->is_symmetric) {
3348: PetscBLASInt B_itype = 1;
3349: PetscBLASInt B_IL, B_IU;
3350: PetscReal eps = -1.0; /* dlamch? */
3351: PetscInt nmin_s;
3352: PetscBool compute_range;
3354: B_neigs = 0;
3355: compute_range = (PetscBool)!same_data;
3356: if (nmin >= subset_size) compute_range = PETSC_FALSE;
3358: if (pcbddc->dbg_flag) {
3359: PetscInt nc = 0;
3361: if (sub_schurs->change_primal_sub) {
3362: ISGetLocalSize(sub_schurs->change_primal_sub[i],&nc);
3363: }
3364: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Computing for sub %D/%D size %D count %D fid %D (range %d) (change %D).\n",i,sub_schurs->n_subs,subset_size,pcbddc->mat_graph->count[idxs[0]]+1,pcbddc->mat_graph->which_dof[idxs[0]],compute_range,nc);
3365: }
3367: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
3368: if (compute_range) {
3370: /* ask for eigenvalues larger than thresh */
3371: if (sub_schurs->is_posdef) {
3372: #if defined(PETSC_USE_COMPLEX)
3373: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&lower,&upper,&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3374: #else
3375: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&lower,&upper,&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3376: #endif
3377: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3378: } else { /* no theory so far, but it works nicely */
3379: PetscInt recipe = 0,recipe_m = 1;
3380: PetscReal bb[2];
3382: PetscOptionsGetInt(NULL,((PetscObject)pc)->prefix,"-pc_bddc_adaptive_recipe",&recipe,NULL);
3383: switch (recipe) {
3384: case 0:
3385: if (scal) { bb[0] = PETSC_MIN_REAL; bb[1] = lthresh; }
3386: else { bb[0] = uthresh; bb[1] = PETSC_MAX_REAL; }
3387: #if defined(PETSC_USE_COMPLEX)
3388: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3389: #else
3390: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3391: #endif
3392: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3393: break;
3394: case 1:
3395: bb[0] = PETSC_MIN_REAL; bb[1] = lthresh*lthresh;
3396: #if defined(PETSC_USE_COMPLEX)
3397: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3398: #else
3399: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3400: #endif
3401: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3402: if (!scal) {
3403: PetscBLASInt B_neigs2 = 0;
3405: bb[0] = PetscMax(lthresh*lthresh,uthresh); bb[1] = PETSC_MAX_REAL;
3406: PetscArraycpy(S,Sarray+cumarray,subset_size*subset_size);
3407: PetscArraycpy(St,Starray+cumarray,subset_size*subset_size);
3408: #if defined(PETSC_USE_COMPLEX)
3409: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*B_N,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3410: #else
3411: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*B_N,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3412: #endif
3413: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3414: B_neigs += B_neigs2;
3415: }
3416: break;
3417: case 2:
3418: if (scal) {
3419: bb[0] = PETSC_MIN_REAL;
3420: bb[1] = 0;
3421: #if defined(PETSC_USE_COMPLEX)
3422: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3423: #else
3424: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3425: #endif
3426: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3427: } else {
3428: PetscBLASInt B_neigs2 = 0;
3429: PetscBool import = PETSC_FALSE;
3431: lthresh = PetscMax(lthresh,0.0);
3432: if (lthresh > 0.0) {
3433: bb[0] = PETSC_MIN_REAL;
3434: bb[1] = lthresh*lthresh;
3436: import = PETSC_TRUE;
3437: #if defined(PETSC_USE_COMPLEX)
3438: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3439: #else
3440: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3441: #endif
3442: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3443: }
3444: bb[0] = PetscMax(lthresh*lthresh,uthresh);
3445: bb[1] = PETSC_MAX_REAL;
3446: if (import) {
3447: PetscArraycpy(S,Sarray+cumarray,subset_size*subset_size);
3448: PetscArraycpy(St,Starray+cumarray,subset_size*subset_size);
3449: }
3450: #if defined(PETSC_USE_COMPLEX)
3451: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*B_N,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3452: #else
3453: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*B_N,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3454: #endif
3455: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3456: B_neigs += B_neigs2;
3457: }
3458: break;
3459: case 3:
3460: if (scal) {
3461: PetscOptionsGetInt(NULL,((PetscObject)pc)->prefix,"-pc_bddc_adaptive_recipe3_min_scal",&recipe_m,NULL);
3462: } else {
3463: PetscOptionsGetInt(NULL,((PetscObject)pc)->prefix,"-pc_bddc_adaptive_recipe3_min",&recipe_m,NULL);
3464: }
3465: if (!scal) {
3466: bb[0] = uthresh;
3467: bb[1] = PETSC_MAX_REAL;
3468: #if defined(PETSC_USE_COMPLEX)
3469: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3470: #else
3471: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3472: #endif
3473: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3474: }
3475: if (recipe_m > 0 && B_N - B_neigs > 0) {
3476: PetscBLASInt B_neigs2 = 0;
3478: B_IL = 1;
3479: PetscBLASIntCast(PetscMin(recipe_m,B_N - B_neigs),&B_IU);
3480: PetscArraycpy(S,Sarray+cumarray,subset_size*subset_size);
3481: PetscArraycpy(St,Starray+cumarray,subset_size*subset_size);
3482: #if defined(PETSC_USE_COMPLEX)
3483: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","I","L",&B_N,St,&B_N,S,&B_N,&lower,&upper,&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*B_N,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3484: #else
3485: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","I","L",&B_N,St,&B_N,S,&B_N,&lower,&upper,&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*B_N,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3486: #endif
3487: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3488: B_neigs += B_neigs2;
3489: }
3490: break;
3491: case 4:
3492: bb[0] = PETSC_MIN_REAL; bb[1] = lthresh;
3493: #if defined(PETSC_USE_COMPLEX)
3494: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3495: #else
3496: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3497: #endif
3498: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3499: {
3500: PetscBLASInt B_neigs2 = 0;
3502: bb[0] = PetscMax(lthresh+PETSC_SMALL,uthresh); bb[1] = PETSC_MAX_REAL;
3503: PetscArraycpy(S,Sarray+cumarray,subset_size*subset_size);
3504: PetscArraycpy(St,Starray+cumarray,subset_size*subset_size);
3505: #if defined(PETSC_USE_COMPLEX)
3506: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*B_N,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3507: #else
3508: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","V","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*B_N,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3509: #endif
3510: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3511: B_neigs += B_neigs2;
3512: }
3513: break;
3514: case 5: /* same as before: first compute all eigenvalues, then filter */
3515: #if defined(PETSC_USE_COMPLEX)
3516: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","A","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3517: #else
3518: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","A","L",&B_N,St,&B_N,S,&B_N,&bb[0],&bb[1],&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3519: #endif
3520: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3521: {
3522: PetscInt e,k,ne;
3523: for (e=0,ne=0;e<B_neigs;e++) {
3524: if (eigs[e] < lthresh || eigs[e] > uthresh) {
3525: for (k=0;k<B_N;k++) S[ne*B_N+k] = eigv[e*B_N+k];
3526: eigs[ne] = eigs[e];
3527: ne++;
3528: }
3529: }
3530: PetscArraycpy(eigv,S,B_N*ne);
3531: B_neigs = ne;
3532: }
3533: break;
3534: default:
3535: SETERRQ1(PetscObjectComm((PetscObject)pc),PETSC_ERR_SUP,"Unknown recipe %D",recipe);
3536: break;
3537: }
3538: }
3539: } else if (!same_data) { /* this is just to see all the eigenvalues */
3540: B_IU = PetscMax(1,PetscMin(B_N,nmax));
3541: B_IL = 1;
3542: #if defined(PETSC_USE_COMPLEX)
3543: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","I","L",&B_N,St,&B_N,S,&B_N,&lower,&upper,&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3544: #else
3545: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","I","L",&B_N,St,&B_N,S,&B_N,&lower,&upper,&B_IL,&B_IU,&eps,&B_neigs,eigs,eigv,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3546: #endif
3547: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3548: } else { /* same_data is true, so just get the adaptive functional requested by the user */
3549: PetscInt k;
3550: if (!sub_schurs->change_primal_sub) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"This should not happen");
3551: ISGetLocalSize(sub_schurs->change_primal_sub[i],&nmax);
3552: PetscBLASIntCast(nmax,&B_neigs);
3553: nmin = nmax;
3554: PetscArrayzero(eigv,subset_size*nmax);
3555: for (k=0;k<nmax;k++) {
3556: eigs[k] = 1./PETSC_SMALL;
3557: eigv[k*(subset_size+1)] = 1.0;
3558: }
3559: }
3560: PetscFPTrapPop();
3561: if (B_ierr) {
3562: if (B_ierr < 0 ) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in SYGVX Lapack routine: illegal value for argument %d",-(int)B_ierr);
3563: else if (B_ierr <= B_N) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in SYGVX Lapack routine: %d eigenvalues failed to converge",(int)B_ierr);
3564: else SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in SYGVX Lapack routine: leading minor of order %d is not positive definite",(int)B_ierr-B_N-1);
3565: }
3567: if (B_neigs > nmax) {
3568: if (pcbddc->dbg_flag) {
3569: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," found %d eigs, more than maximum required %D.\n",B_neigs,nmax);
3570: }
3571: if (pcbddc->use_deluxe_scaling) eigs_start = scal ? 0 : B_neigs-nmax;
3572: B_neigs = nmax;
3573: }
3575: nmin_s = PetscMin(nmin,B_N);
3576: if (B_neigs < nmin_s) {
3577: PetscBLASInt B_neigs2 = 0;
3579: if (pcbddc->use_deluxe_scaling) {
3580: if (scal) {
3581: B_IU = nmin_s;
3582: B_IL = B_neigs + 1;
3583: } else {
3584: B_IL = B_N - nmin_s + 1;
3585: B_IU = B_N - B_neigs;
3586: }
3587: } else {
3588: B_IL = B_neigs + 1;
3589: B_IU = nmin_s;
3590: }
3591: if (pcbddc->dbg_flag) {
3592: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," found %d eigs, less than minimum required %D. Asking for %d to %d incl (fortran like)\n",B_neigs,nmin,B_IL,B_IU);
3593: }
3594: if (sub_schurs->is_symmetric) {
3595: PetscInt j,k;
3596: for (j=0;j<subset_size;j++) {
3597: for (k=j;k<subset_size;k++) {
3598: S [j*subset_size+k] = Sarray [cumarray+j*subset_size+k];
3599: St[j*subset_size+k] = Starray[cumarray+j*subset_size+k];
3600: }
3601: }
3602: } else {
3603: PetscArraycpy(S,Sarray+cumarray,subset_size*subset_size);
3604: PetscArraycpy(St,Starray+cumarray,subset_size*subset_size);
3605: }
3606: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
3607: #if defined(PETSC_USE_COMPLEX)
3608: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","I","L",&B_N,St,&B_N,S,&B_N,&lower,&upper,&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*subset_size,&B_N,work,&B_lwork,rwork,B_iwork,B_ifail,&B_ierr));
3609: #else
3610: PetscStackCallBLAS("LAPACKsygvx",LAPACKsygvx_(&B_itype,"V","I","L",&B_N,St,&B_N,S,&B_N,&lower,&upper,&B_IL,&B_IU,&eps,&B_neigs2,eigs+B_neigs,eigv+B_neigs*subset_size,&B_N,work,&B_lwork,B_iwork,B_ifail,&B_ierr));
3611: #endif
3612: PetscLogFlops((4.0*subset_size*subset_size*subset_size)/3.0);
3613: PetscFPTrapPop();
3614: B_neigs += B_neigs2;
3615: }
3616: if (B_ierr) {
3617: if (B_ierr < 0 ) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in SYGVX Lapack routine: illegal value for argument %d",-(int)B_ierr);
3618: else if (B_ierr <= B_N) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in SYGVX Lapack routine: %d eigenvalues failed to converge",(int)B_ierr);
3619: else SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in SYGVX Lapack routine: leading minor of order %d is not positive definite",(int)B_ierr-B_N-1);
3620: }
3621: if (pcbddc->dbg_flag) {
3622: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," -> Got %d eigs\n",B_neigs);
3623: for (j=0;j<B_neigs;j++) {
3624: if (eigs[j] == 0.0) {
3625: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," Inf\n");
3626: } else {
3627: if (pcbddc->use_deluxe_scaling) {
3628: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," %1.6e\n",eigs[j+eigs_start]);
3629: } else {
3630: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," %1.6e\n",1./eigs[j+eigs_start]);
3631: }
3632: }
3633: }
3634: }
3635: } else SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not yet implemented");
3636: }
3637: /* change the basis back to the original one */
3638: if (sub_schurs->change) {
3639: Mat change,phi,phit;
3641: if (pcbddc->dbg_flag > 2) {
3642: PetscInt ii;
3643: for (ii=0;ii<B_neigs;ii++) {
3644: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," -> Eigenvector (old basis) %d/%d (%d)\n",ii,B_neigs,B_N);
3645: for (j=0;j<B_N;j++) {
3646: #if defined(PETSC_USE_COMPLEX)
3647: PetscReal r = PetscRealPart(eigv[(ii+eigs_start)*subset_size+j]);
3648: PetscReal c = PetscImaginaryPart(eigv[(ii+eigs_start)*subset_size+j]);
3649: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," %1.4e + %1.4e i\n",r,c);
3650: #else
3651: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," %1.4e\n",eigv[(ii+eigs_start)*subset_size+j]);
3652: #endif
3653: }
3654: }
3655: }
3656: KSPGetOperators(sub_schurs->change[i],&change,NULL);
3657: MatCreateSeqDense(PETSC_COMM_SELF,subset_size,B_neigs,eigv+eigs_start*subset_size,&phit);
3658: MatMatMult(change,phit,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&phi);
3659: MatCopy(phi,phit,SAME_NONZERO_PATTERN);
3660: MatDestroy(&phit);
3661: MatDestroy(&phi);
3662: }
3663: maxneigs = PetscMax(B_neigs,maxneigs);
3664: pcbddc->adaptive_constraints_n[i+nv] = B_neigs;
3665: if (B_neigs) {
3666: PetscArraycpy(pcbddc->adaptive_constraints_data+pcbddc->adaptive_constraints_data_ptr[cum],eigv+eigs_start*subset_size,B_neigs*subset_size);
3668: if (pcbddc->dbg_flag > 1) {
3669: PetscInt ii;
3670: for (ii=0;ii<B_neigs;ii++) {
3671: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," -> Eigenvector %d/%d (%d)\n",ii,B_neigs,B_N);
3672: for (j=0;j<B_N;j++) {
3673: #if defined(PETSC_USE_COMPLEX)
3674: PetscReal r = PetscRealPart(pcbddc->adaptive_constraints_data[ii*subset_size+j+pcbddc->adaptive_constraints_data_ptr[cum]]);
3675: PetscReal c = PetscImaginaryPart(pcbddc->adaptive_constraints_data[ii*subset_size+j+pcbddc->adaptive_constraints_data_ptr[cum]]);
3676: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," %1.4e + %1.4e i\n",r,c);
3677: #else
3678: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," %1.4e\n",pcbddc->adaptive_constraints_data[ii*subset_size+j+pcbddc->adaptive_constraints_data_ptr[cum]]);
3679: #endif
3680: }
3681: }
3682: }
3683: PetscArraycpy(pcbddc->adaptive_constraints_idxs+pcbddc->adaptive_constraints_idxs_ptr[cum],idxs,subset_size);
3684: pcbddc->adaptive_constraints_idxs_ptr[cum+1] = pcbddc->adaptive_constraints_idxs_ptr[cum] + subset_size;
3685: pcbddc->adaptive_constraints_data_ptr[cum+1] = pcbddc->adaptive_constraints_data_ptr[cum] + subset_size*B_neigs;
3686: cum++;
3687: }
3688: ISRestoreIndices(sub_schurs->is_subs[i],&idxs);
3689: /* shift for next computation */
3690: cumarray += subset_size*subset_size;
3691: }
3692: if (pcbddc->dbg_flag) {
3693: PetscViewerFlush(pcbddc->dbg_viewer);
3694: }
3696: if (mss) {
3697: MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_inv_all,&Sarray);
3698: MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_tilda_all,&Starray);
3699: /* destroy matrices (junk) */
3700: MatDestroy(&sub_schurs->sum_S_Ej_inv_all);
3701: MatDestroy(&sub_schurs->sum_S_Ej_tilda_all);
3702: }
3703: if (allocated_S_St) {
3704: PetscFree2(S,St);
3705: }
3706: PetscFree5(eigv,eigs,work,B_iwork,B_ifail);
3707: #if defined(PETSC_USE_COMPLEX)
3708: PetscFree(rwork);
3709: #endif
3710: if (pcbddc->dbg_flag) {
3711: PetscInt maxneigs_r;
3712: MPIU_Allreduce(&maxneigs,&maxneigs_r,1,MPIU_INT,MPI_MAX,PetscObjectComm((PetscObject)pc));
3713: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Maximum number of constraints per cc %D\n",maxneigs_r);
3714: }
3715: PetscLogEventEnd(PC_BDDC_AdaptiveSetUp[pcbddc->current_level],pc,0,0,0);
3716: return(0);
3717: }
3719: PetscErrorCode PCBDDCSetUpSolvers(PC pc)
3720: {
3721: PetscScalar *coarse_submat_vals;
3725: /* Setup local scatters R_to_B and (optionally) R_to_D */
3726: /* PCBDDCSetUpLocalWorkVectors should be called first! */
3727: PCBDDCSetUpLocalScatters(pc);
3729: /* Setup local neumann solver ksp_R */
3730: /* PCBDDCSetUpLocalScatters should be called first! */
3731: PCBDDCSetUpLocalSolvers(pc,PETSC_FALSE,PETSC_TRUE);
3733: /*
3734: Setup local correction and local part of coarse basis.
3735: Gives back the dense local part of the coarse matrix in column major ordering
3736: */
3737: PCBDDCSetUpCorrection(pc,&coarse_submat_vals);
3739: /* Compute total number of coarse nodes and setup coarse solver */
3740: PCBDDCSetUpCoarseSolver(pc,coarse_submat_vals);
3742: /* free */
3743: PetscFree(coarse_submat_vals);
3744: return(0);
3745: }
3747: PetscErrorCode PCBDDCResetCustomization(PC pc)
3748: {
3749: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
3753: ISDestroy(&pcbddc->user_primal_vertices);
3754: ISDestroy(&pcbddc->user_primal_vertices_local);
3755: ISDestroy(&pcbddc->NeumannBoundaries);
3756: ISDestroy(&pcbddc->NeumannBoundariesLocal);
3757: ISDestroy(&pcbddc->DirichletBoundaries);
3758: MatNullSpaceDestroy(&pcbddc->onearnullspace);
3759: PetscFree(pcbddc->onearnullvecs_state);
3760: ISDestroy(&pcbddc->DirichletBoundariesLocal);
3761: PCBDDCSetDofsSplitting(pc,0,NULL);
3762: PCBDDCSetDofsSplittingLocal(pc,0,NULL);
3763: return(0);
3764: }
3766: PetscErrorCode PCBDDCResetTopography(PC pc)
3767: {
3768: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
3769: PetscInt i;
3773: MatDestroy(&pcbddc->nedcG);
3774: ISDestroy(&pcbddc->nedclocal);
3775: MatDestroy(&pcbddc->discretegradient);
3776: MatDestroy(&pcbddc->user_ChangeOfBasisMatrix);
3777: MatDestroy(&pcbddc->ChangeOfBasisMatrix);
3778: MatDestroy(&pcbddc->switch_static_change);
3779: VecDestroy(&pcbddc->work_change);
3780: MatDestroy(&pcbddc->ConstraintMatrix);
3781: MatDestroy(&pcbddc->divudotp);
3782: ISDestroy(&pcbddc->divudotp_vl2l);
3783: PCBDDCGraphDestroy(&pcbddc->mat_graph);
3784: for (i=0;i<pcbddc->n_local_subs;i++) {
3785: ISDestroy(&pcbddc->local_subs[i]);
3786: }
3787: pcbddc->n_local_subs = 0;
3788: PetscFree(pcbddc->local_subs);
3789: PCBDDCSubSchursDestroy(&pcbddc->sub_schurs);
3790: pcbddc->graphanalyzed = PETSC_FALSE;
3791: pcbddc->recompute_topography = PETSC_TRUE;
3792: pcbddc->corner_selected = PETSC_FALSE;
3793: return(0);
3794: }
3796: PetscErrorCode PCBDDCResetSolvers(PC pc)
3797: {
3798: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
3802: VecDestroy(&pcbddc->coarse_vec);
3803: if (pcbddc->coarse_phi_B) {
3804: PetscScalar *array;
3805: MatDenseGetArray(pcbddc->coarse_phi_B,&array);
3806: PetscFree(array);
3807: }
3808: MatDestroy(&pcbddc->coarse_phi_B);
3809: MatDestroy(&pcbddc->coarse_phi_D);
3810: MatDestroy(&pcbddc->coarse_psi_B);
3811: MatDestroy(&pcbddc->coarse_psi_D);
3812: VecDestroy(&pcbddc->vec1_P);
3813: VecDestroy(&pcbddc->vec1_C);
3814: MatDestroy(&pcbddc->local_auxmat2);
3815: MatDestroy(&pcbddc->local_auxmat1);
3816: VecDestroy(&pcbddc->vec1_R);
3817: VecDestroy(&pcbddc->vec2_R);
3818: ISDestroy(&pcbddc->is_R_local);
3819: VecScatterDestroy(&pcbddc->R_to_B);
3820: VecScatterDestroy(&pcbddc->R_to_D);
3821: VecScatterDestroy(&pcbddc->coarse_loc_to_glob);
3822: KSPReset(pcbddc->ksp_D);
3823: KSPReset(pcbddc->ksp_R);
3824: KSPReset(pcbddc->coarse_ksp);
3825: MatDestroy(&pcbddc->local_mat);
3826: PetscFree(pcbddc->primal_indices_local_idxs);
3827: PetscFree2(pcbddc->local_primal_ref_node,pcbddc->local_primal_ref_mult);
3828: PetscFree(pcbddc->global_primal_indices);
3829: ISDestroy(&pcbddc->coarse_subassembling);
3830: MatDestroy(&pcbddc->benign_change);
3831: VecDestroy(&pcbddc->benign_vec);
3832: PCBDDCBenignShellMat(pc,PETSC_TRUE);
3833: MatDestroy(&pcbddc->benign_B0);
3834: PetscSFDestroy(&pcbddc->benign_sf);
3835: if (pcbddc->benign_zerodiag_subs) {
3836: PetscInt i;
3837: for (i=0;i<pcbddc->benign_n;i++) {
3838: ISDestroy(&pcbddc->benign_zerodiag_subs[i]);
3839: }
3840: PetscFree(pcbddc->benign_zerodiag_subs);
3841: }
3842: PetscFree3(pcbddc->benign_p0_lidx,pcbddc->benign_p0_gidx,pcbddc->benign_p0);
3843: return(0);
3844: }
3846: PetscErrorCode PCBDDCSetUpLocalWorkVectors(PC pc)
3847: {
3848: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
3849: PC_IS *pcis = (PC_IS*)pc->data;
3850: VecType impVecType;
3851: PetscInt n_constraints,n_R,old_size;
3855: n_constraints = pcbddc->local_primal_size - pcbddc->benign_n - pcbddc->n_vertices;
3856: n_R = pcis->n - pcbddc->n_vertices;
3857: VecGetType(pcis->vec1_N,&impVecType);
3858: /* local work vectors (try to avoid unneeded work)*/
3859: /* R nodes */
3860: old_size = -1;
3861: if (pcbddc->vec1_R) {
3862: VecGetSize(pcbddc->vec1_R,&old_size);
3863: }
3864: if (n_R != old_size) {
3865: VecDestroy(&pcbddc->vec1_R);
3866: VecDestroy(&pcbddc->vec2_R);
3867: VecCreate(PetscObjectComm((PetscObject)pcis->vec1_N),&pcbddc->vec1_R);
3868: VecSetSizes(pcbddc->vec1_R,PETSC_DECIDE,n_R);
3869: VecSetType(pcbddc->vec1_R,impVecType);
3870: VecDuplicate(pcbddc->vec1_R,&pcbddc->vec2_R);
3871: }
3872: /* local primal dofs */
3873: old_size = -1;
3874: if (pcbddc->vec1_P) {
3875: VecGetSize(pcbddc->vec1_P,&old_size);
3876: }
3877: if (pcbddc->local_primal_size != old_size) {
3878: VecDestroy(&pcbddc->vec1_P);
3879: VecCreate(PetscObjectComm((PetscObject)pcis->vec1_N),&pcbddc->vec1_P);
3880: VecSetSizes(pcbddc->vec1_P,PETSC_DECIDE,pcbddc->local_primal_size);
3881: VecSetType(pcbddc->vec1_P,impVecType);
3882: }
3883: /* local explicit constraints */
3884: old_size = -1;
3885: if (pcbddc->vec1_C) {
3886: VecGetSize(pcbddc->vec1_C,&old_size);
3887: }
3888: if (n_constraints && n_constraints != old_size) {
3889: VecDestroy(&pcbddc->vec1_C);
3890: VecCreate(PetscObjectComm((PetscObject)pcis->vec1_N),&pcbddc->vec1_C);
3891: VecSetSizes(pcbddc->vec1_C,PETSC_DECIDE,n_constraints);
3892: VecSetType(pcbddc->vec1_C,impVecType);
3893: }
3894: return(0);
3895: }
3897: PetscErrorCode PCBDDCSetUpCorrection(PC pc, PetscScalar **coarse_submat_vals_n)
3898: {
3899: PetscErrorCode ierr;
3900: /* pointers to pcis and pcbddc */
3901: PC_IS* pcis = (PC_IS*)pc->data;
3902: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
3903: PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs;
3904: /* submatrices of local problem */
3905: Mat A_RV,A_VR,A_VV,local_auxmat2_R;
3906: /* submatrices of local coarse problem */
3907: Mat S_VV,S_CV,S_VC,S_CC;
3908: /* working matrices */
3909: Mat C_CR;
3910: /* additional working stuff */
3911: PC pc_R;
3912: Mat F,Brhs = NULL;
3913: Vec dummy_vec;
3914: PetscBool isLU,isCHOL,need_benign_correction,sparserhs;
3915: PetscScalar *coarse_submat_vals; /* TODO: use a PETSc matrix */
3916: PetscScalar *work;
3917: PetscInt *idx_V_B;
3918: PetscInt lda_rhs,n,n_vertices,n_constraints,*p0_lidx_I;
3919: PetscInt i,n_R,n_D,n_B;
3920: PetscScalar one=1.0,m_one=-1.0;
3923: if (!pcbddc->symmetric_primal && pcbddc->benign_n) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Non-symmetric primal basis computation with benign trick not yet implemented");
3924: PetscLogEventBegin(PC_BDDC_CorrectionSetUp[pcbddc->current_level],pc,0,0,0);
3926: /* Set Non-overlapping dimensions */
3927: n_vertices = pcbddc->n_vertices;
3928: n_constraints = pcbddc->local_primal_size - pcbddc->benign_n - n_vertices;
3929: n_B = pcis->n_B;
3930: n_D = pcis->n - n_B;
3931: n_R = pcis->n - n_vertices;
3933: /* vertices in boundary numbering */
3934: PetscMalloc1(n_vertices,&idx_V_B);
3935: ISGlobalToLocalMappingApply(pcis->BtoNmap,IS_GTOLM_DROP,n_vertices,pcbddc->local_primal_ref_node,&i,idx_V_B);
3936: if (i != n_vertices) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in boundary numbering for BDDC vertices! %D != %D",n_vertices,i);
3938: /* Subdomain contribution (Non-overlapping) to coarse matrix */
3939: PetscCalloc1(pcbddc->local_primal_size*pcbddc->local_primal_size,&coarse_submat_vals);
3940: MatCreateSeqDense(PETSC_COMM_SELF,n_vertices,n_vertices,coarse_submat_vals,&S_VV);
3941: MatSeqDenseSetLDA(S_VV,pcbddc->local_primal_size);
3942: MatCreateSeqDense(PETSC_COMM_SELF,n_constraints,n_vertices,coarse_submat_vals+n_vertices,&S_CV);
3943: MatSeqDenseSetLDA(S_CV,pcbddc->local_primal_size);
3944: MatCreateSeqDense(PETSC_COMM_SELF,n_vertices,n_constraints,coarse_submat_vals+pcbddc->local_primal_size*n_vertices,&S_VC);
3945: MatSeqDenseSetLDA(S_VC,pcbddc->local_primal_size);
3946: MatCreateSeqDense(PETSC_COMM_SELF,n_constraints,n_constraints,coarse_submat_vals+(pcbddc->local_primal_size+1)*n_vertices,&S_CC);
3947: MatSeqDenseSetLDA(S_CC,pcbddc->local_primal_size);
3949: /* determine if can use MatSolve routines instead of calling KSPSolve on ksp_R */
3950: KSPGetPC(pcbddc->ksp_R,&pc_R);
3951: PCSetUp(pc_R);
3952: PetscObjectTypeCompare((PetscObject)pc_R,PCLU,&isLU);
3953: PetscObjectTypeCompare((PetscObject)pc_R,PCCHOLESKY,&isCHOL);
3954: lda_rhs = n_R;
3955: need_benign_correction = PETSC_FALSE;
3956: if (isLU || isCHOL) {
3957: PCFactorGetMatrix(pc_R,&F);
3958: } else if (sub_schurs && sub_schurs->reuse_solver) {
3959: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
3960: MatFactorType type;
3962: F = reuse_solver->F;
3963: MatGetFactorType(F,&type);
3964: if (type == MAT_FACTOR_CHOLESKY) isCHOL = PETSC_TRUE;
3965: if (type == MAT_FACTOR_LU) isLU = PETSC_TRUE;
3966: MatGetSize(F,&lda_rhs,NULL);
3967: need_benign_correction = (PetscBool)(!!reuse_solver->benign_n);
3968: } else F = NULL;
3970: /* determine if we can use a sparse right-hand side */
3971: sparserhs = PETSC_FALSE;
3972: if (F) {
3973: MatSolverType solver;
3975: MatFactorGetSolverType(F,&solver);
3976: PetscStrcmp(solver,MATSOLVERMUMPS,&sparserhs);
3977: }
3979: /* allocate workspace */
3980: n = 0;
3981: if (n_constraints) {
3982: n += lda_rhs*n_constraints;
3983: }
3984: if (n_vertices) {
3985: n = PetscMax(2*lda_rhs*n_vertices,n);
3986: n = PetscMax((lda_rhs+n_B)*n_vertices,n);
3987: }
3988: if (!pcbddc->symmetric_primal) {
3989: n = PetscMax(2*lda_rhs*pcbddc->local_primal_size,n);
3990: }
3991: PetscMalloc1(n,&work);
3993: /* create dummy vector to modify rhs and sol of MatMatSolve (work array will never be used) */
3994: dummy_vec = NULL;
3995: if (need_benign_correction && lda_rhs != n_R && F) {
3996: VecCreate(PetscObjectComm((PetscObject)pcis->vec1_N),&dummy_vec);
3997: VecSetSizes(dummy_vec,lda_rhs,PETSC_DECIDE);
3998: VecSetType(dummy_vec,((PetscObject)pcis->vec1_N)->type_name);
3999: }
4001: MatDestroy(&pcbddc->local_auxmat1);
4002: MatDestroy(&pcbddc->local_auxmat2);
4004: /* Precompute stuffs needed for preprocessing and application of BDDC*/
4005: if (n_constraints) {
4006: Mat M3,C_B;
4007: IS is_aux;
4008: PetscScalar *array,*array2;
4010: /* Extract constraints on R nodes: C_{CR} */
4011: ISCreateStride(PETSC_COMM_SELF,n_constraints,n_vertices,1,&is_aux);
4012: MatCreateSubMatrix(pcbddc->ConstraintMatrix,is_aux,pcbddc->is_R_local,MAT_INITIAL_MATRIX,&C_CR);
4013: MatCreateSubMatrix(pcbddc->ConstraintMatrix,is_aux,pcis->is_B_local,MAT_INITIAL_MATRIX,&C_B);
4015: /* Assemble local_auxmat2_R = (- A_{RR}^{-1} C^T_{CR}) needed by BDDC setup */
4016: /* Assemble pcbddc->local_auxmat2 = R_to_B (- A_{RR}^{-1} C^T_{CR}) needed by BDDC application */
4017: if (!sparserhs) {
4018: PetscArrayzero(work,lda_rhs*n_constraints);
4019: for (i=0;i<n_constraints;i++) {
4020: const PetscScalar *row_cmat_values;
4021: const PetscInt *row_cmat_indices;
4022: PetscInt size_of_constraint,j;
4024: MatGetRow(C_CR,i,&size_of_constraint,&row_cmat_indices,&row_cmat_values);
4025: for (j=0;j<size_of_constraint;j++) {
4026: work[row_cmat_indices[j]+i*lda_rhs] = -row_cmat_values[j];
4027: }
4028: MatRestoreRow(C_CR,i,&size_of_constraint,&row_cmat_indices,&row_cmat_values);
4029: }
4030: MatCreateSeqDense(PETSC_COMM_SELF,lda_rhs,n_constraints,work,&Brhs);
4031: } else {
4032: Mat tC_CR;
4034: MatScale(C_CR,-1.0);
4035: if (lda_rhs != n_R) {
4036: PetscScalar *aa;
4037: PetscInt r,*ii,*jj;
4038: PetscBool done;
4040: MatGetRowIJ(C_CR,0,PETSC_FALSE,PETSC_FALSE,&r,(const PetscInt**)&ii,(const PetscInt**)&jj,&done);
4041: if (!done) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"GetRowIJ failed");
4042: MatSeqAIJGetArray(C_CR,&aa);
4043: MatCreateSeqAIJWithArrays(PETSC_COMM_SELF,n_constraints,lda_rhs,ii,jj,aa,&tC_CR);
4044: MatRestoreRowIJ(C_CR,0,PETSC_FALSE,PETSC_FALSE,&r,(const PetscInt**)&ii,(const PetscInt**)&jj,&done);
4045: if (!done) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"RestoreRowIJ failed");
4046: } else {
4047: PetscObjectReference((PetscObject)C_CR);
4048: tC_CR = C_CR;
4049: }
4050: MatCreateTranspose(tC_CR,&Brhs);
4051: MatDestroy(&tC_CR);
4052: }
4053: MatCreateSeqDense(PETSC_COMM_SELF,lda_rhs,n_constraints,NULL,&local_auxmat2_R);
4054: if (F) {
4055: if (need_benign_correction) {
4056: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
4058: /* rhs is already zero on interior dofs, no need to change the rhs */
4059: PetscArrayzero(reuse_solver->benign_save_vals,pcbddc->benign_n);
4060: }
4061: MatMatSolve(F,Brhs,local_auxmat2_R);
4062: if (need_benign_correction) {
4063: PetscScalar *marr;
4064: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
4066: MatDenseGetArray(local_auxmat2_R,&marr);
4067: if (lda_rhs != n_R) {
4068: for (i=0;i<n_constraints;i++) {
4069: VecPlaceArray(dummy_vec,marr+i*lda_rhs);
4070: PCBDDCReuseSolversBenignAdapt(reuse_solver,dummy_vec,NULL,PETSC_TRUE,PETSC_TRUE);
4071: VecResetArray(dummy_vec);
4072: }
4073: } else {
4074: for (i=0;i<n_constraints;i++) {
4075: VecPlaceArray(pcbddc->vec1_R,marr+i*lda_rhs);
4076: PCBDDCReuseSolversBenignAdapt(reuse_solver,pcbddc->vec1_R,NULL,PETSC_TRUE,PETSC_TRUE);
4077: VecResetArray(pcbddc->vec1_R);
4078: }
4079: }
4080: MatDenseRestoreArray(local_auxmat2_R,&marr);
4081: }
4082: } else {
4083: PetscScalar *marr;
4085: MatDenseGetArray(local_auxmat2_R,&marr);
4086: for (i=0;i<n_constraints;i++) {
4087: VecPlaceArray(pcbddc->vec1_R,work+i*lda_rhs);
4088: VecPlaceArray(pcbddc->vec2_R,marr+i*lda_rhs);
4089: KSPSolve(pcbddc->ksp_R,pcbddc->vec1_R,pcbddc->vec2_R);
4090: KSPCheckSolve(pcbddc->ksp_R,pc,pcbddc->vec2_R);
4091: VecResetArray(pcbddc->vec1_R);
4092: VecResetArray(pcbddc->vec2_R);
4093: }
4094: MatDenseRestoreArray(local_auxmat2_R,&marr);
4095: }
4096: if (sparserhs) {
4097: MatScale(C_CR,-1.0);
4098: }
4099: MatDestroy(&Brhs);
4100: if (!pcbddc->switch_static) {
4101: MatCreateSeqDense(PETSC_COMM_SELF,n_B,n_constraints,NULL,&pcbddc->local_auxmat2);
4102: MatDenseGetArray(pcbddc->local_auxmat2,&array);
4103: MatDenseGetArray(local_auxmat2_R,&array2);
4104: for (i=0;i<n_constraints;i++) {
4105: VecPlaceArray(pcbddc->vec1_R,array2+i*lda_rhs);
4106: VecPlaceArray(pcis->vec1_B,array+i*n_B);
4107: VecScatterBegin(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4108: VecScatterEnd(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4109: VecResetArray(pcis->vec1_B);
4110: VecResetArray(pcbddc->vec1_R);
4111: }
4112: MatDenseRestoreArray(local_auxmat2_R,&array2);
4113: MatDenseRestoreArray(pcbddc->local_auxmat2,&array);
4114: MatMatMult(C_B,pcbddc->local_auxmat2,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&M3);
4115: } else {
4116: if (lda_rhs != n_R) {
4117: IS dummy;
4119: ISCreateStride(PETSC_COMM_SELF,n_R,0,1,&dummy);
4120: MatCreateSubMatrix(local_auxmat2_R,dummy,NULL,MAT_INITIAL_MATRIX,&pcbddc->local_auxmat2);
4121: ISDestroy(&dummy);
4122: } else {
4123: PetscObjectReference((PetscObject)local_auxmat2_R);
4124: pcbddc->local_auxmat2 = local_auxmat2_R;
4125: }
4126: MatMatMult(C_CR,pcbddc->local_auxmat2,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&M3);
4127: }
4128: ISDestroy(&is_aux);
4129: /* Assemble explicitly S_CC = ( C_{CR} A_{RR}^{-1} C^T_{CR} )^{-1} */
4130: MatScale(M3,m_one);
4131: if (isCHOL) {
4132: MatCholeskyFactor(M3,NULL,NULL);
4133: } else {
4134: MatLUFactor(M3,NULL,NULL,NULL);
4135: }
4136: MatSeqDenseInvertFactors_Private(M3);
4137: /* Assemble local_auxmat1 = S_CC*C_{CB} needed by BDDC application in KSP and in preproc */
4138: MatMatMult(M3,C_B,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&pcbddc->local_auxmat1);
4139: MatDestroy(&C_B);
4140: MatCopy(M3,S_CC,SAME_NONZERO_PATTERN); /* S_CC can have a different LDA, MatMatSolve doesn't support it */
4141: MatDestroy(&M3);
4142: }
4144: /* Get submatrices from subdomain matrix */
4145: if (n_vertices) {
4146: #if defined(PETSC_HAVE_VIENNACL) || defined(PETSC_HAVE_CUDA)
4147: PetscBool oldpin;
4148: #endif
4149: PetscBool isaij;
4150: IS is_aux;
4152: if (sub_schurs && sub_schurs->reuse_solver) { /* is_R_local is not sorted, ISComplement doesn't like it */
4153: IS tis;
4155: ISDuplicate(pcbddc->is_R_local,&tis);
4156: ISSort(tis);
4157: ISComplement(tis,0,pcis->n,&is_aux);
4158: ISDestroy(&tis);
4159: } else {
4160: ISComplement(pcbddc->is_R_local,0,pcis->n,&is_aux);
4161: }
4162: #if defined(PETSC_HAVE_VIENNACL) || defined(PETSC_HAVE_CUDA)
4163: oldpin = pcbddc->local_mat->boundtocpu;
4164: #endif
4165: MatBindToCPU(pcbddc->local_mat,PETSC_TRUE);
4166: MatCreateSubMatrix(pcbddc->local_mat,pcbddc->is_R_local,is_aux,MAT_INITIAL_MATRIX,&A_RV);
4167: MatCreateSubMatrix(pcbddc->local_mat,is_aux,pcbddc->is_R_local,MAT_INITIAL_MATRIX,&A_VR);
4168: PetscObjectBaseTypeCompare((PetscObject)A_VR,MATSEQAIJ,&isaij);
4169: if (!isaij) { /* TODO REMOVE: MatMatMult(A_VR,A_RRmA_RV) below may raise an error */
4170: MatConvert(A_VR,MATSEQAIJ,MAT_INPLACE_MATRIX,&A_VR);
4171: }
4172: MatCreateSubMatrix(pcbddc->local_mat,is_aux,is_aux,MAT_INITIAL_MATRIX,&A_VV);
4173: #if defined(PETSC_HAVE_VIENNACL) || defined(PETSC_HAVE_CUDA)
4174: MatBindToCPU(pcbddc->local_mat,oldpin);
4175: #endif
4176: ISDestroy(&is_aux);
4177: }
4179: /* Matrix of coarse basis functions (local) */
4180: if (pcbddc->coarse_phi_B) {
4181: PetscInt on_B,on_primal,on_D=n_D;
4182: if (pcbddc->coarse_phi_D) {
4183: MatGetSize(pcbddc->coarse_phi_D,&on_D,NULL);
4184: }
4185: MatGetSize(pcbddc->coarse_phi_B,&on_B,&on_primal);
4186: if (on_B != n_B || on_primal != pcbddc->local_primal_size || on_D != n_D) {
4187: PetscScalar *marray;
4189: MatDenseGetArray(pcbddc->coarse_phi_B,&marray);
4190: PetscFree(marray);
4191: MatDestroy(&pcbddc->coarse_phi_B);
4192: MatDestroy(&pcbddc->coarse_psi_B);
4193: MatDestroy(&pcbddc->coarse_phi_D);
4194: MatDestroy(&pcbddc->coarse_psi_D);
4195: }
4196: }
4198: if (!pcbddc->coarse_phi_B) {
4199: PetscScalar *marr;
4201: /* memory size */
4202: n = n_B*pcbddc->local_primal_size;
4203: if (pcbddc->switch_static || pcbddc->dbg_flag) n += n_D*pcbddc->local_primal_size;
4204: if (!pcbddc->symmetric_primal) n *= 2;
4205: PetscCalloc1(n,&marr);
4206: MatCreateSeqDense(PETSC_COMM_SELF,n_B,pcbddc->local_primal_size,marr,&pcbddc->coarse_phi_B);
4207: marr += n_B*pcbddc->local_primal_size;
4208: if (pcbddc->switch_static || pcbddc->dbg_flag) {
4209: MatCreateSeqDense(PETSC_COMM_SELF,n_D,pcbddc->local_primal_size,marr,&pcbddc->coarse_phi_D);
4210: marr += n_D*pcbddc->local_primal_size;
4211: }
4212: if (!pcbddc->symmetric_primal) {
4213: MatCreateSeqDense(PETSC_COMM_SELF,n_B,pcbddc->local_primal_size,marr,&pcbddc->coarse_psi_B);
4214: marr += n_B*pcbddc->local_primal_size;
4215: if (pcbddc->switch_static || pcbddc->dbg_flag) {
4216: MatCreateSeqDense(PETSC_COMM_SELF,n_D,pcbddc->local_primal_size,marr,&pcbddc->coarse_psi_D);
4217: }
4218: } else {
4219: PetscObjectReference((PetscObject)pcbddc->coarse_phi_B);
4220: pcbddc->coarse_psi_B = pcbddc->coarse_phi_B;
4221: if (pcbddc->switch_static || pcbddc->dbg_flag) {
4222: PetscObjectReference((PetscObject)pcbddc->coarse_phi_D);
4223: pcbddc->coarse_psi_D = pcbddc->coarse_phi_D;
4224: }
4225: }
4226: }
4228: /* We are now ready to evaluate coarse basis functions and subdomain contribution to coarse problem */
4229: p0_lidx_I = NULL;
4230: if (pcbddc->benign_n && (pcbddc->switch_static || pcbddc->dbg_flag)) {
4231: const PetscInt *idxs;
4233: ISGetIndices(pcis->is_I_local,&idxs);
4234: PetscMalloc1(pcbddc->benign_n,&p0_lidx_I);
4235: for (i=0;i<pcbddc->benign_n;i++) {
4236: PetscFindInt(pcbddc->benign_p0_lidx[i],pcis->n-pcis->n_B,idxs,&p0_lidx_I[i]);
4237: }
4238: ISRestoreIndices(pcis->is_I_local,&idxs);
4239: }
4241: /* vertices */
4242: if (n_vertices) {
4243: PetscBool restoreavr = PETSC_FALSE;
4245: MatConvert(A_VV,MATDENSE,MAT_INPLACE_MATRIX,&A_VV);
4247: if (n_R) {
4248: Mat A_RRmA_RV,A_RV_bcorr=NULL,S_VVt; /* S_VVt with LDA=N */
4249: PetscBLASInt B_N,B_one = 1;
4250: const PetscScalar *x;
4251: PetscScalar *y;
4253: MatScale(A_RV,m_one);
4254: if (need_benign_correction) {
4255: ISLocalToGlobalMapping RtoN;
4256: IS is_p0;
4257: PetscInt *idxs_p0,n;
4259: PetscMalloc1(pcbddc->benign_n,&idxs_p0);
4260: ISLocalToGlobalMappingCreateIS(pcbddc->is_R_local,&RtoN);
4261: ISGlobalToLocalMappingApply(RtoN,IS_GTOLM_DROP,pcbddc->benign_n,pcbddc->benign_p0_lidx,&n,idxs_p0);
4262: if (n != pcbddc->benign_n) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in R numbering for benign p0! %D != %D",n,pcbddc->benign_n);
4263: ISLocalToGlobalMappingDestroy(&RtoN);
4264: ISCreateGeneral(PETSC_COMM_SELF,n,idxs_p0,PETSC_OWN_POINTER,&is_p0);
4265: MatCreateSubMatrix(A_RV,is_p0,NULL,MAT_INITIAL_MATRIX,&A_RV_bcorr);
4266: ISDestroy(&is_p0);
4267: }
4269: MatCreateSeqDense(PETSC_COMM_SELF,lda_rhs,n_vertices,work,&A_RRmA_RV);
4270: if (!sparserhs || need_benign_correction) {
4271: if (lda_rhs == n_R) {
4272: MatConvert(A_RV,MATDENSE,MAT_INPLACE_MATRIX,&A_RV);
4273: } else {
4274: PetscScalar *av,*array;
4275: const PetscInt *xadj,*adjncy;
4276: PetscInt n;
4277: PetscBool flg_row;
4279: array = work+lda_rhs*n_vertices;
4280: PetscArrayzero(array,lda_rhs*n_vertices);
4281: MatConvert(A_RV,MATSEQAIJ,MAT_INPLACE_MATRIX,&A_RV);
4282: MatGetRowIJ(A_RV,0,PETSC_FALSE,PETSC_FALSE,&n,&xadj,&adjncy,&flg_row);
4283: MatSeqAIJGetArray(A_RV,&av);
4284: for (i=0;i<n;i++) {
4285: PetscInt j;
4286: for (j=xadj[i];j<xadj[i+1];j++) array[lda_rhs*adjncy[j]+i] = av[j];
4287: }
4288: MatRestoreRowIJ(A_RV,0,PETSC_FALSE,PETSC_FALSE,&n,&xadj,&adjncy,&flg_row);
4289: MatDestroy(&A_RV);
4290: MatCreateSeqDense(PETSC_COMM_SELF,lda_rhs,n_vertices,array,&A_RV);
4291: }
4292: if (need_benign_correction) {
4293: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
4294: PetscScalar *marr;
4296: MatDenseGetArray(A_RV,&marr);
4297: /* need \Phi^T A_RV = (I+L)A_RV, L given by
4299: | 0 0 0 | (V)
4300: L = | 0 0 -1 | (P-p0)
4301: | 0 0 -1 | (p0)
4303: */
4304: for (i=0;i<reuse_solver->benign_n;i++) {
4305: const PetscScalar *vals;
4306: const PetscInt *idxs,*idxs_zero;
4307: PetscInt n,j,nz;
4309: ISGetLocalSize(reuse_solver->benign_zerodiag_subs[i],&nz);
4310: ISGetIndices(reuse_solver->benign_zerodiag_subs[i],&idxs_zero);
4311: MatGetRow(A_RV_bcorr,i,&n,&idxs,&vals);
4312: for (j=0;j<n;j++) {
4313: PetscScalar val = vals[j];
4314: PetscInt k,col = idxs[j];
4315: for (k=0;k<nz;k++) marr[idxs_zero[k]+lda_rhs*col] -= val;
4316: }
4317: MatRestoreRow(A_RV_bcorr,i,&n,&idxs,&vals);
4318: ISRestoreIndices(reuse_solver->benign_zerodiag_subs[i],&idxs_zero);
4319: }
4320: MatDenseRestoreArray(A_RV,&marr);
4321: }
4322: PetscObjectReference((PetscObject)A_RV);
4323: Brhs = A_RV;
4324: } else {
4325: Mat tA_RVT,A_RVT;
4327: if (!pcbddc->symmetric_primal) {
4328: /* A_RV already scaled by -1 */
4329: MatTranspose(A_RV,MAT_INITIAL_MATRIX,&A_RVT);
4330: } else {
4331: restoreavr = PETSC_TRUE;
4332: MatScale(A_VR,-1.0);
4333: PetscObjectReference((PetscObject)A_VR);
4334: A_RVT = A_VR;
4335: }
4336: if (lda_rhs != n_R) {
4337: PetscScalar *aa;
4338: PetscInt r,*ii,*jj;
4339: PetscBool done;
4341: MatGetRowIJ(A_RVT,0,PETSC_FALSE,PETSC_FALSE,&r,(const PetscInt**)&ii,(const PetscInt**)&jj,&done);
4342: if (!done) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"GetRowIJ failed");
4343: MatSeqAIJGetArray(A_RVT,&aa);
4344: MatCreateSeqAIJWithArrays(PETSC_COMM_SELF,n_vertices,lda_rhs,ii,jj,aa,&tA_RVT);
4345: MatRestoreRowIJ(A_RVT,0,PETSC_FALSE,PETSC_FALSE,&r,(const PetscInt**)&ii,(const PetscInt**)&jj,&done);
4346: if (!done) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"RestoreRowIJ failed");
4347: } else {
4348: PetscObjectReference((PetscObject)A_RVT);
4349: tA_RVT = A_RVT;
4350: }
4351: MatCreateTranspose(tA_RVT,&Brhs);
4352: MatDestroy(&tA_RVT);
4353: MatDestroy(&A_RVT);
4354: }
4355: if (F) {
4356: /* need to correct the rhs */
4357: if (need_benign_correction) {
4358: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
4359: PetscScalar *marr;
4361: MatDenseGetArray(Brhs,&marr);
4362: if (lda_rhs != n_R) {
4363: for (i=0;i<n_vertices;i++) {
4364: VecPlaceArray(dummy_vec,marr+i*lda_rhs);
4365: PCBDDCReuseSolversBenignAdapt(reuse_solver,dummy_vec,NULL,PETSC_FALSE,PETSC_TRUE);
4366: VecResetArray(dummy_vec);
4367: }
4368: } else {
4369: for (i=0;i<n_vertices;i++) {
4370: VecPlaceArray(pcbddc->vec1_R,marr+i*lda_rhs);
4371: PCBDDCReuseSolversBenignAdapt(reuse_solver,pcbddc->vec1_R,NULL,PETSC_FALSE,PETSC_TRUE);
4372: VecResetArray(pcbddc->vec1_R);
4373: }
4374: }
4375: MatDenseRestoreArray(Brhs,&marr);
4376: }
4377: MatMatSolve(F,Brhs,A_RRmA_RV);
4378: if (restoreavr) {
4379: MatScale(A_VR,-1.0);
4380: }
4381: /* need to correct the solution */
4382: if (need_benign_correction) {
4383: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
4384: PetscScalar *marr;
4386: MatDenseGetArray(A_RRmA_RV,&marr);
4387: if (lda_rhs != n_R) {
4388: for (i=0;i<n_vertices;i++) {
4389: VecPlaceArray(dummy_vec,marr+i*lda_rhs);
4390: PCBDDCReuseSolversBenignAdapt(reuse_solver,dummy_vec,NULL,PETSC_TRUE,PETSC_TRUE);
4391: VecResetArray(dummy_vec);
4392: }
4393: } else {
4394: for (i=0;i<n_vertices;i++) {
4395: VecPlaceArray(pcbddc->vec1_R,marr+i*lda_rhs);
4396: PCBDDCReuseSolversBenignAdapt(reuse_solver,pcbddc->vec1_R,NULL,PETSC_TRUE,PETSC_TRUE);
4397: VecResetArray(pcbddc->vec1_R);
4398: }
4399: }
4400: MatDenseRestoreArray(A_RRmA_RV,&marr);
4401: }
4402: } else {
4403: MatDenseGetArray(Brhs,&y);
4404: for (i=0;i<n_vertices;i++) {
4405: VecPlaceArray(pcbddc->vec1_R,y+i*lda_rhs);
4406: VecPlaceArray(pcbddc->vec2_R,work+i*lda_rhs);
4407: KSPSolve(pcbddc->ksp_R,pcbddc->vec1_R,pcbddc->vec2_R);
4408: KSPCheckSolve(pcbddc->ksp_R,pc,pcbddc->vec2_R);
4409: VecResetArray(pcbddc->vec1_R);
4410: VecResetArray(pcbddc->vec2_R);
4411: }
4412: MatDenseRestoreArray(Brhs,&y);
4413: }
4414: MatDestroy(&A_RV);
4415: MatDestroy(&Brhs);
4416: /* S_VV and S_CV */
4417: if (n_constraints) {
4418: Mat B;
4420: PetscArrayzero(work+lda_rhs*n_vertices,n_B*n_vertices);
4421: for (i=0;i<n_vertices;i++) {
4422: VecPlaceArray(pcbddc->vec1_R,work+i*lda_rhs);
4423: VecPlaceArray(pcis->vec1_B,work+lda_rhs*n_vertices+i*n_B);
4424: VecScatterBegin(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4425: VecScatterEnd(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4426: VecResetArray(pcis->vec1_B);
4427: VecResetArray(pcbddc->vec1_R);
4428: }
4429: MatCreateSeqDense(PETSC_COMM_SELF,n_B,n_vertices,work+lda_rhs*n_vertices,&B);
4430: /* Reuse dense S_C = pcbddc->local_auxmat1 * B */
4431: MatProductCreateWithMat(pcbddc->local_auxmat1,B,NULL,S_CV);
4432: MatProductSetType(S_CV,MATPRODUCT_AB);
4433: MatProductSetFromOptions(S_CV);
4434: MatProductNumeric(S_CV);
4436: MatDestroy(&B);
4437: MatCreateSeqDense(PETSC_COMM_SELF,lda_rhs,n_vertices,work+lda_rhs*n_vertices,&B);
4438: /* Reuse B = local_auxmat2_R * S_CV */
4439: MatProductCreateWithMat(local_auxmat2_R,S_CV,NULL,B);
4440: MatProductSetType(B,MATPRODUCT_AB);
4441: MatProductSetFromOptions(B);
4442: MatProductNumeric(B);
4444: MatScale(S_CV,m_one);
4445: PetscBLASIntCast(lda_rhs*n_vertices,&B_N);
4446: PetscStackCallBLAS("BLASaxpy",BLASaxpy_(&B_N,&one,work+lda_rhs*n_vertices,&B_one,work,&B_one));
4447: MatDestroy(&B);
4448: }
4449: if (lda_rhs != n_R) {
4450: MatDestroy(&A_RRmA_RV);
4451: MatCreateSeqDense(PETSC_COMM_SELF,n_R,n_vertices,work,&A_RRmA_RV);
4452: MatSeqDenseSetLDA(A_RRmA_RV,lda_rhs);
4453: }
4454: MatMatMult(A_VR,A_RRmA_RV,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&S_VVt);
4455: /* need A_VR * \Phi * A_RRmA_RV = A_VR * (I+L)^T * A_RRmA_RV, L given as before */
4456: if (need_benign_correction) {
4457: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
4458: PetscScalar *marr,*sums;
4460: PetscMalloc1(n_vertices,&sums);
4461: MatDenseGetArray(S_VVt,&marr);
4462: for (i=0;i<reuse_solver->benign_n;i++) {
4463: const PetscScalar *vals;
4464: const PetscInt *idxs,*idxs_zero;
4465: PetscInt n,j,nz;
4467: ISGetLocalSize(reuse_solver->benign_zerodiag_subs[i],&nz);
4468: ISGetIndices(reuse_solver->benign_zerodiag_subs[i],&idxs_zero);
4469: for (j=0;j<n_vertices;j++) {
4470: PetscInt k;
4471: sums[j] = 0.;
4472: for (k=0;k<nz;k++) sums[j] += work[idxs_zero[k]+j*lda_rhs];
4473: }
4474: MatGetRow(A_RV_bcorr,i,&n,&idxs,&vals);
4475: for (j=0;j<n;j++) {
4476: PetscScalar val = vals[j];
4477: PetscInt k;
4478: for (k=0;k<n_vertices;k++) {
4479: marr[idxs[j]+k*n_vertices] += val*sums[k];
4480: }
4481: }
4482: MatRestoreRow(A_RV_bcorr,i,&n,&idxs,&vals);
4483: ISRestoreIndices(reuse_solver->benign_zerodiag_subs[i],&idxs_zero);
4484: }
4485: PetscFree(sums);
4486: MatDenseRestoreArray(S_VVt,&marr);
4487: MatDestroy(&A_RV_bcorr);
4488: }
4489: MatDestroy(&A_RRmA_RV);
4490: PetscBLASIntCast(n_vertices*n_vertices,&B_N);
4491: MatDenseGetArrayRead(A_VV,&x);
4492: MatDenseGetArray(S_VVt,&y);
4493: PetscStackCallBLAS("BLASaxpy",BLASaxpy_(&B_N,&one,x,&B_one,y,&B_one));
4494: MatDenseRestoreArrayRead(A_VV,&x);
4495: MatDenseRestoreArray(S_VVt,&y);
4496: MatCopy(S_VVt,S_VV,SAME_NONZERO_PATTERN);
4497: MatDestroy(&S_VVt);
4498: } else {
4499: MatCopy(A_VV,S_VV,SAME_NONZERO_PATTERN);
4500: }
4501: MatDestroy(&A_VV);
4503: /* coarse basis functions */
4504: for (i=0;i<n_vertices;i++) {
4505: PetscScalar *y;
4507: VecPlaceArray(pcbddc->vec1_R,work+lda_rhs*i);
4508: MatDenseGetArray(pcbddc->coarse_phi_B,&y);
4509: VecPlaceArray(pcis->vec1_B,y+n_B*i);
4510: VecScatterBegin(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4511: VecScatterEnd(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4512: y[n_B*i+idx_V_B[i]] = 1.0;
4513: MatDenseRestoreArray(pcbddc->coarse_phi_B,&y);
4514: VecResetArray(pcis->vec1_B);
4516: if (pcbddc->switch_static || pcbddc->dbg_flag) {
4517: PetscInt j;
4519: MatDenseGetArray(pcbddc->coarse_phi_D,&y);
4520: VecPlaceArray(pcis->vec1_D,y+n_D*i);
4521: VecScatterBegin(pcbddc->R_to_D,pcbddc->vec1_R,pcis->vec1_D,INSERT_VALUES,SCATTER_FORWARD);
4522: VecScatterEnd(pcbddc->R_to_D,pcbddc->vec1_R,pcis->vec1_D,INSERT_VALUES,SCATTER_FORWARD);
4523: VecResetArray(pcis->vec1_D);
4524: for (j=0;j<pcbddc->benign_n;j++) y[n_D*i+p0_lidx_I[j]] = 0.0;
4525: MatDenseRestoreArray(pcbddc->coarse_phi_D,&y);
4526: }
4527: VecResetArray(pcbddc->vec1_R);
4528: }
4529: /* if n_R == 0 the object is not destroyed */
4530: MatDestroy(&A_RV);
4531: }
4532: VecDestroy(&dummy_vec);
4534: if (n_constraints) {
4535: Mat B;
4537: MatCreateSeqDense(PETSC_COMM_SELF,lda_rhs,n_constraints,work,&B);
4538: MatScale(S_CC,m_one);
4539: MatMatMult(local_auxmat2_R,S_CC,MAT_REUSE_MATRIX,PETSC_DEFAULT,&B);
4540: MatScale(S_CC,m_one);
4541: if (n_vertices) {
4542: if (isCHOL || need_benign_correction) { /* if we can solve the interior problem with cholesky, we should also be fine with transposing here */
4543: MatTranspose(S_CV,MAT_REUSE_MATRIX,&S_VC);
4544: } else {
4545: Mat S_VCt;
4547: if (lda_rhs != n_R) {
4548: MatDestroy(&B);
4549: MatCreateSeqDense(PETSC_COMM_SELF,n_R,n_constraints,work,&B);
4550: MatSeqDenseSetLDA(B,lda_rhs);
4551: }
4552: MatMatMult(A_VR,B,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&S_VCt);
4553: MatCopy(S_VCt,S_VC,SAME_NONZERO_PATTERN);
4554: MatDestroy(&S_VCt);
4555: }
4556: }
4557: MatDestroy(&B);
4558: /* coarse basis functions */
4559: for (i=0;i<n_constraints;i++) {
4560: PetscScalar *y;
4562: VecPlaceArray(pcbddc->vec1_R,work+lda_rhs*i);
4563: MatDenseGetArray(pcbddc->coarse_phi_B,&y);
4564: VecPlaceArray(pcis->vec1_B,y+n_B*(i+n_vertices));
4565: VecScatterBegin(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4566: VecScatterEnd(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4567: MatDenseRestoreArray(pcbddc->coarse_phi_B,&y);
4568: VecResetArray(pcis->vec1_B);
4569: if (pcbddc->switch_static || pcbddc->dbg_flag) {
4570: PetscInt j;
4572: MatDenseGetArray(pcbddc->coarse_phi_D,&y);
4573: VecPlaceArray(pcis->vec1_D,y+n_D*(i+n_vertices));
4574: VecScatterBegin(pcbddc->R_to_D,pcbddc->vec1_R,pcis->vec1_D,INSERT_VALUES,SCATTER_FORWARD);
4575: VecScatterEnd(pcbddc->R_to_D,pcbddc->vec1_R,pcis->vec1_D,INSERT_VALUES,SCATTER_FORWARD);
4576: VecResetArray(pcis->vec1_D);
4577: for (j=0;j<pcbddc->benign_n;j++) y[n_D*i+p0_lidx_I[j]] = 0.0;
4578: MatDenseRestoreArray(pcbddc->coarse_phi_D,&y);
4579: }
4580: VecResetArray(pcbddc->vec1_R);
4581: }
4582: }
4583: if (n_constraints) {
4584: MatDestroy(&local_auxmat2_R);
4585: }
4586: PetscFree(p0_lidx_I);
4588: /* coarse matrix entries relative to B_0 */
4589: if (pcbddc->benign_n) {
4590: Mat B0_B,B0_BPHI;
4591: IS is_dummy;
4592: const PetscScalar *data;
4593: PetscInt j;
4595: ISCreateStride(PETSC_COMM_SELF,pcbddc->benign_n,0,1,&is_dummy);
4596: MatCreateSubMatrix(pcbddc->benign_B0,is_dummy,pcis->is_B_local,MAT_INITIAL_MATRIX,&B0_B);
4597: ISDestroy(&is_dummy);
4598: MatMatMult(B0_B,pcbddc->coarse_phi_B,MAT_INITIAL_MATRIX,1.0,&B0_BPHI);
4599: MatConvert(B0_BPHI,MATSEQDENSE,MAT_INPLACE_MATRIX,&B0_BPHI);
4600: MatDenseGetArrayRead(B0_BPHI,&data);
4601: for (j=0;j<pcbddc->benign_n;j++) {
4602: PetscInt primal_idx = pcbddc->local_primal_size - pcbddc->benign_n + j;
4603: for (i=0;i<pcbddc->local_primal_size;i++) {
4604: coarse_submat_vals[primal_idx*pcbddc->local_primal_size+i] = data[i*pcbddc->benign_n+j];
4605: coarse_submat_vals[i*pcbddc->local_primal_size+primal_idx] = data[i*pcbddc->benign_n+j];
4606: }
4607: }
4608: MatDenseRestoreArrayRead(B0_BPHI,&data);
4609: MatDestroy(&B0_B);
4610: MatDestroy(&B0_BPHI);
4611: }
4613: /* compute other basis functions for non-symmetric problems */
4614: if (!pcbddc->symmetric_primal) {
4615: Mat B_V=NULL,B_C=NULL;
4616: PetscScalar *marray;
4618: if (n_constraints) {
4619: Mat S_CCT,C_CRT;
4621: MatTranspose(C_CR,MAT_INITIAL_MATRIX,&C_CRT);
4622: MatTranspose(S_CC,MAT_INITIAL_MATRIX,&S_CCT);
4623: MatMatMult(C_CRT,S_CCT,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&B_C);
4624: MatDestroy(&S_CCT);
4625: if (n_vertices) {
4626: Mat S_VCT;
4628: MatTranspose(S_VC,MAT_INITIAL_MATRIX,&S_VCT);
4629: MatMatMult(C_CRT,S_VCT,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&B_V);
4630: MatDestroy(&S_VCT);
4631: }
4632: MatDestroy(&C_CRT);
4633: } else {
4634: MatCreateSeqDense(PETSC_COMM_SELF,n_R,n_vertices,NULL,&B_V);
4635: }
4636: if (n_vertices && n_R) {
4637: PetscScalar *av,*marray;
4638: const PetscInt *xadj,*adjncy;
4639: PetscInt n;
4640: PetscBool flg_row;
4642: /* B_V = B_V - A_VR^T */
4643: MatConvert(A_VR,MATSEQAIJ,MAT_INPLACE_MATRIX,&A_VR);
4644: MatGetRowIJ(A_VR,0,PETSC_FALSE,PETSC_FALSE,&n,&xadj,&adjncy,&flg_row);
4645: MatSeqAIJGetArray(A_VR,&av);
4646: MatDenseGetArray(B_V,&marray);
4647: for (i=0;i<n;i++) {
4648: PetscInt j;
4649: for (j=xadj[i];j<xadj[i+1];j++) marray[i*n_R + adjncy[j]] -= av[j];
4650: }
4651: MatDenseRestoreArray(B_V,&marray);
4652: MatRestoreRowIJ(A_VR,0,PETSC_FALSE,PETSC_FALSE,&n,&xadj,&adjncy,&flg_row);
4653: MatDestroy(&A_VR);
4654: }
4656: /* currently there's no support for MatTransposeMatSolve(F,B,X) */
4657: if (n_vertices) {
4658: MatDenseGetArray(B_V,&marray);
4659: for (i=0;i<n_vertices;i++) {
4660: VecPlaceArray(pcbddc->vec1_R,marray+i*n_R);
4661: VecPlaceArray(pcbddc->vec2_R,work+i*n_R);
4662: KSPSolveTranspose(pcbddc->ksp_R,pcbddc->vec1_R,pcbddc->vec2_R);
4663: KSPCheckSolve(pcbddc->ksp_R,pc,pcbddc->vec2_R);
4664: VecResetArray(pcbddc->vec1_R);
4665: VecResetArray(pcbddc->vec2_R);
4666: }
4667: MatDenseRestoreArray(B_V,&marray);
4668: }
4669: if (B_C) {
4670: MatDenseGetArray(B_C,&marray);
4671: for (i=n_vertices;i<n_constraints+n_vertices;i++) {
4672: VecPlaceArray(pcbddc->vec1_R,marray+(i-n_vertices)*n_R);
4673: VecPlaceArray(pcbddc->vec2_R,work+i*n_R);
4674: KSPSolveTranspose(pcbddc->ksp_R,pcbddc->vec1_R,pcbddc->vec2_R);
4675: KSPCheckSolve(pcbddc->ksp_R,pc,pcbddc->vec2_R);
4676: VecResetArray(pcbddc->vec1_R);
4677: VecResetArray(pcbddc->vec2_R);
4678: }
4679: MatDenseRestoreArray(B_C,&marray);
4680: }
4681: /* coarse basis functions */
4682: for (i=0;i<pcbddc->local_primal_size;i++) {
4683: PetscScalar *y;
4685: VecPlaceArray(pcbddc->vec1_R,work+i*n_R);
4686: MatDenseGetArray(pcbddc->coarse_psi_B,&y);
4687: VecPlaceArray(pcis->vec1_B,y+n_B*i);
4688: VecScatterBegin(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4689: VecScatterEnd(pcbddc->R_to_B,pcbddc->vec1_R,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
4690: if (i<n_vertices) {
4691: y[n_B*i+idx_V_B[i]] = 1.0;
4692: }
4693: MatDenseRestoreArray(pcbddc->coarse_psi_B,&y);
4694: VecResetArray(pcis->vec1_B);
4696: if (pcbddc->switch_static || pcbddc->dbg_flag) {
4697: MatDenseGetArray(pcbddc->coarse_psi_D,&y);
4698: VecPlaceArray(pcis->vec1_D,y+n_D*i);
4699: VecScatterBegin(pcbddc->R_to_D,pcbddc->vec1_R,pcis->vec1_D,INSERT_VALUES,SCATTER_FORWARD);
4700: VecScatterEnd(pcbddc->R_to_D,pcbddc->vec1_R,pcis->vec1_D,INSERT_VALUES,SCATTER_FORWARD);
4701: VecResetArray(pcis->vec1_D);
4702: MatDenseRestoreArray(pcbddc->coarse_psi_D,&y);
4703: }
4704: VecResetArray(pcbddc->vec1_R);
4705: }
4706: MatDestroy(&B_V);
4707: MatDestroy(&B_C);
4708: }
4710: /* free memory */
4711: PetscFree(idx_V_B);
4712: MatDestroy(&S_VV);
4713: MatDestroy(&S_CV);
4714: MatDestroy(&S_VC);
4715: MatDestroy(&S_CC);
4716: PetscFree(work);
4717: if (n_vertices) {
4718: MatDestroy(&A_VR);
4719: }
4720: if (n_constraints) {
4721: MatDestroy(&C_CR);
4722: }
4723: PetscLogEventEnd(PC_BDDC_CorrectionSetUp[pcbddc->current_level],pc,0,0,0);
4725: /* Checking coarse_sub_mat and coarse basis functios */
4726: /* Symmetric case : It should be \Phi^{(j)^T} A^{(j)} \Phi^{(j)}=coarse_sub_mat */
4727: /* Non-symmetric case : It should be \Psi^{(j)^T} A^{(j)} \Phi^{(j)}=coarse_sub_mat */
4728: if (pcbddc->dbg_flag) {
4729: Mat coarse_sub_mat;
4730: Mat AUXMAT,TM1,TM2,TM3,TM4;
4731: Mat coarse_phi_D,coarse_phi_B;
4732: Mat coarse_psi_D,coarse_psi_B;
4733: Mat A_II,A_BB,A_IB,A_BI;
4734: Mat C_B,CPHI;
4735: IS is_dummy;
4736: Vec mones;
4737: MatType checkmattype=MATSEQAIJ;
4738: PetscReal real_value;
4740: if (pcbddc->benign_n && !pcbddc->benign_change_explicit) {
4741: Mat A;
4742: PCBDDCBenignProject(pc,NULL,NULL,&A);
4743: MatCreateSubMatrix(A,pcis->is_I_local,pcis->is_I_local,MAT_INITIAL_MATRIX,&A_II);
4744: MatCreateSubMatrix(A,pcis->is_I_local,pcis->is_B_local,MAT_INITIAL_MATRIX,&A_IB);
4745: MatCreateSubMatrix(A,pcis->is_B_local,pcis->is_I_local,MAT_INITIAL_MATRIX,&A_BI);
4746: MatCreateSubMatrix(A,pcis->is_B_local,pcis->is_B_local,MAT_INITIAL_MATRIX,&A_BB);
4747: MatDestroy(&A);
4748: } else {
4749: MatConvert(pcis->A_II,checkmattype,MAT_INITIAL_MATRIX,&A_II);
4750: MatConvert(pcis->A_IB,checkmattype,MAT_INITIAL_MATRIX,&A_IB);
4751: MatConvert(pcis->A_BI,checkmattype,MAT_INITIAL_MATRIX,&A_BI);
4752: MatConvert(pcis->A_BB,checkmattype,MAT_INITIAL_MATRIX,&A_BB);
4753: }
4754: MatConvert(pcbddc->coarse_phi_D,checkmattype,MAT_INITIAL_MATRIX,&coarse_phi_D);
4755: MatConvert(pcbddc->coarse_phi_B,checkmattype,MAT_INITIAL_MATRIX,&coarse_phi_B);
4756: if (!pcbddc->symmetric_primal) {
4757: MatConvert(pcbddc->coarse_psi_D,checkmattype,MAT_INITIAL_MATRIX,&coarse_psi_D);
4758: MatConvert(pcbddc->coarse_psi_B,checkmattype,MAT_INITIAL_MATRIX,&coarse_psi_B);
4759: }
4760: MatCreateSeqDense(PETSC_COMM_SELF,pcbddc->local_primal_size,pcbddc->local_primal_size,coarse_submat_vals,&coarse_sub_mat);
4762: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"--------------------------------------------------\n");
4763: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Check coarse sub mat computation (symmetric %d)\n",pcbddc->symmetric_primal);
4764: PetscViewerFlush(pcbddc->dbg_viewer);
4765: if (!pcbddc->symmetric_primal) {
4766: MatMatMult(A_II,coarse_phi_D,MAT_INITIAL_MATRIX,1.0,&AUXMAT);
4767: MatTransposeMatMult(coarse_psi_D,AUXMAT,MAT_INITIAL_MATRIX,1.0,&TM1);
4768: MatDestroy(&AUXMAT);
4769: MatMatMult(A_BB,coarse_phi_B,MAT_INITIAL_MATRIX,1.0,&AUXMAT);
4770: MatTransposeMatMult(coarse_psi_B,AUXMAT,MAT_INITIAL_MATRIX,1.0,&TM2);
4771: MatDestroy(&AUXMAT);
4772: MatMatMult(A_IB,coarse_phi_B,MAT_INITIAL_MATRIX,1.0,&AUXMAT);
4773: MatTransposeMatMult(coarse_psi_D,AUXMAT,MAT_INITIAL_MATRIX,1.0,&TM3);
4774: MatDestroy(&AUXMAT);
4775: MatMatMult(A_BI,coarse_phi_D,MAT_INITIAL_MATRIX,1.0,&AUXMAT);
4776: MatTransposeMatMult(coarse_psi_B,AUXMAT,MAT_INITIAL_MATRIX,1.0,&TM4);
4777: MatDestroy(&AUXMAT);
4778: } else {
4779: MatPtAP(A_II,coarse_phi_D,MAT_INITIAL_MATRIX,1.0,&TM1);
4780: MatPtAP(A_BB,coarse_phi_B,MAT_INITIAL_MATRIX,1.0,&TM2);
4781: MatMatMult(A_IB,coarse_phi_B,MAT_INITIAL_MATRIX,1.0,&AUXMAT);
4782: MatTransposeMatMult(coarse_phi_D,AUXMAT,MAT_INITIAL_MATRIX,1.0,&TM3);
4783: MatDestroy(&AUXMAT);
4784: MatMatMult(A_BI,coarse_phi_D,MAT_INITIAL_MATRIX,1.0,&AUXMAT);
4785: MatTransposeMatMult(coarse_phi_B,AUXMAT,MAT_INITIAL_MATRIX,1.0,&TM4);
4786: MatDestroy(&AUXMAT);
4787: }
4788: MatAXPY(TM1,one,TM2,DIFFERENT_NONZERO_PATTERN);
4789: MatAXPY(TM1,one,TM3,DIFFERENT_NONZERO_PATTERN);
4790: MatAXPY(TM1,one,TM4,DIFFERENT_NONZERO_PATTERN);
4791: MatConvert(TM1,MATSEQDENSE,MAT_INPLACE_MATRIX,&TM1);
4792: if (pcbddc->benign_n) {
4793: Mat B0_B,B0_BPHI;
4794: const PetscScalar *data2;
4795: PetscScalar *data;
4796: PetscInt j;
4798: ISCreateStride(PETSC_COMM_SELF,pcbddc->benign_n,0,1,&is_dummy);
4799: MatCreateSubMatrix(pcbddc->benign_B0,is_dummy,pcis->is_B_local,MAT_INITIAL_MATRIX,&B0_B);
4800: MatMatMult(B0_B,coarse_phi_B,MAT_INITIAL_MATRIX,1.0,&B0_BPHI);
4801: MatConvert(B0_BPHI,MATSEQDENSE,MAT_INPLACE_MATRIX,&B0_BPHI);
4802: MatDenseGetArray(TM1,&data);
4803: MatDenseGetArrayRead(B0_BPHI,&data2);
4804: for (j=0;j<pcbddc->benign_n;j++) {
4805: PetscInt primal_idx = pcbddc->local_primal_size - pcbddc->benign_n + j;
4806: for (i=0;i<pcbddc->local_primal_size;i++) {
4807: data[primal_idx*pcbddc->local_primal_size+i] += data2[i*pcbddc->benign_n+j];
4808: data[i*pcbddc->local_primal_size+primal_idx] += data2[i*pcbddc->benign_n+j];
4809: }
4810: }
4811: MatDenseRestoreArray(TM1,&data);
4812: MatDenseRestoreArrayRead(B0_BPHI,&data2);
4813: MatDestroy(&B0_B);
4814: ISDestroy(&is_dummy);
4815: MatDestroy(&B0_BPHI);
4816: }
4817: #if 0
4818: {
4819: PetscViewer viewer;
4820: char filename[256];
4821: sprintf(filename,"details_local_coarse_mat%d_level%d.m",PetscGlobalRank,pcbddc->current_level);
4822: PetscViewerASCIIOpen(PETSC_COMM_SELF,filename,&viewer);
4823: PetscViewerPushFormat(viewer,PETSC_VIEWER_ASCII_MATLAB);
4824: PetscObjectSetName((PetscObject)coarse_sub_mat,"computed");
4825: MatView(coarse_sub_mat,viewer);
4826: PetscObjectSetName((PetscObject)TM1,"projected");
4827: MatView(TM1,viewer);
4828: if (pcbddc->coarse_phi_B) {
4829: PetscObjectSetName((PetscObject)pcbddc->coarse_phi_B,"phi_B");
4830: MatView(pcbddc->coarse_phi_B,viewer);
4831: }
4832: if (pcbddc->coarse_phi_D) {
4833: PetscObjectSetName((PetscObject)pcbddc->coarse_phi_D,"phi_D");
4834: MatView(pcbddc->coarse_phi_D,viewer);
4835: }
4836: if (pcbddc->coarse_psi_B) {
4837: PetscObjectSetName((PetscObject)pcbddc->coarse_psi_B,"psi_B");
4838: MatView(pcbddc->coarse_psi_B,viewer);
4839: }
4840: if (pcbddc->coarse_psi_D) {
4841: PetscObjectSetName((PetscObject)pcbddc->coarse_psi_D,"psi_D");
4842: MatView(pcbddc->coarse_psi_D,viewer);
4843: }
4844: PetscObjectSetName((PetscObject)pcbddc->local_mat,"A");
4845: MatView(pcbddc->local_mat,viewer);
4846: PetscObjectSetName((PetscObject)pcbddc->ConstraintMatrix,"C");
4847: MatView(pcbddc->ConstraintMatrix,viewer);
4848: PetscObjectSetName((PetscObject)pcis->is_I_local,"I");
4849: ISView(pcis->is_I_local,viewer);
4850: PetscObjectSetName((PetscObject)pcis->is_B_local,"B");
4851: ISView(pcis->is_B_local,viewer);
4852: PetscObjectSetName((PetscObject)pcbddc->is_R_local,"R");
4853: ISView(pcbddc->is_R_local,viewer);
4854: PetscViewerDestroy(&viewer);
4855: }
4856: #endif
4857: MatAXPY(TM1,m_one,coarse_sub_mat,DIFFERENT_NONZERO_PATTERN);
4858: MatNorm(TM1,NORM_FROBENIUS,&real_value);
4859: PetscViewerASCIIPushSynchronized(pcbddc->dbg_viewer);
4860: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d matrix error % 1.14e\n",PetscGlobalRank,real_value);
4862: /* check constraints */
4863: ISCreateStride(PETSC_COMM_SELF,pcbddc->local_primal_size-pcbddc->benign_n,0,1,&is_dummy);
4864: MatCreateSubMatrix(pcbddc->ConstraintMatrix,is_dummy,pcis->is_B_local,MAT_INITIAL_MATRIX,&C_B);
4865: if (!pcbddc->benign_n) { /* TODO: add benign case */
4866: MatMatMult(C_B,coarse_phi_B,MAT_INITIAL_MATRIX,1.0,&CPHI);
4867: } else {
4868: PetscScalar *data;
4869: Mat tmat;
4870: MatDenseGetArray(pcbddc->coarse_phi_B,&data);
4871: MatCreateSeqDense(PETSC_COMM_SELF,pcis->n_B,pcbddc->local_primal_size-pcbddc->benign_n,data,&tmat);
4872: MatDenseRestoreArray(pcbddc->coarse_phi_B,&data);
4873: MatMatMult(C_B,tmat,MAT_INITIAL_MATRIX,1.0,&CPHI);
4874: MatDestroy(&tmat);
4875: }
4876: MatCreateVecs(CPHI,&mones,NULL);
4877: VecSet(mones,-1.0);
4878: MatDiagonalSet(CPHI,mones,ADD_VALUES);
4879: MatNorm(CPHI,NORM_FROBENIUS,&real_value);
4880: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d phi constraints error % 1.14e\n",PetscGlobalRank,real_value);
4881: if (!pcbddc->symmetric_primal) {
4882: MatMatMult(C_B,coarse_psi_B,MAT_REUSE_MATRIX,1.0,&CPHI);
4883: VecSet(mones,-1.0);
4884: MatDiagonalSet(CPHI,mones,ADD_VALUES);
4885: MatNorm(CPHI,NORM_FROBENIUS,&real_value);
4886: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d psi constraints error % 1.14e\n",PetscGlobalRank,real_value);
4887: }
4888: MatDestroy(&C_B);
4889: MatDestroy(&CPHI);
4890: ISDestroy(&is_dummy);
4891: VecDestroy(&mones);
4892: PetscViewerFlush(pcbddc->dbg_viewer);
4893: MatDestroy(&A_II);
4894: MatDestroy(&A_BB);
4895: MatDestroy(&A_IB);
4896: MatDestroy(&A_BI);
4897: MatDestroy(&TM1);
4898: MatDestroy(&TM2);
4899: MatDestroy(&TM3);
4900: MatDestroy(&TM4);
4901: MatDestroy(&coarse_phi_D);
4902: MatDestroy(&coarse_phi_B);
4903: if (!pcbddc->symmetric_primal) {
4904: MatDestroy(&coarse_psi_D);
4905: MatDestroy(&coarse_psi_B);
4906: }
4907: MatDestroy(&coarse_sub_mat);
4908: }
4909: /* FINAL CUDA support (we cannot currently mix viennacl and cuda vectors */
4910: {
4911: PetscBool gpu;
4913: PetscObjectTypeCompare((PetscObject)pcis->vec1_N,VECSEQCUDA,&gpu);
4914: if (gpu) {
4915: if (pcbddc->local_auxmat1) {
4916: MatConvert(pcbddc->local_auxmat1,MATSEQDENSECUDA,MAT_INPLACE_MATRIX,&pcbddc->local_auxmat1);
4917: }
4918: if (pcbddc->local_auxmat2) {
4919: MatConvert(pcbddc->local_auxmat2,MATSEQDENSECUDA,MAT_INPLACE_MATRIX,&pcbddc->local_auxmat2);
4920: }
4921: if (pcbddc->coarse_phi_B) {
4922: MatConvert(pcbddc->coarse_phi_B,MATSEQDENSECUDA,MAT_INPLACE_MATRIX,&pcbddc->coarse_phi_B);
4923: }
4924: if (pcbddc->coarse_phi_D) {
4925: MatConvert(pcbddc->coarse_phi_D,MATSEQDENSECUDA,MAT_INPLACE_MATRIX,&pcbddc->coarse_phi_D);
4926: }
4927: if (pcbddc->coarse_psi_B) {
4928: MatConvert(pcbddc->coarse_psi_B,MATSEQDENSECUDA,MAT_INPLACE_MATRIX,&pcbddc->coarse_psi_B);
4929: }
4930: if (pcbddc->coarse_psi_D) {
4931: MatConvert(pcbddc->coarse_psi_D,MATSEQDENSECUDA,MAT_INPLACE_MATRIX,&pcbddc->coarse_psi_D);
4932: }
4933: }
4934: }
4935: /* get back data */
4936: *coarse_submat_vals_n = coarse_submat_vals;
4937: return(0);
4938: }
4940: PetscErrorCode MatCreateSubMatrixUnsorted(Mat A, IS isrow, IS iscol, Mat* B)
4941: {
4942: Mat *work_mat;
4943: IS isrow_s,iscol_s;
4944: PetscBool rsorted,csorted;
4945: PetscInt rsize,*idxs_perm_r=NULL,csize,*idxs_perm_c=NULL;
4949: ISSorted(isrow,&rsorted);
4950: ISSorted(iscol,&csorted);
4951: ISGetLocalSize(isrow,&rsize);
4952: ISGetLocalSize(iscol,&csize);
4954: if (!rsorted) {
4955: const PetscInt *idxs;
4956: PetscInt *idxs_sorted,i;
4958: PetscMalloc1(rsize,&idxs_perm_r);
4959: PetscMalloc1(rsize,&idxs_sorted);
4960: for (i=0;i<rsize;i++) {
4961: idxs_perm_r[i] = i;
4962: }
4963: ISGetIndices(isrow,&idxs);
4964: PetscSortIntWithPermutation(rsize,idxs,idxs_perm_r);
4965: for (i=0;i<rsize;i++) {
4966: idxs_sorted[i] = idxs[idxs_perm_r[i]];
4967: }
4968: ISRestoreIndices(isrow,&idxs);
4969: ISCreateGeneral(PETSC_COMM_SELF,rsize,idxs_sorted,PETSC_OWN_POINTER,&isrow_s);
4970: } else {
4971: PetscObjectReference((PetscObject)isrow);
4972: isrow_s = isrow;
4973: }
4975: if (!csorted) {
4976: if (isrow == iscol) {
4977: PetscObjectReference((PetscObject)isrow_s);
4978: iscol_s = isrow_s;
4979: } else {
4980: const PetscInt *idxs;
4981: PetscInt *idxs_sorted,i;
4983: PetscMalloc1(csize,&idxs_perm_c);
4984: PetscMalloc1(csize,&idxs_sorted);
4985: for (i=0;i<csize;i++) {
4986: idxs_perm_c[i] = i;
4987: }
4988: ISGetIndices(iscol,&idxs);
4989: PetscSortIntWithPermutation(csize,idxs,idxs_perm_c);
4990: for (i=0;i<csize;i++) {
4991: idxs_sorted[i] = idxs[idxs_perm_c[i]];
4992: }
4993: ISRestoreIndices(iscol,&idxs);
4994: ISCreateGeneral(PETSC_COMM_SELF,csize,idxs_sorted,PETSC_OWN_POINTER,&iscol_s);
4995: }
4996: } else {
4997: PetscObjectReference((PetscObject)iscol);
4998: iscol_s = iscol;
4999: }
5001: MatCreateSubMatrices(A,1,&isrow_s,&iscol_s,MAT_INITIAL_MATRIX,&work_mat);
5003: if (!rsorted || !csorted) {
5004: Mat new_mat;
5005: IS is_perm_r,is_perm_c;
5007: if (!rsorted) {
5008: PetscInt *idxs_r,i;
5009: PetscMalloc1(rsize,&idxs_r);
5010: for (i=0;i<rsize;i++) {
5011: idxs_r[idxs_perm_r[i]] = i;
5012: }
5013: PetscFree(idxs_perm_r);
5014: ISCreateGeneral(PETSC_COMM_SELF,rsize,idxs_r,PETSC_OWN_POINTER,&is_perm_r);
5015: } else {
5016: ISCreateStride(PETSC_COMM_SELF,rsize,0,1,&is_perm_r);
5017: }
5018: ISSetPermutation(is_perm_r);
5020: if (!csorted) {
5021: if (isrow_s == iscol_s) {
5022: PetscObjectReference((PetscObject)is_perm_r);
5023: is_perm_c = is_perm_r;
5024: } else {
5025: PetscInt *idxs_c,i;
5026: if (!idxs_perm_c) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Permutation array not present");
5027: PetscMalloc1(csize,&idxs_c);
5028: for (i=0;i<csize;i++) {
5029: idxs_c[idxs_perm_c[i]] = i;
5030: }
5031: PetscFree(idxs_perm_c);
5032: ISCreateGeneral(PETSC_COMM_SELF,csize,idxs_c,PETSC_OWN_POINTER,&is_perm_c);
5033: }
5034: } else {
5035: ISCreateStride(PETSC_COMM_SELF,csize,0,1,&is_perm_c);
5036: }
5037: ISSetPermutation(is_perm_c);
5039: MatPermute(work_mat[0],is_perm_r,is_perm_c,&new_mat);
5040: MatDestroy(&work_mat[0]);
5041: work_mat[0] = new_mat;
5042: ISDestroy(&is_perm_r);
5043: ISDestroy(&is_perm_c);
5044: }
5046: PetscObjectReference((PetscObject)work_mat[0]);
5047: *B = work_mat[0];
5048: MatDestroyMatrices(1,&work_mat);
5049: ISDestroy(&isrow_s);
5050: ISDestroy(&iscol_s);
5051: return(0);
5052: }
5054: PetscErrorCode PCBDDCComputeLocalMatrix(PC pc, Mat ChangeOfBasisMatrix)
5055: {
5056: Mat_IS* matis = (Mat_IS*)pc->pmat->data;
5057: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
5058: Mat new_mat,lA;
5059: IS is_local,is_global;
5060: PetscInt local_size;
5061: PetscBool isseqaij;
5065: MatDestroy(&pcbddc->local_mat);
5066: MatGetSize(matis->A,&local_size,NULL);
5067: ISCreateStride(PetscObjectComm((PetscObject)matis->A),local_size,0,1,&is_local);
5068: ISLocalToGlobalMappingApplyIS(pc->pmat->rmap->mapping,is_local,&is_global);
5069: ISDestroy(&is_local);
5070: MatCreateSubMatrixUnsorted(ChangeOfBasisMatrix,is_global,is_global,&new_mat);
5071: ISDestroy(&is_global);
5073: if (pcbddc->dbg_flag) {
5074: Vec x,x_change;
5075: PetscReal error;
5077: MatCreateVecs(ChangeOfBasisMatrix,&x,&x_change);
5078: VecSetRandom(x,NULL);
5079: MatMult(ChangeOfBasisMatrix,x,x_change);
5080: VecScatterBegin(matis->cctx,x,matis->x,INSERT_VALUES,SCATTER_FORWARD);
5081: VecScatterEnd(matis->cctx,x,matis->x,INSERT_VALUES,SCATTER_FORWARD);
5082: MatMult(new_mat,matis->x,matis->y);
5083: if (!pcbddc->change_interior) {
5084: const PetscScalar *x,*y,*v;
5085: PetscReal lerror = 0.;
5086: PetscInt i;
5088: VecGetArrayRead(matis->x,&x);
5089: VecGetArrayRead(matis->y,&y);
5090: VecGetArrayRead(matis->counter,&v);
5091: for (i=0;i<local_size;i++)
5092: if (PetscRealPart(v[i]) < 1.5 && PetscAbsScalar(x[i]-y[i]) > lerror)
5093: lerror = PetscAbsScalar(x[i]-y[i]);
5094: VecRestoreArrayRead(matis->x,&x);
5095: VecRestoreArrayRead(matis->y,&y);
5096: VecRestoreArrayRead(matis->counter,&v);
5097: MPIU_Allreduce(&lerror,&error,1,MPIU_REAL,MPI_MAX,PetscObjectComm((PetscObject)pc));
5098: if (error > PETSC_SMALL) {
5099: if (!pcbddc->user_ChangeOfBasisMatrix || pcbddc->current_level) {
5100: SETERRQ1(PetscObjectComm((PetscObject)pc),PETSC_ERR_PLIB,"Error global vs local change on I: %1.6e",error);
5101: } else {
5102: SETERRQ1(PetscObjectComm((PetscObject)pc),PETSC_ERR_USER,"Error global vs local change on I: %1.6e",error);
5103: }
5104: }
5105: }
5106: VecScatterBegin(matis->rctx,matis->y,x,INSERT_VALUES,SCATTER_REVERSE);
5107: VecScatterEnd(matis->rctx,matis->y,x,INSERT_VALUES,SCATTER_REVERSE);
5108: VecAXPY(x,-1.0,x_change);
5109: VecNorm(x,NORM_INFINITY,&error);
5110: if (error > PETSC_SMALL) {
5111: if (!pcbddc->user_ChangeOfBasisMatrix || pcbddc->current_level) {
5112: SETERRQ1(PetscObjectComm((PetscObject)pc),PETSC_ERR_PLIB,"Error global vs local change on N: %1.6e",error);
5113: } else {
5114: SETERRQ1(PetscObjectComm((PetscObject)pc),PETSC_ERR_USER,"Error global vs local change on N: %1.6e",error);
5115: }
5116: }
5117: VecDestroy(&x);
5118: VecDestroy(&x_change);
5119: }
5121: /* lA is present if we are setting up an inner BDDC for a saddle point FETI-DP */
5122: PetscObjectQuery((PetscObject)pc,"__KSPFETIDP_lA" ,(PetscObject*)&lA);
5124: /* TODO: HOW TO WORK WITH BAIJ and SBAIJ and SEQDENSE? */
5125: PetscObjectBaseTypeCompare((PetscObject)matis->A,MATSEQAIJ,&isseqaij);
5126: if (isseqaij) {
5127: MatDestroy(&pcbddc->local_mat);
5128: MatPtAP(matis->A,new_mat,MAT_INITIAL_MATRIX,2.0,&pcbddc->local_mat);
5129: if (lA) {
5130: Mat work;
5131: MatPtAP(lA,new_mat,MAT_INITIAL_MATRIX,2.0,&work);
5132: PetscObjectCompose((PetscObject)pc,"__KSPFETIDP_lA" ,(PetscObject)work);
5133: MatDestroy(&work);
5134: }
5135: } else {
5136: Mat work_mat;
5138: MatDestroy(&pcbddc->local_mat);
5139: MatConvert(matis->A,MATSEQAIJ,MAT_INITIAL_MATRIX,&work_mat);
5140: MatPtAP(work_mat,new_mat,MAT_INITIAL_MATRIX,2.0,&pcbddc->local_mat);
5141: MatDestroy(&work_mat);
5142: if (lA) {
5143: Mat work;
5144: MatConvert(lA,MATSEQAIJ,MAT_INITIAL_MATRIX,&work_mat);
5145: MatPtAP(work_mat,new_mat,MAT_INITIAL_MATRIX,2.0,&work);
5146: PetscObjectCompose((PetscObject)pc,"__KSPFETIDP_lA" ,(PetscObject)work);
5147: MatDestroy(&work);
5148: }
5149: }
5150: if (matis->A->symmetric_set) {
5151: MatSetOption(pcbddc->local_mat,MAT_SYMMETRIC,matis->A->symmetric);
5152: #if !defined(PETSC_USE_COMPLEX)
5153: MatSetOption(pcbddc->local_mat,MAT_HERMITIAN,matis->A->symmetric);
5154: #endif
5155: }
5156: MatDestroy(&new_mat);
5157: return(0);
5158: }
5160: PetscErrorCode PCBDDCSetUpLocalScatters(PC pc)
5161: {
5162: PC_IS* pcis = (PC_IS*)(pc->data);
5163: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
5164: PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs;
5165: PetscInt *idx_R_local=NULL;
5166: PetscInt n_vertices,i,j,n_R,n_D,n_B;
5167: PetscInt vbs,bs;
5168: PetscBT bitmask=NULL;
5169: PetscErrorCode ierr;
5172: /*
5173: No need to setup local scatters if
5174: - primal space is unchanged
5175: AND
5176: - we actually have locally some primal dofs (could not be true in multilevel or for isolated subdomains)
5177: AND
5178: - we are not in debugging mode (this is needed since there are Synchronized prints at the end of the subroutine
5179: */
5180: if (!pcbddc->new_primal_space_local && pcbddc->local_primal_size && !pcbddc->dbg_flag) {
5181: return(0);
5182: }
5183: /* destroy old objects */
5184: ISDestroy(&pcbddc->is_R_local);
5185: VecScatterDestroy(&pcbddc->R_to_B);
5186: VecScatterDestroy(&pcbddc->R_to_D);
5187: /* Set Non-overlapping dimensions */
5188: n_B = pcis->n_B;
5189: n_D = pcis->n - n_B;
5190: n_vertices = pcbddc->n_vertices;
5192: /* Dohrmann's notation: dofs splitted in R (Remaining: all dofs but the vertices) and V (Vertices) */
5194: /* create auxiliary bitmask and allocate workspace */
5195: if (!sub_schurs || !sub_schurs->reuse_solver) {
5196: PetscMalloc1(pcis->n-n_vertices,&idx_R_local);
5197: PetscBTCreate(pcis->n,&bitmask);
5198: for (i=0;i<n_vertices;i++) {
5199: PetscBTSet(bitmask,pcbddc->local_primal_ref_node[i]);
5200: }
5202: for (i=0, n_R=0; i<pcis->n; i++) {
5203: if (!PetscBTLookup(bitmask,i)) {
5204: idx_R_local[n_R++] = i;
5205: }
5206: }
5207: } else { /* A different ordering (already computed) is present if we are reusing the Schur solver */
5208: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5210: ISGetIndices(reuse_solver->is_R,(const PetscInt**)&idx_R_local);
5211: ISGetLocalSize(reuse_solver->is_R,&n_R);
5212: }
5214: /* Block code */
5215: vbs = 1;
5216: MatGetBlockSize(pcbddc->local_mat,&bs);
5217: if (bs>1 && !(n_vertices%bs)) {
5218: PetscBool is_blocked = PETSC_TRUE;
5219: PetscInt *vary;
5220: if (!sub_schurs || !sub_schurs->reuse_solver) {
5221: PetscMalloc1(pcis->n/bs,&vary);
5222: PetscArrayzero(vary,pcis->n/bs);
5223: /* Verify that the vertex indices correspond to each element in a block (code taken from sbaij2.c) */
5224: /* it is ok to check this way since local_primal_ref_node are always sorted by local numbering and idx_R_local is obtained as a complement */
5225: for (i=0; i<n_vertices; i++) vary[pcbddc->local_primal_ref_node[i]/bs]++;
5226: for (i=0; i<pcis->n/bs; i++) {
5227: if (vary[i]!=0 && vary[i]!=bs) {
5228: is_blocked = PETSC_FALSE;
5229: break;
5230: }
5231: }
5232: PetscFree(vary);
5233: } else {
5234: /* Verify directly the R set */
5235: for (i=0; i<n_R/bs; i++) {
5236: PetscInt j,node=idx_R_local[bs*i];
5237: for (j=1; j<bs; j++) {
5238: if (node != idx_R_local[bs*i+j]-j) {
5239: is_blocked = PETSC_FALSE;
5240: break;
5241: }
5242: }
5243: }
5244: }
5245: if (is_blocked) { /* build compressed IS for R nodes (complement of vertices) */
5246: vbs = bs;
5247: for (i=0;i<n_R/vbs;i++) {
5248: idx_R_local[i] = idx_R_local[vbs*i]/vbs;
5249: }
5250: }
5251: }
5252: ISCreateBlock(PETSC_COMM_SELF,vbs,n_R/vbs,idx_R_local,PETSC_COPY_VALUES,&pcbddc->is_R_local);
5253: if (sub_schurs && sub_schurs->reuse_solver) {
5254: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5256: ISRestoreIndices(reuse_solver->is_R,(const PetscInt**)&idx_R_local);
5257: ISDestroy(&reuse_solver->is_R);
5258: PetscObjectReference((PetscObject)pcbddc->is_R_local);
5259: reuse_solver->is_R = pcbddc->is_R_local;
5260: } else {
5261: PetscFree(idx_R_local);
5262: }
5264: /* print some info if requested */
5265: if (pcbddc->dbg_flag) {
5266: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"--------------------------------------------------\n");
5267: PetscViewerFlush(pcbddc->dbg_viewer);
5268: PetscViewerASCIIPushSynchronized(pcbddc->dbg_viewer);
5269: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d local dimensions\n",PetscGlobalRank);
5270: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"local_size = %D, dirichlet_size = %D, boundary_size = %D\n",pcis->n,n_D,n_B);
5271: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"r_size = %D, v_size = %D, constraints = %D, local_primal_size = %D\n",n_R,n_vertices,pcbddc->local_primal_size-n_vertices-pcbddc->benign_n,pcbddc->local_primal_size);
5272: PetscViewerFlush(pcbddc->dbg_viewer);
5273: }
5275: /* VecScatters pcbddc->R_to_B and (optionally) pcbddc->R_to_D */
5276: if (!sub_schurs || !sub_schurs->reuse_solver) {
5277: IS is_aux1,is_aux2;
5278: PetscInt *aux_array1,*aux_array2,*is_indices,*idx_R_local;
5280: ISGetIndices(pcbddc->is_R_local,(const PetscInt**)&idx_R_local);
5281: PetscMalloc1(pcis->n_B-n_vertices,&aux_array1);
5282: PetscMalloc1(pcis->n_B-n_vertices,&aux_array2);
5283: ISGetIndices(pcis->is_I_local,(const PetscInt**)&is_indices);
5284: for (i=0; i<n_D; i++) {
5285: PetscBTSet(bitmask,is_indices[i]);
5286: }
5287: ISRestoreIndices(pcis->is_I_local,(const PetscInt**)&is_indices);
5288: for (i=0, j=0; i<n_R; i++) {
5289: if (!PetscBTLookup(bitmask,idx_R_local[i])) {
5290: aux_array1[j++] = i;
5291: }
5292: }
5293: ISCreateGeneral(PETSC_COMM_SELF,j,aux_array1,PETSC_OWN_POINTER,&is_aux1);
5294: ISGetIndices(pcis->is_B_local,(const PetscInt**)&is_indices);
5295: for (i=0, j=0; i<n_B; i++) {
5296: if (!PetscBTLookup(bitmask,is_indices[i])) {
5297: aux_array2[j++] = i;
5298: }
5299: }
5300: ISRestoreIndices(pcis->is_B_local,(const PetscInt**)&is_indices);
5301: ISCreateGeneral(PETSC_COMM_SELF,j,aux_array2,PETSC_OWN_POINTER,&is_aux2);
5302: VecScatterCreate(pcbddc->vec1_R,is_aux1,pcis->vec1_B,is_aux2,&pcbddc->R_to_B);
5303: ISDestroy(&is_aux1);
5304: ISDestroy(&is_aux2);
5306: if (pcbddc->switch_static || pcbddc->dbg_flag) {
5307: PetscMalloc1(n_D,&aux_array1);
5308: for (i=0, j=0; i<n_R; i++) {
5309: if (PetscBTLookup(bitmask,idx_R_local[i])) {
5310: aux_array1[j++] = i;
5311: }
5312: }
5313: ISCreateGeneral(PETSC_COMM_SELF,j,aux_array1,PETSC_OWN_POINTER,&is_aux1);
5314: VecScatterCreate(pcbddc->vec1_R,is_aux1,pcis->vec1_D,(IS)0,&pcbddc->R_to_D);
5315: ISDestroy(&is_aux1);
5316: }
5317: PetscBTDestroy(&bitmask);
5318: ISRestoreIndices(pcbddc->is_R_local,(const PetscInt**)&idx_R_local);
5319: } else {
5320: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5321: IS tis;
5322: PetscInt schur_size;
5324: ISGetLocalSize(reuse_solver->is_B,&schur_size);
5325: ISCreateStride(PETSC_COMM_SELF,schur_size,n_D,1,&tis);
5326: VecScatterCreate(pcbddc->vec1_R,tis,pcis->vec1_B,reuse_solver->is_B,&pcbddc->R_to_B);
5327: ISDestroy(&tis);
5328: if (pcbddc->switch_static || pcbddc->dbg_flag) {
5329: ISCreateStride(PETSC_COMM_SELF,n_D,0,1,&tis);
5330: VecScatterCreate(pcbddc->vec1_R,tis,pcis->vec1_D,(IS)0,&pcbddc->R_to_D);
5331: ISDestroy(&tis);
5332: }
5333: }
5334: return(0);
5335: }
5337: static PetscErrorCode MatNullSpacePropagateAny_Private(Mat A, IS is, Mat B)
5338: {
5339: MatNullSpace NullSpace;
5340: Mat dmat;
5341: const Vec *nullvecs;
5342: Vec v,v2,*nullvecs2;
5343: VecScatter sct = NULL;
5344: PetscContainer c;
5345: PetscScalar *ddata;
5346: PetscInt k,nnsp_size,bsiz,bsiz2,n,N,bs;
5347: PetscBool nnsp_has_cnst;
5351: if (!is && !B) { /* MATIS */
5352: Mat_IS* matis = (Mat_IS*)A->data;
5354: if (!B) {
5355: MatISGetLocalMat(A,&B);
5356: }
5357: sct = matis->cctx;
5358: PetscObjectReference((PetscObject)sct);
5359: } else {
5360: MatGetNullSpace(B,&NullSpace);
5361: if (!NullSpace) {
5362: MatGetNearNullSpace(B,&NullSpace);
5363: }
5364: if (NullSpace) return(0);
5365: }
5366: MatGetNullSpace(A,&NullSpace);
5367: if (!NullSpace) {
5368: MatGetNearNullSpace(A,&NullSpace);
5369: }
5370: if (!NullSpace) return(0);
5372: MatCreateVecs(A,&v,NULL);
5373: MatCreateVecs(B,&v2,NULL);
5374: if (!sct) {
5375: VecScatterCreate(v,is,v2,NULL,&sct);
5376: }
5377: MatNullSpaceGetVecs(NullSpace,&nnsp_has_cnst,&nnsp_size,(const Vec**)&nullvecs);
5378: bsiz = bsiz2 = nnsp_size+!!nnsp_has_cnst;
5379: PetscMalloc1(bsiz,&nullvecs2);
5380: VecGetBlockSize(v2,&bs);
5381: VecGetSize(v2,&N);
5382: VecGetLocalSize(v2,&n);
5383: PetscMalloc1(n*bsiz,&ddata);
5384: for (k=0;k<nnsp_size;k++) {
5385: VecCreateMPIWithArray(PetscObjectComm((PetscObject)B),bs,n,N,ddata + n*k,&nullvecs2[k]);
5386: VecScatterBegin(sct,nullvecs[k],nullvecs2[k],INSERT_VALUES,SCATTER_FORWARD);
5387: VecScatterEnd(sct,nullvecs[k],nullvecs2[k],INSERT_VALUES,SCATTER_FORWARD);
5388: }
5389: if (nnsp_has_cnst) {
5390: VecCreateMPIWithArray(PetscObjectComm((PetscObject)B),bs,n,N,ddata + n*nnsp_size,&nullvecs2[nnsp_size]);
5391: VecSet(nullvecs2[nnsp_size],1.0);
5392: }
5393: PCBDDCOrthonormalizeVecs(&bsiz2,nullvecs2);
5394: MatNullSpaceCreate(PetscObjectComm((PetscObject)B),PETSC_FALSE,bsiz2,nullvecs2,&NullSpace);
5396: MatCreateDense(PetscObjectComm((PetscObject)B),n,PETSC_DECIDE,N,bsiz2,ddata,&dmat);
5397: PetscContainerCreate(PetscObjectComm((PetscObject)B),&c);
5398: PetscContainerSetPointer(c,ddata);
5399: PetscContainerSetUserDestroy(c,PetscContainerUserDestroyDefault);
5400: PetscObjectCompose((PetscObject)dmat,"_PBDDC_Null_dmat_arr",(PetscObject)c);
5401: PetscContainerDestroy(&c);
5402: PetscObjectCompose((PetscObject)NullSpace,"_PBDDC_Null_dmat",(PetscObject)dmat);
5403: MatDestroy(&dmat);
5405: for (k=0;k<bsiz;k++) {
5406: VecDestroy(&nullvecs2[k]);
5407: }
5408: PetscFree(nullvecs2);
5409: MatSetNearNullSpace(B,NullSpace);
5410: MatNullSpaceDestroy(&NullSpace);
5411: VecDestroy(&v);
5412: VecDestroy(&v2);
5413: VecScatterDestroy(&sct);
5414: return(0);
5415: }
5417: PetscErrorCode PCBDDCSetUpLocalSolvers(PC pc, PetscBool dirichlet, PetscBool neumann)
5418: {
5419: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
5420: PC_IS *pcis = (PC_IS*)pc->data;
5421: PC pc_temp;
5422: Mat A_RR;
5423: MatNullSpace nnsp;
5424: MatReuse reuse;
5425: PetscScalar m_one = -1.0;
5426: PetscReal value;
5427: PetscInt n_D,n_R;
5428: PetscBool issbaij,opts;
5430: void (*f)(void) = 0;
5431: char dir_prefix[256],neu_prefix[256],str_level[16];
5432: size_t len;
5435: PetscLogEventBegin(PC_BDDC_LocalSolvers[pcbddc->current_level],pc,0,0,0);
5436: /* approximate solver, propagate NearNullSpace if needed */
5437: if (!pc->setupcalled && (pcbddc->NullSpace_corr[0] || pcbddc->NullSpace_corr[2])) {
5438: MatNullSpace gnnsp1,gnnsp2;
5439: PetscBool lhas,ghas;
5441: MatGetNearNullSpace(pcbddc->local_mat,&nnsp);
5442: MatGetNearNullSpace(pc->pmat,&gnnsp1);
5443: MatGetNullSpace(pc->pmat,&gnnsp2);
5444: lhas = nnsp ? PETSC_TRUE : PETSC_FALSE;
5445: MPIU_Allreduce(&lhas,&ghas,1,MPIU_BOOL,MPI_LOR,PetscObjectComm((PetscObject)pc));
5446: if (!ghas && (gnnsp1 || gnnsp2)) {
5447: MatNullSpacePropagateAny_Private(pc->pmat,NULL,NULL);
5448: }
5449: }
5451: /* compute prefixes */
5452: PetscStrcpy(dir_prefix,"");
5453: PetscStrcpy(neu_prefix,"");
5454: if (!pcbddc->current_level) {
5455: PetscStrncpy(dir_prefix,((PetscObject)pc)->prefix,sizeof(dir_prefix));
5456: PetscStrncpy(neu_prefix,((PetscObject)pc)->prefix,sizeof(neu_prefix));
5457: PetscStrlcat(dir_prefix,"pc_bddc_dirichlet_",sizeof(dir_prefix));
5458: PetscStrlcat(neu_prefix,"pc_bddc_neumann_",sizeof(neu_prefix));
5459: } else {
5460: PetscSNPrintf(str_level,sizeof(str_level),"l%d_",(int)(pcbddc->current_level));
5461: PetscStrlen(((PetscObject)pc)->prefix,&len);
5462: len -= 15; /* remove "pc_bddc_coarse_" */
5463: if (pcbddc->current_level>1) len -= 3; /* remove "lX_" with X level number */
5464: if (pcbddc->current_level>10) len -= 1; /* remove another char from level number */
5465: /* Nonstandard use of PetscStrncpy() to only copy a portion of the input string */
5466: PetscStrncpy(dir_prefix,((PetscObject)pc)->prefix,len+1);
5467: PetscStrncpy(neu_prefix,((PetscObject)pc)->prefix,len+1);
5468: PetscStrlcat(dir_prefix,"pc_bddc_dirichlet_",sizeof(dir_prefix));
5469: PetscStrlcat(neu_prefix,"pc_bddc_neumann_",sizeof(neu_prefix));
5470: PetscStrlcat(dir_prefix,str_level,sizeof(dir_prefix));
5471: PetscStrlcat(neu_prefix,str_level,sizeof(neu_prefix));
5472: }
5474: /* DIRICHLET PROBLEM */
5475: if (dirichlet) {
5476: PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs;
5477: if (pcbddc->benign_n && !pcbddc->benign_change_explicit) {
5478: if (!sub_schurs || !sub_schurs->reuse_solver) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not yet implemented");
5479: if (pcbddc->dbg_flag) {
5480: Mat A_IIn;
5482: PCBDDCBenignProject(pc,pcis->is_I_local,pcis->is_I_local,&A_IIn);
5483: MatDestroy(&pcis->A_II);
5484: pcis->A_II = A_IIn;
5485: }
5486: }
5487: if (pcbddc->local_mat->symmetric_set) {
5488: MatSetOption(pcis->A_II,MAT_SYMMETRIC,pcbddc->local_mat->symmetric);
5489: }
5490: /* Matrix for Dirichlet problem is pcis->A_II */
5491: n_D = pcis->n - pcis->n_B;
5492: opts = PETSC_FALSE;
5493: if (!pcbddc->ksp_D) { /* create object if not yet build */
5494: opts = PETSC_TRUE;
5495: KSPCreate(PETSC_COMM_SELF,&pcbddc->ksp_D);
5496: PetscObjectIncrementTabLevel((PetscObject)pcbddc->ksp_D,(PetscObject)pc,1);
5497: /* default */
5498: KSPSetType(pcbddc->ksp_D,KSPPREONLY);
5499: KSPSetOptionsPrefix(pcbddc->ksp_D,dir_prefix);
5500: PetscObjectTypeCompare((PetscObject)pcis->pA_II,MATSEQSBAIJ,&issbaij);
5501: KSPGetPC(pcbddc->ksp_D,&pc_temp);
5502: if (issbaij) {
5503: PCSetType(pc_temp,PCCHOLESKY);
5504: } else {
5505: PCSetType(pc_temp,PCLU);
5506: }
5507: KSPSetErrorIfNotConverged(pcbddc->ksp_D,pc->erroriffailure);
5508: }
5509: MatSetOptionsPrefix(pcis->pA_II,((PetscObject)pcbddc->ksp_D)->prefix);
5510: KSPSetOperators(pcbddc->ksp_D,pcis->A_II,pcis->pA_II);
5511: /* Allow user's customization */
5512: if (opts) {
5513: KSPSetFromOptions(pcbddc->ksp_D);
5514: }
5515: MatGetNearNullSpace(pcis->pA_II,&nnsp);
5516: if (pcbddc->NullSpace_corr[0] && !nnsp) { /* approximate solver, propagate NearNullSpace */
5517: MatNullSpacePropagateAny_Private(pcbddc->local_mat,pcis->is_I_local,pcis->pA_II);
5518: }
5519: MatGetNearNullSpace(pcis->pA_II,&nnsp);
5520: KSPGetPC(pcbddc->ksp_D,&pc_temp);
5521: PetscObjectQueryFunction((PetscObject)pc_temp,"PCSetCoordinates_C",&f);
5522: if (f && pcbddc->mat_graph->cloc && !nnsp) {
5523: PetscReal *coords = pcbddc->mat_graph->coords,*scoords;
5524: const PetscInt *idxs;
5525: PetscInt cdim = pcbddc->mat_graph->cdim,nl,i,d;
5527: ISGetLocalSize(pcis->is_I_local,&nl);
5528: ISGetIndices(pcis->is_I_local,&idxs);
5529: PetscMalloc1(nl*cdim,&scoords);
5530: for (i=0;i<nl;i++) {
5531: for (d=0;d<cdim;d++) {
5532: scoords[i*cdim+d] = coords[idxs[i]*cdim+d];
5533: }
5534: }
5535: ISRestoreIndices(pcis->is_I_local,&idxs);
5536: PCSetCoordinates(pc_temp,cdim,nl,scoords);
5537: PetscFree(scoords);
5538: }
5539: if (sub_schurs && sub_schurs->reuse_solver) {
5540: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5542: KSPSetPC(pcbddc->ksp_D,reuse_solver->interior_solver);
5543: }
5545: /* umfpack interface has a bug when matrix dimension is zero. TODO solve from umfpack interface */
5546: if (!n_D) {
5547: KSPGetPC(pcbddc->ksp_D,&pc_temp);
5548: PCSetType(pc_temp,PCNONE);
5549: }
5550: KSPSetUp(pcbddc->ksp_D);
5551: /* set ksp_D into pcis data */
5552: PetscObjectReference((PetscObject)pcbddc->ksp_D);
5553: KSPDestroy(&pcis->ksp_D);
5554: pcis->ksp_D = pcbddc->ksp_D;
5555: }
5557: /* NEUMANN PROBLEM */
5558: A_RR = 0;
5559: if (neumann) {
5560: PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs;
5561: PetscInt ibs,mbs;
5562: PetscBool issbaij, reuse_neumann_solver;
5563: Mat_IS* matis = (Mat_IS*)pc->pmat->data;
5565: reuse_neumann_solver = PETSC_FALSE;
5566: if (sub_schurs && sub_schurs->reuse_solver) {
5567: IS iP;
5569: reuse_neumann_solver = PETSC_TRUE;
5570: PetscObjectQuery((PetscObject)sub_schurs->A,"__KSPFETIDP_iP",(PetscObject*)&iP);
5571: if (iP) reuse_neumann_solver = PETSC_FALSE;
5572: }
5573: /* Matrix for Neumann problem is A_RR -> we need to create/reuse it at this point */
5574: ISGetSize(pcbddc->is_R_local,&n_R);
5575: if (pcbddc->ksp_R) { /* already created ksp */
5576: PetscInt nn_R;
5577: KSPGetOperators(pcbddc->ksp_R,NULL,&A_RR);
5578: PetscObjectReference((PetscObject)A_RR);
5579: MatGetSize(A_RR,&nn_R,NULL);
5580: if (nn_R != n_R) { /* old ksp is not reusable, so reset it */
5581: KSPReset(pcbddc->ksp_R);
5582: MatDestroy(&A_RR);
5583: reuse = MAT_INITIAL_MATRIX;
5584: } else { /* same sizes, but nonzero pattern depend on primal vertices so it can be changed */
5585: if (pcbddc->new_primal_space_local) { /* we are not sure the matrix will have the same nonzero pattern */
5586: MatDestroy(&A_RR);
5587: reuse = MAT_INITIAL_MATRIX;
5588: } else { /* safe to reuse the matrix */
5589: reuse = MAT_REUSE_MATRIX;
5590: }
5591: }
5592: /* last check */
5593: if (pc->flag == DIFFERENT_NONZERO_PATTERN) {
5594: MatDestroy(&A_RR);
5595: reuse = MAT_INITIAL_MATRIX;
5596: }
5597: } else { /* first time, so we need to create the matrix */
5598: reuse = MAT_INITIAL_MATRIX;
5599: }
5600: /* convert pcbddc->local_mat if needed later in PCBDDCSetUpCorrection
5601: TODO: Get Rid of these conversions */
5602: MatGetBlockSize(pcbddc->local_mat,&mbs);
5603: ISGetBlockSize(pcbddc->is_R_local,&ibs);
5604: PetscObjectTypeCompare((PetscObject)pcbddc->local_mat,MATSEQSBAIJ,&issbaij);
5605: if (ibs != mbs) { /* need to convert to SEQAIJ to extract any submatrix with is_R_local */
5606: if (matis->A == pcbddc->local_mat) {
5607: MatDestroy(&pcbddc->local_mat);
5608: MatConvert(matis->A,MATSEQAIJ,MAT_INITIAL_MATRIX,&pcbddc->local_mat);
5609: } else {
5610: MatConvert(pcbddc->local_mat,MATSEQAIJ,MAT_INPLACE_MATRIX,&pcbddc->local_mat);
5611: }
5612: } else if (issbaij) { /* need to convert to BAIJ to get offdiagonal blocks */
5613: if (matis->A == pcbddc->local_mat) {
5614: MatDestroy(&pcbddc->local_mat);
5615: MatConvert(matis->A,mbs > 1 ? MATSEQBAIJ : MATSEQAIJ,MAT_INITIAL_MATRIX,&pcbddc->local_mat);
5616: } else {
5617: MatConvert(pcbddc->local_mat,mbs > 1 ? MATSEQBAIJ : MATSEQAIJ,MAT_INPLACE_MATRIX,&pcbddc->local_mat);
5618: }
5619: }
5620: /* extract A_RR */
5621: if (reuse_neumann_solver) {
5622: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5624: if (pcbddc->dbg_flag) { /* we need A_RR to test the solver later */
5625: MatDestroy(&A_RR);
5626: if (reuse_solver->benign_n) { /* we are not using the explicit change of basis on the pressures */
5627: PCBDDCBenignProject(pc,pcbddc->is_R_local,pcbddc->is_R_local,&A_RR);
5628: } else {
5629: MatCreateSubMatrix(pcbddc->local_mat,pcbddc->is_R_local,pcbddc->is_R_local,MAT_INITIAL_MATRIX,&A_RR);
5630: }
5631: } else {
5632: MatDestroy(&A_RR);
5633: PCGetOperators(reuse_solver->correction_solver,&A_RR,NULL);
5634: PetscObjectReference((PetscObject)A_RR);
5635: }
5636: } else { /* we have to build the neumann solver, so we need to extract the relevant matrix */
5637: MatCreateSubMatrix(pcbddc->local_mat,pcbddc->is_R_local,pcbddc->is_R_local,reuse,&A_RR);
5638: }
5639: if (pcbddc->local_mat->symmetric_set) {
5640: MatSetOption(A_RR,MAT_SYMMETRIC,pcbddc->local_mat->symmetric);
5641: }
5642: opts = PETSC_FALSE;
5643: if (!pcbddc->ksp_R) { /* create object if not present */
5644: opts = PETSC_TRUE;
5645: KSPCreate(PETSC_COMM_SELF,&pcbddc->ksp_R);
5646: PetscObjectIncrementTabLevel((PetscObject)pcbddc->ksp_R,(PetscObject)pc,1);
5647: /* default */
5648: KSPSetType(pcbddc->ksp_R,KSPPREONLY);
5649: KSPSetOptionsPrefix(pcbddc->ksp_R,neu_prefix);
5650: KSPGetPC(pcbddc->ksp_R,&pc_temp);
5651: PetscObjectTypeCompare((PetscObject)A_RR,MATSEQSBAIJ,&issbaij);
5652: if (issbaij) {
5653: PCSetType(pc_temp,PCCHOLESKY);
5654: } else {
5655: PCSetType(pc_temp,PCLU);
5656: }
5657: KSPSetErrorIfNotConverged(pcbddc->ksp_R,pc->erroriffailure);
5658: }
5659: KSPSetOperators(pcbddc->ksp_R,A_RR,A_RR);
5660: MatSetOptionsPrefix(A_RR,((PetscObject)pcbddc->ksp_R)->prefix);
5661: if (opts) { /* Allow user's customization once */
5662: KSPSetFromOptions(pcbddc->ksp_R);
5663: }
5664: MatGetNearNullSpace(A_RR,&nnsp);
5665: if (pcbddc->NullSpace_corr[2] && !nnsp) { /* approximate solver, propagate NearNullSpace */
5666: MatNullSpacePropagateAny_Private(pcbddc->local_mat,pcbddc->is_R_local,A_RR);
5667: }
5668: MatGetNearNullSpace(A_RR,&nnsp);
5669: KSPGetPC(pcbddc->ksp_R,&pc_temp);
5670: PetscObjectQueryFunction((PetscObject)pc_temp,"PCSetCoordinates_C",&f);
5671: if (f && pcbddc->mat_graph->cloc && !nnsp) {
5672: PetscReal *coords = pcbddc->mat_graph->coords,*scoords;
5673: const PetscInt *idxs;
5674: PetscInt cdim = pcbddc->mat_graph->cdim,nl,i,d;
5676: ISGetLocalSize(pcbddc->is_R_local,&nl);
5677: ISGetIndices(pcbddc->is_R_local,&idxs);
5678: PetscMalloc1(nl*cdim,&scoords);
5679: for (i=0;i<nl;i++) {
5680: for (d=0;d<cdim;d++) {
5681: scoords[i*cdim+d] = coords[idxs[i]*cdim+d];
5682: }
5683: }
5684: ISRestoreIndices(pcbddc->is_R_local,&idxs);
5685: PCSetCoordinates(pc_temp,cdim,nl,scoords);
5686: PetscFree(scoords);
5687: }
5689: /* umfpack interface has a bug when matrix dimension is zero. TODO solve from umfpack interface */
5690: if (!n_R) {
5691: KSPGetPC(pcbddc->ksp_R,&pc_temp);
5692: PCSetType(pc_temp,PCNONE);
5693: }
5694: /* Reuse solver if it is present */
5695: if (reuse_neumann_solver) {
5696: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5698: KSPSetPC(pcbddc->ksp_R,reuse_solver->correction_solver);
5699: }
5700: KSPSetUp(pcbddc->ksp_R);
5701: }
5703: if (pcbddc->dbg_flag) {
5704: PetscViewerFlush(pcbddc->dbg_viewer);
5705: PetscViewerASCIIPushSynchronized(pcbddc->dbg_viewer);
5706: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"--------------------------------------------------\n");
5707: }
5708: PetscLogEventEnd(PC_BDDC_LocalSolvers[pcbddc->current_level],pc,0,0,0);
5710: /* adapt Dirichlet and Neumann solvers if a nullspace correction has been requested */
5711: if (pcbddc->NullSpace_corr[0]) {
5712: PCBDDCSetUseExactDirichlet(pc,PETSC_FALSE);
5713: }
5714: if (dirichlet && pcbddc->NullSpace_corr[0] && !pcbddc->switch_static) {
5715: PCBDDCNullSpaceAssembleCorrection(pc,PETSC_TRUE,pcbddc->NullSpace_corr[1]);
5716: }
5717: if (neumann && pcbddc->NullSpace_corr[2]) {
5718: PCBDDCNullSpaceAssembleCorrection(pc,PETSC_FALSE,pcbddc->NullSpace_corr[3]);
5719: }
5720: /* check Dirichlet and Neumann solvers */
5721: if (pcbddc->dbg_flag) {
5722: if (dirichlet) { /* Dirichlet */
5723: VecSetRandom(pcis->vec1_D,NULL);
5724: MatMult(pcis->A_II,pcis->vec1_D,pcis->vec2_D);
5725: KSPSolve(pcbddc->ksp_D,pcis->vec2_D,pcis->vec2_D);
5726: KSPCheckSolve(pcbddc->ksp_D,pc,pcis->vec2_D);
5727: VecAXPY(pcis->vec1_D,m_one,pcis->vec2_D);
5728: VecNorm(pcis->vec1_D,NORM_INFINITY,&value);
5729: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d infinity error for Dirichlet solve (%s) = % 1.14e \n",PetscGlobalRank,((PetscObject)(pcbddc->ksp_D))->prefix,value);
5730: PetscViewerFlush(pcbddc->dbg_viewer);
5731: }
5732: if (neumann) { /* Neumann */
5733: VecSetRandom(pcbddc->vec1_R,NULL);
5734: MatMult(A_RR,pcbddc->vec1_R,pcbddc->vec2_R);
5735: KSPSolve(pcbddc->ksp_R,pcbddc->vec2_R,pcbddc->vec2_R);
5736: KSPCheckSolve(pcbddc->ksp_R,pc,pcbddc->vec2_R);
5737: VecAXPY(pcbddc->vec1_R,m_one,pcbddc->vec2_R);
5738: VecNorm(pcbddc->vec1_R,NORM_INFINITY,&value);
5739: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d infinity error for Neumann solve (%s) = % 1.14e\n",PetscGlobalRank,((PetscObject)(pcbddc->ksp_R))->prefix,value);
5740: PetscViewerFlush(pcbddc->dbg_viewer);
5741: }
5742: }
5743: /* free Neumann problem's matrix */
5744: MatDestroy(&A_RR);
5745: return(0);
5746: }
5748: static PetscErrorCode PCBDDCSolveSubstructureCorrection(PC pc, Vec inout_B, Vec inout_D, PetscBool applytranspose)
5749: {
5750: PetscErrorCode ierr;
5751: PC_BDDC* pcbddc = (PC_BDDC*)(pc->data);
5752: PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs;
5753: PetscBool reuse_solver = sub_schurs ? ( sub_schurs->reuse_solver ? PETSC_TRUE : PETSC_FALSE ) : PETSC_FALSE;
5756: if (!reuse_solver) {
5757: VecSet(pcbddc->vec1_R,0.);
5758: }
5759: if (!pcbddc->switch_static) {
5760: if (applytranspose && pcbddc->local_auxmat1) {
5761: MatMultTranspose(pcbddc->local_auxmat2,inout_B,pcbddc->vec1_C);
5762: MatMultTransposeAdd(pcbddc->local_auxmat1,pcbddc->vec1_C,inout_B,inout_B);
5763: }
5764: if (!reuse_solver) {
5765: VecScatterBegin(pcbddc->R_to_B,inout_B,pcbddc->vec1_R,INSERT_VALUES,SCATTER_REVERSE);
5766: VecScatterEnd(pcbddc->R_to_B,inout_B,pcbddc->vec1_R,INSERT_VALUES,SCATTER_REVERSE);
5767: } else {
5768: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5770: VecScatterBegin(reuse_solver->correction_scatter_B,inout_B,reuse_solver->rhs_B,INSERT_VALUES,SCATTER_FORWARD);
5771: VecScatterEnd(reuse_solver->correction_scatter_B,inout_B,reuse_solver->rhs_B,INSERT_VALUES,SCATTER_FORWARD);
5772: }
5773: } else {
5774: VecScatterBegin(pcbddc->R_to_B,inout_B,pcbddc->vec1_R,INSERT_VALUES,SCATTER_REVERSE);
5775: VecScatterEnd(pcbddc->R_to_B,inout_B,pcbddc->vec1_R,INSERT_VALUES,SCATTER_REVERSE);
5776: VecScatterBegin(pcbddc->R_to_D,inout_D,pcbddc->vec1_R,INSERT_VALUES,SCATTER_REVERSE);
5777: VecScatterEnd(pcbddc->R_to_D,inout_D,pcbddc->vec1_R,INSERT_VALUES,SCATTER_REVERSE);
5778: if (applytranspose && pcbddc->local_auxmat1) {
5779: MatMultTranspose(pcbddc->local_auxmat2,pcbddc->vec1_R,pcbddc->vec1_C);
5780: MatMultTransposeAdd(pcbddc->local_auxmat1,pcbddc->vec1_C,inout_B,inout_B);
5781: VecScatterBegin(pcbddc->R_to_B,inout_B,pcbddc->vec1_R,INSERT_VALUES,SCATTER_REVERSE);
5782: VecScatterEnd(pcbddc->R_to_B,inout_B,pcbddc->vec1_R,INSERT_VALUES,SCATTER_REVERSE);
5783: }
5784: }
5785: if (!reuse_solver || pcbddc->switch_static) {
5786: if (applytranspose) {
5787: KSPSolveTranspose(pcbddc->ksp_R,pcbddc->vec1_R,pcbddc->vec1_R);
5788: } else {
5789: KSPSolve(pcbddc->ksp_R,pcbddc->vec1_R,pcbddc->vec1_R);
5790: }
5791: KSPCheckSolve(pcbddc->ksp_R,pc,pcbddc->vec1_R);
5792: } else {
5793: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5795: if (applytranspose) {
5796: MatFactorSolveSchurComplementTranspose(reuse_solver->F,reuse_solver->rhs_B,reuse_solver->sol_B);
5797: } else {
5798: MatFactorSolveSchurComplement(reuse_solver->F,reuse_solver->rhs_B,reuse_solver->sol_B);
5799: }
5800: }
5801: VecSet(inout_B,0.);
5802: if (!pcbddc->switch_static) {
5803: if (!reuse_solver) {
5804: VecScatterBegin(pcbddc->R_to_B,pcbddc->vec1_R,inout_B,INSERT_VALUES,SCATTER_FORWARD);
5805: VecScatterEnd(pcbddc->R_to_B,pcbddc->vec1_R,inout_B,INSERT_VALUES,SCATTER_FORWARD);
5806: } else {
5807: PCBDDCReuseSolvers reuse_solver = sub_schurs->reuse_solver;
5809: VecScatterBegin(reuse_solver->correction_scatter_B,reuse_solver->sol_B,inout_B,INSERT_VALUES,SCATTER_REVERSE);
5810: VecScatterEnd(reuse_solver->correction_scatter_B,reuse_solver->sol_B,inout_B,INSERT_VALUES,SCATTER_REVERSE);
5811: }
5812: if (!applytranspose && pcbddc->local_auxmat1) {
5813: MatMult(pcbddc->local_auxmat1,inout_B,pcbddc->vec1_C);
5814: MatMultAdd(pcbddc->local_auxmat2,pcbddc->vec1_C,inout_B,inout_B);
5815: }
5816: } else {
5817: VecScatterBegin(pcbddc->R_to_B,pcbddc->vec1_R,inout_B,INSERT_VALUES,SCATTER_FORWARD);
5818: VecScatterEnd(pcbddc->R_to_B,pcbddc->vec1_R,inout_B,INSERT_VALUES,SCATTER_FORWARD);
5819: VecScatterBegin(pcbddc->R_to_D,pcbddc->vec1_R,inout_D,INSERT_VALUES,SCATTER_FORWARD);
5820: VecScatterEnd(pcbddc->R_to_D,pcbddc->vec1_R,inout_D,INSERT_VALUES,SCATTER_FORWARD);
5821: if (!applytranspose && pcbddc->local_auxmat1) {
5822: MatMult(pcbddc->local_auxmat1,inout_B,pcbddc->vec1_C);
5823: MatMultAdd(pcbddc->local_auxmat2,pcbddc->vec1_C,pcbddc->vec1_R,pcbddc->vec1_R);
5824: }
5825: VecScatterBegin(pcbddc->R_to_B,pcbddc->vec1_R,inout_B,INSERT_VALUES,SCATTER_FORWARD);
5826: VecScatterEnd(pcbddc->R_to_B,pcbddc->vec1_R,inout_B,INSERT_VALUES,SCATTER_FORWARD);
5827: VecScatterBegin(pcbddc->R_to_D,pcbddc->vec1_R,inout_D,INSERT_VALUES,SCATTER_FORWARD);
5828: VecScatterEnd(pcbddc->R_to_D,pcbddc->vec1_R,inout_D,INSERT_VALUES,SCATTER_FORWARD);
5829: }
5830: return(0);
5831: }
5833: /* parameter apply transpose determines if the interface preconditioner should be applied transposed or not */
5834: PetscErrorCode PCBDDCApplyInterfacePreconditioner(PC pc, PetscBool applytranspose)
5835: {
5837: PC_BDDC* pcbddc = (PC_BDDC*)(pc->data);
5838: PC_IS* pcis = (PC_IS*) (pc->data);
5839: const PetscScalar zero = 0.0;
5842: /* Application of PSI^T or PHI^T (depending on applytranspose, see comment above) */
5843: if (!pcbddc->benign_apply_coarse_only) {
5844: if (applytranspose) {
5845: MatMultTranspose(pcbddc->coarse_phi_B,pcis->vec1_B,pcbddc->vec1_P);
5846: if (pcbddc->switch_static) { MatMultTransposeAdd(pcbddc->coarse_phi_D,pcis->vec1_D,pcbddc->vec1_P,pcbddc->vec1_P); }
5847: } else {
5848: MatMultTranspose(pcbddc->coarse_psi_B,pcis->vec1_B,pcbddc->vec1_P);
5849: if (pcbddc->switch_static) { MatMultTransposeAdd(pcbddc->coarse_psi_D,pcis->vec1_D,pcbddc->vec1_P,pcbddc->vec1_P); }
5850: }
5851: } else {
5852: VecSet(pcbddc->vec1_P,zero);
5853: }
5855: /* add p0 to the last value of vec1_P holding the coarse dof relative to p0 */
5856: if (pcbddc->benign_n) {
5857: PetscScalar *array;
5858: PetscInt j;
5860: VecGetArray(pcbddc->vec1_P,&array);
5861: for (j=0;j<pcbddc->benign_n;j++) array[pcbddc->local_primal_size-pcbddc->benign_n+j] += pcbddc->benign_p0[j];
5862: VecRestoreArray(pcbddc->vec1_P,&array);
5863: }
5865: /* start communications from local primal nodes to rhs of coarse solver */
5866: VecSet(pcbddc->coarse_vec,zero);
5867: PCBDDCScatterCoarseDataBegin(pc,ADD_VALUES,SCATTER_FORWARD);
5868: PCBDDCScatterCoarseDataEnd(pc,ADD_VALUES,SCATTER_FORWARD);
5870: /* Coarse solution -> rhs and sol updated inside PCBDDCScattarCoarseDataBegin/End */
5871: if (pcbddc->coarse_ksp) {
5872: Mat coarse_mat;
5873: Vec rhs,sol;
5874: MatNullSpace nullsp;
5875: PetscBool isbddc = PETSC_FALSE;
5877: if (pcbddc->benign_have_null) {
5878: PC coarse_pc;
5880: KSPGetPC(pcbddc->coarse_ksp,&coarse_pc);
5881: PetscObjectTypeCompare((PetscObject)coarse_pc,PCBDDC,&isbddc);
5882: /* we need to propagate to coarser levels the need for a possible benign correction */
5883: if (isbddc && pcbddc->benign_apply_coarse_only && !pcbddc->benign_skip_correction) {
5884: PC_BDDC* coarsepcbddc = (PC_BDDC*)(coarse_pc->data);
5885: coarsepcbddc->benign_skip_correction = PETSC_FALSE;
5886: coarsepcbddc->benign_apply_coarse_only = PETSC_TRUE;
5887: }
5888: }
5889: KSPGetRhs(pcbddc->coarse_ksp,&rhs);
5890: KSPGetSolution(pcbddc->coarse_ksp,&sol);
5891: KSPGetOperators(pcbddc->coarse_ksp,&coarse_mat,NULL);
5892: if (applytranspose) {
5893: if (pcbddc->benign_apply_coarse_only) SETERRQ(PetscObjectComm((PetscObject)pcbddc->coarse_ksp),PETSC_ERR_SUP,"Not yet implemented");
5894: KSPSolveTranspose(pcbddc->coarse_ksp,rhs,sol);
5895: KSPCheckSolve(pcbddc->coarse_ksp,pc,sol);
5896: MatGetTransposeNullSpace(coarse_mat,&nullsp);
5897: if (nullsp) {
5898: MatNullSpaceRemove(nullsp,sol);
5899: }
5900: } else {
5901: MatGetNullSpace(coarse_mat,&nullsp);
5902: if (pcbddc->benign_apply_coarse_only && isbddc) { /* need just to apply the coarse preconditioner during presolve */
5903: PC coarse_pc;
5905: if (nullsp) {
5906: MatNullSpaceRemove(nullsp,rhs);
5907: }
5908: KSPGetPC(pcbddc->coarse_ksp,&coarse_pc);
5909: PCPreSolve(coarse_pc,pcbddc->coarse_ksp);
5910: PCBDDCBenignRemoveInterior(coarse_pc,rhs,sol);
5911: PCPostSolve(coarse_pc,pcbddc->coarse_ksp);
5912: } else {
5913: KSPSolve(pcbddc->coarse_ksp,rhs,sol);
5914: KSPCheckSolve(pcbddc->coarse_ksp,pc,sol);
5915: if (nullsp) {
5916: MatNullSpaceRemove(nullsp,sol);
5917: }
5918: }
5919: }
5920: /* we don't need the benign correction at coarser levels anymore */
5921: if (pcbddc->benign_have_null && isbddc) {
5922: PC coarse_pc;
5923: PC_BDDC* coarsepcbddc;
5925: KSPGetPC(pcbddc->coarse_ksp,&coarse_pc);
5926: coarsepcbddc = (PC_BDDC*)(coarse_pc->data);
5927: coarsepcbddc->benign_skip_correction = PETSC_TRUE;
5928: coarsepcbddc->benign_apply_coarse_only = PETSC_FALSE;
5929: }
5930: }
5932: /* Local solution on R nodes */
5933: if (pcis->n && !pcbddc->benign_apply_coarse_only) {
5934: PCBDDCSolveSubstructureCorrection(pc,pcis->vec1_B,pcis->vec1_D,applytranspose);
5935: }
5936: /* communications from coarse sol to local primal nodes */
5937: PCBDDCScatterCoarseDataBegin(pc,INSERT_VALUES,SCATTER_REVERSE);
5938: PCBDDCScatterCoarseDataEnd(pc,INSERT_VALUES,SCATTER_REVERSE);
5940: /* Sum contributions from the two levels */
5941: if (!pcbddc->benign_apply_coarse_only) {
5942: if (applytranspose) {
5943: MatMultAdd(pcbddc->coarse_psi_B,pcbddc->vec1_P,pcis->vec1_B,pcis->vec1_B);
5944: if (pcbddc->switch_static) { MatMultAdd(pcbddc->coarse_psi_D,pcbddc->vec1_P,pcis->vec1_D,pcis->vec1_D); }
5945: } else {
5946: MatMultAdd(pcbddc->coarse_phi_B,pcbddc->vec1_P,pcis->vec1_B,pcis->vec1_B);
5947: if (pcbddc->switch_static) { MatMultAdd(pcbddc->coarse_phi_D,pcbddc->vec1_P,pcis->vec1_D,pcis->vec1_D); }
5948: }
5949: /* store p0 */
5950: if (pcbddc->benign_n) {
5951: PetscScalar *array;
5952: PetscInt j;
5954: VecGetArray(pcbddc->vec1_P,&array);
5955: for (j=0;j<pcbddc->benign_n;j++) pcbddc->benign_p0[j] = array[pcbddc->local_primal_size-pcbddc->benign_n+j];
5956: VecRestoreArray(pcbddc->vec1_P,&array);
5957: }
5958: } else { /* expand the coarse solution */
5959: if (applytranspose) {
5960: MatMult(pcbddc->coarse_psi_B,pcbddc->vec1_P,pcis->vec1_B);
5961: } else {
5962: MatMult(pcbddc->coarse_phi_B,pcbddc->vec1_P,pcis->vec1_B);
5963: }
5964: }
5965: return(0);
5966: }
5968: PetscErrorCode PCBDDCScatterCoarseDataBegin(PC pc,InsertMode imode, ScatterMode smode)
5969: {
5970: PC_BDDC* pcbddc = (PC_BDDC*)(pc->data);
5971: Vec from,to;
5972: const PetscScalar *array;
5973: PetscErrorCode ierr;
5976: if (smode == SCATTER_REVERSE) { /* from global to local -> get data from coarse solution */
5977: from = pcbddc->coarse_vec;
5978: to = pcbddc->vec1_P;
5979: if (pcbddc->coarse_ksp) { /* get array from coarse processes */
5980: Vec tvec;
5982: KSPGetRhs(pcbddc->coarse_ksp,&tvec);
5983: VecResetArray(tvec);
5984: KSPGetSolution(pcbddc->coarse_ksp,&tvec);
5985: VecGetArrayRead(tvec,&array);
5986: VecPlaceArray(from,array);
5987: VecRestoreArrayRead(tvec,&array);
5988: }
5989: } else { /* from local to global -> put data in coarse right hand side */
5990: from = pcbddc->vec1_P;
5991: to = pcbddc->coarse_vec;
5992: }
5993: VecScatterBegin(pcbddc->coarse_loc_to_glob,from,to,imode,smode);
5994: return(0);
5995: }
5997: PetscErrorCode PCBDDCScatterCoarseDataEnd(PC pc, InsertMode imode, ScatterMode smode)
5998: {
5999: PC_BDDC* pcbddc = (PC_BDDC*)(pc->data);
6000: Vec from,to;
6001: const PetscScalar *array;
6002: PetscErrorCode ierr;
6005: if (smode == SCATTER_REVERSE) { /* from global to local -> get data from coarse solution */
6006: from = pcbddc->coarse_vec;
6007: to = pcbddc->vec1_P;
6008: } else { /* from local to global -> put data in coarse right hand side */
6009: from = pcbddc->vec1_P;
6010: to = pcbddc->coarse_vec;
6011: }
6012: VecScatterEnd(pcbddc->coarse_loc_to_glob,from,to,imode,smode);
6013: if (smode == SCATTER_FORWARD) {
6014: if (pcbddc->coarse_ksp) { /* get array from coarse processes */
6015: Vec tvec;
6017: KSPGetRhs(pcbddc->coarse_ksp,&tvec);
6018: VecGetArrayRead(to,&array);
6019: VecPlaceArray(tvec,array);
6020: VecRestoreArrayRead(to,&array);
6021: }
6022: } else {
6023: if (pcbddc->coarse_ksp) { /* restore array of pcbddc->coarse_vec */
6024: VecResetArray(from);
6025: }
6026: }
6027: return(0);
6028: }
6030: PetscErrorCode PCBDDCConstraintsSetUp(PC pc)
6031: {
6032: PetscErrorCode ierr;
6033: PC_IS* pcis = (PC_IS*)(pc->data);
6034: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
6035: Mat_IS* matis = (Mat_IS*)pc->pmat->data;
6036: /* one and zero */
6037: PetscScalar one=1.0,zero=0.0;
6038: /* space to store constraints and their local indices */
6039: PetscScalar *constraints_data;
6040: PetscInt *constraints_idxs,*constraints_idxs_B;
6041: PetscInt *constraints_idxs_ptr,*constraints_data_ptr;
6042: PetscInt *constraints_n;
6043: /* iterators */
6044: PetscInt i,j,k,total_counts,total_counts_cc,cum;
6045: /* BLAS integers */
6046: PetscBLASInt lwork,lierr;
6047: PetscBLASInt Blas_N,Blas_M,Blas_K,Blas_one=1;
6048: PetscBLASInt Blas_LDA,Blas_LDB,Blas_LDC;
6049: /* reuse */
6050: PetscInt olocal_primal_size,olocal_primal_size_cc;
6051: PetscInt *olocal_primal_ref_node,*olocal_primal_ref_mult;
6052: /* change of basis */
6053: PetscBool qr_needed;
6054: PetscBT change_basis,qr_needed_idx;
6055: /* auxiliary stuff */
6056: PetscInt *nnz,*is_indices;
6057: PetscInt ncc;
6058: /* some quantities */
6059: PetscInt n_vertices,total_primal_vertices,valid_constraints;
6060: PetscInt size_of_constraint,max_size_of_constraint=0,max_constraints,temp_constraints;
6061: PetscReal tol; /* tolerance for retaining eigenmodes */
6064: tol = PetscSqrtReal(PETSC_SMALL);
6065: /* Destroy Mat objects computed previously */
6066: MatDestroy(&pcbddc->ChangeOfBasisMatrix);
6067: MatDestroy(&pcbddc->ConstraintMatrix);
6068: MatDestroy(&pcbddc->switch_static_change);
6069: /* save info on constraints from previous setup (if any) */
6070: olocal_primal_size = pcbddc->local_primal_size;
6071: olocal_primal_size_cc = pcbddc->local_primal_size_cc;
6072: PetscMalloc2(olocal_primal_size_cc,&olocal_primal_ref_node,olocal_primal_size_cc,&olocal_primal_ref_mult);
6073: PetscArraycpy(olocal_primal_ref_node,pcbddc->local_primal_ref_node,olocal_primal_size_cc);
6074: PetscArraycpy(olocal_primal_ref_mult,pcbddc->local_primal_ref_mult,olocal_primal_size_cc);
6075: PetscFree2(pcbddc->local_primal_ref_node,pcbddc->local_primal_ref_mult);
6076: PetscFree(pcbddc->primal_indices_local_idxs);
6078: if (!pcbddc->adaptive_selection) {
6079: IS ISForVertices,*ISForFaces,*ISForEdges;
6080: MatNullSpace nearnullsp;
6081: const Vec *nearnullvecs;
6082: Vec *localnearnullsp;
6083: PetscScalar *array;
6084: PetscInt n_ISForFaces,n_ISForEdges,nnsp_size;
6085: PetscBool nnsp_has_cnst;
6086: /* LAPACK working arrays for SVD or POD */
6087: PetscBool skip_lapack,boolforchange;
6088: PetscScalar *work;
6089: PetscReal *singular_vals;
6090: #if defined(PETSC_USE_COMPLEX)
6091: PetscReal *rwork;
6092: #endif
6093: PetscScalar *temp_basis = NULL,*correlation_mat = NULL;
6094: PetscBLASInt dummy_int=1;
6095: PetscScalar dummy_scalar=1.;
6096: PetscBool use_pod = PETSC_FALSE;
6098: /* MKL SVD with same input gives different results on different processes! */
6099: #if defined(PETSC_MISSING_LAPACK_GESVD) || defined(PETSC_HAVE_MKL)
6100: use_pod = PETSC_TRUE;
6101: #endif
6102: /* Get index sets for faces, edges and vertices from graph */
6103: PCBDDCGraphGetCandidatesIS(pcbddc->mat_graph,&n_ISForFaces,&ISForFaces,&n_ISForEdges,&ISForEdges,&ISForVertices);
6104: /* print some info */
6105: if (pcbddc->dbg_flag && (!pcbddc->sub_schurs || pcbddc->sub_schurs_rebuild)) {
6106: PetscInt nv;
6108: PCBDDCGraphASCIIView(pcbddc->mat_graph,pcbddc->dbg_flag,pcbddc->dbg_viewer);
6109: ISGetSize(ISForVertices,&nv);
6110: PetscViewerASCIIPushSynchronized(pcbddc->dbg_viewer);
6111: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"--------------------------------------------------------------\n");
6112: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d got %02d local candidate vertices (%D)\n",PetscGlobalRank,nv,pcbddc->use_vertices);
6113: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d got %02d local candidate edges (%D)\n",PetscGlobalRank,n_ISForEdges,pcbddc->use_edges);
6114: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d got %02d local candidate faces (%D)\n",PetscGlobalRank,n_ISForFaces,pcbddc->use_faces);
6115: PetscViewerFlush(pcbddc->dbg_viewer);
6116: PetscViewerASCIIPopSynchronized(pcbddc->dbg_viewer);
6117: }
6119: /* free unneeded index sets */
6120: if (!pcbddc->use_vertices) {
6121: ISDestroy(&ISForVertices);
6122: }
6123: if (!pcbddc->use_edges) {
6124: for (i=0;i<n_ISForEdges;i++) {
6125: ISDestroy(&ISForEdges[i]);
6126: }
6127: PetscFree(ISForEdges);
6128: n_ISForEdges = 0;
6129: }
6130: if (!pcbddc->use_faces) {
6131: for (i=0;i<n_ISForFaces;i++) {
6132: ISDestroy(&ISForFaces[i]);
6133: }
6134: PetscFree(ISForFaces);
6135: n_ISForFaces = 0;
6136: }
6138: /* check if near null space is attached to global mat */
6139: if (pcbddc->use_nnsp) {
6140: MatGetNearNullSpace(pc->pmat,&nearnullsp);
6141: } else nearnullsp = NULL;
6143: if (nearnullsp) {
6144: MatNullSpaceGetVecs(nearnullsp,&nnsp_has_cnst,&nnsp_size,&nearnullvecs);
6145: /* remove any stored info */
6146: MatNullSpaceDestroy(&pcbddc->onearnullspace);
6147: PetscFree(pcbddc->onearnullvecs_state);
6148: /* store information for BDDC solver reuse */
6149: PetscObjectReference((PetscObject)nearnullsp);
6150: pcbddc->onearnullspace = nearnullsp;
6151: PetscMalloc1(nnsp_size,&pcbddc->onearnullvecs_state);
6152: for (i=0;i<nnsp_size;i++) {
6153: PetscObjectStateGet((PetscObject)nearnullvecs[i],&pcbddc->onearnullvecs_state[i]);
6154: }
6155: } else { /* if near null space is not provided BDDC uses constants by default */
6156: nnsp_size = 0;
6157: nnsp_has_cnst = PETSC_TRUE;
6158: }
6159: /* get max number of constraints on a single cc */
6160: max_constraints = nnsp_size;
6161: if (nnsp_has_cnst) max_constraints++;
6163: /*
6164: Evaluate maximum storage size needed by the procedure
6165: - Indices for connected component i stored at "constraints_idxs + constraints_idxs_ptr[i]"
6166: - Values for constraints on connected component i stored at "constraints_data + constraints_data_ptr[i]"
6167: There can be multiple constraints per connected component
6168: */
6169: n_vertices = 0;
6170: if (ISForVertices) {
6171: ISGetSize(ISForVertices,&n_vertices);
6172: }
6173: ncc = n_vertices+n_ISForFaces+n_ISForEdges;
6174: PetscMalloc3(ncc+1,&constraints_idxs_ptr,ncc+1,&constraints_data_ptr,ncc,&constraints_n);
6176: total_counts = n_ISForFaces+n_ISForEdges;
6177: total_counts *= max_constraints;
6178: total_counts += n_vertices;
6179: PetscBTCreate(total_counts,&change_basis);
6181: total_counts = 0;
6182: max_size_of_constraint = 0;
6183: for (i=0;i<n_ISForEdges+n_ISForFaces;i++) {
6184: IS used_is;
6185: if (i<n_ISForEdges) {
6186: used_is = ISForEdges[i];
6187: } else {
6188: used_is = ISForFaces[i-n_ISForEdges];
6189: }
6190: ISGetSize(used_is,&j);
6191: total_counts += j;
6192: max_size_of_constraint = PetscMax(j,max_size_of_constraint);
6193: }
6194: PetscMalloc3(total_counts*max_constraints+n_vertices,&constraints_data,total_counts+n_vertices,&constraints_idxs,total_counts+n_vertices,&constraints_idxs_B);
6196: /* get local part of global near null space vectors */
6197: PetscMalloc1(nnsp_size,&localnearnullsp);
6198: for (k=0;k<nnsp_size;k++) {
6199: VecDuplicate(pcis->vec1_N,&localnearnullsp[k]);
6200: VecScatterBegin(matis->rctx,nearnullvecs[k],localnearnullsp[k],INSERT_VALUES,SCATTER_FORWARD);
6201: VecScatterEnd(matis->rctx,nearnullvecs[k],localnearnullsp[k],INSERT_VALUES,SCATTER_FORWARD);
6202: }
6204: /* whether or not to skip lapack calls */
6205: skip_lapack = PETSC_TRUE;
6206: if (n_ISForFaces+n_ISForEdges && max_constraints > 1 && !pcbddc->use_nnsp_true) skip_lapack = PETSC_FALSE;
6208: /* First we issue queries to allocate optimal workspace for LAPACKgesvd (or LAPACKsyev if SVD is missing) */
6209: if (!skip_lapack) {
6210: PetscScalar temp_work;
6212: if (use_pod) {
6213: /* Proper Orthogonal Decomposition (POD) using the snapshot method */
6214: PetscMalloc1(max_constraints*max_constraints,&correlation_mat);
6215: PetscMalloc1(max_constraints,&singular_vals);
6216: PetscMalloc1(max_size_of_constraint*max_constraints,&temp_basis);
6217: #if defined(PETSC_USE_COMPLEX)
6218: PetscMalloc1(3*max_constraints,&rwork);
6219: #endif
6220: /* now we evaluate the optimal workspace using query with lwork=-1 */
6221: PetscBLASIntCast(max_constraints,&Blas_N);
6222: PetscBLASIntCast(max_constraints,&Blas_LDA);
6223: lwork = -1;
6224: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6225: #if !defined(PETSC_USE_COMPLEX)
6226: PetscStackCallBLAS("LAPACKsyev",LAPACKsyev_("V","U",&Blas_N,correlation_mat,&Blas_LDA,singular_vals,&temp_work,&lwork,&lierr));
6227: #else
6228: PetscStackCallBLAS("LAPACKsyev",LAPACKsyev_("V","U",&Blas_N,correlation_mat,&Blas_LDA,singular_vals,&temp_work,&lwork,rwork,&lierr));
6229: #endif
6230: PetscFPTrapPop();
6231: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in query to SYEV Lapack routine %d",(int)lierr);
6232: } else {
6233: #if !defined(PETSC_MISSING_LAPACK_GESVD)
6234: /* SVD */
6235: PetscInt max_n,min_n;
6236: max_n = max_size_of_constraint;
6237: min_n = max_constraints;
6238: if (max_size_of_constraint < max_constraints) {
6239: min_n = max_size_of_constraint;
6240: max_n = max_constraints;
6241: }
6242: PetscMalloc1(min_n,&singular_vals);
6243: #if defined(PETSC_USE_COMPLEX)
6244: PetscMalloc1(5*min_n,&rwork);
6245: #endif
6246: /* now we evaluate the optimal workspace using query with lwork=-1 */
6247: lwork = -1;
6248: PetscBLASIntCast(max_n,&Blas_M);
6249: PetscBLASIntCast(min_n,&Blas_N);
6250: PetscBLASIntCast(max_n,&Blas_LDA);
6251: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6252: #if !defined(PETSC_USE_COMPLEX)
6253: PetscStackCallBLAS("LAPACKgesvd",LAPACKgesvd_("O","N",&Blas_M,&Blas_N,&constraints_data[0],&Blas_LDA,singular_vals,&dummy_scalar,&dummy_int,&dummy_scalar,&dummy_int,&temp_work,&lwork,&lierr));
6254: #else
6255: PetscStackCallBLAS("LAPACKgesvd",LAPACKgesvd_("O","N",&Blas_M,&Blas_N,&constraints_data[0],&Blas_LDA,singular_vals,&dummy_scalar,&dummy_int,&dummy_scalar,&dummy_int,&temp_work,&lwork,rwork,&lierr));
6256: #endif
6257: PetscFPTrapPop();
6258: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in query to GESVD Lapack routine %d",(int)lierr);
6259: #else
6260: SETERRQ(PETSC_COMM_SELF,PETSC_ERR_LIB,"This should not happen");
6261: #endif /* on missing GESVD */
6262: }
6263: /* Allocate optimal workspace */
6264: PetscBLASIntCast((PetscInt)PetscRealPart(temp_work),&lwork);
6265: PetscMalloc1(lwork,&work);
6266: }
6267: /* Now we can loop on constraining sets */
6268: total_counts = 0;
6269: constraints_idxs_ptr[0] = 0;
6270: constraints_data_ptr[0] = 0;
6271: /* vertices */
6272: if (n_vertices) {
6273: ISGetIndices(ISForVertices,(const PetscInt**)&is_indices);
6274: PetscArraycpy(constraints_idxs,is_indices,n_vertices);
6275: for (i=0;i<n_vertices;i++) {
6276: constraints_n[total_counts] = 1;
6277: constraints_data[total_counts] = 1.0;
6278: constraints_idxs_ptr[total_counts+1] = constraints_idxs_ptr[total_counts]+1;
6279: constraints_data_ptr[total_counts+1] = constraints_data_ptr[total_counts]+1;
6280: total_counts++;
6281: }
6282: ISRestoreIndices(ISForVertices,(const PetscInt**)&is_indices);
6283: n_vertices = total_counts;
6284: }
6286: /* edges and faces */
6287: total_counts_cc = total_counts;
6288: for (ncc=0;ncc<n_ISForEdges+n_ISForFaces;ncc++) {
6289: IS used_is;
6290: PetscBool idxs_copied = PETSC_FALSE;
6292: if (ncc<n_ISForEdges) {
6293: used_is = ISForEdges[ncc];
6294: boolforchange = pcbddc->use_change_of_basis; /* change or not the basis on the edge */
6295: } else {
6296: used_is = ISForFaces[ncc-n_ISForEdges];
6297: boolforchange = (PetscBool)(pcbddc->use_change_of_basis && pcbddc->use_change_on_faces); /* change or not the basis on the face */
6298: }
6299: temp_constraints = 0; /* zero the number of constraints I have on this conn comp */
6301: ISGetSize(used_is,&size_of_constraint);
6302: ISGetIndices(used_is,(const PetscInt**)&is_indices);
6303: /* change of basis should not be performed on local periodic nodes */
6304: if (pcbddc->mat_graph->mirrors && pcbddc->mat_graph->mirrors[is_indices[0]]) boolforchange = PETSC_FALSE;
6305: if (nnsp_has_cnst) {
6306: PetscScalar quad_value;
6308: PetscArraycpy(constraints_idxs + constraints_idxs_ptr[total_counts_cc],is_indices,size_of_constraint);
6309: idxs_copied = PETSC_TRUE;
6311: if (!pcbddc->use_nnsp_true) {
6312: quad_value = (PetscScalar)(1.0/PetscSqrtReal((PetscReal)size_of_constraint));
6313: } else {
6314: quad_value = 1.0;
6315: }
6316: for (j=0;j<size_of_constraint;j++) {
6317: constraints_data[constraints_data_ptr[total_counts_cc]+j] = quad_value;
6318: }
6319: temp_constraints++;
6320: total_counts++;
6321: }
6322: for (k=0;k<nnsp_size;k++) {
6323: PetscReal real_value;
6324: PetscScalar *ptr_to_data;
6326: VecGetArrayRead(localnearnullsp[k],(const PetscScalar**)&array);
6327: ptr_to_data = &constraints_data[constraints_data_ptr[total_counts_cc]+temp_constraints*size_of_constraint];
6328: for (j=0;j<size_of_constraint;j++) {
6329: ptr_to_data[j] = array[is_indices[j]];
6330: }
6331: VecRestoreArrayRead(localnearnullsp[k],(const PetscScalar**)&array);
6332: /* check if array is null on the connected component */
6333: PetscBLASIntCast(size_of_constraint,&Blas_N);
6334: PetscStackCallBLAS("BLASasum",real_value = BLASasum_(&Blas_N,ptr_to_data,&Blas_one));
6335: if (real_value > tol*size_of_constraint) { /* keep indices and values */
6336: temp_constraints++;
6337: total_counts++;
6338: if (!idxs_copied) {
6339: PetscArraycpy(constraints_idxs + constraints_idxs_ptr[total_counts_cc],is_indices,size_of_constraint);
6340: idxs_copied = PETSC_TRUE;
6341: }
6342: }
6343: }
6344: ISRestoreIndices(used_is,(const PetscInt**)&is_indices);
6345: valid_constraints = temp_constraints;
6346: if (!pcbddc->use_nnsp_true && temp_constraints) {
6347: if (temp_constraints == 1) { /* just normalize the constraint */
6348: PetscScalar norm,*ptr_to_data;
6350: ptr_to_data = &constraints_data[constraints_data_ptr[total_counts_cc]];
6351: PetscBLASIntCast(size_of_constraint,&Blas_N);
6352: PetscStackCallBLAS("BLASdot",norm = BLASdot_(&Blas_N,ptr_to_data,&Blas_one,ptr_to_data,&Blas_one));
6353: norm = 1.0/PetscSqrtReal(PetscRealPart(norm));
6354: PetscStackCallBLAS("BLASscal",BLASscal_(&Blas_N,&norm,ptr_to_data,&Blas_one));
6355: } else { /* perform SVD */
6356: PetscScalar *ptr_to_data = &constraints_data[constraints_data_ptr[total_counts_cc]];
6358: if (use_pod) {
6359: /* SVD: Y = U*S*V^H -> U (eigenvectors of Y*Y^H) = Y*V*(S)^\dag
6360: POD: Y^H*Y = V*D*V^H, D = S^H*S -> U = Y*V*D^(-1/2)
6361: -> When PETSC_USE_COMPLEX and PETSC_MISSING_LAPACK_GESVD are defined
6362: the constraints basis will differ (by a complex factor with absolute value equal to 1)
6363: from that computed using LAPACKgesvd
6364: -> This is due to a different computation of eigenvectors in LAPACKheev
6365: -> The quality of the POD-computed basis will be the same */
6366: PetscArrayzero(correlation_mat,temp_constraints*temp_constraints);
6367: /* Store upper triangular part of correlation matrix */
6368: PetscBLASIntCast(size_of_constraint,&Blas_N);
6369: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6370: for (j=0;j<temp_constraints;j++) {
6371: for (k=0;k<j+1;k++) {
6372: PetscStackCallBLAS("BLASdot",correlation_mat[j*temp_constraints+k] = BLASdot_(&Blas_N,ptr_to_data+k*size_of_constraint,&Blas_one,ptr_to_data+j*size_of_constraint,&Blas_one));
6373: }
6374: }
6375: /* compute eigenvalues and eigenvectors of correlation matrix */
6376: PetscBLASIntCast(temp_constraints,&Blas_N);
6377: PetscBLASIntCast(temp_constraints,&Blas_LDA);
6378: #if !defined(PETSC_USE_COMPLEX)
6379: PetscStackCallBLAS("LAPACKsyev",LAPACKsyev_("V","U",&Blas_N,correlation_mat,&Blas_LDA,singular_vals,work,&lwork,&lierr));
6380: #else
6381: PetscStackCallBLAS("LAPACKsyev",LAPACKsyev_("V","U",&Blas_N,correlation_mat,&Blas_LDA,singular_vals,work,&lwork,rwork,&lierr));
6382: #endif
6383: PetscFPTrapPop();
6384: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in SYEV Lapack routine %d",(int)lierr);
6385: /* retain eigenvalues greater than tol: note that LAPACKsyev gives eigs in ascending order */
6386: j = 0;
6387: while (j < temp_constraints && singular_vals[j]/singular_vals[temp_constraints-1] < tol) j++;
6388: total_counts = total_counts-j;
6389: valid_constraints = temp_constraints-j;
6390: /* scale and copy POD basis into used quadrature memory */
6391: PetscBLASIntCast(size_of_constraint,&Blas_M);
6392: PetscBLASIntCast(temp_constraints,&Blas_N);
6393: PetscBLASIntCast(temp_constraints,&Blas_K);
6394: PetscBLASIntCast(size_of_constraint,&Blas_LDA);
6395: PetscBLASIntCast(temp_constraints,&Blas_LDB);
6396: PetscBLASIntCast(size_of_constraint,&Blas_LDC);
6397: if (j<temp_constraints) {
6398: PetscInt ii;
6399: for (k=j;k<temp_constraints;k++) singular_vals[k] = 1.0/PetscSqrtReal(singular_vals[k]);
6400: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6401: PetscStackCallBLAS("BLASgemm",BLASgemm_("N","N",&Blas_M,&Blas_N,&Blas_K,&one,ptr_to_data,&Blas_LDA,correlation_mat,&Blas_LDB,&zero,temp_basis,&Blas_LDC));
6402: PetscFPTrapPop();
6403: for (k=0;k<temp_constraints-j;k++) {
6404: for (ii=0;ii<size_of_constraint;ii++) {
6405: ptr_to_data[k*size_of_constraint+ii] = singular_vals[temp_constraints-1-k]*temp_basis[(temp_constraints-1-k)*size_of_constraint+ii];
6406: }
6407: }
6408: }
6409: } else {
6410: #if !defined(PETSC_MISSING_LAPACK_GESVD)
6411: PetscBLASIntCast(size_of_constraint,&Blas_M);
6412: PetscBLASIntCast(temp_constraints,&Blas_N);
6413: PetscBLASIntCast(size_of_constraint,&Blas_LDA);
6414: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6415: #if !defined(PETSC_USE_COMPLEX)
6416: PetscStackCallBLAS("LAPACKgesvd",LAPACKgesvd_("O","N",&Blas_M,&Blas_N,ptr_to_data,&Blas_LDA,singular_vals,&dummy_scalar,&dummy_int,&dummy_scalar,&dummy_int,work,&lwork,&lierr));
6417: #else
6418: PetscStackCallBLAS("LAPACKgesvd",LAPACKgesvd_("O","N",&Blas_M,&Blas_N,ptr_to_data,&Blas_LDA,singular_vals,&dummy_scalar,&dummy_int,&dummy_scalar,&dummy_int,work,&lwork,rwork,&lierr));
6419: #endif
6420: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GESVD Lapack routine %d",(int)lierr);
6421: PetscFPTrapPop();
6422: /* retain eigenvalues greater than tol: note that LAPACKgesvd gives eigs in descending order */
6423: k = temp_constraints;
6424: if (k > size_of_constraint) k = size_of_constraint;
6425: j = 0;
6426: while (j < k && singular_vals[k-j-1]/singular_vals[0] < tol) j++;
6427: valid_constraints = k-j;
6428: total_counts = total_counts-temp_constraints+valid_constraints;
6429: #else
6430: SETERRQ(PETSC_COMM_SELF,PETSC_ERR_LIB,"This should not happen");
6431: #endif /* on missing GESVD */
6432: }
6433: }
6434: }
6435: /* update pointers information */
6436: if (valid_constraints) {
6437: constraints_n[total_counts_cc] = valid_constraints;
6438: constraints_idxs_ptr[total_counts_cc+1] = constraints_idxs_ptr[total_counts_cc]+size_of_constraint;
6439: constraints_data_ptr[total_counts_cc+1] = constraints_data_ptr[total_counts_cc]+size_of_constraint*valid_constraints;
6440: /* set change_of_basis flag */
6441: if (boolforchange) {
6442: PetscBTSet(change_basis,total_counts_cc);
6443: }
6444: total_counts_cc++;
6445: }
6446: }
6447: /* free workspace */
6448: if (!skip_lapack) {
6449: PetscFree(work);
6450: #if defined(PETSC_USE_COMPLEX)
6451: PetscFree(rwork);
6452: #endif
6453: PetscFree(singular_vals);
6454: PetscFree(correlation_mat);
6455: PetscFree(temp_basis);
6456: }
6457: for (k=0;k<nnsp_size;k++) {
6458: VecDestroy(&localnearnullsp[k]);
6459: }
6460: PetscFree(localnearnullsp);
6461: /* free index sets of faces, edges and vertices */
6462: for (i=0;i<n_ISForFaces;i++) {
6463: ISDestroy(&ISForFaces[i]);
6464: }
6465: if (n_ISForFaces) {
6466: PetscFree(ISForFaces);
6467: }
6468: for (i=0;i<n_ISForEdges;i++) {
6469: ISDestroy(&ISForEdges[i]);
6470: }
6471: if (n_ISForEdges) {
6472: PetscFree(ISForEdges);
6473: }
6474: ISDestroy(&ISForVertices);
6475: } else {
6476: PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs;
6478: total_counts = 0;
6479: n_vertices = 0;
6480: if (sub_schurs->is_vertices && pcbddc->use_vertices) {
6481: ISGetLocalSize(sub_schurs->is_vertices,&n_vertices);
6482: }
6483: max_constraints = 0;
6484: total_counts_cc = 0;
6485: for (i=0;i<sub_schurs->n_subs+n_vertices;i++) {
6486: total_counts += pcbddc->adaptive_constraints_n[i];
6487: if (pcbddc->adaptive_constraints_n[i]) total_counts_cc++;
6488: max_constraints = PetscMax(max_constraints,pcbddc->adaptive_constraints_n[i]);
6489: }
6490: constraints_idxs_ptr = pcbddc->adaptive_constraints_idxs_ptr;
6491: constraints_data_ptr = pcbddc->adaptive_constraints_data_ptr;
6492: constraints_idxs = pcbddc->adaptive_constraints_idxs;
6493: constraints_data = pcbddc->adaptive_constraints_data;
6494: /* constraints_n differs from pcbddc->adaptive_constraints_n */
6495: PetscMalloc1(total_counts_cc,&constraints_n);
6496: total_counts_cc = 0;
6497: for (i=0;i<sub_schurs->n_subs+n_vertices;i++) {
6498: if (pcbddc->adaptive_constraints_n[i]) {
6499: constraints_n[total_counts_cc++] = pcbddc->adaptive_constraints_n[i];
6500: }
6501: }
6503: max_size_of_constraint = 0;
6504: for (i=0;i<total_counts_cc;i++) max_size_of_constraint = PetscMax(max_size_of_constraint,constraints_idxs_ptr[i+1]-constraints_idxs_ptr[i]);
6505: PetscMalloc1(constraints_idxs_ptr[total_counts_cc],&constraints_idxs_B);
6506: /* Change of basis */
6507: PetscBTCreate(total_counts_cc,&change_basis);
6508: if (pcbddc->use_change_of_basis) {
6509: for (i=0;i<sub_schurs->n_subs;i++) {
6510: if (PetscBTLookup(sub_schurs->is_edge,i) || pcbddc->use_change_on_faces) {
6511: PetscBTSet(change_basis,i+n_vertices);
6512: }
6513: }
6514: }
6515: }
6516: pcbddc->local_primal_size = total_counts;
6517: PetscMalloc1(pcbddc->local_primal_size+pcbddc->benign_n,&pcbddc->primal_indices_local_idxs);
6519: /* map constraints_idxs in boundary numbering */
6520: ISGlobalToLocalMappingApply(pcis->BtoNmap,IS_GTOLM_DROP,constraints_idxs_ptr[total_counts_cc],constraints_idxs,&i,constraints_idxs_B);
6521: if (i != constraints_idxs_ptr[total_counts_cc]) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in boundary numbering for constraints indices %D != %D",constraints_idxs_ptr[total_counts_cc],i);
6523: /* Create constraint matrix */
6524: MatCreate(PETSC_COMM_SELF,&pcbddc->ConstraintMatrix);
6525: MatSetType(pcbddc->ConstraintMatrix,MATAIJ);
6526: MatSetSizes(pcbddc->ConstraintMatrix,pcbddc->local_primal_size,pcis->n,pcbddc->local_primal_size,pcis->n);
6528: /* find primal_dofs: subdomain corners plus dofs selected as primal after change of basis */
6529: /* determine if a QR strategy is needed for change of basis */
6530: qr_needed = pcbddc->use_qr_single;
6531: PetscBTCreate(total_counts_cc,&qr_needed_idx);
6532: total_primal_vertices=0;
6533: pcbddc->local_primal_size_cc = 0;
6534: for (i=0;i<total_counts_cc;i++) {
6535: size_of_constraint = constraints_idxs_ptr[i+1]-constraints_idxs_ptr[i];
6536: if (size_of_constraint == 1 && pcbddc->mat_graph->custom_minimal_size) {
6537: pcbddc->primal_indices_local_idxs[total_primal_vertices++] = constraints_idxs[constraints_idxs_ptr[i]];
6538: pcbddc->local_primal_size_cc += 1;
6539: } else if (PetscBTLookup(change_basis,i)) {
6540: for (k=0;k<constraints_n[i];k++) {
6541: pcbddc->primal_indices_local_idxs[total_primal_vertices++] = constraints_idxs[constraints_idxs_ptr[i]+k];
6542: }
6543: pcbddc->local_primal_size_cc += constraints_n[i];
6544: if (constraints_n[i] > 1 || pcbddc->use_qr_single) {
6545: PetscBTSet(qr_needed_idx,i);
6546: qr_needed = PETSC_TRUE;
6547: }
6548: } else {
6549: pcbddc->local_primal_size_cc += 1;
6550: }
6551: }
6552: /* note that the local variable n_vertices used below stores the number of pointwise constraints */
6553: pcbddc->n_vertices = total_primal_vertices;
6554: /* permute indices in order to have a sorted set of vertices */
6555: PetscSortInt(total_primal_vertices,pcbddc->primal_indices_local_idxs);
6556: PetscMalloc2(pcbddc->local_primal_size_cc+pcbddc->benign_n,&pcbddc->local_primal_ref_node,pcbddc->local_primal_size_cc+pcbddc->benign_n,&pcbddc->local_primal_ref_mult);
6557: PetscArraycpy(pcbddc->local_primal_ref_node,pcbddc->primal_indices_local_idxs,total_primal_vertices);
6558: for (i=0;i<total_primal_vertices;i++) pcbddc->local_primal_ref_mult[i] = 1;
6560: /* nonzero structure of constraint matrix */
6561: /* and get reference dof for local constraints */
6562: PetscMalloc1(pcbddc->local_primal_size,&nnz);
6563: for (i=0;i<total_primal_vertices;i++) nnz[i] = 1;
6565: j = total_primal_vertices;
6566: total_counts = total_primal_vertices;
6567: cum = total_primal_vertices;
6568: for (i=n_vertices;i<total_counts_cc;i++) {
6569: if (!PetscBTLookup(change_basis,i)) {
6570: pcbddc->local_primal_ref_node[cum] = constraints_idxs[constraints_idxs_ptr[i]];
6571: pcbddc->local_primal_ref_mult[cum] = constraints_n[i];
6572: cum++;
6573: size_of_constraint = constraints_idxs_ptr[i+1]-constraints_idxs_ptr[i];
6574: for (k=0;k<constraints_n[i];k++) {
6575: pcbddc->primal_indices_local_idxs[total_counts++] = constraints_idxs[constraints_idxs_ptr[i]+k];
6576: nnz[j+k] = size_of_constraint;
6577: }
6578: j += constraints_n[i];
6579: }
6580: }
6581: MatSeqAIJSetPreallocation(pcbddc->ConstraintMatrix,0,nnz);
6582: MatSetOption(pcbddc->ConstraintMatrix,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_TRUE);
6583: PetscFree(nnz);
6585: /* set values in constraint matrix */
6586: for (i=0;i<total_primal_vertices;i++) {
6587: MatSetValue(pcbddc->ConstraintMatrix,i,pcbddc->local_primal_ref_node[i],1.0,INSERT_VALUES);
6588: }
6589: total_counts = total_primal_vertices;
6590: for (i=n_vertices;i<total_counts_cc;i++) {
6591: if (!PetscBTLookup(change_basis,i)) {
6592: PetscInt *cols;
6594: size_of_constraint = constraints_idxs_ptr[i+1]-constraints_idxs_ptr[i];
6595: cols = constraints_idxs+constraints_idxs_ptr[i];
6596: for (k=0;k<constraints_n[i];k++) {
6597: PetscInt row = total_counts+k;
6598: PetscScalar *vals;
6600: vals = constraints_data+constraints_data_ptr[i]+k*size_of_constraint;
6601: MatSetValues(pcbddc->ConstraintMatrix,1,&row,size_of_constraint,cols,vals,INSERT_VALUES);
6602: }
6603: total_counts += constraints_n[i];
6604: }
6605: }
6606: /* assembling */
6607: MatAssemblyBegin(pcbddc->ConstraintMatrix,MAT_FINAL_ASSEMBLY);
6608: MatAssemblyEnd(pcbddc->ConstraintMatrix,MAT_FINAL_ASSEMBLY);
6609: MatViewFromOptions(pcbddc->ConstraintMatrix,(PetscObject)pc,"-pc_bddc_constraint_mat_view");
6611: /* Create matrix for change of basis. We don't need it in case pcbddc->use_change_of_basis is FALSE */
6612: if (pcbddc->use_change_of_basis) {
6613: /* dual and primal dofs on a single cc */
6614: PetscInt dual_dofs,primal_dofs;
6615: /* working stuff for GEQRF */
6616: PetscScalar *qr_basis = NULL,*qr_tau = NULL,*qr_work = NULL,lqr_work_t;
6617: PetscBLASInt lqr_work;
6618: /* working stuff for UNGQR */
6619: PetscScalar *gqr_work = NULL,lgqr_work_t=0.0;
6620: PetscBLASInt lgqr_work;
6621: /* working stuff for TRTRS */
6622: PetscScalar *trs_rhs = NULL;
6623: PetscBLASInt Blas_NRHS;
6624: /* pointers for values insertion into change of basis matrix */
6625: PetscInt *start_rows,*start_cols;
6626: PetscScalar *start_vals;
6627: /* working stuff for values insertion */
6628: PetscBT is_primal;
6629: PetscInt *aux_primal_numbering_B;
6630: /* matrix sizes */
6631: PetscInt global_size,local_size;
6632: /* temporary change of basis */
6633: Mat localChangeOfBasisMatrix;
6634: /* extra space for debugging */
6635: PetscScalar *dbg_work = NULL;
6637: /* local temporary change of basis acts on local interfaces -> dimension is n_B x n_B */
6638: MatCreate(PETSC_COMM_SELF,&localChangeOfBasisMatrix);
6639: MatSetType(localChangeOfBasisMatrix,MATAIJ);
6640: MatSetSizes(localChangeOfBasisMatrix,pcis->n,pcis->n,pcis->n,pcis->n);
6641: /* nonzeros for local mat */
6642: PetscMalloc1(pcis->n,&nnz);
6643: if (!pcbddc->benign_change || pcbddc->fake_change) {
6644: for (i=0;i<pcis->n;i++) nnz[i]=1;
6645: } else {
6646: const PetscInt *ii;
6647: PetscInt n;
6648: PetscBool flg_row;
6649: MatGetRowIJ(pcbddc->benign_change,0,PETSC_FALSE,PETSC_FALSE,&n,&ii,NULL,&flg_row);
6650: for (i=0;i<n;i++) nnz[i] = ii[i+1]-ii[i];
6651: MatRestoreRowIJ(pcbddc->benign_change,0,PETSC_FALSE,PETSC_FALSE,&n,&ii,NULL,&flg_row);
6652: }
6653: for (i=n_vertices;i<total_counts_cc;i++) {
6654: if (PetscBTLookup(change_basis,i)) {
6655: size_of_constraint = constraints_idxs_ptr[i+1]-constraints_idxs_ptr[i];
6656: if (PetscBTLookup(qr_needed_idx,i)) {
6657: for (j=0;j<size_of_constraint;j++) nnz[constraints_idxs[constraints_idxs_ptr[i]+j]] = size_of_constraint;
6658: } else {
6659: nnz[constraints_idxs[constraints_idxs_ptr[i]]] = size_of_constraint;
6660: for (j=1;j<size_of_constraint;j++) nnz[constraints_idxs[constraints_idxs_ptr[i]+j]] = 2;
6661: }
6662: }
6663: }
6664: MatSeqAIJSetPreallocation(localChangeOfBasisMatrix,0,nnz);
6665: MatSetOption(localChangeOfBasisMatrix,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_TRUE);
6666: PetscFree(nnz);
6667: /* Set interior change in the matrix */
6668: if (!pcbddc->benign_change || pcbddc->fake_change) {
6669: for (i=0;i<pcis->n;i++) {
6670: MatSetValue(localChangeOfBasisMatrix,i,i,1.0,INSERT_VALUES);
6671: }
6672: } else {
6673: const PetscInt *ii,*jj;
6674: PetscScalar *aa;
6675: PetscInt n;
6676: PetscBool flg_row;
6677: MatGetRowIJ(pcbddc->benign_change,0,PETSC_FALSE,PETSC_FALSE,&n,&ii,&jj,&flg_row);
6678: MatSeqAIJGetArray(pcbddc->benign_change,&aa);
6679: for (i=0;i<n;i++) {
6680: MatSetValues(localChangeOfBasisMatrix,1,&i,ii[i+1]-ii[i],jj+ii[i],aa+ii[i],INSERT_VALUES);
6681: }
6682: MatSeqAIJRestoreArray(pcbddc->benign_change,&aa);
6683: MatRestoreRowIJ(pcbddc->benign_change,0,PETSC_FALSE,PETSC_FALSE,&n,&ii,&jj,&flg_row);
6684: }
6686: if (pcbddc->dbg_flag) {
6687: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"--------------------------------------------------------------\n");
6688: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Checking change of basis computation for subdomain %04d\n",PetscGlobalRank);
6689: }
6692: /* Now we loop on the constraints which need a change of basis */
6693: /*
6694: Change of basis matrix is evaluated similarly to the FIRST APPROACH in
6695: Klawonn and Widlund, Dual-primal FETI-DP methods for linear elasticity, (see Sect 6.2.1)
6697: Basic blocks of change of basis matrix T computed by
6699: - Using the following block transformation if there is only a primal dof on the cc (and -pc_bddc_use_qr_single is not specified)
6701: | 1 0 ... 0 s_1/S |
6702: | 0 1 ... 0 s_2/S |
6703: | ... |
6704: | 0 ... 1 s_{n-1}/S |
6705: | -s_1/s_n ... -s_{n-1}/s_n s_n/S |
6707: with S = \sum_{i=1}^n s_i^2
6708: NOTE: in the above example, the primal dof is the last one of the edge in LOCAL ordering
6709: in the current implementation, the primal dof is the first one of the edge in GLOBAL ordering
6711: - QR decomposition of constraints otherwise
6712: */
6713: if (qr_needed && max_size_of_constraint) {
6714: /* space to store Q */
6715: PetscMalloc1(max_size_of_constraint*max_size_of_constraint,&qr_basis);
6716: /* array to store scaling factors for reflectors */
6717: PetscMalloc1(max_constraints,&qr_tau);
6718: /* first we issue queries for optimal work */
6719: PetscBLASIntCast(max_size_of_constraint,&Blas_M);
6720: PetscBLASIntCast(max_constraints,&Blas_N);
6721: PetscBLASIntCast(max_size_of_constraint,&Blas_LDA);
6722: lqr_work = -1;
6723: PetscStackCallBLAS("LAPACKgeqrf",LAPACKgeqrf_(&Blas_M,&Blas_N,qr_basis,&Blas_LDA,qr_tau,&lqr_work_t,&lqr_work,&lierr));
6724: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in query to GEQRF Lapack routine %d",(int)lierr);
6725: PetscBLASIntCast((PetscInt)PetscRealPart(lqr_work_t),&lqr_work);
6726: PetscMalloc1((PetscInt)PetscRealPart(lqr_work_t),&qr_work);
6727: lgqr_work = -1;
6728: PetscBLASIntCast(max_size_of_constraint,&Blas_M);
6729: PetscBLASIntCast(max_size_of_constraint,&Blas_N);
6730: PetscBLASIntCast(max_constraints,&Blas_K);
6731: PetscBLASIntCast(max_size_of_constraint,&Blas_LDA);
6732: if (Blas_K>Blas_M) Blas_K=Blas_M; /* adjust just for computing optimal work */
6733: PetscStackCallBLAS("LAPACKorgqr",LAPACKorgqr_(&Blas_M,&Blas_N,&Blas_K,qr_basis,&Blas_LDA,qr_tau,&lgqr_work_t,&lgqr_work,&lierr));
6734: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in query to ORGQR/UNGQR Lapack routine %d",(int)lierr);
6735: PetscBLASIntCast((PetscInt)PetscRealPart(lgqr_work_t),&lgqr_work);
6736: PetscMalloc1((PetscInt)PetscRealPart(lgqr_work_t),&gqr_work);
6737: /* array to store rhs and solution of triangular solver */
6738: PetscMalloc1(max_constraints*max_constraints,&trs_rhs);
6739: /* allocating workspace for check */
6740: if (pcbddc->dbg_flag) {
6741: PetscMalloc1(max_size_of_constraint*(max_constraints+max_size_of_constraint),&dbg_work);
6742: }
6743: }
6744: /* array to store whether a node is primal or not */
6745: PetscBTCreate(pcis->n_B,&is_primal);
6746: PetscMalloc1(total_primal_vertices,&aux_primal_numbering_B);
6747: ISGlobalToLocalMappingApply(pcis->BtoNmap,IS_GTOLM_DROP,total_primal_vertices,pcbddc->local_primal_ref_node,&i,aux_primal_numbering_B);
6748: if (i != total_primal_vertices) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in boundary numbering for BDDC vertices! %D != %D",total_primal_vertices,i);
6749: for (i=0;i<total_primal_vertices;i++) {
6750: PetscBTSet(is_primal,aux_primal_numbering_B[i]);
6751: }
6752: PetscFree(aux_primal_numbering_B);
6754: /* loop on constraints and see whether or not they need a change of basis and compute it */
6755: for (total_counts=n_vertices;total_counts<total_counts_cc;total_counts++) {
6756: size_of_constraint = constraints_idxs_ptr[total_counts+1]-constraints_idxs_ptr[total_counts];
6757: if (PetscBTLookup(change_basis,total_counts)) {
6758: /* get constraint info */
6759: primal_dofs = constraints_n[total_counts];
6760: dual_dofs = size_of_constraint-primal_dofs;
6762: if (pcbddc->dbg_flag) {
6763: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Constraints %D: %D need a change of basis (size %D)\n",total_counts,primal_dofs,size_of_constraint);
6764: }
6766: if (PetscBTLookup(qr_needed_idx,total_counts)) { /* QR */
6768: /* copy quadrature constraints for change of basis check */
6769: if (pcbddc->dbg_flag) {
6770: PetscArraycpy(dbg_work,&constraints_data[constraints_data_ptr[total_counts]],size_of_constraint*primal_dofs);
6771: }
6772: /* copy temporary constraints into larger work vector (in order to store all columns of Q) */
6773: PetscArraycpy(qr_basis,&constraints_data[constraints_data_ptr[total_counts]],size_of_constraint*primal_dofs);
6775: /* compute QR decomposition of constraints */
6776: PetscBLASIntCast(size_of_constraint,&Blas_M);
6777: PetscBLASIntCast(primal_dofs,&Blas_N);
6778: PetscBLASIntCast(size_of_constraint,&Blas_LDA);
6779: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6780: PetscStackCallBLAS("LAPACKgeqrf",LAPACKgeqrf_(&Blas_M,&Blas_N,qr_basis,&Blas_LDA,qr_tau,qr_work,&lqr_work,&lierr));
6781: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GEQRF Lapack routine %d",(int)lierr);
6782: PetscFPTrapPop();
6784: /* explictly compute R^-T */
6785: PetscArrayzero(trs_rhs,primal_dofs*primal_dofs);
6786: for (j=0;j<primal_dofs;j++) trs_rhs[j*(primal_dofs+1)] = 1.0;
6787: PetscBLASIntCast(primal_dofs,&Blas_N);
6788: PetscBLASIntCast(primal_dofs,&Blas_NRHS);
6789: PetscBLASIntCast(size_of_constraint,&Blas_LDA);
6790: PetscBLASIntCast(primal_dofs,&Blas_LDB);
6791: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6792: PetscStackCallBLAS("LAPACKtrtrs",LAPACKtrtrs_("U","T","N",&Blas_N,&Blas_NRHS,qr_basis,&Blas_LDA,trs_rhs,&Blas_LDB,&lierr));
6793: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in TRTRS Lapack routine %d",(int)lierr);
6794: PetscFPTrapPop();
6796: /* explicitly compute all columns of Q (Q = [Q1 | Q2] ) overwriting QR factorization in qr_basis */
6797: PetscBLASIntCast(size_of_constraint,&Blas_M);
6798: PetscBLASIntCast(size_of_constraint,&Blas_N);
6799: PetscBLASIntCast(primal_dofs,&Blas_K);
6800: PetscBLASIntCast(size_of_constraint,&Blas_LDA);
6801: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6802: PetscStackCallBLAS("LAPACKorgqr",LAPACKorgqr_(&Blas_M,&Blas_N,&Blas_K,qr_basis,&Blas_LDA,qr_tau,gqr_work,&lgqr_work,&lierr));
6803: if (lierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in ORGQR/UNGQR Lapack routine %d",(int)lierr);
6804: PetscFPTrapPop();
6806: /* first primal_dofs columns of Q need to be re-scaled in order to be unitary w.r.t constraints
6807: i.e. C_{pxn}*Q_{nxn} should be equal to [I_pxp | 0_pxd] (see check below)
6808: where n=size_of_constraint, p=primal_dofs, d=dual_dofs (n=p+d), I and 0 identity and null matrix resp. */
6809: PetscBLASIntCast(size_of_constraint,&Blas_M);
6810: PetscBLASIntCast(primal_dofs,&Blas_N);
6811: PetscBLASIntCast(primal_dofs,&Blas_K);
6812: PetscBLASIntCast(size_of_constraint,&Blas_LDA);
6813: PetscBLASIntCast(primal_dofs,&Blas_LDB);
6814: PetscBLASIntCast(size_of_constraint,&Blas_LDC);
6815: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6816: PetscStackCallBLAS("BLASgemm",BLASgemm_("N","N",&Blas_M,&Blas_N,&Blas_K,&one,qr_basis,&Blas_LDA,trs_rhs,&Blas_LDB,&zero,constraints_data+constraints_data_ptr[total_counts],&Blas_LDC));
6817: PetscFPTrapPop();
6818: PetscArraycpy(qr_basis,&constraints_data[constraints_data_ptr[total_counts]],size_of_constraint*primal_dofs);
6820: /* insert values in change of basis matrix respecting global ordering of new primal dofs */
6821: start_rows = &constraints_idxs[constraints_idxs_ptr[total_counts]];
6822: /* insert cols for primal dofs */
6823: for (j=0;j<primal_dofs;j++) {
6824: start_vals = &qr_basis[j*size_of_constraint];
6825: start_cols = &constraints_idxs[constraints_idxs_ptr[total_counts]+j];
6826: MatSetValues(localChangeOfBasisMatrix,size_of_constraint,start_rows,1,start_cols,start_vals,INSERT_VALUES);
6827: }
6828: /* insert cols for dual dofs */
6829: for (j=0,k=0;j<dual_dofs;k++) {
6830: if (!PetscBTLookup(is_primal,constraints_idxs_B[constraints_idxs_ptr[total_counts]+k])) {
6831: start_vals = &qr_basis[(primal_dofs+j)*size_of_constraint];
6832: start_cols = &constraints_idxs[constraints_idxs_ptr[total_counts]+k];
6833: MatSetValues(localChangeOfBasisMatrix,size_of_constraint,start_rows,1,start_cols,start_vals,INSERT_VALUES);
6834: j++;
6835: }
6836: }
6838: /* check change of basis */
6839: if (pcbddc->dbg_flag) {
6840: PetscInt ii,jj;
6841: PetscBool valid_qr=PETSC_TRUE;
6842: PetscBLASIntCast(primal_dofs,&Blas_M);
6843: PetscBLASIntCast(size_of_constraint,&Blas_N);
6844: PetscBLASIntCast(size_of_constraint,&Blas_K);
6845: PetscBLASIntCast(size_of_constraint,&Blas_LDA);
6846: PetscBLASIntCast(size_of_constraint,&Blas_LDB);
6847: PetscBLASIntCast(primal_dofs,&Blas_LDC);
6848: PetscFPTrapPush(PETSC_FP_TRAP_OFF);
6849: PetscStackCallBLAS("BLASgemm",BLASgemm_("T","N",&Blas_M,&Blas_N,&Blas_K,&one,dbg_work,&Blas_LDA,qr_basis,&Blas_LDB,&zero,&dbg_work[size_of_constraint*primal_dofs],&Blas_LDC));
6850: PetscFPTrapPop();
6851: for (jj=0;jj<size_of_constraint;jj++) {
6852: for (ii=0;ii<primal_dofs;ii++) {
6853: if (ii != jj && PetscAbsScalar(dbg_work[size_of_constraint*primal_dofs+jj*primal_dofs+ii]) > 1.e-12) valid_qr = PETSC_FALSE;
6854: if (ii == jj && PetscAbsScalar(dbg_work[size_of_constraint*primal_dofs+jj*primal_dofs+ii]-(PetscReal)1) > 1.e-12) valid_qr = PETSC_FALSE;
6855: }
6856: }
6857: if (!valid_qr) {
6858: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"\t-> wrong change of basis!\n");
6859: for (jj=0;jj<size_of_constraint;jj++) {
6860: for (ii=0;ii<primal_dofs;ii++) {
6861: if (ii != jj && PetscAbsScalar(dbg_work[size_of_constraint*primal_dofs+jj*primal_dofs+ii]) > 1.e-12) {
6862: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"\tQr basis function %D is not orthogonal to constraint %D (%1.14e)!\n",jj,ii,PetscAbsScalar(dbg_work[size_of_constraint*primal_dofs+jj*primal_dofs+ii]));
6863: }
6864: if (ii == jj && PetscAbsScalar(dbg_work[size_of_constraint*primal_dofs+jj*primal_dofs+ii]-(PetscReal)1) > 1.e-12) {
6865: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"\tQr basis function %D is not unitary w.r.t constraint %D (%1.14e)!\n",jj,ii,PetscAbsScalar(dbg_work[size_of_constraint*primal_dofs+jj*primal_dofs+ii]));
6866: }
6867: }
6868: }
6869: } else {
6870: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"\t-> right change of basis!\n");
6871: }
6872: }
6873: } else { /* simple transformation block */
6874: PetscInt row,col;
6875: PetscScalar val,norm;
6877: PetscBLASIntCast(size_of_constraint,&Blas_N);
6878: PetscStackCallBLAS("BLASdot",norm = BLASdot_(&Blas_N,constraints_data+constraints_data_ptr[total_counts],&Blas_one,constraints_data+constraints_data_ptr[total_counts],&Blas_one));
6879: for (j=0;j<size_of_constraint;j++) {
6880: PetscInt row_B = constraints_idxs_B[constraints_idxs_ptr[total_counts]+j];
6881: row = constraints_idxs[constraints_idxs_ptr[total_counts]+j];
6882: if (!PetscBTLookup(is_primal,row_B)) {
6883: col = constraints_idxs[constraints_idxs_ptr[total_counts]];
6884: MatSetValue(localChangeOfBasisMatrix,row,row,1.0,INSERT_VALUES);
6885: MatSetValue(localChangeOfBasisMatrix,row,col,constraints_data[constraints_data_ptr[total_counts]+j]/norm,INSERT_VALUES);
6886: } else {
6887: for (k=0;k<size_of_constraint;k++) {
6888: col = constraints_idxs[constraints_idxs_ptr[total_counts]+k];
6889: if (row != col) {
6890: val = -constraints_data[constraints_data_ptr[total_counts]+k]/constraints_data[constraints_data_ptr[total_counts]];
6891: } else {
6892: val = constraints_data[constraints_data_ptr[total_counts]]/norm;
6893: }
6894: MatSetValue(localChangeOfBasisMatrix,row,col,val,INSERT_VALUES);
6895: }
6896: }
6897: }
6898: if (pcbddc->dbg_flag) {
6899: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"\t-> using standard change of basis\n");
6900: }
6901: }
6902: } else {
6903: if (pcbddc->dbg_flag) {
6904: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Constraint %D does not need a change of basis (size %D)\n",total_counts,size_of_constraint);
6905: }
6906: }
6907: }
6909: /* free workspace */
6910: if (qr_needed) {
6911: if (pcbddc->dbg_flag) {
6912: PetscFree(dbg_work);
6913: }
6914: PetscFree(trs_rhs);
6915: PetscFree(qr_tau);
6916: PetscFree(qr_work);
6917: PetscFree(gqr_work);
6918: PetscFree(qr_basis);
6919: }
6920: PetscBTDestroy(&is_primal);
6921: MatAssemblyBegin(localChangeOfBasisMatrix,MAT_FINAL_ASSEMBLY);
6922: MatAssemblyEnd(localChangeOfBasisMatrix,MAT_FINAL_ASSEMBLY);
6924: /* assembling of global change of variable */
6925: if (!pcbddc->fake_change) {
6926: Mat tmat;
6927: PetscInt bs;
6929: VecGetSize(pcis->vec1_global,&global_size);
6930: VecGetLocalSize(pcis->vec1_global,&local_size);
6931: MatDuplicate(pc->pmat,MAT_DO_NOT_COPY_VALUES,&tmat);
6932: MatISSetLocalMat(tmat,localChangeOfBasisMatrix);
6933: MatAssemblyBegin(tmat,MAT_FINAL_ASSEMBLY);
6934: MatAssemblyEnd(tmat,MAT_FINAL_ASSEMBLY);
6935: MatCreate(PetscObjectComm((PetscObject)pc),&pcbddc->ChangeOfBasisMatrix);
6936: MatSetType(pcbddc->ChangeOfBasisMatrix,MATAIJ);
6937: MatGetBlockSize(pc->pmat,&bs);
6938: MatSetBlockSize(pcbddc->ChangeOfBasisMatrix,bs);
6939: MatSetSizes(pcbddc->ChangeOfBasisMatrix,local_size,local_size,global_size,global_size);
6940: MatISSetMPIXAIJPreallocation_Private(tmat,pcbddc->ChangeOfBasisMatrix,PETSC_TRUE);
6941: MatConvert(tmat,MATAIJ,MAT_REUSE_MATRIX,&pcbddc->ChangeOfBasisMatrix);
6942: MatDestroy(&tmat);
6943: VecSet(pcis->vec1_global,0.0);
6944: VecSet(pcis->vec1_N,1.0);
6945: VecScatterBegin(matis->rctx,pcis->vec1_N,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);
6946: VecScatterEnd(matis->rctx,pcis->vec1_N,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);
6947: VecReciprocal(pcis->vec1_global);
6948: MatDiagonalScale(pcbddc->ChangeOfBasisMatrix,pcis->vec1_global,NULL);
6950: /* check */
6951: if (pcbddc->dbg_flag) {
6952: PetscReal error;
6953: Vec x,x_change;
6955: VecDuplicate(pcis->vec1_global,&x);
6956: VecDuplicate(pcis->vec1_global,&x_change);
6957: VecSetRandom(x,NULL);
6958: VecCopy(x,pcis->vec1_global);
6959: VecScatterBegin(matis->rctx,x,pcis->vec1_N,INSERT_VALUES,SCATTER_FORWARD);
6960: VecScatterEnd(matis->rctx,x,pcis->vec1_N,INSERT_VALUES,SCATTER_FORWARD);
6961: MatMult(localChangeOfBasisMatrix,pcis->vec1_N,pcis->vec2_N);
6962: VecScatterBegin(matis->rctx,pcis->vec2_N,x,INSERT_VALUES,SCATTER_REVERSE);
6963: VecScatterEnd(matis->rctx,pcis->vec2_N,x,INSERT_VALUES,SCATTER_REVERSE);
6964: MatMult(pcbddc->ChangeOfBasisMatrix,pcis->vec1_global,x_change);
6965: VecAXPY(x,-1.0,x_change);
6966: VecNorm(x,NORM_INFINITY,&error);
6967: if (error > PETSC_SMALL) {
6968: SETERRQ1(PetscObjectComm((PetscObject)pc),PETSC_ERR_PLIB,"Error global vs local change on N: %1.6e",error);
6969: }
6970: VecDestroy(&x);
6971: VecDestroy(&x_change);
6972: }
6973: /* adapt sub_schurs computed (if any) */
6974: if (pcbddc->use_deluxe_scaling) {
6975: PCBDDCSubSchurs sub_schurs=pcbddc->sub_schurs;
6977: if (pcbddc->use_change_of_basis && pcbddc->adaptive_userdefined) SETERRQ(PetscObjectComm((PetscObject)pc),PETSC_ERR_SUP,"Cannot mix automatic change of basis, adaptive selection and user-defined constraints");
6978: if (sub_schurs && sub_schurs->S_Ej_all) {
6979: Mat S_new,tmat;
6980: IS is_all_N,is_V_Sall = NULL;
6982: ISLocalToGlobalMappingApplyIS(pcis->BtoNmap,sub_schurs->is_Ej_all,&is_all_N);
6983: MatCreateSubMatrix(localChangeOfBasisMatrix,is_all_N,is_all_N,MAT_INITIAL_MATRIX,&tmat);
6984: if (pcbddc->deluxe_zerorows) {
6985: ISLocalToGlobalMapping NtoSall;
6986: IS is_V;
6987: ISCreateGeneral(PETSC_COMM_SELF,pcbddc->n_vertices,pcbddc->local_primal_ref_node,PETSC_COPY_VALUES,&is_V);
6988: ISLocalToGlobalMappingCreateIS(is_all_N,&NtoSall);
6989: ISGlobalToLocalMappingApplyIS(NtoSall,IS_GTOLM_DROP,is_V,&is_V_Sall);
6990: ISLocalToGlobalMappingDestroy(&NtoSall);
6991: ISDestroy(&is_V);
6992: }
6993: ISDestroy(&is_all_N);
6994: MatPtAP(sub_schurs->S_Ej_all,tmat,MAT_INITIAL_MATRIX,1.0,&S_new);
6995: MatDestroy(&sub_schurs->S_Ej_all);
6996: PetscObjectReference((PetscObject)S_new);
6997: if (pcbddc->deluxe_zerorows) {
6998: const PetscScalar *array;
6999: const PetscInt *idxs_V,*idxs_all;
7000: PetscInt i,n_V;
7002: MatZeroRowsColumnsIS(S_new,is_V_Sall,1.,NULL,NULL);
7003: ISGetLocalSize(is_V_Sall,&n_V);
7004: ISGetIndices(is_V_Sall,&idxs_V);
7005: ISGetIndices(sub_schurs->is_Ej_all,&idxs_all);
7006: VecGetArrayRead(pcis->D,&array);
7007: for (i=0;i<n_V;i++) {
7008: PetscScalar val;
7009: PetscInt idx;
7011: idx = idxs_V[i];
7012: val = array[idxs_all[idxs_V[i]]];
7013: MatSetValue(S_new,idx,idx,val,INSERT_VALUES);
7014: }
7015: MatAssemblyBegin(S_new,MAT_FINAL_ASSEMBLY);
7016: MatAssemblyEnd(S_new,MAT_FINAL_ASSEMBLY);
7017: VecRestoreArrayRead(pcis->D,&array);
7018: ISRestoreIndices(sub_schurs->is_Ej_all,&idxs_all);
7019: ISRestoreIndices(is_V_Sall,&idxs_V);
7020: }
7021: sub_schurs->S_Ej_all = S_new;
7022: MatDestroy(&S_new);
7023: if (sub_schurs->sum_S_Ej_all) {
7024: MatPtAP(sub_schurs->sum_S_Ej_all,tmat,MAT_INITIAL_MATRIX,1.0,&S_new);
7025: MatDestroy(&sub_schurs->sum_S_Ej_all);
7026: PetscObjectReference((PetscObject)S_new);
7027: if (pcbddc->deluxe_zerorows) {
7028: MatZeroRowsColumnsIS(S_new,is_V_Sall,1.,NULL,NULL);
7029: }
7030: sub_schurs->sum_S_Ej_all = S_new;
7031: MatDestroy(&S_new);
7032: }
7033: ISDestroy(&is_V_Sall);
7034: MatDestroy(&tmat);
7035: }
7036: /* destroy any change of basis context in sub_schurs */
7037: if (sub_schurs && sub_schurs->change) {
7038: PetscInt i;
7040: for (i=0;i<sub_schurs->n_subs;i++) {
7041: KSPDestroy(&sub_schurs->change[i]);
7042: }
7043: PetscFree(sub_schurs->change);
7044: }
7045: }
7046: if (pcbddc->switch_static) { /* need to save the local change */
7047: pcbddc->switch_static_change = localChangeOfBasisMatrix;
7048: } else {
7049: MatDestroy(&localChangeOfBasisMatrix);
7050: }
7051: /* determine if any process has changed the pressures locally */
7052: pcbddc->change_interior = pcbddc->benign_have_null;
7053: } else { /* fake change (get back change of basis into ConstraintMatrix and info on qr) */
7054: MatDestroy(&pcbddc->ConstraintMatrix);
7055: pcbddc->ConstraintMatrix = localChangeOfBasisMatrix;
7056: pcbddc->use_qr_single = qr_needed;
7057: }
7058: } else if (pcbddc->user_ChangeOfBasisMatrix || pcbddc->benign_saddle_point) {
7059: if (!pcbddc->benign_have_null && pcbddc->user_ChangeOfBasisMatrix) {
7060: PetscObjectReference((PetscObject)pcbddc->user_ChangeOfBasisMatrix);
7061: pcbddc->ChangeOfBasisMatrix = pcbddc->user_ChangeOfBasisMatrix;
7062: } else {
7063: Mat benign_global = NULL;
7064: if (pcbddc->benign_have_null) {
7065: Mat M;
7067: pcbddc->change_interior = PETSC_TRUE;
7068: VecCopy(matis->counter,pcis->vec1_N);
7069: VecReciprocal(pcis->vec1_N);
7070: MatDuplicate(pc->pmat,MAT_DO_NOT_COPY_VALUES,&benign_global);
7071: if (pcbddc->benign_change) {
7072: MatDuplicate(pcbddc->benign_change,MAT_COPY_VALUES,&M);
7073: MatDiagonalScale(M,pcis->vec1_N,NULL);
7074: } else {
7075: MatCreateSeqAIJ(PETSC_COMM_SELF,pcis->n,pcis->n,1,NULL,&M);
7076: MatDiagonalSet(M,pcis->vec1_N,INSERT_VALUES);
7077: }
7078: MatISSetLocalMat(benign_global,M);
7079: MatDestroy(&M);
7080: MatAssemblyBegin(benign_global,MAT_FINAL_ASSEMBLY);
7081: MatAssemblyEnd(benign_global,MAT_FINAL_ASSEMBLY);
7082: }
7083: if (pcbddc->user_ChangeOfBasisMatrix) {
7084: MatMatMult(pcbddc->user_ChangeOfBasisMatrix,benign_global,MAT_INITIAL_MATRIX,PETSC_DEFAULT,&pcbddc->ChangeOfBasisMatrix);
7085: MatDestroy(&benign_global);
7086: } else if (pcbddc->benign_have_null) {
7087: pcbddc->ChangeOfBasisMatrix = benign_global;
7088: }
7089: }
7090: if (pcbddc->switch_static && pcbddc->ChangeOfBasisMatrix) { /* need to save the local change */
7091: IS is_global;
7092: const PetscInt *gidxs;
7094: ISLocalToGlobalMappingGetIndices(pc->pmat->rmap->mapping,&gidxs);
7095: ISCreateGeneral(PetscObjectComm((PetscObject)pc),pcis->n,gidxs,PETSC_COPY_VALUES,&is_global);
7096: ISLocalToGlobalMappingRestoreIndices(pc->pmat->rmap->mapping,&gidxs);
7097: MatCreateSubMatrixUnsorted(pcbddc->ChangeOfBasisMatrix,is_global,is_global,&pcbddc->switch_static_change);
7098: ISDestroy(&is_global);
7099: }
7100: }
7101: if (!pcbddc->fake_change && pcbddc->ChangeOfBasisMatrix && !pcbddc->work_change) {
7102: VecDuplicate(pcis->vec1_global,&pcbddc->work_change);
7103: }
7105: if (!pcbddc->fake_change) {
7106: /* add pressure dofs to set of primal nodes for numbering purposes */
7107: for (i=0;i<pcbddc->benign_n;i++) {
7108: pcbddc->local_primal_ref_node[pcbddc->local_primal_size_cc] = pcbddc->benign_p0_lidx[i];
7109: pcbddc->primal_indices_local_idxs[pcbddc->local_primal_size] = pcbddc->benign_p0_lidx[i];
7110: pcbddc->local_primal_ref_mult[pcbddc->local_primal_size_cc] = 1;
7111: pcbddc->local_primal_size_cc++;
7112: pcbddc->local_primal_size++;
7113: }
7115: /* check if a new primal space has been introduced (also take into account benign trick) */
7116: pcbddc->new_primal_space_local = PETSC_TRUE;
7117: if (olocal_primal_size == pcbddc->local_primal_size) {
7118: PetscArraycmp(pcbddc->local_primal_ref_node,olocal_primal_ref_node,olocal_primal_size_cc,&pcbddc->new_primal_space_local);
7119: pcbddc->new_primal_space_local = (PetscBool)(!pcbddc->new_primal_space_local);
7120: if (!pcbddc->new_primal_space_local) {
7121: PetscArraycmp(pcbddc->local_primal_ref_mult,olocal_primal_ref_mult,olocal_primal_size_cc,&pcbddc->new_primal_space_local);
7122: pcbddc->new_primal_space_local = (PetscBool)(!pcbddc->new_primal_space_local);
7123: }
7124: }
7125: /* new_primal_space will be used for numbering of coarse dofs, so it should be the same across all subdomains */
7126: MPIU_Allreduce(&pcbddc->new_primal_space_local,&pcbddc->new_primal_space,1,MPIU_BOOL,MPI_LOR,PetscObjectComm((PetscObject)pc));
7127: }
7128: PetscFree2(olocal_primal_ref_node,olocal_primal_ref_mult);
7130: /* flush dbg viewer */
7131: if (pcbddc->dbg_flag) {
7132: PetscViewerFlush(pcbddc->dbg_viewer);
7133: }
7135: /* free workspace */
7136: PetscBTDestroy(&qr_needed_idx);
7137: PetscBTDestroy(&change_basis);
7138: if (!pcbddc->adaptive_selection) {
7139: PetscFree3(constraints_idxs_ptr,constraints_data_ptr,constraints_n);
7140: PetscFree3(constraints_data,constraints_idxs,constraints_idxs_B);
7141: } else {
7142: PetscFree5(pcbddc->adaptive_constraints_n,
7143: pcbddc->adaptive_constraints_idxs_ptr,
7144: pcbddc->adaptive_constraints_data_ptr,
7145: pcbddc->adaptive_constraints_idxs,
7146: pcbddc->adaptive_constraints_data);
7147: PetscFree(constraints_n);
7148: PetscFree(constraints_idxs_B);
7149: }
7150: return(0);
7151: }
7153: PetscErrorCode PCBDDCAnalyzeInterface(PC pc)
7154: {
7155: ISLocalToGlobalMapping map;
7156: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
7157: Mat_IS *matis = (Mat_IS*)pc->pmat->data;
7158: PetscInt i,N;
7159: PetscBool rcsr = PETSC_FALSE;
7160: PetscErrorCode ierr;
7163: if (pcbddc->recompute_topography) {
7164: pcbddc->graphanalyzed = PETSC_FALSE;
7165: /* Reset previously computed graph */
7166: PCBDDCGraphReset(pcbddc->mat_graph);
7167: /* Init local Graph struct */
7168: MatGetSize(pc->pmat,&N,NULL);
7169: MatGetLocalToGlobalMapping(pc->pmat,&map,NULL);
7170: PCBDDCGraphInit(pcbddc->mat_graph,map,N,pcbddc->graphmaxcount);
7172: if (pcbddc->user_primal_vertices_local && !pcbddc->user_primal_vertices) {
7173: PCBDDCConsistencyCheckIS(pc,MPI_LOR,&pcbddc->user_primal_vertices_local);
7174: }
7175: /* Check validity of the csr graph passed in by the user */
7176: if (pcbddc->mat_graph->nvtxs_csr && pcbddc->mat_graph->nvtxs_csr != pcbddc->mat_graph->nvtxs) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONG,"Invalid size of local CSR graph! Found %D, expected %D",pcbddc->mat_graph->nvtxs_csr,pcbddc->mat_graph->nvtxs);
7178: /* Set default CSR adjacency of local dofs if not provided by the user with PCBDDCSetLocalAdjacencyGraph */
7179: if (!pcbddc->mat_graph->xadj && pcbddc->use_local_adj) {
7180: PetscInt *xadj,*adjncy;
7181: PetscInt nvtxs;
7182: PetscBool flg_row=PETSC_FALSE;
7184: MatGetRowIJ(matis->A,0,PETSC_TRUE,PETSC_FALSE,&nvtxs,(const PetscInt**)&xadj,(const PetscInt**)&adjncy,&flg_row);
7185: if (flg_row) {
7186: PCBDDCSetLocalAdjacencyGraph(pc,nvtxs,xadj,adjncy,PETSC_COPY_VALUES);
7187: pcbddc->computed_rowadj = PETSC_TRUE;
7188: }
7189: MatRestoreRowIJ(matis->A,0,PETSC_TRUE,PETSC_FALSE,&nvtxs,(const PetscInt**)&xadj,(const PetscInt**)&adjncy,&flg_row);
7190: rcsr = PETSC_TRUE;
7191: }
7192: if (pcbddc->dbg_flag) {
7193: PetscViewerFlush(pcbddc->dbg_viewer);
7194: }
7196: if (pcbddc->mat_graph->cdim && !pcbddc->mat_graph->cloc) {
7197: PetscReal *lcoords;
7198: PetscInt n;
7199: MPI_Datatype dimrealtype;
7201: /* TODO: support for blocked */
7202: if (pcbddc->mat_graph->cnloc != pc->pmat->rmap->n) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_USER,"Invalid number of local coordinates! Got %D, expected %D",pcbddc->mat_graph->cnloc,pc->pmat->rmap->n);
7203: MatGetLocalSize(matis->A,&n,NULL);
7204: PetscMalloc1(pcbddc->mat_graph->cdim*n,&lcoords);
7205: MPI_Type_contiguous(pcbddc->mat_graph->cdim,MPIU_REAL,&dimrealtype);
7206: MPI_Type_commit(&dimrealtype);
7207: PetscSFBcastBegin(matis->sf,dimrealtype,pcbddc->mat_graph->coords,lcoords);
7208: PetscSFBcastEnd(matis->sf,dimrealtype,pcbddc->mat_graph->coords,lcoords);
7209: MPI_Type_free(&dimrealtype);
7210: PetscFree(pcbddc->mat_graph->coords);
7212: pcbddc->mat_graph->coords = lcoords;
7213: pcbddc->mat_graph->cloc = PETSC_TRUE;
7214: pcbddc->mat_graph->cnloc = n;
7215: }
7216: if (pcbddc->mat_graph->cnloc && pcbddc->mat_graph->cnloc != pcbddc->mat_graph->nvtxs) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_USER,"Invalid number of local subdomain coordinates! Got %D, expected %D",pcbddc->mat_graph->cnloc,pcbddc->mat_graph->nvtxs);
7217: pcbddc->mat_graph->active_coords = (PetscBool)(pcbddc->corner_selection && !pcbddc->corner_selected);
7219: /* Setup of Graph */
7220: pcbddc->mat_graph->commsizelimit = 0; /* don't use the COMM_SELF variant of the graph */
7221: PCBDDCGraphSetUp(pcbddc->mat_graph,pcbddc->vertex_size,pcbddc->NeumannBoundariesLocal,pcbddc->DirichletBoundariesLocal,pcbddc->n_ISForDofsLocal,pcbddc->ISForDofsLocal,pcbddc->user_primal_vertices_local);
7223: /* attach info on disconnected subdomains if present */
7224: if (pcbddc->n_local_subs) {
7225: PetscInt *local_subs,n,totn;
7227: MatGetLocalSize(matis->A,&n,NULL);
7228: PetscMalloc1(n,&local_subs);
7229: for (i=0;i<n;i++) local_subs[i] = pcbddc->n_local_subs;
7230: for (i=0;i<pcbddc->n_local_subs;i++) {
7231: const PetscInt *idxs;
7232: PetscInt nl,j;
7234: ISGetLocalSize(pcbddc->local_subs[i],&nl);
7235: ISGetIndices(pcbddc->local_subs[i],&idxs);
7236: for (j=0;j<nl;j++) local_subs[idxs[j]] = i;
7237: ISRestoreIndices(pcbddc->local_subs[i],&idxs);
7238: }
7239: for (i=0,totn=0;i<n;i++) totn = PetscMax(totn,local_subs[i]);
7240: pcbddc->mat_graph->n_local_subs = totn + 1;
7241: pcbddc->mat_graph->local_subs = local_subs;
7242: }
7243: }
7245: if (!pcbddc->graphanalyzed) {
7246: /* Graph's connected components analysis */
7247: PCBDDCGraphComputeConnectedComponents(pcbddc->mat_graph);
7248: pcbddc->graphanalyzed = PETSC_TRUE;
7249: pcbddc->corner_selected = pcbddc->corner_selection;
7250: }
7251: if (rcsr) pcbddc->mat_graph->nvtxs_csr = 0;
7252: return(0);
7253: }
7255: PetscErrorCode PCBDDCOrthonormalizeVecs(PetscInt *nio, Vec vecs[])
7256: {
7257: PetscInt i,j,n;
7258: PetscScalar *alphas;
7259: PetscReal norm,*onorms;
7263: n = *nio;
7264: if (!n) return(0);
7265: PetscMalloc2(n,&alphas,n,&onorms);
7266: VecNormalize(vecs[0],&norm);
7267: if (norm < PETSC_SMALL) {
7268: onorms[0] = 0.0;
7269: VecSet(vecs[0],0.0);
7270: } else {
7271: onorms[0] = norm;
7272: }
7274: for (i=1;i<n;i++) {
7275: VecMDot(vecs[i],i,vecs,alphas);
7276: for (j=0;j<i;j++) alphas[j] = PetscConj(-alphas[j]);
7277: VecMAXPY(vecs[i],i,alphas,vecs);
7278: VecNormalize(vecs[i],&norm);
7279: if (norm < PETSC_SMALL) {
7280: onorms[i] = 0.0;
7281: VecSet(vecs[i],0.0);
7282: } else {
7283: onorms[i] = norm;
7284: }
7285: }
7286: /* push nonzero vectors at the beginning */
7287: for (i=0;i<n;i++) {
7288: if (onorms[i] == 0.0) {
7289: for (j=i+1;j<n;j++) {
7290: if (onorms[j] != 0.0) {
7291: VecCopy(vecs[j],vecs[i]);
7292: onorms[j] = 0.0;
7293: }
7294: }
7295: }
7296: }
7297: for (i=0,*nio=0;i<n;i++) *nio += onorms[i] != 0.0 ? 1 : 0;
7298: PetscFree2(alphas,onorms);
7299: return(0);
7300: }
7302: PetscErrorCode PCBDDCMatISGetSubassemblingPattern(Mat mat, PetscInt *n_subdomains, PetscInt redprocs, IS* is_sends, PetscBool *have_void)
7303: {
7304: Mat A;
7305: PetscInt n_neighs,*neighs,*n_shared,**shared;
7306: PetscMPIInt size,rank,color;
7307: PetscInt *xadj,*adjncy;
7308: PetscInt *adjncy_wgt,*v_wgt,*ranks_send_to_idx;
7309: PetscInt im_active,active_procs,N,n,i,j,threshold = 2;
7310: PetscInt void_procs,*procs_candidates = NULL;
7311: PetscInt xadj_count,*count;
7312: PetscBool ismatis,use_vwgt=PETSC_FALSE;
7313: PetscSubcomm psubcomm;
7314: MPI_Comm subcomm;
7319: PetscObjectTypeCompare((PetscObject)mat,MATIS,&ismatis);
7320: if (!ismatis) SETERRQ1(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Cannot use %s on a matrix object which is not of type MATIS",PETSC_FUNCTION_NAME);
7323: if (*n_subdomains <=0) SETERRQ1(PetscObjectComm((PetscObject)mat),PETSC_ERR_ARG_WRONG,"Invalid number of subdomains requested %D",*n_subdomains);
7325: if (have_void) *have_void = PETSC_FALSE;
7326: MPI_Comm_size(PetscObjectComm((PetscObject)mat),&size);
7327: MPI_Comm_rank(PetscObjectComm((PetscObject)mat),&rank);
7328: MatISGetLocalMat(mat,&A);
7329: MatGetLocalSize(A,&n,NULL);
7330: im_active = !!n;
7331: MPIU_Allreduce(&im_active,&active_procs,1,MPIU_INT,MPI_SUM,PetscObjectComm((PetscObject)mat));
7332: void_procs = size - active_procs;
7333: /* get ranks of of non-active processes in mat communicator */
7334: if (void_procs) {
7335: PetscInt ncand;
7337: if (have_void) *have_void = PETSC_TRUE;
7338: PetscMalloc1(size,&procs_candidates);
7339: MPI_Allgather(&im_active,1,MPIU_INT,procs_candidates,1,MPIU_INT,PetscObjectComm((PetscObject)mat));
7340: for (i=0,ncand=0;i<size;i++) {
7341: if (!procs_candidates[i]) {
7342: procs_candidates[ncand++] = i;
7343: }
7344: }
7345: /* force n_subdomains to be not greater that the number of non-active processes */
7346: *n_subdomains = PetscMin(void_procs,*n_subdomains);
7347: }
7349: /* number of subdomains requested greater than active processes or matrix size -> just shift the matrix
7350: number of subdomains requested 1 -> send to master or first candidate in voids */
7351: MatGetSize(mat,&N,NULL);
7352: if (active_procs < *n_subdomains || *n_subdomains == 1 || N <= *n_subdomains) {
7353: PetscInt issize,isidx,dest;
7354: if (*n_subdomains == 1) dest = 0;
7355: else dest = rank;
7356: if (im_active) {
7357: issize = 1;
7358: if (procs_candidates) { /* shift the pattern on non-active candidates (if any) */
7359: isidx = procs_candidates[dest];
7360: } else {
7361: isidx = dest;
7362: }
7363: } else {
7364: issize = 0;
7365: isidx = -1;
7366: }
7367: if (*n_subdomains != 1) *n_subdomains = active_procs;
7368: ISCreateGeneral(PetscObjectComm((PetscObject)mat),issize,&isidx,PETSC_COPY_VALUES,is_sends);
7369: PetscFree(procs_candidates);
7370: return(0);
7371: }
7372: PetscOptionsGetBool(NULL,NULL,"-matis_partitioning_use_vwgt",&use_vwgt,NULL);
7373: PetscOptionsGetInt(NULL,NULL,"-matis_partitioning_threshold",&threshold,NULL);
7374: threshold = PetscMax(threshold,2);
7376: /* Get info on mapping */
7377: ISLocalToGlobalMappingGetInfo(mat->rmap->mapping,&n_neighs,&neighs,&n_shared,&shared);
7379: /* build local CSR graph of subdomains' connectivity */
7380: PetscMalloc1(2,&xadj);
7381: xadj[0] = 0;
7382: xadj[1] = PetscMax(n_neighs-1,0);
7383: PetscMalloc1(xadj[1],&adjncy);
7384: PetscMalloc1(xadj[1],&adjncy_wgt);
7385: PetscCalloc1(n,&count);
7386: for (i=1;i<n_neighs;i++)
7387: for (j=0;j<n_shared[i];j++)
7388: count[shared[i][j]] += 1;
7390: xadj_count = 0;
7391: for (i=1;i<n_neighs;i++) {
7392: for (j=0;j<n_shared[i];j++) {
7393: if (count[shared[i][j]] < threshold) {
7394: adjncy[xadj_count] = neighs[i];
7395: adjncy_wgt[xadj_count] = n_shared[i];
7396: xadj_count++;
7397: break;
7398: }
7399: }
7400: }
7401: xadj[1] = xadj_count;
7402: PetscFree(count);
7403: ISLocalToGlobalMappingRestoreInfo(mat->rmap->mapping,&n_neighs,&neighs,&n_shared,&shared);
7404: PetscSortIntWithArray(xadj[1],adjncy,adjncy_wgt);
7406: PetscMalloc1(1,&ranks_send_to_idx);
7408: /* Restrict work on active processes only */
7409: PetscMPIIntCast(im_active,&color);
7410: if (void_procs) {
7411: PetscSubcommCreate(PetscObjectComm((PetscObject)mat),&psubcomm);
7412: PetscSubcommSetNumber(psubcomm,2); /* 2 groups, active process and not active processes */
7413: PetscSubcommSetTypeGeneral(psubcomm,color,rank);
7414: subcomm = PetscSubcommChild(psubcomm);
7415: } else {
7416: psubcomm = NULL;
7417: subcomm = PetscObjectComm((PetscObject)mat);
7418: }
7420: v_wgt = NULL;
7421: if (!color) {
7422: PetscFree(xadj);
7423: PetscFree(adjncy);
7424: PetscFree(adjncy_wgt);
7425: } else {
7426: Mat subdomain_adj;
7427: IS new_ranks,new_ranks_contig;
7428: MatPartitioning partitioner;
7429: PetscInt rstart=0,rend=0;
7430: PetscInt *is_indices,*oldranks;
7431: PetscMPIInt size;
7432: PetscBool aggregate;
7434: MPI_Comm_size(subcomm,&size);
7435: if (void_procs) {
7436: PetscInt prank = rank;
7437: PetscMalloc1(size,&oldranks);
7438: MPI_Allgather(&prank,1,MPIU_INT,oldranks,1,MPIU_INT,subcomm);
7439: for (i=0;i<xadj[1];i++) {
7440: PetscFindInt(adjncy[i],size,oldranks,&adjncy[i]);
7441: }
7442: PetscSortIntWithArray(xadj[1],adjncy,adjncy_wgt);
7443: } else {
7444: oldranks = NULL;
7445: }
7446: aggregate = ((redprocs > 0 && redprocs < size) ? PETSC_TRUE : PETSC_FALSE);
7447: if (aggregate) { /* TODO: all this part could be made more efficient */
7448: PetscInt lrows,row,ncols,*cols;
7449: PetscMPIInt nrank;
7450: PetscScalar *vals;
7452: MPI_Comm_rank(subcomm,&nrank);
7453: lrows = 0;
7454: if (nrank<redprocs) {
7455: lrows = size/redprocs;
7456: if (nrank<size%redprocs) lrows++;
7457: }
7458: MatCreateAIJ(subcomm,lrows,lrows,size,size,50,NULL,50,NULL,&subdomain_adj);
7459: MatGetOwnershipRange(subdomain_adj,&rstart,&rend);
7460: MatSetOption(subdomain_adj,MAT_NEW_NONZERO_LOCATION_ERR,PETSC_FALSE);
7461: MatSetOption(subdomain_adj,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_FALSE);
7462: row = nrank;
7463: ncols = xadj[1]-xadj[0];
7464: cols = adjncy;
7465: PetscMalloc1(ncols,&vals);
7466: for (i=0;i<ncols;i++) vals[i] = adjncy_wgt[i];
7467: MatSetValues(subdomain_adj,1,&row,ncols,cols,vals,INSERT_VALUES);
7468: MatAssemblyBegin(subdomain_adj,MAT_FINAL_ASSEMBLY);
7469: MatAssemblyEnd(subdomain_adj,MAT_FINAL_ASSEMBLY);
7470: PetscFree(xadj);
7471: PetscFree(adjncy);
7472: PetscFree(adjncy_wgt);
7473: PetscFree(vals);
7474: if (use_vwgt) {
7475: Vec v;
7476: const PetscScalar *array;
7477: PetscInt nl;
7479: MatCreateVecs(subdomain_adj,&v,NULL);
7480: VecSetValue(v,row,(PetscScalar)n,INSERT_VALUES);
7481: VecAssemblyBegin(v);
7482: VecAssemblyEnd(v);
7483: VecGetLocalSize(v,&nl);
7484: VecGetArrayRead(v,&array);
7485: PetscMalloc1(nl,&v_wgt);
7486: for (i=0;i<nl;i++) v_wgt[i] = (PetscInt)PetscRealPart(array[i]);
7487: VecRestoreArrayRead(v,&array);
7488: VecDestroy(&v);
7489: }
7490: } else {
7491: MatCreateMPIAdj(subcomm,1,(PetscInt)size,xadj,adjncy,adjncy_wgt,&subdomain_adj);
7492: if (use_vwgt) {
7493: PetscMalloc1(1,&v_wgt);
7494: v_wgt[0] = n;
7495: }
7496: }
7497: /* MatView(subdomain_adj,0); */
7499: /* Partition */
7500: MatPartitioningCreate(subcomm,&partitioner);
7501: #if defined(PETSC_HAVE_PTSCOTCH)
7502: MatPartitioningSetType(partitioner,MATPARTITIONINGPTSCOTCH);
7503: #elif defined(PETSC_HAVE_PARMETIS)
7504: MatPartitioningSetType(partitioner,MATPARTITIONINGPARMETIS);
7505: #else
7506: MatPartitioningSetType(partitioner,MATPARTITIONINGAVERAGE);
7507: #endif
7508: MatPartitioningSetAdjacency(partitioner,subdomain_adj);
7509: if (v_wgt) {
7510: MatPartitioningSetVertexWeights(partitioner,v_wgt);
7511: }
7512: *n_subdomains = PetscMin((PetscInt)size,*n_subdomains);
7513: MatPartitioningSetNParts(partitioner,*n_subdomains);
7514: MatPartitioningSetFromOptions(partitioner);
7515: MatPartitioningApply(partitioner,&new_ranks);
7516: /* MatPartitioningView(partitioner,0); */
7518: /* renumber new_ranks to avoid "holes" in new set of processors */
7519: ISRenumber(new_ranks,NULL,NULL,&new_ranks_contig);
7520: ISDestroy(&new_ranks);
7521: ISGetIndices(new_ranks_contig,(const PetscInt**)&is_indices);
7522: if (!aggregate) {
7523: if (procs_candidates) { /* shift the pattern on non-active candidates (if any) */
7524: #if defined(PETSC_USE_DEBUG)
7525: if (!oldranks) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"This should not happen");
7526: #endif
7527: ranks_send_to_idx[0] = procs_candidates[oldranks[is_indices[0]]];
7528: } else if (oldranks) {
7529: ranks_send_to_idx[0] = oldranks[is_indices[0]];
7530: } else {
7531: ranks_send_to_idx[0] = is_indices[0];
7532: }
7533: } else {
7534: PetscInt idx = 0;
7535: PetscMPIInt tag;
7536: MPI_Request *reqs;
7538: PetscObjectGetNewTag((PetscObject)subdomain_adj,&tag);
7539: PetscMalloc1(rend-rstart,&reqs);
7540: for (i=rstart;i<rend;i++) {
7541: MPI_Isend(is_indices+i-rstart,1,MPIU_INT,i,tag,subcomm,&reqs[i-rstart]);
7542: }
7543: MPI_Recv(&idx,1,MPIU_INT,MPI_ANY_SOURCE,tag,subcomm,MPI_STATUS_IGNORE);
7544: MPI_Waitall(rend-rstart,reqs,MPI_STATUSES_IGNORE);
7545: PetscFree(reqs);
7546: if (procs_candidates) { /* shift the pattern on non-active candidates (if any) */
7547: #if defined(PETSC_USE_DEBUG)
7548: if (!oldranks) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"This should not happen");
7549: #endif
7550: ranks_send_to_idx[0] = procs_candidates[oldranks[idx]];
7551: } else if (oldranks) {
7552: ranks_send_to_idx[0] = oldranks[idx];
7553: } else {
7554: ranks_send_to_idx[0] = idx;
7555: }
7556: }
7557: ISRestoreIndices(new_ranks_contig,(const PetscInt**)&is_indices);
7558: /* clean up */
7559: PetscFree(oldranks);
7560: ISDestroy(&new_ranks_contig);
7561: MatDestroy(&subdomain_adj);
7562: MatPartitioningDestroy(&partitioner);
7563: }
7564: PetscSubcommDestroy(&psubcomm);
7565: PetscFree(procs_candidates);
7567: /* assemble parallel IS for sends */
7568: i = 1;
7569: if (!color) i=0;
7570: ISCreateGeneral(PetscObjectComm((PetscObject)mat),i,ranks_send_to_idx,PETSC_OWN_POINTER,is_sends);
7571: return(0);
7572: }
7574: typedef enum {MATDENSE_PRIVATE=0,MATAIJ_PRIVATE,MATBAIJ_PRIVATE,MATSBAIJ_PRIVATE}MatTypePrivate;
7576: PetscErrorCode PCBDDCMatISSubassemble(Mat mat, IS is_sends, PetscInt n_subdomains, PetscBool restrict_comm, PetscBool restrict_full, PetscBool reuse, Mat *mat_n, PetscInt nis, IS isarray[], PetscInt nvecs, Vec nnsp_vec[])
7577: {
7578: Mat local_mat;
7579: IS is_sends_internal;
7580: PetscInt rows,cols,new_local_rows;
7581: PetscInt i,bs,buf_size_idxs,buf_size_idxs_is,buf_size_vals,buf_size_vecs;
7582: PetscBool ismatis,isdense,newisdense,destroy_mat;
7583: ISLocalToGlobalMapping l2gmap;
7584: PetscInt* l2gmap_indices;
7585: const PetscInt* is_indices;
7586: MatType new_local_type;
7587: /* buffers */
7588: PetscInt *ptr_idxs,*send_buffer_idxs,*recv_buffer_idxs;
7589: PetscInt *ptr_idxs_is,*send_buffer_idxs_is,*recv_buffer_idxs_is;
7590: PetscInt *recv_buffer_idxs_local;
7591: PetscScalar *ptr_vals,*recv_buffer_vals;
7592: const PetscScalar *send_buffer_vals;
7593: PetscScalar *ptr_vecs,*send_buffer_vecs,*recv_buffer_vecs;
7594: /* MPI */
7595: MPI_Comm comm,comm_n;
7596: PetscSubcomm subcomm;
7597: PetscMPIInt n_sends,n_recvs,size;
7598: PetscMPIInt *iflags,*ilengths_idxs,*ilengths_vals,*ilengths_idxs_is;
7599: PetscMPIInt *onodes,*onodes_is,*olengths_idxs,*olengths_idxs_is,*olengths_vals;
7600: PetscMPIInt len,tag_idxs,tag_idxs_is,tag_vals,tag_vecs,source_dest;
7601: MPI_Request *send_req_idxs,*send_req_idxs_is,*send_req_vals,*send_req_vecs;
7602: MPI_Request *recv_req_idxs,*recv_req_idxs_is,*recv_req_vals,*recv_req_vecs;
7603: PetscErrorCode ierr;
7607: PetscObjectTypeCompare((PetscObject)mat,MATIS,&ismatis);
7608: if (!ismatis) SETERRQ1(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Cannot use %s on a matrix object which is not of type MATIS",PETSC_FUNCTION_NAME);
7615: if (nvecs) {
7616: if (nvecs > 1) SETERRQ(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Just 1 vector supported");
7618: }
7619: /* further checks */
7620: MatISGetLocalMat(mat,&local_mat);
7621: PetscObjectTypeCompare((PetscObject)local_mat,MATSEQDENSE,&isdense);
7622: if (!isdense) SETERRQ(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Currently cannot subassemble MATIS when local matrix type is not of type SEQDENSE");
7623: MatGetSize(local_mat,&rows,&cols);
7624: if (rows != cols) SETERRQ(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Local MATIS matrices should be square");
7625: if (reuse && *mat_n) {
7626: PetscInt mrows,mcols,mnrows,mncols;
7628: PetscObjectTypeCompare((PetscObject)*mat_n,MATIS,&ismatis);
7629: if (!ismatis) SETERRQ(PetscObjectComm((PetscObject)*mat_n),PETSC_ERR_SUP,"Cannot reuse a matrix which is not of type MATIS");
7630: MatGetSize(mat,&mrows,&mcols);
7631: MatGetSize(*mat_n,&mnrows,&mncols);
7632: if (mrows != mnrows) SETERRQ2(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Cannot reuse matrix! Wrong number of rows %D != %D",mrows,mnrows);
7633: if (mcols != mncols) SETERRQ2(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Cannot reuse matrix! Wrong number of cols %D != %D",mcols,mncols);
7634: }
7635: MatGetBlockSize(local_mat,&bs);
7638: /* prepare IS for sending if not provided */
7639: if (!is_sends) {
7640: if (!n_subdomains) SETERRQ(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"You should specify either an IS or a target number of subdomains");
7641: PCBDDCMatISGetSubassemblingPattern(mat,&n_subdomains,0,&is_sends_internal,NULL);
7642: } else {
7643: PetscObjectReference((PetscObject)is_sends);
7644: is_sends_internal = is_sends;
7645: }
7647: /* get comm */
7648: PetscObjectGetComm((PetscObject)mat,&comm);
7650: /* compute number of sends */
7651: ISGetLocalSize(is_sends_internal,&i);
7652: PetscMPIIntCast(i,&n_sends);
7654: /* compute number of receives */
7655: MPI_Comm_size(comm,&size);
7656: PetscMalloc1(size,&iflags);
7657: PetscArrayzero(iflags,size);
7658: ISGetIndices(is_sends_internal,&is_indices);
7659: for (i=0;i<n_sends;i++) iflags[is_indices[i]] = 1;
7660: PetscGatherNumberOfMessages(comm,iflags,NULL,&n_recvs);
7661: PetscFree(iflags);
7663: /* restrict comm if requested */
7664: subcomm = 0;
7665: destroy_mat = PETSC_FALSE;
7666: if (restrict_comm) {
7667: PetscMPIInt color,subcommsize;
7669: color = 0;
7670: if (restrict_full) {
7671: if (!n_recvs) color = 1; /* processes not receiving anything will not partecipate in new comm (full restriction) */
7672: } else {
7673: if (!n_recvs && n_sends) color = 1; /* just those processes that are sending but not receiving anything will not partecipate in new comm */
7674: }
7675: MPIU_Allreduce(&color,&subcommsize,1,MPI_INT,MPI_SUM,comm);
7676: subcommsize = size - subcommsize;
7677: /* check if reuse has been requested */
7678: if (reuse) {
7679: if (*mat_n) {
7680: PetscMPIInt subcommsize2;
7681: MPI_Comm_size(PetscObjectComm((PetscObject)*mat_n),&subcommsize2);
7682: if (subcommsize != subcommsize2) SETERRQ2(PetscObjectComm((PetscObject)*mat_n),PETSC_ERR_PLIB,"Cannot reuse matrix! wrong subcomm size %d != %d",subcommsize,subcommsize2);
7683: comm_n = PetscObjectComm((PetscObject)*mat_n);
7684: } else {
7685: comm_n = PETSC_COMM_SELF;
7686: }
7687: } else { /* MAT_INITIAL_MATRIX */
7688: PetscMPIInt rank;
7690: MPI_Comm_rank(comm,&rank);
7691: PetscSubcommCreate(comm,&subcomm);
7692: PetscSubcommSetNumber(subcomm,2);
7693: PetscSubcommSetTypeGeneral(subcomm,color,rank);
7694: comm_n = PetscSubcommChild(subcomm);
7695: }
7696: /* flag to destroy *mat_n if not significative */
7697: if (color) destroy_mat = PETSC_TRUE;
7698: } else {
7699: comm_n = comm;
7700: }
7702: /* prepare send/receive buffers */
7703: PetscMalloc1(size,&ilengths_idxs);
7704: PetscArrayzero(ilengths_idxs,size);
7705: PetscMalloc1(size,&ilengths_vals);
7706: PetscArrayzero(ilengths_vals,size);
7707: if (nis) {
7708: PetscCalloc1(size,&ilengths_idxs_is);
7709: }
7711: /* Get data from local matrices */
7712: if (!isdense) SETERRQ(PetscObjectComm((PetscObject)mat),PETSC_ERR_SUP,"Subassembling of AIJ local matrices not yet implemented");
7713: /* TODO: See below some guidelines on how to prepare the local buffers */
7714: /*
7715: send_buffer_vals should contain the raw values of the local matrix
7716: send_buffer_idxs should contain:
7717: - MatType_PRIVATE type
7718: - PetscInt size_of_l2gmap
7719: - PetscInt global_row_indices[size_of_l2gmap]
7720: - PetscInt all_other_info_which_is_needed_to_compute_preallocation_and_set_values
7721: */
7722: else {
7723: MatDenseGetArrayRead(local_mat,&send_buffer_vals);
7724: ISLocalToGlobalMappingGetSize(mat->rmap->mapping,&i);
7725: PetscMalloc1(i+2,&send_buffer_idxs);
7726: send_buffer_idxs[0] = (PetscInt)MATDENSE_PRIVATE;
7727: send_buffer_idxs[1] = i;
7728: ISLocalToGlobalMappingGetIndices(mat->rmap->mapping,(const PetscInt**)&ptr_idxs);
7729: PetscArraycpy(&send_buffer_idxs[2],ptr_idxs,i);
7730: ISLocalToGlobalMappingRestoreIndices(mat->rmap->mapping,(const PetscInt**)&ptr_idxs);
7731: PetscMPIIntCast(i,&len);
7732: for (i=0;i<n_sends;i++) {
7733: ilengths_vals[is_indices[i]] = len*len;
7734: ilengths_idxs[is_indices[i]] = len+2;
7735: }
7736: }
7737: PetscGatherMessageLengths2(comm,n_sends,n_recvs,ilengths_idxs,ilengths_vals,&onodes,&olengths_idxs,&olengths_vals);
7738: /* additional is (if any) */
7739: if (nis) {
7740: PetscMPIInt psum;
7741: PetscInt j;
7742: for (j=0,psum=0;j<nis;j++) {
7743: PetscInt plen;
7744: ISGetLocalSize(isarray[j],&plen);
7745: PetscMPIIntCast(plen,&len);
7746: psum += len+1; /* indices + lenght */
7747: }
7748: PetscMalloc1(psum,&send_buffer_idxs_is);
7749: for (j=0,psum=0;j<nis;j++) {
7750: PetscInt plen;
7751: const PetscInt *is_array_idxs;
7752: ISGetLocalSize(isarray[j],&plen);
7753: send_buffer_idxs_is[psum] = plen;
7754: ISGetIndices(isarray[j],&is_array_idxs);
7755: PetscArraycpy(&send_buffer_idxs_is[psum+1],is_array_idxs,plen);
7756: ISRestoreIndices(isarray[j],&is_array_idxs);
7757: psum += plen+1; /* indices + lenght */
7758: }
7759: for (i=0;i<n_sends;i++) {
7760: ilengths_idxs_is[is_indices[i]] = psum;
7761: }
7762: PetscGatherMessageLengths(comm,n_sends,n_recvs,ilengths_idxs_is,&onodes_is,&olengths_idxs_is);
7763: }
7764: MatISRestoreLocalMat(mat,&local_mat);
7766: buf_size_idxs = 0;
7767: buf_size_vals = 0;
7768: buf_size_idxs_is = 0;
7769: buf_size_vecs = 0;
7770: for (i=0;i<n_recvs;i++) {
7771: buf_size_idxs += (PetscInt)olengths_idxs[i];
7772: buf_size_vals += (PetscInt)olengths_vals[i];
7773: if (nis) buf_size_idxs_is += (PetscInt)olengths_idxs_is[i];
7774: if (nvecs) buf_size_vecs += (PetscInt)olengths_idxs[i];
7775: }
7776: PetscMalloc1(buf_size_idxs,&recv_buffer_idxs);
7777: PetscMalloc1(buf_size_vals,&recv_buffer_vals);
7778: PetscMalloc1(buf_size_idxs_is,&recv_buffer_idxs_is);
7779: PetscMalloc1(buf_size_vecs,&recv_buffer_vecs);
7781: /* get new tags for clean communications */
7782: PetscObjectGetNewTag((PetscObject)mat,&tag_idxs);
7783: PetscObjectGetNewTag((PetscObject)mat,&tag_vals);
7784: PetscObjectGetNewTag((PetscObject)mat,&tag_idxs_is);
7785: PetscObjectGetNewTag((PetscObject)mat,&tag_vecs);
7787: /* allocate for requests */
7788: PetscMalloc1(n_sends,&send_req_idxs);
7789: PetscMalloc1(n_sends,&send_req_vals);
7790: PetscMalloc1(n_sends,&send_req_idxs_is);
7791: PetscMalloc1(n_sends,&send_req_vecs);
7792: PetscMalloc1(n_recvs,&recv_req_idxs);
7793: PetscMalloc1(n_recvs,&recv_req_vals);
7794: PetscMalloc1(n_recvs,&recv_req_idxs_is);
7795: PetscMalloc1(n_recvs,&recv_req_vecs);
7797: /* communications */
7798: ptr_idxs = recv_buffer_idxs;
7799: ptr_vals = recv_buffer_vals;
7800: ptr_idxs_is = recv_buffer_idxs_is;
7801: ptr_vecs = recv_buffer_vecs;
7802: for (i=0;i<n_recvs;i++) {
7803: source_dest = onodes[i];
7804: MPI_Irecv(ptr_idxs,olengths_idxs[i],MPIU_INT,source_dest,tag_idxs,comm,&recv_req_idxs[i]);
7805: MPI_Irecv(ptr_vals,olengths_vals[i],MPIU_SCALAR,source_dest,tag_vals,comm,&recv_req_vals[i]);
7806: ptr_idxs += olengths_idxs[i];
7807: ptr_vals += olengths_vals[i];
7808: if (nis) {
7809: source_dest = onodes_is[i];
7810: MPI_Irecv(ptr_idxs_is,olengths_idxs_is[i],MPIU_INT,source_dest,tag_idxs_is,comm,&recv_req_idxs_is[i]);
7811: ptr_idxs_is += olengths_idxs_is[i];
7812: }
7813: if (nvecs) {
7814: source_dest = onodes[i];
7815: MPI_Irecv(ptr_vecs,olengths_idxs[i]-2,MPIU_SCALAR,source_dest,tag_vecs,comm,&recv_req_vecs[i]);
7816: ptr_vecs += olengths_idxs[i]-2;
7817: }
7818: }
7819: for (i=0;i<n_sends;i++) {
7820: PetscMPIIntCast(is_indices[i],&source_dest);
7821: MPI_Isend(send_buffer_idxs,ilengths_idxs[source_dest],MPIU_INT,source_dest,tag_idxs,comm,&send_req_idxs[i]);
7822: MPI_Isend((PetscScalar*)send_buffer_vals,ilengths_vals[source_dest],MPIU_SCALAR,source_dest,tag_vals,comm,&send_req_vals[i]);
7823: if (nis) {
7824: MPI_Isend(send_buffer_idxs_is,ilengths_idxs_is[source_dest],MPIU_INT,source_dest,tag_idxs_is,comm,&send_req_idxs_is[i]);
7825: }
7826: if (nvecs) {
7827: VecGetArray(nnsp_vec[0],&send_buffer_vecs);
7828: MPI_Isend(send_buffer_vecs,ilengths_idxs[source_dest]-2,MPIU_SCALAR,source_dest,tag_vecs,comm,&send_req_vecs[i]);
7829: }
7830: }
7831: ISRestoreIndices(is_sends_internal,&is_indices);
7832: ISDestroy(&is_sends_internal);
7834: /* assemble new l2g map */
7835: MPI_Waitall(n_recvs,recv_req_idxs,MPI_STATUSES_IGNORE);
7836: ptr_idxs = recv_buffer_idxs;
7837: new_local_rows = 0;
7838: for (i=0;i<n_recvs;i++) {
7839: new_local_rows += *(ptr_idxs+1); /* second element is the local size of the l2gmap */
7840: ptr_idxs += olengths_idxs[i];
7841: }
7842: PetscMalloc1(new_local_rows,&l2gmap_indices);
7843: ptr_idxs = recv_buffer_idxs;
7844: new_local_rows = 0;
7845: for (i=0;i<n_recvs;i++) {
7846: PetscArraycpy(&l2gmap_indices[new_local_rows],ptr_idxs+2,*(ptr_idxs+1));
7847: new_local_rows += *(ptr_idxs+1); /* second element is the local size of the l2gmap */
7848: ptr_idxs += olengths_idxs[i];
7849: }
7850: PetscSortRemoveDupsInt(&new_local_rows,l2gmap_indices);
7851: ISLocalToGlobalMappingCreate(comm_n,1,new_local_rows,l2gmap_indices,PETSC_COPY_VALUES,&l2gmap);
7852: PetscFree(l2gmap_indices);
7854: /* infer new local matrix type from received local matrices type */
7855: /* currently if all local matrices are of type X, then the resulting matrix will be of type X, except for the dense case */
7856: /* it also assumes that if the block size is set, than it is the same among all local matrices (see checks at the beginning of the function) */
7857: if (n_recvs) {
7858: MatTypePrivate new_local_type_private = (MatTypePrivate)send_buffer_idxs[0];
7859: ptr_idxs = recv_buffer_idxs;
7860: for (i=0;i<n_recvs;i++) {
7861: if ((PetscInt)new_local_type_private != *ptr_idxs) {
7862: new_local_type_private = MATAIJ_PRIVATE;
7863: break;
7864: }
7865: ptr_idxs += olengths_idxs[i];
7866: }
7867: switch (new_local_type_private) {
7868: case MATDENSE_PRIVATE:
7869: new_local_type = MATSEQAIJ;
7870: bs = 1;
7871: break;
7872: case MATAIJ_PRIVATE:
7873: new_local_type = MATSEQAIJ;
7874: bs = 1;
7875: break;
7876: case MATBAIJ_PRIVATE:
7877: new_local_type = MATSEQBAIJ;
7878: break;
7879: case MATSBAIJ_PRIVATE:
7880: new_local_type = MATSEQSBAIJ;
7881: break;
7882: default:
7883: SETERRQ2(comm,PETSC_ERR_SUP,"Unsupported private type %d in %s",new_local_type_private,PETSC_FUNCTION_NAME);
7884: break;
7885: }
7886: } else { /* by default, new_local_type is seqaij */
7887: new_local_type = MATSEQAIJ;
7888: bs = 1;
7889: }
7891: /* create MATIS object if needed */
7892: if (!reuse) {
7893: MatGetSize(mat,&rows,&cols);
7894: MatCreateIS(comm_n,bs,PETSC_DECIDE,PETSC_DECIDE,rows,cols,l2gmap,NULL,mat_n);
7895: } else {
7896: /* it also destroys the local matrices */
7897: if (*mat_n) {
7898: MatSetLocalToGlobalMapping(*mat_n,l2gmap,l2gmap);
7899: } else { /* this is a fake object */
7900: MatCreateIS(comm_n,bs,PETSC_DECIDE,PETSC_DECIDE,rows,cols,l2gmap,NULL,mat_n);
7901: }
7902: }
7903: MatISGetLocalMat(*mat_n,&local_mat);
7904: MatSetType(local_mat,new_local_type);
7906: MPI_Waitall(n_recvs,recv_req_vals,MPI_STATUSES_IGNORE);
7908: /* Global to local map of received indices */
7909: PetscMalloc1(buf_size_idxs,&recv_buffer_idxs_local); /* needed for values insertion */
7910: ISGlobalToLocalMappingApply(l2gmap,IS_GTOLM_MASK,buf_size_idxs,recv_buffer_idxs,&i,recv_buffer_idxs_local);
7911: ISLocalToGlobalMappingDestroy(&l2gmap);
7913: /* restore attributes -> type of incoming data and its size */
7914: buf_size_idxs = 0;
7915: for (i=0;i<n_recvs;i++) {
7916: recv_buffer_idxs_local[buf_size_idxs] = recv_buffer_idxs[buf_size_idxs];
7917: recv_buffer_idxs_local[buf_size_idxs+1] = recv_buffer_idxs[buf_size_idxs+1];
7918: buf_size_idxs += (PetscInt)olengths_idxs[i];
7919: }
7920: PetscFree(recv_buffer_idxs);
7922: /* set preallocation */
7923: PetscObjectTypeCompare((PetscObject)local_mat,MATSEQDENSE,&newisdense);
7924: if (!newisdense) {
7925: PetscInt *new_local_nnz=0;
7927: ptr_idxs = recv_buffer_idxs_local;
7928: if (n_recvs) {
7929: PetscCalloc1(new_local_rows,&new_local_nnz);
7930: }
7931: for (i=0;i<n_recvs;i++) {
7932: PetscInt j;
7933: if (*ptr_idxs == (PetscInt)MATDENSE_PRIVATE) { /* preallocation provided for dense case only */
7934: for (j=0;j<*(ptr_idxs+1);j++) {
7935: new_local_nnz[*(ptr_idxs+2+j)] += *(ptr_idxs+1);
7936: }
7937: } else {
7938: /* TODO */
7939: }
7940: ptr_idxs += olengths_idxs[i];
7941: }
7942: if (new_local_nnz) {
7943: for (i=0;i<new_local_rows;i++) new_local_nnz[i] = PetscMin(new_local_nnz[i],new_local_rows);
7944: MatSeqAIJSetPreallocation(local_mat,0,new_local_nnz);
7945: for (i=0;i<new_local_rows;i++) new_local_nnz[i] /= bs;
7946: MatSeqBAIJSetPreallocation(local_mat,bs,0,new_local_nnz);
7947: for (i=0;i<new_local_rows;i++) new_local_nnz[i] = PetscMax(new_local_nnz[i]-i,0);
7948: MatSeqSBAIJSetPreallocation(local_mat,bs,0,new_local_nnz);
7949: } else {
7950: MatSetUp(local_mat);
7951: }
7952: PetscFree(new_local_nnz);
7953: } else {
7954: MatSetUp(local_mat);
7955: }
7957: /* set values */
7958: ptr_vals = recv_buffer_vals;
7959: ptr_idxs = recv_buffer_idxs_local;
7960: for (i=0;i<n_recvs;i++) {
7961: if (*ptr_idxs == (PetscInt)MATDENSE_PRIVATE) { /* values insertion provided for dense case only */
7962: MatSetOption(local_mat,MAT_ROW_ORIENTED,PETSC_FALSE);
7963: MatSetValues(local_mat,*(ptr_idxs+1),ptr_idxs+2,*(ptr_idxs+1),ptr_idxs+2,ptr_vals,ADD_VALUES);
7964: MatAssemblyBegin(local_mat,MAT_FLUSH_ASSEMBLY);
7965: MatAssemblyEnd(local_mat,MAT_FLUSH_ASSEMBLY);
7966: MatSetOption(local_mat,MAT_ROW_ORIENTED,PETSC_TRUE);
7967: } else {
7968: /* TODO */
7969: }
7970: ptr_idxs += olengths_idxs[i];
7971: ptr_vals += olengths_vals[i];
7972: }
7973: MatAssemblyBegin(local_mat,MAT_FINAL_ASSEMBLY);
7974: MatAssemblyEnd(local_mat,MAT_FINAL_ASSEMBLY);
7975: MatISRestoreLocalMat(*mat_n,&local_mat);
7976: MatAssemblyBegin(*mat_n,MAT_FINAL_ASSEMBLY);
7977: MatAssemblyEnd(*mat_n,MAT_FINAL_ASSEMBLY);
7978: PetscFree(recv_buffer_vals);
7980: #if 0
7981: if (!restrict_comm) { /* check */
7982: Vec lvec,rvec;
7983: PetscReal infty_error;
7985: MatCreateVecs(mat,&rvec,&lvec);
7986: VecSetRandom(rvec,NULL);
7987: MatMult(mat,rvec,lvec);
7988: VecScale(lvec,-1.0);
7989: MatMultAdd(*mat_n,rvec,lvec,lvec);
7990: VecNorm(lvec,NORM_INFINITY,&infty_error);
7991: PetscPrintf(PetscObjectComm((PetscObject)mat),"Infinity error subassembling %1.6e\n",infty_error);
7992: VecDestroy(&rvec);
7993: VecDestroy(&lvec);
7994: }
7995: #endif
7997: /* assemble new additional is (if any) */
7998: if (nis) {
7999: PetscInt **temp_idxs,*count_is,j,psum;
8001: MPI_Waitall(n_recvs,recv_req_idxs_is,MPI_STATUSES_IGNORE);
8002: PetscCalloc1(nis,&count_is);
8003: ptr_idxs = recv_buffer_idxs_is;
8004: psum = 0;
8005: for (i=0;i<n_recvs;i++) {
8006: for (j=0;j<nis;j++) {
8007: PetscInt plen = *(ptr_idxs); /* first element is the local size of IS's indices */
8008: count_is[j] += plen; /* increment counting of buffer for j-th IS */
8009: psum += plen;
8010: ptr_idxs += plen+1; /* shift pointer to received data */
8011: }
8012: }
8013: PetscMalloc1(nis,&temp_idxs);
8014: PetscMalloc1(psum,&temp_idxs[0]);
8015: for (i=1;i<nis;i++) {
8016: temp_idxs[i] = temp_idxs[i-1]+count_is[i-1];
8017: }
8018: PetscArrayzero(count_is,nis);
8019: ptr_idxs = recv_buffer_idxs_is;
8020: for (i=0;i<n_recvs;i++) {
8021: for (j=0;j<nis;j++) {
8022: PetscInt plen = *(ptr_idxs); /* first element is the local size of IS's indices */
8023: PetscArraycpy(&temp_idxs[j][count_is[j]],ptr_idxs+1,plen);
8024: count_is[j] += plen; /* increment starting point of buffer for j-th IS */
8025: ptr_idxs += plen+1; /* shift pointer to received data */
8026: }
8027: }
8028: for (i=0;i<nis;i++) {
8029: ISDestroy(&isarray[i]);
8030: PetscSortRemoveDupsInt(&count_is[i],temp_idxs[i]);
8031: ISCreateGeneral(comm_n,count_is[i],temp_idxs[i],PETSC_COPY_VALUES,&isarray[i]);
8032: }
8033: PetscFree(count_is);
8034: PetscFree(temp_idxs[0]);
8035: PetscFree(temp_idxs);
8036: }
8037: /* free workspace */
8038: PetscFree(recv_buffer_idxs_is);
8039: MPI_Waitall(n_sends,send_req_idxs,MPI_STATUSES_IGNORE);
8040: PetscFree(send_buffer_idxs);
8041: MPI_Waitall(n_sends,send_req_vals,MPI_STATUSES_IGNORE);
8042: if (isdense) {
8043: MatISGetLocalMat(mat,&local_mat);
8044: MatDenseRestoreArrayRead(local_mat,&send_buffer_vals);
8045: MatISRestoreLocalMat(mat,&local_mat);
8046: } else {
8047: /* PetscFree(send_buffer_vals); */
8048: }
8049: if (nis) {
8050: MPI_Waitall(n_sends,send_req_idxs_is,MPI_STATUSES_IGNORE);
8051: PetscFree(send_buffer_idxs_is);
8052: }
8054: if (nvecs) {
8055: MPI_Waitall(n_recvs,recv_req_vecs,MPI_STATUSES_IGNORE);
8056: MPI_Waitall(n_sends,send_req_vecs,MPI_STATUSES_IGNORE);
8057: VecRestoreArray(nnsp_vec[0],&send_buffer_vecs);
8058: VecDestroy(&nnsp_vec[0]);
8059: VecCreate(comm_n,&nnsp_vec[0]);
8060: VecSetSizes(nnsp_vec[0],new_local_rows,PETSC_DECIDE);
8061: VecSetType(nnsp_vec[0],VECSTANDARD);
8062: /* set values */
8063: ptr_vals = recv_buffer_vecs;
8064: ptr_idxs = recv_buffer_idxs_local;
8065: VecGetArray(nnsp_vec[0],&send_buffer_vecs);
8066: for (i=0;i<n_recvs;i++) {
8067: PetscInt j;
8068: for (j=0;j<*(ptr_idxs+1);j++) {
8069: send_buffer_vecs[*(ptr_idxs+2+j)] += *(ptr_vals + j);
8070: }
8071: ptr_idxs += olengths_idxs[i];
8072: ptr_vals += olengths_idxs[i]-2;
8073: }
8074: VecRestoreArray(nnsp_vec[0],&send_buffer_vecs);
8075: VecAssemblyBegin(nnsp_vec[0]);
8076: VecAssemblyEnd(nnsp_vec[0]);
8077: }
8079: PetscFree(recv_buffer_vecs);
8080: PetscFree(recv_buffer_idxs_local);
8081: PetscFree(recv_req_idxs);
8082: PetscFree(recv_req_vals);
8083: PetscFree(recv_req_vecs);
8084: PetscFree(recv_req_idxs_is);
8085: PetscFree(send_req_idxs);
8086: PetscFree(send_req_vals);
8087: PetscFree(send_req_vecs);
8088: PetscFree(send_req_idxs_is);
8089: PetscFree(ilengths_vals);
8090: PetscFree(ilengths_idxs);
8091: PetscFree(olengths_vals);
8092: PetscFree(olengths_idxs);
8093: PetscFree(onodes);
8094: if (nis) {
8095: PetscFree(ilengths_idxs_is);
8096: PetscFree(olengths_idxs_is);
8097: PetscFree(onodes_is);
8098: }
8099: PetscSubcommDestroy(&subcomm);
8100: if (destroy_mat) { /* destroy mat is true only if restrict comm is true and process will not partecipate */
8101: MatDestroy(mat_n);
8102: for (i=0;i<nis;i++) {
8103: ISDestroy(&isarray[i]);
8104: }
8105: if (nvecs) { /* need to match VecDestroy nnsp_vec called in the other code path */
8106: VecDestroy(&nnsp_vec[0]);
8107: }
8108: *mat_n = NULL;
8109: }
8110: return(0);
8111: }
8113: /* temporary hack into ksp private data structure */
8114: #include <petsc/private/kspimpl.h>
8116: PetscErrorCode PCBDDCSetUpCoarseSolver(PC pc,PetscScalar* coarse_submat_vals)
8117: {
8118: PC_BDDC *pcbddc = (PC_BDDC*)pc->data;
8119: PC_IS *pcis = (PC_IS*)pc->data;
8120: Mat coarse_mat,coarse_mat_is,coarse_submat_dense;
8121: Mat coarsedivudotp = NULL;
8122: Mat coarseG,t_coarse_mat_is;
8123: MatNullSpace CoarseNullSpace = NULL;
8124: ISLocalToGlobalMapping coarse_islg;
8125: IS coarse_is,*isarray,corners;
8126: PetscInt i,im_active=-1,active_procs=-1;
8127: PetscInt nis,nisdofs,nisneu,nisvert;
8128: PetscInt coarse_eqs_per_proc;
8129: PC pc_temp;
8130: PCType coarse_pc_type;
8131: KSPType coarse_ksp_type;
8132: PetscBool multilevel_requested,multilevel_allowed;
8133: PetscBool coarse_reuse;
8134: PetscInt ncoarse,nedcfield;
8135: PetscBool compute_vecs = PETSC_FALSE;
8136: PetscScalar *array;
8137: MatReuse coarse_mat_reuse;
8138: PetscBool restr, full_restr, have_void;
8139: PetscMPIInt size;
8140: PetscErrorCode ierr;
8143: PetscLogEventBegin(PC_BDDC_CoarseSetUp[pcbddc->current_level],pc,0,0,0);
8144: /* Assign global numbering to coarse dofs */
8145: if (pcbddc->new_primal_space || pcbddc->coarse_size == -1) { /* a new primal space is present or it is the first initialization, so recompute global numbering */
8146: PetscInt ocoarse_size;
8147: compute_vecs = PETSC_TRUE;
8149: pcbddc->new_primal_space = PETSC_TRUE;
8150: ocoarse_size = pcbddc->coarse_size;
8151: PetscFree(pcbddc->global_primal_indices);
8152: PCBDDCComputePrimalNumbering(pc,&pcbddc->coarse_size,&pcbddc->global_primal_indices);
8153: /* see if we can avoid some work */
8154: if (pcbddc->coarse_ksp) { /* coarse ksp has already been created */
8155: /* if the coarse size is different or we are using adaptive selection, better to not reuse the coarse matrix */
8156: if (ocoarse_size != pcbddc->coarse_size || pcbddc->adaptive_selection) {
8157: KSPReset(pcbddc->coarse_ksp);
8158: coarse_reuse = PETSC_FALSE;
8159: } else { /* we can safely reuse already computed coarse matrix */
8160: coarse_reuse = PETSC_TRUE;
8161: }
8162: } else { /* there's no coarse ksp, so we need to create the coarse matrix too */
8163: coarse_reuse = PETSC_FALSE;
8164: }
8165: /* reset any subassembling information */
8166: if (!coarse_reuse || pcbddc->recompute_topography) {
8167: ISDestroy(&pcbddc->coarse_subassembling);
8168: }
8169: } else { /* primal space is unchanged, so we can reuse coarse matrix */
8170: coarse_reuse = PETSC_TRUE;
8171: }
8172: if (coarse_reuse && pcbddc->coarse_ksp) {
8173: KSPGetOperators(pcbddc->coarse_ksp,&coarse_mat,NULL);
8174: PetscObjectReference((PetscObject)coarse_mat);
8175: coarse_mat_reuse = MAT_REUSE_MATRIX;
8176: } else {
8177: coarse_mat = NULL;
8178: coarse_mat_reuse = MAT_INITIAL_MATRIX;
8179: }
8181: /* creates temporary l2gmap and IS for coarse indexes */
8182: ISCreateGeneral(PetscObjectComm((PetscObject)pc),pcbddc->local_primal_size,pcbddc->global_primal_indices,PETSC_COPY_VALUES,&coarse_is);
8183: ISLocalToGlobalMappingCreateIS(coarse_is,&coarse_islg);
8185: /* creates temporary MATIS object for coarse matrix */
8186: MatCreateSeqDense(PETSC_COMM_SELF,pcbddc->local_primal_size,pcbddc->local_primal_size,coarse_submat_vals,&coarse_submat_dense);
8187: MatCreateIS(PetscObjectComm((PetscObject)pc),1,PETSC_DECIDE,PETSC_DECIDE,pcbddc->coarse_size,pcbddc->coarse_size,coarse_islg,NULL,&t_coarse_mat_is);
8188: MatISSetLocalMat(t_coarse_mat_is,coarse_submat_dense);
8189: MatAssemblyBegin(t_coarse_mat_is,MAT_FINAL_ASSEMBLY);
8190: MatAssemblyEnd(t_coarse_mat_is,MAT_FINAL_ASSEMBLY);
8191: MatDestroy(&coarse_submat_dense);
8193: /* count "active" (i.e. with positive local size) and "void" processes */
8194: im_active = !!(pcis->n);
8195: MPIU_Allreduce(&im_active,&active_procs,1,MPIU_INT,MPI_SUM,PetscObjectComm((PetscObject)pc));
8197: /* determine number of processes partecipating to coarse solver and compute subassembling pattern */
8198: /* restr : whether we want to exclude senders (which are not receivers) from the subassembling pattern */
8199: /* full_restr : just use the receivers from the subassembling pattern */
8200: MPI_Comm_size(PetscObjectComm((PetscObject)pc),&size);
8201: coarse_mat_is = NULL;
8202: multilevel_allowed = PETSC_FALSE;
8203: multilevel_requested = PETSC_FALSE;
8204: coarse_eqs_per_proc = PetscMin(PetscMax(pcbddc->coarse_size,1),pcbddc->coarse_eqs_per_proc);
8205: if (coarse_eqs_per_proc < 0) coarse_eqs_per_proc = pcbddc->coarse_size;
8206: if (pcbddc->current_level < pcbddc->max_levels) multilevel_requested = PETSC_TRUE;
8207: if (pcbddc->coarse_size <= pcbddc->coarse_eqs_limit) multilevel_requested = PETSC_FALSE;
8208: if (multilevel_requested) {
8209: ncoarse = active_procs/pcbddc->coarsening_ratio;
8210: restr = PETSC_FALSE;
8211: full_restr = PETSC_FALSE;
8212: } else {
8213: ncoarse = pcbddc->coarse_size/coarse_eqs_per_proc + !!(pcbddc->coarse_size%coarse_eqs_per_proc);
8214: restr = PETSC_TRUE;
8215: full_restr = PETSC_TRUE;
8216: }
8217: if (!pcbddc->coarse_size || size == 1) multilevel_allowed = multilevel_requested = restr = full_restr = PETSC_FALSE;
8218: ncoarse = PetscMax(1,ncoarse);
8219: if (!pcbddc->coarse_subassembling) {
8220: if (pcbddc->coarsening_ratio > 1) {
8221: if (multilevel_requested) {
8222: PCBDDCMatISGetSubassemblingPattern(pc->pmat,&ncoarse,pcbddc->coarse_adj_red,&pcbddc->coarse_subassembling,&have_void);
8223: } else {
8224: PCBDDCMatISGetSubassemblingPattern(t_coarse_mat_is,&ncoarse,pcbddc->coarse_adj_red,&pcbddc->coarse_subassembling,&have_void);
8225: }
8226: } else {
8227: PetscMPIInt rank;
8229: MPI_Comm_rank(PetscObjectComm((PetscObject)pc),&rank);
8230: have_void = (active_procs == (PetscInt)size) ? PETSC_FALSE : PETSC_TRUE;
8231: ISCreateStride(PetscObjectComm((PetscObject)pc),1,rank,1,&pcbddc->coarse_subassembling);
8232: }
8233: } else { /* if a subassembling pattern exists, then we can reuse the coarse ksp and compute the number of process involved */
8234: PetscInt psum;
8235: if (pcbddc->coarse_ksp) psum = 1;
8236: else psum = 0;
8237: MPIU_Allreduce(&psum,&ncoarse,1,MPIU_INT,MPI_SUM,PetscObjectComm((PetscObject)pc));
8238: have_void = ncoarse < size ? PETSC_TRUE : PETSC_FALSE;
8239: }
8240: /* determine if we can go multilevel */
8241: if (multilevel_requested) {
8242: if (ncoarse > 1) multilevel_allowed = PETSC_TRUE; /* found enough processes */
8243: else restr = full_restr = PETSC_TRUE; /* 1 subdomain, use a direct solver */
8244: }
8245: if (multilevel_allowed && have_void) restr = PETSC_TRUE;
8247: /* dump subassembling pattern */
8248: if (pcbddc->dbg_flag && multilevel_allowed) {
8249: ISView(pcbddc->coarse_subassembling,pcbddc->dbg_viewer);
8250: }
8251: /* compute dofs splitting and neumann boundaries for coarse dofs */
8252: nedcfield = -1;
8253: corners = NULL;
8254: if (multilevel_allowed && !coarse_reuse && (pcbddc->n_ISForDofsLocal || pcbddc->NeumannBoundariesLocal || pcbddc->nedclocal || pcbddc->corner_selected)) { /* protects from unneeded computations */
8255: PetscInt *tidxs,*tidxs2,nout,tsize,i;
8256: const PetscInt *idxs;
8257: ISLocalToGlobalMapping tmap;
8259: /* create map between primal indices (in local representative ordering) and local primal numbering */
8260: ISLocalToGlobalMappingCreate(PETSC_COMM_SELF,1,pcbddc->local_primal_size,pcbddc->primal_indices_local_idxs,PETSC_COPY_VALUES,&tmap);
8261: /* allocate space for temporary storage */
8262: PetscMalloc1(pcbddc->local_primal_size,&tidxs);
8263: PetscMalloc1(pcbddc->local_primal_size,&tidxs2);
8264: /* allocate for IS array */
8265: nisdofs = pcbddc->n_ISForDofsLocal;
8266: if (pcbddc->nedclocal) {
8267: if (pcbddc->nedfield > -1) {
8268: nedcfield = pcbddc->nedfield;
8269: } else {
8270: nedcfield = 0;
8271: if (nisdofs) SETERRQ1(PetscObjectComm((PetscObject)pc),PETSC_ERR_PLIB,"This should not happen (%D)",nisdofs);
8272: nisdofs = 1;
8273: }
8274: }
8275: nisneu = !!pcbddc->NeumannBoundariesLocal;
8276: nisvert = 0; /* nisvert is not used */
8277: nis = nisdofs + nisneu + nisvert;
8278: PetscMalloc1(nis,&isarray);
8279: /* dofs splitting */
8280: for (i=0;i<nisdofs;i++) {
8281: /* ISView(pcbddc->ISForDofsLocal[i],0); */
8282: if (nedcfield != i) {
8283: ISGetLocalSize(pcbddc->ISForDofsLocal[i],&tsize);
8284: ISGetIndices(pcbddc->ISForDofsLocal[i],&idxs);
8285: ISGlobalToLocalMappingApply(tmap,IS_GTOLM_DROP,tsize,idxs,&nout,tidxs);
8286: ISRestoreIndices(pcbddc->ISForDofsLocal[i],&idxs);
8287: } else {
8288: ISGetLocalSize(pcbddc->nedclocal,&tsize);
8289: ISGetIndices(pcbddc->nedclocal,&idxs);
8290: ISGlobalToLocalMappingApply(tmap,IS_GTOLM_DROP,tsize,idxs,&nout,tidxs);
8291: if (tsize != nout) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Failed when mapping coarse nedelec field! %D != %D",tsize,nout);
8292: ISRestoreIndices(pcbddc->nedclocal,&idxs);
8293: }
8294: ISLocalToGlobalMappingApply(coarse_islg,nout,tidxs,tidxs2);
8295: ISCreateGeneral(PetscObjectComm((PetscObject)pc),nout,tidxs2,PETSC_COPY_VALUES,&isarray[i]);
8296: /* ISView(isarray[i],0); */
8297: }
8298: /* neumann boundaries */
8299: if (pcbddc->NeumannBoundariesLocal) {
8300: /* ISView(pcbddc->NeumannBoundariesLocal,0); */
8301: ISGetLocalSize(pcbddc->NeumannBoundariesLocal,&tsize);
8302: ISGetIndices(pcbddc->NeumannBoundariesLocal,&idxs);
8303: ISGlobalToLocalMappingApply(tmap,IS_GTOLM_DROP,tsize,idxs,&nout,tidxs);
8304: ISRestoreIndices(pcbddc->NeumannBoundariesLocal,&idxs);
8305: ISLocalToGlobalMappingApply(coarse_islg,nout,tidxs,tidxs2);
8306: ISCreateGeneral(PetscObjectComm((PetscObject)pc),nout,tidxs2,PETSC_COPY_VALUES,&isarray[nisdofs]);
8307: /* ISView(isarray[nisdofs],0); */
8308: }
8309: /* coordinates */
8310: if (pcbddc->corner_selected) {
8311: PCBDDCGraphGetCandidatesIS(pcbddc->mat_graph,NULL,NULL,NULL,NULL,&corners);
8312: ISGetLocalSize(corners,&tsize);
8313: ISGetIndices(corners,&idxs);
8314: ISGlobalToLocalMappingApply(tmap,IS_GTOLM_DROP,tsize,idxs,&nout,tidxs);
8315: if (tsize != nout) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Failed when mapping corners! %D != %D",tsize,nout);
8316: ISRestoreIndices(corners,&idxs);
8317: PCBDDCGraphRestoreCandidatesIS(pcbddc->mat_graph,NULL,NULL,NULL,NULL,&corners);
8318: ISLocalToGlobalMappingApply(coarse_islg,nout,tidxs,tidxs2);
8319: ISCreateGeneral(PetscObjectComm((PetscObject)pc),nout,tidxs2,PETSC_COPY_VALUES,&corners);
8320: }
8321: PetscFree(tidxs);
8322: PetscFree(tidxs2);
8323: ISLocalToGlobalMappingDestroy(&tmap);
8324: } else {
8325: nis = 0;
8326: nisdofs = 0;
8327: nisneu = 0;
8328: nisvert = 0;
8329: isarray = NULL;
8330: }
8331: /* destroy no longer needed map */
8332: ISLocalToGlobalMappingDestroy(&coarse_islg);
8334: /* subassemble */
8335: if (multilevel_allowed) {
8336: Vec vp[1];
8337: PetscInt nvecs = 0;
8338: PetscBool reuse,reuser;
8340: if (coarse_mat) reuse = PETSC_TRUE;
8341: else reuse = PETSC_FALSE;
8342: MPIU_Allreduce(&reuse,&reuser,1,MPIU_BOOL,MPI_LOR,PetscObjectComm((PetscObject)pc));
8343: vp[0] = NULL;
8344: if (pcbddc->benign_have_null) { /* propagate no-net-flux quadrature to coarser level */
8345: VecCreate(PetscObjectComm((PetscObject)pc),&vp[0]);
8346: VecSetSizes(vp[0],pcbddc->local_primal_size,PETSC_DECIDE);
8347: VecSetType(vp[0],VECSTANDARD);
8348: nvecs = 1;
8350: if (pcbddc->divudotp) {
8351: Mat B,loc_divudotp;
8352: Vec v,p;
8353: IS dummy;
8354: PetscInt np;
8356: MatISGetLocalMat(pcbddc->divudotp,&loc_divudotp);
8357: MatGetSize(loc_divudotp,&np,NULL);
8358: ISCreateStride(PETSC_COMM_SELF,np,0,1,&dummy);
8359: MatCreateSubMatrix(loc_divudotp,dummy,pcis->is_B_local,MAT_INITIAL_MATRIX,&B);
8360: MatCreateVecs(B,&v,&p);
8361: VecSet(p,1.);
8362: MatMultTranspose(B,p,v);
8363: VecDestroy(&p);
8364: MatDestroy(&B);
8365: VecGetArray(vp[0],&array);
8366: VecPlaceArray(pcbddc->vec1_P,array);
8367: VecRestoreArray(vp[0],&array);
8368: MatMultTranspose(pcbddc->coarse_phi_B,v,pcbddc->vec1_P);
8369: VecResetArray(pcbddc->vec1_P);
8370: ISDestroy(&dummy);
8371: VecDestroy(&v);
8372: }
8373: }
8374: if (reuser) {
8375: PCBDDCMatISSubassemble(t_coarse_mat_is,pcbddc->coarse_subassembling,0,restr,full_restr,PETSC_TRUE,&coarse_mat,nis,isarray,nvecs,vp);
8376: } else {
8377: PCBDDCMatISSubassemble(t_coarse_mat_is,pcbddc->coarse_subassembling,0,restr,full_restr,PETSC_FALSE,&coarse_mat_is,nis,isarray,nvecs,vp);
8378: }
8379: if (vp[0]) { /* vp[0] could have been placed on a different set of processes */
8380: PetscScalar *arraym;
8381: const PetscScalar *arrayv;
8382: PetscInt nl;
8383: VecGetLocalSize(vp[0],&nl);
8384: MatCreateSeqDense(PETSC_COMM_SELF,1,nl,NULL,&coarsedivudotp);
8385: MatDenseGetArray(coarsedivudotp,&arraym);
8386: VecGetArrayRead(vp[0],&arrayv);
8387: PetscArraycpy(arraym,arrayv,nl);
8388: VecRestoreArrayRead(vp[0],&arrayv);
8389: MatDenseRestoreArray(coarsedivudotp,&arraym);
8390: VecDestroy(&vp[0]);
8391: } else {
8392: MatCreateSeqAIJ(PETSC_COMM_SELF,0,0,1,NULL,&coarsedivudotp);
8393: }
8394: } else {
8395: PCBDDCMatISSubassemble(t_coarse_mat_is,pcbddc->coarse_subassembling,0,restr,full_restr,PETSC_FALSE,&coarse_mat_is,0,NULL,0,NULL);
8396: }
8397: if (coarse_mat_is || coarse_mat) {
8398: if (!multilevel_allowed) {
8399: MatConvert(coarse_mat_is,MATAIJ,coarse_mat_reuse,&coarse_mat);
8400: } else {
8401: /* if this matrix is present, it means we are not reusing the coarse matrix */
8402: if (coarse_mat_is) {
8403: if (coarse_mat) SETERRQ(PetscObjectComm((PetscObject)coarse_mat_is),PETSC_ERR_PLIB,"This should not happen");
8404: PetscObjectReference((PetscObject)coarse_mat_is);
8405: coarse_mat = coarse_mat_is;
8406: }
8407: }
8408: }
8409: MatDestroy(&t_coarse_mat_is);
8410: MatDestroy(&coarse_mat_is);
8412: /* create local to global scatters for coarse problem */
8413: if (compute_vecs) {
8414: PetscInt lrows;
8415: VecDestroy(&pcbddc->coarse_vec);
8416: if (coarse_mat) {
8417: MatGetLocalSize(coarse_mat,&lrows,NULL);
8418: } else {
8419: lrows = 0;
8420: }
8421: VecCreate(PetscObjectComm((PetscObject)pc),&pcbddc->coarse_vec);
8422: VecSetSizes(pcbddc->coarse_vec,lrows,PETSC_DECIDE);
8423: VecSetType(pcbddc->coarse_vec,coarse_mat ? coarse_mat->defaultvectype : VECSTANDARD);
8424: VecScatterDestroy(&pcbddc->coarse_loc_to_glob);
8425: VecScatterCreate(pcbddc->vec1_P,NULL,pcbddc->coarse_vec,coarse_is,&pcbddc->coarse_loc_to_glob);
8426: }
8427: ISDestroy(&coarse_is);
8429: /* set defaults for coarse KSP and PC */
8430: if (multilevel_allowed) {
8431: coarse_ksp_type = KSPRICHARDSON;
8432: coarse_pc_type = PCBDDC;
8433: } else {
8434: coarse_ksp_type = KSPPREONLY;
8435: coarse_pc_type = PCREDUNDANT;
8436: }
8438: /* print some info if requested */
8439: if (pcbddc->dbg_flag) {
8440: if (!multilevel_allowed) {
8441: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"--------------------------------------------------\n");
8442: if (multilevel_requested) {
8443: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Not enough active processes on level %D (active processes %D, coarsening ratio %D)\n",pcbddc->current_level,active_procs,pcbddc->coarsening_ratio);
8444: } else if (pcbddc->max_levels) {
8445: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Maximum number of requested levels reached (%D)\n",pcbddc->max_levels);
8446: }
8447: PetscViewerFlush(pcbddc->dbg_viewer);
8448: }
8449: }
8451: /* communicate coarse discrete gradient */
8452: coarseG = NULL;
8453: if (pcbddc->nedcG && multilevel_allowed) {
8454: MPI_Comm ccomm;
8455: if (coarse_mat) {
8456: ccomm = PetscObjectComm((PetscObject)coarse_mat);
8457: } else {
8458: ccomm = MPI_COMM_NULL;
8459: }
8460: MatMPIAIJRestrict(pcbddc->nedcG,ccomm,&coarseG);
8461: }
8463: /* create the coarse KSP object only once with defaults */
8464: if (coarse_mat) {
8465: PetscBool isredundant,isbddc,force,valid;
8466: PetscViewer dbg_viewer = NULL;
8468: if (pcbddc->dbg_flag) {
8469: dbg_viewer = PETSC_VIEWER_STDOUT_(PetscObjectComm((PetscObject)coarse_mat));
8470: PetscViewerASCIIAddTab(dbg_viewer,2*pcbddc->current_level);
8471: }
8472: if (!pcbddc->coarse_ksp) {
8473: char prefix[256],str_level[16];
8474: size_t len;
8476: KSPCreate(PetscObjectComm((PetscObject)coarse_mat),&pcbddc->coarse_ksp);
8477: KSPSetErrorIfNotConverged(pcbddc->coarse_ksp,pc->erroriffailure);
8478: PetscObjectIncrementTabLevel((PetscObject)pcbddc->coarse_ksp,(PetscObject)pc,1);
8479: KSPSetTolerances(pcbddc->coarse_ksp,PETSC_DEFAULT,PETSC_DEFAULT,PETSC_DEFAULT,1);
8480: KSPSetOperators(pcbddc->coarse_ksp,coarse_mat,coarse_mat);
8481: KSPSetType(pcbddc->coarse_ksp,coarse_ksp_type);
8482: KSPSetNormType(pcbddc->coarse_ksp,KSP_NORM_NONE);
8483: KSPGetPC(pcbddc->coarse_ksp,&pc_temp);
8484: /* TODO is this logic correct? should check for coarse_mat type */
8485: PCSetType(pc_temp,coarse_pc_type);
8486: /* prefix */
8487: PetscStrcpy(prefix,"");
8488: PetscStrcpy(str_level,"");
8489: if (!pcbddc->current_level) {
8490: PetscStrncpy(prefix,((PetscObject)pc)->prefix,sizeof(prefix));
8491: PetscStrlcat(prefix,"pc_bddc_coarse_",sizeof(prefix));
8492: } else {
8493: PetscStrlen(((PetscObject)pc)->prefix,&len);
8494: if (pcbddc->current_level>1) len -= 3; /* remove "lX_" with X level number */
8495: if (pcbddc->current_level>10) len -= 1; /* remove another char from level number */
8496: /* Nonstandard use of PetscStrncpy() to copy only a portion of the string */
8497: PetscStrncpy(prefix,((PetscObject)pc)->prefix,len+1);
8498: PetscSNPrintf(str_level,sizeof(str_level),"l%d_",(int)(pcbddc->current_level));
8499: PetscStrlcat(prefix,str_level,sizeof(prefix));
8500: }
8501: KSPSetOptionsPrefix(pcbddc->coarse_ksp,prefix);
8502: /* propagate BDDC info to the next level (these are dummy calls if pc_temp is not of type PCBDDC) */
8503: PCBDDCSetLevel(pc_temp,pcbddc->current_level+1);
8504: PCBDDCSetCoarseningRatio(pc_temp,pcbddc->coarsening_ratio);
8505: PCBDDCSetLevels(pc_temp,pcbddc->max_levels);
8506: /* allow user customization */
8507: KSPSetFromOptions(pcbddc->coarse_ksp);
8508: /* get some info after set from options */
8509: KSPGetPC(pcbddc->coarse_ksp,&pc_temp);
8510: /* multilevel cannot be done with coarse PC different from BDDC, NN, HPDDM, unless forced to */
8511: force = PETSC_FALSE;
8512: PetscOptionsGetBool(NULL,((PetscObject)pc_temp)->prefix,"-pc_type_forced",&force,NULL);
8513: PetscObjectTypeCompareAny((PetscObject)pc_temp,&valid,PCBDDC,PCNN,PCHPDDM,"");
8514: PetscObjectTypeCompare((PetscObject)pc_temp,PCBDDC,&isbddc);
8515: if (multilevel_allowed && !force && !valid) {
8516: isbddc = PETSC_TRUE;
8517: PCSetType(pc_temp,PCBDDC);
8518: PCBDDCSetLevel(pc_temp,pcbddc->current_level+1);
8519: PCBDDCSetCoarseningRatio(pc_temp,pcbddc->coarsening_ratio);
8520: PCBDDCSetLevels(pc_temp,pcbddc->max_levels);
8521: if (pc_temp->ops->setfromoptions) { /* need to setfromoptions again, skipping the pc_type */
8522: PetscObjectOptionsBegin((PetscObject)pc_temp);
8523: (*pc_temp->ops->setfromoptions)(PetscOptionsObject,pc_temp);
8524: PetscObjectProcessOptionsHandlers(PetscOptionsObject,(PetscObject)pc_temp);
8525: PetscOptionsEnd();
8526: pc_temp->setfromoptionscalled++;
8527: }
8528: }
8529: }
8530: /* propagate BDDC info to the next level (these are dummy calls if pc_temp is not of type PCBDDC) */
8531: KSPGetPC(pcbddc->coarse_ksp,&pc_temp);
8532: if (nisdofs) {
8533: PCBDDCSetDofsSplitting(pc_temp,nisdofs,isarray);
8534: for (i=0;i<nisdofs;i++) {
8535: ISDestroy(&isarray[i]);
8536: }
8537: }
8538: if (nisneu) {
8539: PCBDDCSetNeumannBoundaries(pc_temp,isarray[nisdofs]);
8540: ISDestroy(&isarray[nisdofs]);
8541: }
8542: if (nisvert) {
8543: PCBDDCSetPrimalVerticesIS(pc_temp,isarray[nis-1]);
8544: ISDestroy(&isarray[nis-1]);
8545: }
8546: if (coarseG) {
8547: PCBDDCSetDiscreteGradient(pc_temp,coarseG,1,nedcfield,PETSC_FALSE,PETSC_TRUE);
8548: }
8550: /* get some info after set from options */
8551: PetscObjectTypeCompare((PetscObject)pc_temp,PCBDDC,&isbddc);
8553: /* multilevel can only be requested via -pc_bddc_levels or PCBDDCSetLevels */
8554: if (isbddc && !multilevel_allowed) {
8555: PCSetType(pc_temp,coarse_pc_type);
8556: }
8557: /* multilevel cannot be done with coarse PC different from BDDC, NN, HPDDM, unless forced to */
8558: force = PETSC_FALSE;
8559: PetscOptionsGetBool(NULL,((PetscObject)pc_temp)->prefix,"-pc_type_forced",&force,NULL);
8560: PetscObjectTypeCompareAny((PetscObject)pc_temp,&valid,PCBDDC,PCNN,PCHPDDM,"");
8561: if (multilevel_requested && multilevel_allowed && !valid && !force) {
8562: PCSetType(pc_temp,PCBDDC);
8563: }
8564: PetscObjectTypeCompare((PetscObject)pc_temp,PCREDUNDANT,&isredundant);
8565: if (isredundant) {
8566: KSP inner_ksp;
8567: PC inner_pc;
8569: PCRedundantGetKSP(pc_temp,&inner_ksp);
8570: KSPGetPC(inner_ksp,&inner_pc);
8571: }
8573: /* parameters which miss an API */
8574: PetscObjectTypeCompare((PetscObject)pc_temp,PCBDDC,&isbddc);
8575: if (isbddc) {
8576: PC_BDDC* pcbddc_coarse = (PC_BDDC*)pc_temp->data;
8578: pcbddc_coarse->detect_disconnected = PETSC_TRUE;
8579: pcbddc_coarse->coarse_eqs_per_proc = pcbddc->coarse_eqs_per_proc;
8580: pcbddc_coarse->coarse_eqs_limit = pcbddc->coarse_eqs_limit;
8581: pcbddc_coarse->benign_saddle_point = pcbddc->benign_have_null;
8582: if (pcbddc_coarse->benign_saddle_point) {
8583: Mat coarsedivudotp_is;
8584: ISLocalToGlobalMapping l2gmap,rl2g,cl2g;
8585: IS row,col;
8586: const PetscInt *gidxs;
8587: PetscInt n,st,M,N;
8589: MatGetSize(coarsedivudotp,&n,NULL);
8590: MPI_Scan(&n,&st,1,MPIU_INT,MPI_SUM,PetscObjectComm((PetscObject)coarse_mat));
8591: st = st-n;
8592: ISCreateStride(PetscObjectComm((PetscObject)coarse_mat),1,st,1,&row);
8593: MatGetLocalToGlobalMapping(coarse_mat,&l2gmap,NULL);
8594: ISLocalToGlobalMappingGetSize(l2gmap,&n);
8595: ISLocalToGlobalMappingGetIndices(l2gmap,&gidxs);
8596: ISCreateGeneral(PetscObjectComm((PetscObject)coarse_mat),n,gidxs,PETSC_COPY_VALUES,&col);
8597: ISLocalToGlobalMappingRestoreIndices(l2gmap,&gidxs);
8598: ISLocalToGlobalMappingCreateIS(row,&rl2g);
8599: ISLocalToGlobalMappingCreateIS(col,&cl2g);
8600: ISGetSize(row,&M);
8601: MatGetSize(coarse_mat,&N,NULL);
8602: ISDestroy(&row);
8603: ISDestroy(&col);
8604: MatCreate(PetscObjectComm((PetscObject)coarse_mat),&coarsedivudotp_is);
8605: MatSetType(coarsedivudotp_is,MATIS);
8606: MatSetSizes(coarsedivudotp_is,PETSC_DECIDE,PETSC_DECIDE,M,N);
8607: MatSetLocalToGlobalMapping(coarsedivudotp_is,rl2g,cl2g);
8608: ISLocalToGlobalMappingDestroy(&rl2g);
8609: ISLocalToGlobalMappingDestroy(&cl2g);
8610: MatISSetLocalMat(coarsedivudotp_is,coarsedivudotp);
8611: MatDestroy(&coarsedivudotp);
8612: PCBDDCSetDivergenceMat(pc_temp,coarsedivudotp_is,PETSC_FALSE,NULL);
8613: MatDestroy(&coarsedivudotp_is);
8614: pcbddc_coarse->adaptive_userdefined = PETSC_TRUE;
8615: if (pcbddc->adaptive_threshold[0] == 0.0) pcbddc_coarse->deluxe_zerorows = PETSC_TRUE;
8616: }
8617: }
8619: /* propagate symmetry info of coarse matrix */
8620: MatSetOption(coarse_mat,MAT_STRUCTURALLY_SYMMETRIC,PETSC_TRUE);
8621: if (pc->pmat->symmetric_set) {
8622: MatSetOption(coarse_mat,MAT_SYMMETRIC,pc->pmat->symmetric);
8623: }
8624: if (pc->pmat->hermitian_set) {
8625: MatSetOption(coarse_mat,MAT_HERMITIAN,pc->pmat->hermitian);
8626: }
8627: if (pc->pmat->spd_set) {
8628: MatSetOption(coarse_mat,MAT_SPD,pc->pmat->spd);
8629: }
8630: if (pcbddc->benign_saddle_point && !pcbddc->benign_have_null) {
8631: MatSetOption(coarse_mat,MAT_SPD,PETSC_TRUE);
8632: }
8633: /* set operators */
8634: MatViewFromOptions(coarse_mat,(PetscObject)pc,"-pc_bddc_coarse_mat_view");
8635: MatSetOptionsPrefix(coarse_mat,((PetscObject)pcbddc->coarse_ksp)->prefix);
8636: KSPSetOperators(pcbddc->coarse_ksp,coarse_mat,coarse_mat);
8637: if (pcbddc->dbg_flag) {
8638: PetscViewerASCIISubtractTab(dbg_viewer,2*pcbddc->current_level);
8639: }
8640: }
8641: MatDestroy(&coarseG);
8642: PetscFree(isarray);
8643: #if 0
8644: {
8645: PetscViewer viewer;
8646: char filename[256];
8647: sprintf(filename,"coarse_mat_level%d.m",pcbddc->current_level);
8648: PetscViewerASCIIOpen(PetscObjectComm((PetscObject)coarse_mat),filename,&viewer);
8649: PetscViewerPushFormat(viewer,PETSC_VIEWER_ASCII_MATLAB);
8650: MatView(coarse_mat,viewer);
8651: PetscViewerPopFormat(viewer);
8652: PetscViewerDestroy(&viewer);
8653: }
8654: #endif
8656: if (corners) {
8657: Vec gv;
8658: IS is;
8659: const PetscInt *idxs;
8660: PetscInt i,d,N,n,cdim = pcbddc->mat_graph->cdim;
8661: PetscScalar *coords;
8663: if (!pcbddc->mat_graph->cloc) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Missing local coordinates");
8664: VecGetSize(pcbddc->coarse_vec,&N);
8665: VecGetLocalSize(pcbddc->coarse_vec,&n);
8666: VecCreate(PetscObjectComm((PetscObject)pcbddc->coarse_vec),&gv);
8667: VecSetBlockSize(gv,cdim);
8668: VecSetSizes(gv,n*cdim,N*cdim);
8669: VecSetType(gv,VECSTANDARD);
8670: VecSetFromOptions(gv);
8671: VecSet(gv,PETSC_MAX_REAL); /* we only propagate coordinates from vertices constraints */
8673: PCBDDCGraphGetCandidatesIS(pcbddc->mat_graph,NULL,NULL,NULL,NULL,&is);
8674: ISGetLocalSize(is,&n);
8675: ISGetIndices(is,&idxs);
8676: PetscMalloc1(n*cdim,&coords);
8677: for (i=0;i<n;i++) {
8678: for (d=0;d<cdim;d++) {
8679: coords[cdim*i+d] = pcbddc->mat_graph->coords[cdim*idxs[i]+d];
8680: }
8681: }
8682: ISRestoreIndices(is,&idxs);
8683: PCBDDCGraphRestoreCandidatesIS(pcbddc->mat_graph,NULL,NULL,NULL,NULL,&is);
8685: ISGetLocalSize(corners,&n);
8686: ISGetIndices(corners,&idxs);
8687: VecSetValuesBlocked(gv,n,idxs,coords,INSERT_VALUES);
8688: ISRestoreIndices(corners,&idxs);
8689: PetscFree(coords);
8690: VecAssemblyBegin(gv);
8691: VecAssemblyEnd(gv);
8692: VecGetArray(gv,&coords);
8693: if (pcbddc->coarse_ksp) {
8694: PC coarse_pc;
8695: PetscBool isbddc;
8697: KSPGetPC(pcbddc->coarse_ksp,&coarse_pc);
8698: PetscObjectTypeCompare((PetscObject)coarse_pc,PCBDDC,&isbddc);
8699: if (isbddc) { /* coarse coordinates have PETSC_MAX_REAL, specific for BDDC */
8700: PetscReal *realcoords;
8702: VecGetLocalSize(gv,&n);
8703: #if defined(PETSC_USE_COMPLEX)
8704: PetscMalloc1(n,&realcoords);
8705: for (i=0;i<n;i++) realcoords[i] = PetscRealPart(coords[i]);
8706: #else
8707: realcoords = coords;
8708: #endif
8709: PCSetCoordinates(coarse_pc,cdim,n/cdim,realcoords);
8710: #if defined(PETSC_USE_COMPLEX)
8711: PetscFree(realcoords);
8712: #endif
8713: }
8714: }
8715: VecRestoreArray(gv,&coords);
8716: VecDestroy(&gv);
8717: }
8718: ISDestroy(&corners);
8720: if (pcbddc->coarse_ksp) {
8721: Vec crhs,csol;
8723: KSPGetSolution(pcbddc->coarse_ksp,&csol);
8724: KSPGetRhs(pcbddc->coarse_ksp,&crhs);
8725: if (!csol) {
8726: MatCreateVecs(coarse_mat,&((pcbddc->coarse_ksp)->vec_sol),NULL);
8727: }
8728: if (!crhs) {
8729: MatCreateVecs(coarse_mat,NULL,&((pcbddc->coarse_ksp)->vec_rhs));
8730: }
8731: }
8732: MatDestroy(&coarsedivudotp);
8734: /* compute null space for coarse solver if the benign trick has been requested */
8735: if (pcbddc->benign_null) {
8737: VecSet(pcbddc->vec1_P,0.);
8738: for (i=0;i<pcbddc->benign_n;i++) {
8739: VecSetValue(pcbddc->vec1_P,pcbddc->local_primal_size-pcbddc->benign_n+i,1.0,INSERT_VALUES);
8740: }
8741: VecAssemblyBegin(pcbddc->vec1_P);
8742: VecAssemblyEnd(pcbddc->vec1_P);
8743: VecScatterBegin(pcbddc->coarse_loc_to_glob,pcbddc->vec1_P,pcbddc->coarse_vec,INSERT_VALUES,SCATTER_FORWARD);
8744: VecScatterEnd(pcbddc->coarse_loc_to_glob,pcbddc->vec1_P,pcbddc->coarse_vec,INSERT_VALUES,SCATTER_FORWARD);
8745: if (coarse_mat) {
8746: Vec nullv;
8747: PetscScalar *array,*array2;
8748: PetscInt nl;
8750: MatCreateVecs(coarse_mat,&nullv,NULL);
8751: VecGetLocalSize(nullv,&nl);
8752: VecGetArrayRead(pcbddc->coarse_vec,(const PetscScalar**)&array);
8753: VecGetArray(nullv,&array2);
8754: PetscArraycpy(array2,array,nl);
8755: VecRestoreArray(nullv,&array2);
8756: VecRestoreArrayRead(pcbddc->coarse_vec,(const PetscScalar**)&array);
8757: VecNormalize(nullv,NULL);
8758: MatNullSpaceCreate(PetscObjectComm((PetscObject)coarse_mat),PETSC_FALSE,1,&nullv,&CoarseNullSpace);
8759: VecDestroy(&nullv);
8760: }
8761: }
8762: PetscLogEventEnd(PC_BDDC_CoarseSetUp[pcbddc->current_level],pc,0,0,0);
8764: PetscLogEventBegin(PC_BDDC_CoarseSolver[pcbddc->current_level],pc,0,0,0);
8765: if (pcbddc->coarse_ksp) {
8766: PetscBool ispreonly;
8768: if (CoarseNullSpace) {
8769: PetscBool isnull;
8770: MatNullSpaceTest(CoarseNullSpace,coarse_mat,&isnull);
8771: if (isnull) {
8772: MatSetNullSpace(coarse_mat,CoarseNullSpace);
8773: }
8774: /* TODO: add local nullspaces (if any) */
8775: }
8776: /* setup coarse ksp */
8777: KSPSetUp(pcbddc->coarse_ksp);
8778: /* Check coarse problem if in debug mode or if solving with an iterative method */
8779: PetscObjectTypeCompare((PetscObject)pcbddc->coarse_ksp,KSPPREONLY,&ispreonly);
8780: if (pcbddc->dbg_flag || (!ispreonly && pcbddc->use_coarse_estimates) ) {
8781: KSP check_ksp;
8782: KSPType check_ksp_type;
8783: PC check_pc;
8784: Vec check_vec,coarse_vec;
8785: PetscReal abs_infty_error,infty_error,lambda_min=1.0,lambda_max=1.0;
8786: PetscInt its;
8787: PetscBool compute_eigs;
8788: PetscReal *eigs_r,*eigs_c;
8789: PetscInt neigs;
8790: const char *prefix;
8792: /* Create ksp object suitable for estimation of extreme eigenvalues */
8793: KSPCreate(PetscObjectComm((PetscObject)pcbddc->coarse_ksp),&check_ksp);
8794: PetscObjectIncrementTabLevel((PetscObject)check_ksp,(PetscObject)pcbddc->coarse_ksp,0);
8795: KSPSetErrorIfNotConverged(pcbddc->coarse_ksp,PETSC_FALSE);
8796: KSPSetOperators(check_ksp,coarse_mat,coarse_mat);
8797: KSPSetTolerances(check_ksp,1.e-12,1.e-12,PETSC_DEFAULT,pcbddc->coarse_size);
8798: /* prevent from setup unneeded object */
8799: KSPGetPC(check_ksp,&check_pc);
8800: PCSetType(check_pc,PCNONE);
8801: if (ispreonly) {
8802: check_ksp_type = KSPPREONLY;
8803: compute_eigs = PETSC_FALSE;
8804: } else {
8805: check_ksp_type = KSPGMRES;
8806: compute_eigs = PETSC_TRUE;
8807: }
8808: KSPSetType(check_ksp,check_ksp_type);
8809: KSPSetComputeSingularValues(check_ksp,compute_eigs);
8810: KSPSetComputeEigenvalues(check_ksp,compute_eigs);
8811: KSPGMRESSetRestart(check_ksp,pcbddc->coarse_size+1);
8812: KSPGetOptionsPrefix(pcbddc->coarse_ksp,&prefix);
8813: KSPSetOptionsPrefix(check_ksp,prefix);
8814: KSPAppendOptionsPrefix(check_ksp,"check_");
8815: KSPSetFromOptions(check_ksp);
8816: KSPSetUp(check_ksp);
8817: KSPGetPC(pcbddc->coarse_ksp,&check_pc);
8818: KSPSetPC(check_ksp,check_pc);
8819: /* create random vec */
8820: MatCreateVecs(coarse_mat,&coarse_vec,&check_vec);
8821: VecSetRandom(check_vec,NULL);
8822: MatMult(coarse_mat,check_vec,coarse_vec);
8823: /* solve coarse problem */
8824: KSPSolve(check_ksp,coarse_vec,coarse_vec);
8825: KSPCheckSolve(check_ksp,pc,coarse_vec);
8826: /* set eigenvalue estimation if preonly has not been requested */
8827: if (compute_eigs) {
8828: PetscMalloc1(pcbddc->coarse_size+1,&eigs_r);
8829: PetscMalloc1(pcbddc->coarse_size+1,&eigs_c);
8830: KSPComputeEigenvalues(check_ksp,pcbddc->coarse_size+1,eigs_r,eigs_c,&neigs);
8831: if (neigs) {
8832: lambda_max = eigs_r[neigs-1];
8833: lambda_min = eigs_r[0];
8834: if (pcbddc->use_coarse_estimates) {
8835: if (lambda_max>=lambda_min) { /* using PETSC_SMALL since lambda_max == lambda_min is not allowed by KSPChebyshevSetEigenvalues */
8836: KSPChebyshevSetEigenvalues(pcbddc->coarse_ksp,lambda_max+PETSC_SMALL,lambda_min);
8837: KSPRichardsonSetScale(pcbddc->coarse_ksp,2.0/(lambda_max+lambda_min));
8838: }
8839: }
8840: }
8841: }
8843: /* check coarse problem residual error */
8844: if (pcbddc->dbg_flag) {
8845: PetscViewer dbg_viewer = PETSC_VIEWER_STDOUT_(PetscObjectComm((PetscObject)pcbddc->coarse_ksp));
8846: PetscViewerASCIIAddTab(dbg_viewer,2*(pcbddc->current_level+1));
8847: VecAXPY(check_vec,-1.0,coarse_vec);
8848: VecNorm(check_vec,NORM_INFINITY,&infty_error);
8849: MatMult(coarse_mat,check_vec,coarse_vec);
8850: VecNorm(coarse_vec,NORM_INFINITY,&abs_infty_error);
8851: PetscViewerASCIIPrintf(dbg_viewer,"Coarse problem details (use estimates %d)\n",pcbddc->use_coarse_estimates);
8852: PetscObjectPrintClassNamePrefixType((PetscObject)(pcbddc->coarse_ksp),dbg_viewer);
8853: PetscObjectPrintClassNamePrefixType((PetscObject)(check_pc),dbg_viewer);
8854: PetscViewerASCIIPrintf(dbg_viewer,"Coarse problem exact infty_error : %1.6e\n",infty_error);
8855: PetscViewerASCIIPrintf(dbg_viewer,"Coarse problem residual infty_error: %1.6e\n",abs_infty_error);
8856: if (CoarseNullSpace) {
8857: PetscViewerASCIIPrintf(dbg_viewer,"Coarse problem is singular\n");
8858: }
8859: if (compute_eigs) {
8860: PetscReal lambda_max_s,lambda_min_s;
8861: KSPConvergedReason reason;
8862: KSPGetType(check_ksp,&check_ksp_type);
8863: KSPGetIterationNumber(check_ksp,&its);
8864: KSPGetConvergedReason(check_ksp,&reason);
8865: KSPComputeExtremeSingularValues(check_ksp,&lambda_max_s,&lambda_min_s);
8866: PetscViewerASCIIPrintf(dbg_viewer,"Coarse problem eigenvalues (estimated with %d iterations of %s, conv reason %d): %1.6e %1.6e (%1.6e %1.6e)\n",its,check_ksp_type,reason,lambda_min,lambda_max,lambda_min_s,lambda_max_s);
8867: for (i=0;i<neigs;i++) {
8868: PetscViewerASCIIPrintf(dbg_viewer,"%1.6e %1.6ei\n",eigs_r[i],eigs_c[i]);
8869: }
8870: }
8871: PetscViewerFlush(dbg_viewer);
8872: PetscViewerASCIISubtractTab(dbg_viewer,2*(pcbddc->current_level+1));
8873: }
8874: VecDestroy(&check_vec);
8875: VecDestroy(&coarse_vec);
8876: KSPDestroy(&check_ksp);
8877: if (compute_eigs) {
8878: PetscFree(eigs_r);
8879: PetscFree(eigs_c);
8880: }
8881: }
8882: }
8883: MatNullSpaceDestroy(&CoarseNullSpace);
8884: /* print additional info */
8885: if (pcbddc->dbg_flag) {
8886: /* waits until all processes reaches this point */
8887: PetscBarrier((PetscObject)pc);
8888: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Coarse solver setup completed at level %D\n",pcbddc->current_level);
8889: PetscViewerFlush(pcbddc->dbg_viewer);
8890: }
8892: /* free memory */
8893: MatDestroy(&coarse_mat);
8894: PetscLogEventEnd(PC_BDDC_CoarseSolver[pcbddc->current_level],pc,0,0,0);
8895: return(0);
8896: }
8898: PetscErrorCode PCBDDCComputePrimalNumbering(PC pc,PetscInt* coarse_size_n,PetscInt** local_primal_indices_n)
8899: {
8900: PC_BDDC* pcbddc = (PC_BDDC*)pc->data;
8901: PC_IS* pcis = (PC_IS*)pc->data;
8902: Mat_IS* matis = (Mat_IS*)pc->pmat->data;
8903: IS subset,subset_mult,subset_n;
8904: PetscInt local_size,coarse_size=0;
8905: PetscInt *local_primal_indices=NULL;
8906: const PetscInt *t_local_primal_indices;
8910: /* Compute global number of coarse dofs */
8911: if (pcbddc->local_primal_size && !pcbddc->local_primal_ref_node) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"BDDC ConstraintsSetUp should be called first");
8912: ISCreateGeneral(PetscObjectComm((PetscObject)(pc->pmat)),pcbddc->local_primal_size_cc,pcbddc->local_primal_ref_node,PETSC_COPY_VALUES,&subset_n);
8913: ISLocalToGlobalMappingApplyIS(pcis->mapping,subset_n,&subset);
8914: ISDestroy(&subset_n);
8915: ISCreateGeneral(PetscObjectComm((PetscObject)(pc->pmat)),pcbddc->local_primal_size_cc,pcbddc->local_primal_ref_mult,PETSC_COPY_VALUES,&subset_mult);
8916: ISRenumber(subset,subset_mult,&coarse_size,&subset_n);
8917: ISDestroy(&subset);
8918: ISDestroy(&subset_mult);
8919: ISGetLocalSize(subset_n,&local_size);
8920: if (local_size != pcbddc->local_primal_size) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Invalid number of local primal indices computed %D != %D",local_size,pcbddc->local_primal_size);
8921: PetscMalloc1(local_size,&local_primal_indices);
8922: ISGetIndices(subset_n,&t_local_primal_indices);
8923: PetscArraycpy(local_primal_indices,t_local_primal_indices,local_size);
8924: ISRestoreIndices(subset_n,&t_local_primal_indices);
8925: ISDestroy(&subset_n);
8927: /* check numbering */
8928: if (pcbddc->dbg_flag) {
8929: PetscScalar coarsesum,*array,*array2;
8930: PetscInt i;
8931: PetscBool set_error = PETSC_FALSE,set_error_reduced = PETSC_FALSE;
8933: PetscViewerFlush(pcbddc->dbg_viewer);
8934: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"--------------------------------------------------\n");
8935: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Check coarse indices\n");
8936: PetscViewerASCIIPushSynchronized(pcbddc->dbg_viewer);
8937: /* counter */
8938: VecSet(pcis->vec1_global,0.0);
8939: VecSet(pcis->vec1_N,1.0);
8940: VecScatterBegin(matis->rctx,pcis->vec1_N,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);
8941: VecScatterEnd(matis->rctx,pcis->vec1_N,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);
8942: VecScatterBegin(matis->rctx,pcis->vec1_global,pcis->vec2_N,INSERT_VALUES,SCATTER_FORWARD);
8943: VecScatterEnd(matis->rctx,pcis->vec1_global,pcis->vec2_N,INSERT_VALUES,SCATTER_FORWARD);
8944: VecSet(pcis->vec1_N,0.0);
8945: for (i=0;i<pcbddc->local_primal_size;i++) {
8946: VecSetValue(pcis->vec1_N,pcbddc->primal_indices_local_idxs[i],1.0,INSERT_VALUES);
8947: }
8948: VecAssemblyBegin(pcis->vec1_N);
8949: VecAssemblyEnd(pcis->vec1_N);
8950: VecSet(pcis->vec1_global,0.0);
8951: VecScatterBegin(matis->rctx,pcis->vec1_N,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);
8952: VecScatterEnd(matis->rctx,pcis->vec1_N,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);
8953: VecScatterBegin(matis->rctx,pcis->vec1_global,pcis->vec1_N,INSERT_VALUES,SCATTER_FORWARD);
8954: VecScatterEnd(matis->rctx,pcis->vec1_global,pcis->vec1_N,INSERT_VALUES,SCATTER_FORWARD);
8955: VecGetArray(pcis->vec1_N,&array);
8956: VecGetArray(pcis->vec2_N,&array2);
8957: for (i=0;i<pcis->n;i++) {
8958: if (array[i] != 0.0 && array[i] != array2[i]) {
8959: PetscInt owned = (PetscInt)PetscRealPart(array[i]),gi;
8960: PetscInt neigh = (PetscInt)PetscRealPart(array2[i]);
8961: set_error = PETSC_TRUE;
8962: ISLocalToGlobalMappingApply(pcis->mapping,1,&i,&gi);
8963: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d: local index %D (gid %D) owned by %D processes instead of %D!\n",PetscGlobalRank,i,gi,owned,neigh);
8964: }
8965: }
8966: VecRestoreArray(pcis->vec2_N,&array2);
8967: MPIU_Allreduce(&set_error,&set_error_reduced,1,MPIU_BOOL,MPI_LOR,PetscObjectComm((PetscObject)pc));
8968: PetscViewerFlush(pcbddc->dbg_viewer);
8969: for (i=0;i<pcis->n;i++) {
8970: if (PetscRealPart(array[i]) > 0.0) array[i] = 1.0/PetscRealPart(array[i]);
8971: }
8972: VecRestoreArray(pcis->vec1_N,&array);
8973: VecSet(pcis->vec1_global,0.0);
8974: VecScatterBegin(matis->rctx,pcis->vec1_N,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);
8975: VecScatterEnd(matis->rctx,pcis->vec1_N,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);
8976: VecSum(pcis->vec1_global,&coarsesum);
8977: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Size of coarse problem is %D (%lf)\n",coarse_size,PetscRealPart(coarsesum));
8978: if (pcbddc->dbg_flag > 1 || set_error_reduced) {
8979: PetscInt *gidxs;
8981: PetscMalloc1(pcbddc->local_primal_size,&gidxs);
8982: ISLocalToGlobalMappingApply(pcis->mapping,pcbddc->local_primal_size,pcbddc->primal_indices_local_idxs,gidxs);
8983: PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Distribution of local primal indices\n");
8984: PetscViewerFlush(pcbddc->dbg_viewer);
8985: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d\n",PetscGlobalRank);
8986: for (i=0;i<pcbddc->local_primal_size;i++) {
8987: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"local_primal_indices[%D]=%D (%D,%D)\n",i,local_primal_indices[i],pcbddc->primal_indices_local_idxs[i],gidxs[i]);
8988: }
8989: PetscViewerFlush(pcbddc->dbg_viewer);
8990: PetscFree(gidxs);
8991: }
8992: PetscViewerFlush(pcbddc->dbg_viewer);
8993: PetscViewerASCIIPushSynchronized(pcbddc->dbg_viewer);
8994: if (set_error_reduced) SETERRQ(PetscObjectComm((PetscObject)pc),PETSC_ERR_PLIB,"BDDC Numbering of coarse dofs failed");
8995: }
8997: /* get back data */
8998: *coarse_size_n = coarse_size;
8999: *local_primal_indices_n = local_primal_indices;
9000: return(0);
9001: }
9003: PetscErrorCode PCBDDCGlobalToLocal(VecScatter g2l_ctx,Vec gwork, Vec lwork, IS globalis, IS* localis)
9004: {
9005: IS localis_t;
9006: PetscInt i,lsize,*idxs,n;
9007: PetscScalar *vals;
9011: /* get indices in local ordering exploiting local to global map */
9012: ISGetLocalSize(globalis,&lsize);
9013: PetscMalloc1(lsize,&vals);
9014: for (i=0;i<lsize;i++) vals[i] = 1.0;
9015: ISGetIndices(globalis,(const PetscInt**)&idxs);
9016: VecSet(gwork,0.0);
9017: VecSet(lwork,0.0);
9018: if (idxs) { /* multilevel guard */
9019: VecSetOption(gwork,VEC_IGNORE_NEGATIVE_INDICES,PETSC_TRUE);
9020: VecSetValues(gwork,lsize,idxs,vals,INSERT_VALUES);
9021: }
9022: VecAssemblyBegin(gwork);
9023: ISRestoreIndices(globalis,(const PetscInt**)&idxs);
9024: PetscFree(vals);
9025: VecAssemblyEnd(gwork);
9026: /* now compute set in local ordering */
9027: VecScatterBegin(g2l_ctx,gwork,lwork,INSERT_VALUES,SCATTER_FORWARD);
9028: VecScatterEnd(g2l_ctx,gwork,lwork,INSERT_VALUES,SCATTER_FORWARD);
9029: VecGetArrayRead(lwork,(const PetscScalar**)&vals);
9030: VecGetSize(lwork,&n);
9031: for (i=0,lsize=0;i<n;i++) {
9032: if (PetscRealPart(vals[i]) > 0.5) {
9033: lsize++;
9034: }
9035: }
9036: PetscMalloc1(lsize,&idxs);
9037: for (i=0,lsize=0;i<n;i++) {
9038: if (PetscRealPart(vals[i]) > 0.5) {
9039: idxs[lsize++] = i;
9040: }
9041: }
9042: VecRestoreArrayRead(lwork,(const PetscScalar**)&vals);
9043: ISCreateGeneral(PetscObjectComm((PetscObject)gwork),lsize,idxs,PETSC_OWN_POINTER,&localis_t);
9044: *localis = localis_t;
9045: return(0);
9046: }
9048: PetscErrorCode PCBDDCSetUpSubSchurs(PC pc)
9049: {
9050: PC_IS *pcis=(PC_IS*)pc->data;
9051: PC_BDDC *pcbddc=(PC_BDDC*)pc->data;
9052: PCBDDCSubSchurs sub_schurs=pcbddc->sub_schurs;
9053: Mat S_j;
9054: PetscInt *used_xadj,*used_adjncy;
9055: PetscBool free_used_adj;
9056: PetscErrorCode ierr;
9059: PetscLogEventBegin(PC_BDDC_Schurs[pcbddc->current_level],pc,0,0,0);
9060: /* decide the adjacency to be used for determining internal problems for local schur on subsets */
9061: free_used_adj = PETSC_FALSE;
9062: if (pcbddc->sub_schurs_layers == -1) {
9063: used_xadj = NULL;
9064: used_adjncy = NULL;
9065: } else {
9066: if (pcbddc->sub_schurs_use_useradj && pcbddc->mat_graph->xadj) {
9067: used_xadj = pcbddc->mat_graph->xadj;
9068: used_adjncy = pcbddc->mat_graph->adjncy;
9069: } else if (pcbddc->computed_rowadj) {
9070: used_xadj = pcbddc->mat_graph->xadj;
9071: used_adjncy = pcbddc->mat_graph->adjncy;
9072: } else {
9073: PetscBool flg_row=PETSC_FALSE;
9074: const PetscInt *xadj,*adjncy;
9075: PetscInt nvtxs;
9077: MatGetRowIJ(pcbddc->local_mat,0,PETSC_TRUE,PETSC_FALSE,&nvtxs,&xadj,&adjncy,&flg_row);
9078: if (flg_row) {
9079: PetscMalloc2(nvtxs+1,&used_xadj,xadj[nvtxs],&used_adjncy);
9080: PetscArraycpy(used_xadj,xadj,nvtxs+1);
9081: PetscArraycpy(used_adjncy,adjncy,xadj[nvtxs]);
9082: free_used_adj = PETSC_TRUE;
9083: } else {
9084: pcbddc->sub_schurs_layers = -1;
9085: used_xadj = NULL;
9086: used_adjncy = NULL;
9087: }
9088: MatRestoreRowIJ(pcbddc->local_mat,0,PETSC_TRUE,PETSC_FALSE,&nvtxs,&xadj,&adjncy,&flg_row);
9089: }
9090: }
9092: /* setup sub_schurs data */
9093: MatCreateSchurComplement(pcis->A_II,pcis->pA_II,pcis->A_IB,pcis->A_BI,pcis->A_BB,&S_j);
9094: if (!sub_schurs->schur_explicit) {
9095: /* pcbddc->ksp_D up to date only if not using MatFactor with Schur complement support */
9096: MatSchurComplementSetKSP(S_j,pcbddc->ksp_D);
9097: PCBDDCSubSchursSetUp(sub_schurs,NULL,S_j,PETSC_FALSE,used_xadj,used_adjncy,pcbddc->sub_schurs_layers,NULL,pcbddc->adaptive_selection,PETSC_FALSE,PETSC_FALSE,0,NULL,NULL,NULL,NULL);
9098: } else {
9099: Mat change = NULL;
9100: Vec scaling = NULL;
9101: IS change_primal = NULL, iP;
9102: PetscInt benign_n;
9103: PetscBool reuse_solvers = (PetscBool)!pcbddc->use_change_of_basis;
9104: PetscBool need_change = PETSC_FALSE;
9105: PetscBool discrete_harmonic = PETSC_FALSE;
9107: if (!pcbddc->use_vertices && reuse_solvers) {
9108: PetscInt n_vertices;
9110: ISGetLocalSize(sub_schurs->is_vertices,&n_vertices);
9111: reuse_solvers = (PetscBool)!n_vertices;
9112: }
9113: if (!pcbddc->benign_change_explicit) {
9114: benign_n = pcbddc->benign_n;
9115: } else {
9116: benign_n = 0;
9117: }
9118: /* sub_schurs->change is a local object; instead, PCBDDCConstraintsSetUp and the quantities used in the test below are logically collective on pc.
9119: We need a global reduction to avoid possible deadlocks.
9120: We assume that sub_schurs->change is created once, and then reused for different solves, unless the topography has been recomputed */
9121: if (pcbddc->adaptive_userdefined || (pcbddc->deluxe_zerorows && !pcbddc->use_change_of_basis)) {
9122: PetscBool have_loc_change = (PetscBool)(!!sub_schurs->change);
9123: MPIU_Allreduce(&have_loc_change,&need_change,1,MPIU_BOOL,MPI_LOR,PetscObjectComm((PetscObject)pc));
9124: need_change = (PetscBool)(!need_change);
9125: }
9126: /* If the user defines additional constraints, we import them here.
9127: We need to compute the change of basis according to the quadrature weights attached to pmat via MatSetNearNullSpace, and this could not be done (at the moment) without some hacking */
9128: if (need_change) {
9129: PC_IS *pcisf;
9130: PC_BDDC *pcbddcf;
9131: PC pcf;
9133: if (pcbddc->sub_schurs_rebuild) SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Cannot compute change of basis with a different graph");
9134: PCCreate(PetscObjectComm((PetscObject)pc),&pcf);
9135: PCSetOperators(pcf,pc->mat,pc->pmat);
9136: PCSetType(pcf,PCBDDC);
9138: /* hacks */
9139: pcisf = (PC_IS*)pcf->data;
9140: pcisf->is_B_local = pcis->is_B_local;
9141: pcisf->vec1_N = pcis->vec1_N;
9142: pcisf->BtoNmap = pcis->BtoNmap;
9143: pcisf->n = pcis->n;
9144: pcisf->n_B = pcis->n_B;
9145: pcbddcf = (PC_BDDC*)pcf->data;
9146: PetscFree(pcbddcf->mat_graph);
9147: pcbddcf->mat_graph = pcbddc->mat_graph;
9148: pcbddcf->use_faces = PETSC_TRUE;
9149: pcbddcf->use_change_of_basis = PETSC_TRUE;
9150: pcbddcf->use_change_on_faces = PETSC_TRUE;
9151: pcbddcf->use_qr_single = PETSC_TRUE;
9152: pcbddcf->fake_change = PETSC_TRUE;
9154: /* setup constraints so that we can get information on primal vertices and change of basis (in local numbering) */
9155: PCBDDCConstraintsSetUp(pcf);
9156: sub_schurs->change_with_qr = pcbddcf->use_qr_single;
9157: ISCreateGeneral(PETSC_COMM_SELF,pcbddcf->n_vertices,pcbddcf->local_primal_ref_node,PETSC_COPY_VALUES,&change_primal);
9158: change = pcbddcf->ConstraintMatrix;
9159: pcbddcf->ConstraintMatrix = NULL;
9161: /* free unneeded memory allocated in PCBDDCConstraintsSetUp */
9162: PetscFree(pcbddcf->sub_schurs);
9163: MatNullSpaceDestroy(&pcbddcf->onearnullspace);
9164: PetscFree2(pcbddcf->local_primal_ref_node,pcbddcf->local_primal_ref_mult);
9165: PetscFree(pcbddcf->primal_indices_local_idxs);
9166: PetscFree(pcbddcf->onearnullvecs_state);
9167: PetscFree(pcf->data);
9168: pcf->ops->destroy = NULL;
9169: pcf->ops->reset = NULL;
9170: PCDestroy(&pcf);
9171: }
9172: if (!pcbddc->use_deluxe_scaling) scaling = pcis->D;
9174: PetscObjectQuery((PetscObject)pc,"__KSPFETIDP_iP",(PetscObject*)&iP);
9175: if (iP) {
9176: PetscOptionsBegin(PetscObjectComm((PetscObject)iP),sub_schurs->prefix,"BDDC sub_schurs options","PC");
9177: PetscOptionsBool("-sub_schurs_discrete_harmonic",NULL,NULL,discrete_harmonic,&discrete_harmonic,NULL);
9178: PetscOptionsEnd();
9179: }
9180: if (discrete_harmonic) {
9181: Mat A;
9182: MatDuplicate(pcbddc->local_mat,MAT_COPY_VALUES,&A);
9183: MatZeroRowsColumnsIS(A,iP,1.0,NULL,NULL);
9184: PetscObjectCompose((PetscObject)A,"__KSPFETIDP_iP",(PetscObject)iP);
9185: PCBDDCSubSchursSetUp(sub_schurs,A,S_j,pcbddc->sub_schurs_exact_schur,used_xadj,used_adjncy,pcbddc->sub_schurs_layers,scaling,pcbddc->adaptive_selection,reuse_solvers,pcbddc->benign_saddle_point,benign_n,pcbddc->benign_p0_lidx,pcbddc->benign_zerodiag_subs,change,change_primal);
9186: MatDestroy(&A);
9187: } else {
9188: PCBDDCSubSchursSetUp(sub_schurs,pcbddc->local_mat,S_j,pcbddc->sub_schurs_exact_schur,used_xadj,used_adjncy,pcbddc->sub_schurs_layers,scaling,pcbddc->adaptive_selection,reuse_solvers,pcbddc->benign_saddle_point,benign_n,pcbddc->benign_p0_lidx,pcbddc->benign_zerodiag_subs,change,change_primal);
9189: }
9190: MatDestroy(&change);
9191: ISDestroy(&change_primal);
9192: }
9193: MatDestroy(&S_j);
9195: /* free adjacency */
9196: if (free_used_adj) {
9197: PetscFree2(used_xadj,used_adjncy);
9198: }
9199: PetscLogEventEnd(PC_BDDC_Schurs[pcbddc->current_level],pc,0,0,0);
9200: return(0);
9201: }
9203: PetscErrorCode PCBDDCInitSubSchurs(PC pc)
9204: {
9205: PC_IS *pcis=(PC_IS*)pc->data;
9206: PC_BDDC *pcbddc=(PC_BDDC*)pc->data;
9207: PCBDDCGraph graph;
9208: PetscErrorCode ierr;
9211: /* attach interface graph for determining subsets */
9212: if (pcbddc->sub_schurs_rebuild) { /* in case rebuild has been requested, it uses a graph generated only by the neighbouring information */
9213: IS verticesIS,verticescomm;
9214: PetscInt vsize,*idxs;
9216: PCBDDCGraphGetCandidatesIS(pcbddc->mat_graph,NULL,NULL,NULL,NULL,&verticesIS);
9217: ISGetSize(verticesIS,&vsize);
9218: ISGetIndices(verticesIS,(const PetscInt**)&idxs);
9219: ISCreateGeneral(PetscObjectComm((PetscObject)pc),vsize,idxs,PETSC_COPY_VALUES,&verticescomm);
9220: ISRestoreIndices(verticesIS,(const PetscInt**)&idxs);
9221: PCBDDCGraphRestoreCandidatesIS(pcbddc->mat_graph,NULL,NULL,NULL,NULL,&verticesIS);
9222: PCBDDCGraphCreate(&graph);
9223: PCBDDCGraphInit(graph,pcbddc->mat_graph->l2gmap,pcbddc->mat_graph->nvtxs_global,pcbddc->graphmaxcount);
9224: PCBDDCGraphSetUp(graph,pcbddc->mat_graph->custom_minimal_size,NULL,pcbddc->DirichletBoundariesLocal,0,NULL,verticescomm);
9225: ISDestroy(&verticescomm);
9226: PCBDDCGraphComputeConnectedComponents(graph);
9227: } else {
9228: graph = pcbddc->mat_graph;
9229: }
9230: /* print some info */
9231: if (pcbddc->dbg_flag && !pcbddc->sub_schurs_rebuild) {
9232: IS vertices;
9233: PetscInt nv,nedges,nfaces;
9234: PCBDDCGraphASCIIView(graph,pcbddc->dbg_flag,pcbddc->dbg_viewer);
9235: PCBDDCGraphGetCandidatesIS(graph,&nfaces,NULL,&nedges,NULL,&vertices);
9236: ISGetSize(vertices,&nv);
9237: PetscViewerASCIIPushSynchronized(pcbddc->dbg_viewer);
9238: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"--------------------------------------------------------------\n");
9239: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d got %02d local candidate vertices (%D)\n",PetscGlobalRank,(int)nv,pcbddc->use_vertices);
9240: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d got %02d local candidate edges (%D)\n",PetscGlobalRank,(int)nedges,pcbddc->use_edges);
9241: PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Subdomain %04d got %02d local candidate faces (%D)\n",PetscGlobalRank,(int)nfaces,pcbddc->use_faces);
9242: PetscViewerFlush(pcbddc->dbg_viewer);
9243: PetscViewerASCIIPopSynchronized(pcbddc->dbg_viewer);
9244: PCBDDCGraphRestoreCandidatesIS(graph,&nfaces,NULL,&nedges,NULL,&vertices);
9245: }
9247: /* sub_schurs init */
9248: if (!pcbddc->sub_schurs) {
9249: PCBDDCSubSchursCreate(&pcbddc->sub_schurs);
9250: }
9251: PCBDDCSubSchursInit(pcbddc->sub_schurs,((PetscObject)pc)->prefix,pcis->is_I_local,pcis->is_B_local,graph,pcis->BtoNmap,pcbddc->sub_schurs_rebuild);
9253: /* free graph struct */
9254: if (pcbddc->sub_schurs_rebuild) {
9255: PCBDDCGraphDestroy(&graph);
9256: }
9257: return(0);
9258: }
9260: PetscErrorCode PCBDDCCheckOperator(PC pc)
9261: {
9262: PC_IS *pcis=(PC_IS*)pc->data;
9263: PC_BDDC *pcbddc=(PC_BDDC*)pc->data;
9264: PetscErrorCode ierr;
9267: if (pcbddc->n_vertices == pcbddc->local_primal_size) {
9268: IS zerodiag = NULL;
9269: Mat S_j,B0_B=NULL;
9270: Vec dummy_vec=NULL,vec_check_B,vec_scale_P;
9271: PetscScalar *p0_check,*array,*array2;
9272: PetscReal norm;
9273: PetscInt i;
9275: /* B0 and B0_B */
9276: if (zerodiag) {
9277: IS dummy;
9279: ISCreateStride(PETSC_COMM_SELF,pcbddc->benign_n,0,1,&dummy);
9280: MatCreateSubMatrix(pcbddc->benign_B0,dummy,pcis->is_B_local,MAT_INITIAL_MATRIX,&B0_B);
9281: MatCreateVecs(B0_B,NULL,&dummy_vec);
9282: ISDestroy(&dummy);
9283: }
9284: /* I need a primal vector to scale primal nodes since BDDC sums contibutions */
9285: VecDuplicate(pcbddc->vec1_P,&vec_scale_P);
9286: VecSet(pcbddc->vec1_P,1.0);
9287: VecScatterBegin(pcbddc->coarse_loc_to_glob,pcbddc->vec1_P,pcbddc->coarse_vec,ADD_VALUES,SCATTER_FORWARD);
9288: VecScatterEnd(pcbddc->coarse_loc_to_glob,pcbddc->vec1_P,pcbddc->coarse_vec,ADD_VALUES,SCATTER_FORWARD);
9289: VecScatterBegin(pcbddc->coarse_loc_to_glob,pcbddc->coarse_vec,vec_scale_P,INSERT_VALUES,SCATTER_REVERSE);
9290: VecScatterEnd(pcbddc->coarse_loc_to_glob,pcbddc->coarse_vec,vec_scale_P,INSERT_VALUES,SCATTER_REVERSE);
9291: VecReciprocal(vec_scale_P);
9292: /* S_j */
9293: MatCreateSchurComplement(pcis->A_II,pcis->pA_II,pcis->A_IB,pcis->A_BI,pcis->A_BB,&S_j);
9294: MatSchurComplementSetKSP(S_j,pcbddc->ksp_D);
9296: /* mimic vector in \widetilde{W}_\Gamma */
9297: VecSetRandom(pcis->vec1_N,NULL);
9298: /* continuous in primal space */
9299: VecSetRandom(pcbddc->coarse_vec,NULL);
9300: VecScatterBegin(pcbddc->coarse_loc_to_glob,pcbddc->coarse_vec,pcbddc->vec1_P,INSERT_VALUES,SCATTER_REVERSE);
9301: VecScatterEnd(pcbddc->coarse_loc_to_glob,pcbddc->coarse_vec,pcbddc->vec1_P,INSERT_VALUES,SCATTER_REVERSE);
9302: VecGetArray(pcbddc->vec1_P,&array);
9303: PetscCalloc1(pcbddc->benign_n,&p0_check);
9304: for (i=0;i<pcbddc->benign_n;i++) p0_check[i] = array[pcbddc->local_primal_size-pcbddc->benign_n+i];
9305: VecSetValues(pcis->vec1_N,pcbddc->local_primal_size,pcbddc->local_primal_ref_node,array,INSERT_VALUES);
9306: VecRestoreArray(pcbddc->vec1_P,&array);
9307: VecAssemblyBegin(pcis->vec1_N);
9308: VecAssemblyEnd(pcis->vec1_N);
9309: VecScatterBegin(pcis->N_to_B,pcis->vec1_N,pcis->vec2_B,INSERT_VALUES,SCATTER_FORWARD);
9310: VecScatterEnd(pcis->N_to_B,pcis->vec1_N,pcis->vec2_B,INSERT_VALUES,SCATTER_FORWARD);
9311: VecDuplicate(pcis->vec2_B,&vec_check_B);
9312: VecCopy(pcis->vec2_B,vec_check_B);
9314: /* assemble rhs for coarse problem */
9315: /* widetilde{S}_\Gamma w_\Gamma + \widetilde{B0}^T_B p0 */
9316: /* local with Schur */
9317: MatMult(S_j,pcis->vec2_B,pcis->vec1_B);
9318: if (zerodiag) {
9319: VecGetArray(dummy_vec,&array);
9320: for (i=0;i<pcbddc->benign_n;i++) array[i] = p0_check[i];
9321: VecRestoreArray(dummy_vec,&array);
9322: MatMultTransposeAdd(B0_B,dummy_vec,pcis->vec1_B,pcis->vec1_B);
9323: }
9324: /* sum on primal nodes the local contributions */
9325: VecScatterBegin(pcis->N_to_B,pcis->vec1_B,pcis->vec1_N,INSERT_VALUES,SCATTER_REVERSE);
9326: VecScatterEnd(pcis->N_to_B,pcis->vec1_B,pcis->vec1_N,INSERT_VALUES,SCATTER_REVERSE);
9327: VecGetArray(pcis->vec1_N,&array);
9328: VecGetArray(pcbddc->vec1_P,&array2);
9329: for (i=0;i<pcbddc->local_primal_size;i++) array2[i] = array[pcbddc->local_primal_ref_node[i]];
9330: VecRestoreArray(pcbddc->vec1_P,&array2);
9331: VecRestoreArray(pcis->vec1_N,&array);
9332: VecSet(pcbddc->coarse_vec,0.);
9333: VecScatterBegin(pcbddc->coarse_loc_to_glob,pcbddc->vec1_P,pcbddc->coarse_vec,ADD_VALUES,SCATTER_FORWARD);
9334: VecScatterEnd(pcbddc->coarse_loc_to_glob,pcbddc->vec1_P,pcbddc->coarse_vec,ADD_VALUES,SCATTER_FORWARD);
9335: VecScatterBegin(pcbddc->coarse_loc_to_glob,pcbddc->coarse_vec,pcbddc->vec1_P,INSERT_VALUES,SCATTER_REVERSE);
9336: VecScatterEnd(pcbddc->coarse_loc_to_glob,pcbddc->coarse_vec,pcbddc->vec1_P,INSERT_VALUES,SCATTER_REVERSE);
9337: VecGetArray(pcbddc->vec1_P,&array);
9338: /* scale primal nodes (BDDC sums contibutions) */
9339: VecPointwiseMult(pcbddc->vec1_P,vec_scale_P,pcbddc->vec1_P);
9340: VecSetValues(pcis->vec1_N,pcbddc->local_primal_size,pcbddc->local_primal_ref_node,array,INSERT_VALUES);
9341: VecRestoreArray(pcbddc->vec1_P,&array);
9342: VecAssemblyBegin(pcis->vec1_N);
9343: VecAssemblyEnd(pcis->vec1_N);
9344: VecScatterBegin(pcis->N_to_B,pcis->vec1_N,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
9345: VecScatterEnd(pcis->N_to_B,pcis->vec1_N,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);
9346: /* global: \widetilde{B0}_B w_\Gamma */
9347: if (zerodiag) {
9348: MatMult(B0_B,pcis->vec2_B,dummy_vec);
9349: VecGetArray(dummy_vec,&array);
9350: for (i=0;i<pcbddc->benign_n;i++) pcbddc->benign_p0[i] = array[i];
9351: VecRestoreArray(dummy_vec,&array);
9352: }
9353: /* BDDC */
9354: VecSet(pcis->vec1_D,0.);
9355: PCBDDCApplyInterfacePreconditioner(pc,PETSC_FALSE);
9357: VecCopy(pcis->vec1_B,pcis->vec2_B);
9358: VecAXPY(pcis->vec1_B,-1.0,vec_check_B);
9359: VecNorm(pcis->vec1_B,NORM_INFINITY,&norm);
9360: PetscPrintf(PETSC_COMM_SELF,"[%d] BDDC local error is %1.4e\n",PetscGlobalRank,norm);
9361: for (i=0;i<pcbddc->benign_n;i++) {
9362: PetscPrintf(PETSC_COMM_SELF,"[%d] BDDC p0[%D] error is %1.4e\n",PetscGlobalRank,i,PetscAbsScalar(pcbddc->benign_p0[i]-p0_check[i]));
9363: }
9364: PetscFree(p0_check);
9365: VecDestroy(&vec_scale_P);
9366: VecDestroy(&vec_check_B);
9367: VecDestroy(&dummy_vec);
9368: MatDestroy(&S_j);
9369: MatDestroy(&B0_B);
9370: }
9371: return(0);
9372: }
9374: #include <../src/mat/impls/aij/mpi/mpiaij.h>
9375: PetscErrorCode MatMPIAIJRestrict(Mat A, MPI_Comm ccomm, Mat *B)
9376: {
9377: Mat At;
9378: IS rows;
9379: PetscInt rst,ren;
9381: PetscLayout rmap;
9384: rst = ren = 0;
9385: if (ccomm != MPI_COMM_NULL) {
9386: PetscLayoutCreate(ccomm,&rmap);
9387: PetscLayoutSetSize(rmap,A->rmap->N);
9388: PetscLayoutSetBlockSize(rmap,1);
9389: PetscLayoutSetUp(rmap);
9390: PetscLayoutGetRange(rmap,&rst,&ren);
9391: }
9392: ISCreateStride(PetscObjectComm((PetscObject)A),ren-rst,rst,1,&rows);
9393: MatCreateSubMatrix(A,rows,NULL,MAT_INITIAL_MATRIX,&At);
9394: ISDestroy(&rows);
9396: if (ccomm != MPI_COMM_NULL) {
9397: Mat_MPIAIJ *a,*b;
9398: IS from,to;
9399: Vec gvec;
9400: PetscInt lsize;
9402: MatCreate(ccomm,B);
9403: MatSetSizes(*B,ren-rst,PETSC_DECIDE,PETSC_DECIDE,At->cmap->N);
9404: MatSetType(*B,MATAIJ);
9405: PetscLayoutDestroy(&((*B)->rmap));
9406: PetscLayoutSetUp((*B)->cmap);
9407: a = (Mat_MPIAIJ*)At->data;
9408: b = (Mat_MPIAIJ*)(*B)->data;
9409: MPI_Comm_size(ccomm,&b->size);
9410: MPI_Comm_rank(ccomm,&b->rank);
9411: PetscObjectReference((PetscObject)a->A);
9412: PetscObjectReference((PetscObject)a->B);
9413: b->A = a->A;
9414: b->B = a->B;
9416: b->donotstash = a->donotstash;
9417: b->roworiented = a->roworiented;
9418: b->rowindices = 0;
9419: b->rowvalues = 0;
9420: b->getrowactive = PETSC_FALSE;
9422: (*B)->rmap = rmap;
9423: (*B)->factortype = A->factortype;
9424: (*B)->assembled = PETSC_TRUE;
9425: (*B)->insertmode = NOT_SET_VALUES;
9426: (*B)->preallocated = PETSC_TRUE;
9428: if (a->colmap) {
9429: #if defined(PETSC_USE_CTABLE)
9430: PetscTableCreateCopy(a->colmap,&b->colmap);
9431: #else
9432: PetscMalloc1(At->cmap->N,&b->colmap);
9433: PetscLogObjectMemory((PetscObject)*B,At->cmap->N*sizeof(PetscInt));
9434: PetscArraycpy(b->colmap,a->colmap,At->cmap->N);
9435: #endif
9436: } else b->colmap = 0;
9437: if (a->garray) {
9438: PetscInt len;
9439: len = a->B->cmap->n;
9440: PetscMalloc1(len+1,&b->garray);
9441: PetscLogObjectMemory((PetscObject)(*B),len*sizeof(PetscInt));
9442: if (len) { PetscArraycpy(b->garray,a->garray,len); }
9443: } else b->garray = 0;
9445: PetscObjectReference((PetscObject)a->lvec);
9446: b->lvec = a->lvec;
9447: PetscLogObjectParent((PetscObject)*B,(PetscObject)b->lvec);
9449: /* cannot use VecScatterCopy */
9450: VecGetLocalSize(b->lvec,&lsize);
9451: ISCreateGeneral(ccomm,lsize,b->garray,PETSC_USE_POINTER,&from);
9452: ISCreateStride(PETSC_COMM_SELF,lsize,0,1,&to);
9453: MatCreateVecs(*B,&gvec,NULL);
9454: VecScatterCreate(gvec,from,b->lvec,to,&b->Mvctx);
9455: PetscLogObjectParent((PetscObject)*B,(PetscObject)b->Mvctx);
9456: ISDestroy(&from);
9457: ISDestroy(&to);
9458: VecDestroy(&gvec);
9459: }
9460: MatDestroy(&At);
9461: return(0);
9462: }