1 #include <../src/ksp/pc/impls/bddc/bddc.h> 2 #include <../src/ksp/pc/impls/bddc/bddcprivate.h> 3 #include <petscblaslapack.h> 4 5 PETSC_STATIC_INLINE PetscErrorCode PCBDDCAdjGetNextLayer_Private(PetscInt*,PetscInt,PetscBT,PetscInt*,PetscInt*,PetscInt*); 6 static PetscErrorCode PCBDDCComputeExplicitSchur(Mat,PetscBool,MatReuse,Mat*); 7 static PetscErrorCode PCBDDCMumpsInteriorSolve(PC,Vec,Vec); 8 static PetscErrorCode PCBDDCMumpsCorrectionSolve(PC,Vec,Vec); 9 10 #undef __FUNCT__ 11 #define __FUNCT__ "PCBDDCMumpsCorrectionSolve_Private" 12 static PetscErrorCode PCBDDCMumpsCorrectionSolve_Private(PC pc, Vec rhs, Vec sol, PetscBool transpose) 13 { 14 PCBDDCReuseMumps ctx; 15 #if defined(PETSC_HAVE_MUMPS) 16 PetscInt ival; 17 #endif 18 PetscErrorCode ierr; 19 20 PetscFunctionBegin; 21 ierr = PCShellGetContext(pc,(void **)&ctx);CHKERRQ(ierr); 22 #if defined(PETSC_HAVE_MUMPS) 23 ierr = MatMumpsGetIcntl(ctx->F,26,&ival);CHKERRQ(ierr); 24 ierr = MatMumpsSetIcntl(ctx->F,26,-1);CHKERRQ(ierr); 25 #endif 26 if (transpose) { 27 ierr = MatSolveTranspose(ctx->F,rhs,sol);CHKERRQ(ierr); 28 } else { 29 ierr = MatSolve(ctx->F,rhs,sol);CHKERRQ(ierr); 30 } 31 #if defined(PETSC_HAVE_MUMPS) 32 ierr = MatMumpsSetIcntl(ctx->F,26,ival);CHKERRQ(ierr); 33 #endif 34 PetscFunctionReturn(0); 35 } 36 37 #undef __FUNCT__ 38 #define __FUNCT__ "PCBDDCMumpsCorrectionSolve" 39 static PetscErrorCode PCBDDCMumpsCorrectionSolve(PC pc, Vec rhs, Vec sol) 40 { 41 PetscErrorCode ierr; 42 43 PetscFunctionBegin; 44 ierr = PCBDDCMumpsCorrectionSolve_Private(pc,rhs,sol,PETSC_FALSE);CHKERRQ(ierr); 45 PetscFunctionReturn(0); 46 } 47 48 #undef __FUNCT__ 49 #define __FUNCT__ "PCBDDCMumpsCorrectionSolveTranspose" 50 static PetscErrorCode PCBDDCMumpsCorrectionSolveTranspose(PC pc, Vec rhs, Vec sol) 51 { 52 PetscErrorCode ierr; 53 54 PetscFunctionBegin; 55 ierr = PCBDDCMumpsCorrectionSolve_Private(pc,rhs,sol,PETSC_TRUE);CHKERRQ(ierr); 56 PetscFunctionReturn(0); 57 } 58 59 #undef __FUNCT__ 60 #define __FUNCT__ "PCBDDCReuseMumpsReset" 61 static PetscErrorCode PCBDDCReuseMumpsReset(PCBDDCReuseMumps reuse) 62 { 63 PetscErrorCode ierr; 64 65 PetscFunctionBegin; 66 ierr = MatDestroy(&reuse->F);CHKERRQ(ierr); 67 ierr = VecDestroy(&reuse->sol);CHKERRQ(ierr); 68 ierr = VecDestroy(&reuse->rhs);CHKERRQ(ierr); 69 ierr = PCDestroy(&reuse->interior_solver);CHKERRQ(ierr); 70 ierr = PCDestroy(&reuse->correction_solver);CHKERRQ(ierr); 71 ierr = ISDestroy(&reuse->is_R);CHKERRQ(ierr); 72 ierr = ISDestroy(&reuse->is_B);CHKERRQ(ierr); 73 ierr = VecScatterDestroy(&reuse->correction_scatter_B);CHKERRQ(ierr); 74 ierr = VecDestroy(&reuse->sol_B);CHKERRQ(ierr); 75 ierr = VecDestroy(&reuse->rhs_B);CHKERRQ(ierr); 76 PetscFunctionReturn(0); 77 } 78 79 #undef __FUNCT__ 80 #define __FUNCT__ "PCBDDCMumpsInteriorSolve_Private" 81 static PetscErrorCode PCBDDCMumpsInteriorSolve_Private(PC pc, Vec rhs, Vec sol, PetscBool transpose) 82 { 83 PCBDDCReuseMumps ctx; 84 PetscScalar *array,*array_mumps; 85 #if defined(PETSC_HAVE_MUMPS) 86 PetscInt ival; 87 #endif 88 PetscErrorCode ierr; 89 90 PetscFunctionBegin; 91 ierr = PCShellGetContext(pc,(void **)&ctx);CHKERRQ(ierr); 92 #if defined(PETSC_HAVE_MUMPS) 93 ierr = MatMumpsGetIcntl(ctx->F,26,&ival);CHKERRQ(ierr); 94 ierr = MatMumpsSetIcntl(ctx->F,26,0);CHKERRQ(ierr); 95 #endif 96 /* copy rhs into factored matrix workspace (can it be avoided?, MatSolve_MUMPS has another copy b->x internally) */ 97 ierr = VecGetArrayRead(rhs,(const PetscScalar**)&array);CHKERRQ(ierr); 98 ierr = VecGetArray(ctx->rhs,&array_mumps);CHKERRQ(ierr); 99 ierr = PetscMemcpy(array_mumps,array,ctx->n_I*sizeof(PetscScalar));CHKERRQ(ierr); 100 ierr = VecRestoreArray(ctx->rhs,&array_mumps);CHKERRQ(ierr); 101 ierr = VecRestoreArrayRead(rhs,(const PetscScalar**)&array);CHKERRQ(ierr); 102 103 if (transpose) { 104 ierr = MatSolveTranspose(ctx->F,ctx->rhs,ctx->sol);CHKERRQ(ierr); 105 } else { 106 ierr = MatSolve(ctx->F,ctx->rhs,ctx->sol);CHKERRQ(ierr); 107 } 108 109 /* get back data to caller worskpace */ 110 ierr = VecGetArrayRead(ctx->sol,(const PetscScalar**)&array_mumps);CHKERRQ(ierr); 111 ierr = VecGetArray(sol,&array);CHKERRQ(ierr); 112 ierr = PetscMemcpy(array,array_mumps,ctx->n_I*sizeof(PetscScalar));CHKERRQ(ierr); 113 ierr = VecRestoreArray(sol,&array);CHKERRQ(ierr); 114 ierr = VecRestoreArrayRead(ctx->sol,(const PetscScalar**)&array_mumps);CHKERRQ(ierr); 115 #if defined(PETSC_HAVE_MUMPS) 116 ierr = MatMumpsSetIcntl(ctx->F,26,ival);CHKERRQ(ierr); 117 #endif 118 PetscFunctionReturn(0); 119 } 120 121 #undef __FUNCT__ 122 #define __FUNCT__ "PCBDDCMumpsInteriorSolve" 123 static PetscErrorCode PCBDDCMumpsInteriorSolve(PC pc, Vec rhs, Vec sol) 124 { 125 PetscErrorCode ierr; 126 127 PetscFunctionBegin; 128 ierr = PCBDDCMumpsInteriorSolve_Private(pc,rhs,sol,PETSC_FALSE);CHKERRQ(ierr); 129 PetscFunctionReturn(0); 130 } 131 132 #undef __FUNCT__ 133 #define __FUNCT__ "PCBDDCMumpsInteriorSolveTranspose" 134 static PetscErrorCode PCBDDCMumpsInteriorSolveTranspose(PC pc, Vec rhs, Vec sol) 135 { 136 PetscErrorCode ierr; 137 138 PetscFunctionBegin; 139 ierr = PCBDDCMumpsInteriorSolve_Private(pc,rhs,sol,PETSC_TRUE);CHKERRQ(ierr); 140 PetscFunctionReturn(0); 141 } 142 143 #undef __FUNCT__ 144 #define __FUNCT__ "PCBDDCComputeExplicitSchur" 145 static PetscErrorCode PCBDDCComputeExplicitSchur(Mat M, PetscBool issym, MatReuse reuse, Mat *S) 146 { 147 Mat B, C, D, Bd, Cd, AinvBd; 148 KSP ksp; 149 PC pc; 150 PetscBool isLU, isILU, isCHOL, Bdense, Cdense; 151 PetscReal fill = 2.0; 152 PetscInt n_I; 153 PetscMPIInt size; 154 PetscErrorCode ierr; 155 156 PetscFunctionBegin; 157 ierr = MPI_Comm_size(PetscObjectComm((PetscObject)M),&size);CHKERRQ(ierr); 158 if (size != 1) { 159 SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not for parallel matrices"); 160 } 161 if (reuse == MAT_REUSE_MATRIX) { 162 PetscBool Sdense; 163 164 ierr = PetscObjectTypeCompare((PetscObject)*S, MATSEQDENSE, &Sdense);CHKERRQ(ierr); 165 if (!Sdense) { 166 SETERRQ(PetscObjectComm((PetscObject)M),PETSC_ERR_SUP,"S should dense"); 167 } 168 } 169 ierr = MatSchurComplementGetSubMatrices(M, NULL, NULL, &B, &C, &D);CHKERRQ(ierr); 170 ierr = MatSchurComplementGetKSP(M, &ksp);CHKERRQ(ierr); 171 ierr = KSPGetPC(ksp, &pc);CHKERRQ(ierr); 172 ierr = PetscObjectTypeCompare((PetscObject) pc, PCLU, &isLU);CHKERRQ(ierr); 173 ierr = PetscObjectTypeCompare((PetscObject) pc, PCILU, &isILU);CHKERRQ(ierr); 174 ierr = PetscObjectTypeCompare((PetscObject) pc, PCCHOLESKY, &isCHOL);CHKERRQ(ierr); 175 ierr = PetscObjectTypeCompare((PetscObject) B, MATSEQDENSE, &Bdense);CHKERRQ(ierr); 176 ierr = PetscObjectTypeCompare((PetscObject) C, MATSEQDENSE, &Cdense);CHKERRQ(ierr); 177 ierr = MatGetSize(B,&n_I,NULL);CHKERRQ(ierr); 178 if (n_I) { 179 if (!Bdense) { 180 ierr = MatConvert(B, MATSEQDENSE, MAT_INITIAL_MATRIX, &Bd);CHKERRQ(ierr); 181 } else { 182 Bd = B; 183 } 184 185 if (isLU || isILU || isCHOL) { 186 Mat fact; 187 ierr = KSPSetUp(ksp);CHKERRQ(ierr); 188 ierr = PCFactorGetMatrix(pc, &fact);CHKERRQ(ierr); 189 ierr = MatDuplicate(Bd, MAT_DO_NOT_COPY_VALUES, &AinvBd);CHKERRQ(ierr); 190 ierr = MatMatSolve(fact, Bd, AinvBd);CHKERRQ(ierr); 191 } else { 192 PetscBool ex = PETSC_TRUE; 193 194 if (ex) { 195 Mat Ainvd; 196 197 ierr = PCComputeExplicitOperator(pc, &Ainvd);CHKERRQ(ierr); 198 ierr = MatMatMult(Ainvd, Bd, MAT_INITIAL_MATRIX, fill, &AinvBd);CHKERRQ(ierr); 199 ierr = MatDestroy(&Ainvd);CHKERRQ(ierr); 200 } else { 201 Vec sol,rhs; 202 PetscScalar *arrayrhs,*arraysol; 203 PetscInt i,nrhs,n; 204 205 ierr = MatDuplicate(Bd, MAT_DO_NOT_COPY_VALUES, &AinvBd);CHKERRQ(ierr); 206 ierr = MatGetSize(Bd,&n,&nrhs);CHKERRQ(ierr); 207 ierr = MatDenseGetArray(Bd,&arrayrhs);CHKERRQ(ierr); 208 ierr = MatDenseGetArray(AinvBd,&arraysol);CHKERRQ(ierr); 209 ierr = KSPGetSolution(ksp,&sol);CHKERRQ(ierr); 210 ierr = KSPGetRhs(ksp,&rhs);CHKERRQ(ierr); 211 for (i=0;i<nrhs;i++) { 212 ierr = VecPlaceArray(rhs,arrayrhs+i*n);CHKERRQ(ierr); 213 ierr = VecPlaceArray(sol,arraysol+i*n);CHKERRQ(ierr); 214 ierr = KSPSolve(ksp,rhs,sol);CHKERRQ(ierr); 215 ierr = VecResetArray(rhs);CHKERRQ(ierr); 216 ierr = VecResetArray(sol);CHKERRQ(ierr); 217 } 218 ierr = MatDenseRestoreArray(Bd,&arrayrhs);CHKERRQ(ierr); 219 ierr = MatDenseRestoreArray(AinvBd,&arrayrhs);CHKERRQ(ierr); 220 } 221 } 222 if (!Bdense & !issym) { 223 ierr = MatDestroy(&Bd);CHKERRQ(ierr); 224 } 225 226 if (!issym) { 227 if (!Cdense) { 228 ierr = MatConvert(C, MATSEQDENSE, MAT_INITIAL_MATRIX, &Cd);CHKERRQ(ierr); 229 } else { 230 Cd = C; 231 } 232 ierr = MatMatMult(Cd, AinvBd, reuse, fill, S);CHKERRQ(ierr); 233 if (!Cdense) { 234 ierr = MatDestroy(&Cd);CHKERRQ(ierr); 235 } 236 } else { 237 ierr = MatTransposeMatMult(Bd, AinvBd, reuse, fill, S);CHKERRQ(ierr); 238 if (!Bdense) { 239 ierr = MatDestroy(&Bd);CHKERRQ(ierr); 240 } 241 } 242 ierr = MatDestroy(&AinvBd);CHKERRQ(ierr); 243 } 244 245 if (D) { 246 Mat Dd; 247 PetscBool Ddense; 248 249 ierr = PetscObjectTypeCompare((PetscObject)D,MATSEQDENSE,&Ddense);CHKERRQ(ierr); 250 if (!Ddense) { 251 ierr = MatConvert(D, MATSEQDENSE, MAT_INITIAL_MATRIX, &Dd);CHKERRQ(ierr); 252 } else { 253 Dd = D; 254 } 255 if (n_I) { 256 ierr = MatAYPX(*S,-1.0,Dd,SAME_NONZERO_PATTERN);CHKERRQ(ierr); 257 } else { 258 if (reuse == MAT_INITIAL_MATRIX) { 259 ierr = MatDuplicate(Dd,MAT_COPY_VALUES,S);CHKERRQ(ierr); 260 } else { 261 ierr = MatCopy(Dd,*S,SAME_NONZERO_PATTERN);CHKERRQ(ierr); 262 } 263 } 264 if (!Ddense) { 265 ierr = MatDestroy(&Dd);CHKERRQ(ierr); 266 } 267 } else { 268 ierr = MatScale(*S,-1.0);CHKERRQ(ierr); 269 } 270 PetscFunctionReturn(0); 271 } 272 273 #undef __FUNCT__ 274 #define __FUNCT__ "PCBDDCSubSchursSetUp" 275 PetscErrorCode PCBDDCSubSchursSetUp(PCBDDCSubSchurs sub_schurs, Mat Ain, Mat Sin, PetscInt xadj[], PetscInt adjncy[], PetscInt nlayers, PetscBool faster_deluxe, PetscBool compute_Stilda, PetscBool reuse_solvers,PetscBool use_edges, PetscBool use_faces) 276 { 277 Mat F,A_II,A_IB,A_BI,A_BB,AE_II; 278 Mat S_all; 279 Mat global_schur_subsets,work_mat; 280 Mat S_Ej_tilda_all,S_Ej_inv_all; 281 ISLocalToGlobalMapping l2gmap_subsets; 282 IS is_I,is_I_layer,temp_is; 283 PetscInt *nnz,*all_local_idx_G,*all_local_idx_N; 284 PetscInt *auxnum1,*auxnum2,*all_local_idx_G_rep; 285 PetscInt i,subset_size,max_subset_size; 286 PetscInt extra,local_size,global_size; 287 PetscBLASInt B_N,B_ierr,B_lwork,*pivots; 288 PetscScalar *Bwork; 289 PetscSubcomm subcomm; 290 PetscMPIInt color,rank; 291 MPI_Comm comm_n; 292 PetscErrorCode ierr; 293 294 PetscFunctionBegin; 295 /* update info in sub_schurs */ 296 ierr = MatDestroy(&sub_schurs->A);CHKERRQ(ierr); 297 ierr = MatDestroy(&sub_schurs->S);CHKERRQ(ierr); 298 sub_schurs->is_hermitian = PETSC_FALSE; 299 sub_schurs->is_posdef = PETSC_FALSE; 300 if (Ain) { 301 PetscBool isseqaij; 302 /* determine if we are dealing with hermitian positive definite problems */ 303 #if !defined(PETSC_USE_COMPLEX) 304 if (Ain->symmetric_set) { 305 sub_schurs->is_hermitian = Ain->symmetric; 306 } 307 #else 308 if (Ain->hermitian_set) { 309 sub_schurs->is_hermitian = Ain->hermitian; 310 } 311 #endif 312 if (Ain->spd_set) { 313 sub_schurs->is_posdef = Ain->spd; 314 } 315 316 /* check */ 317 ierr = PetscObjectTypeCompare((PetscObject)Ain,MATSEQAIJ,&isseqaij);CHKERRQ(ierr); 318 if (compute_Stilda && (!sub_schurs->is_hermitian || !sub_schurs->is_posdef)) { 319 PetscInt lsize; 320 321 ierr = MatGetSize(Ain,&lsize,NULL);CHKERRQ(ierr); 322 if (lsize) { 323 PetscScalar val; 324 PetscReal norm; 325 Vec vec1,vec2,vec3; 326 327 ierr = MatCreateVecs(Ain,&vec1,&vec2);CHKERRQ(ierr); 328 ierr = VecDuplicate(vec1,&vec3);CHKERRQ(ierr); 329 ierr = VecSetRandom(vec1,NULL);CHKERRQ(ierr); 330 ierr = MatMult(Ain,vec1,vec2);CHKERRQ(ierr); 331 #if !defined(PETSC_USE_COMPLEX) 332 ierr = MatMultTranspose(Ain,vec1,vec3);CHKERRQ(ierr); 333 #else 334 ierr = MatMultHermitianTranspose(Ain,vec1,vec3);CHKERRQ(ierr); 335 #endif 336 ierr = VecAXPY(vec3,-1.0,vec2);CHKERRQ(ierr); 337 ierr = VecNorm(vec3,NORM_INFINITY,&norm);CHKERRQ(ierr); 338 if (norm > PETSC_SMALL) { 339 sub_schurs->is_hermitian = PETSC_FALSE; 340 } else { 341 sub_schurs->is_hermitian = PETSC_TRUE; 342 } 343 ierr = VecDot(vec1,vec2,&val);CHKERRQ(ierr); 344 if (PetscRealPart(val) > 0. && PetscAbsReal(PetscImaginaryPart(val)) < PETSC_SMALL) sub_schurs->is_posdef = PETSC_TRUE; 345 ierr = VecDestroy(&vec1);CHKERRQ(ierr); 346 ierr = VecDestroy(&vec2);CHKERRQ(ierr); 347 ierr = VecDestroy(&vec3);CHKERRQ(ierr); 348 } else { 349 sub_schurs->is_hermitian = PETSC_TRUE; 350 sub_schurs->is_posdef = PETSC_TRUE; 351 } 352 } 353 if (isseqaij) { 354 ierr = PetscObjectReference((PetscObject)Ain);CHKERRQ(ierr); 355 sub_schurs->A = Ain; 356 } else { 357 ierr = MatConvert(Ain,MATSEQAIJ,MAT_INITIAL_MATRIX,&sub_schurs->A);CHKERRQ(ierr); 358 } 359 } 360 if (compute_Stilda && (!sub_schurs->is_hermitian || !sub_schurs->is_posdef)) { 361 SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_SUP,"General matrix pencils are not currently supported (%d,%d)",sub_schurs->is_hermitian,sub_schurs->is_posdef); 362 } 363 364 ierr = PetscObjectReference((PetscObject)Sin);CHKERRQ(ierr); 365 sub_schurs->S = Sin; 366 if (sub_schurs->use_mumps) { 367 sub_schurs->use_mumps = (PetscBool)(!!sub_schurs->A); 368 } 369 370 /* preliminary checks */ 371 if (!sub_schurs->use_mumps && compute_Stilda) { 372 SETERRQ(PetscObjectComm((PetscObject)sub_schurs->l2gmap),PETSC_ERR_SUP,"Adaptive selection of constraints requires MUMPS"); 373 } 374 375 /* restrict work on active processes */ 376 color = 0; 377 if (!sub_schurs->n_subs) color = 1; /* this can happen if we are in a multilevel case or if the subdomain is disconnected */ 378 ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)sub_schurs->l2gmap),&rank);CHKERRQ(ierr); 379 ierr = PetscSubcommCreate(PetscObjectComm((PetscObject)sub_schurs->l2gmap),&subcomm);CHKERRQ(ierr); 380 ierr = PetscSubcommSetNumber(subcomm,2);CHKERRQ(ierr); 381 ierr = PetscSubcommSetTypeGeneral(subcomm,color,rank);CHKERRQ(ierr); 382 ierr = PetscCommDuplicate(PetscSubcommChild(subcomm),&comm_n,NULL);CHKERRQ(ierr); 383 ierr = PetscSubcommDestroy(&subcomm);CHKERRQ(ierr); 384 if (!sub_schurs->n_subs) { 385 ierr = PetscCommDestroy(&comm_n);CHKERRQ(ierr); 386 PetscFunctionReturn(0); 387 } 388 389 /* get Schur complement matrices */ 390 if (!sub_schurs->use_mumps) { 391 Mat tA_IB,tA_BI,tA_BB; 392 PetscBool isseqsbaij; 393 ierr = MatSchurComplementGetSubMatrices(sub_schurs->S,&A_II,NULL,&tA_IB,&tA_BI,&tA_BB);CHKERRQ(ierr); 394 ierr = PetscObjectTypeCompare((PetscObject)tA_BB,MATSEQSBAIJ,&isseqsbaij);CHKERRQ(ierr); 395 if (isseqsbaij) { 396 ierr = MatConvert(tA_BB,MATSEQAIJ,MAT_INITIAL_MATRIX,&A_BB);CHKERRQ(ierr); 397 ierr = MatConvert(tA_IB,MATSEQAIJ,MAT_INITIAL_MATRIX,&A_IB);CHKERRQ(ierr); 398 ierr = MatConvert(tA_BI,MATSEQAIJ,MAT_INITIAL_MATRIX,&A_BI);CHKERRQ(ierr); 399 } else { 400 ierr = PetscObjectReference((PetscObject)tA_BB);CHKERRQ(ierr); 401 A_BB = tA_BB; 402 ierr = PetscObjectReference((PetscObject)tA_IB);CHKERRQ(ierr); 403 A_IB = tA_IB; 404 ierr = PetscObjectReference((PetscObject)tA_BI);CHKERRQ(ierr); 405 A_BI = tA_BI; 406 } 407 } else { 408 A_II = NULL; 409 A_IB = NULL; 410 A_BI = NULL; 411 A_BB = NULL; 412 } 413 S_all = NULL; 414 S_Ej_tilda_all = NULL; 415 S_Ej_inv_all = NULL; 416 417 /* determine interior problems */ 418 ierr = ISGetLocalSize(sub_schurs->is_I,&i);CHKERRQ(ierr); 419 if (nlayers >= 0 && i) { /* Interior problems can be different from the original one */ 420 PetscBT touched; 421 const PetscInt* idx_B; 422 PetscInt n_I,n_B,n_local_dofs,n_prev_added,j,layer,*local_numbering; 423 424 if (xadj == NULL || adjncy == NULL) { 425 SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cannot request layering without adjacency"); 426 } 427 /* get sizes */ 428 ierr = ISGetLocalSize(sub_schurs->is_I,&n_I);CHKERRQ(ierr); 429 ierr = ISGetLocalSize(sub_schurs->is_B,&n_B);CHKERRQ(ierr); 430 431 ierr = PetscMalloc1(n_I+n_B,&local_numbering);CHKERRQ(ierr); 432 ierr = PetscBTCreate(n_I+n_B,&touched);CHKERRQ(ierr); 433 ierr = PetscBTMemzero(n_I+n_B,touched);CHKERRQ(ierr); 434 435 /* all boundary dofs must be skipped when adding layers */ 436 ierr = ISGetIndices(sub_schurs->is_B,&idx_B);CHKERRQ(ierr); 437 for (j=0;j<n_B;j++) { 438 ierr = PetscBTSet(touched,idx_B[j]);CHKERRQ(ierr); 439 } 440 ierr = PetscMemcpy(local_numbering,idx_B,n_B*sizeof(PetscInt));CHKERRQ(ierr); 441 ierr = ISRestoreIndices(sub_schurs->is_B,&idx_B);CHKERRQ(ierr); 442 443 /* add prescribed number of layers of dofs */ 444 n_local_dofs = n_B; 445 n_prev_added = n_B; 446 for (layer=0;layer<nlayers;layer++) { 447 PetscInt n_added; 448 if (n_local_dofs == n_I+n_B) break; 449 if (n_local_dofs > n_I+n_B) { 450 SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error querying layer %d. Out of bound access (%d > %d)",layer,n_local_dofs,n_I+n_B); 451 } 452 ierr = PCBDDCAdjGetNextLayer_Private(local_numbering+n_local_dofs,n_prev_added,touched,xadj,adjncy,&n_added);CHKERRQ(ierr); 453 n_prev_added = n_added; 454 n_local_dofs += n_added; 455 if (!n_added) break; 456 } 457 ierr = PetscBTDestroy(&touched);CHKERRQ(ierr); 458 459 /* IS for I layer dofs in original numbering */ 460 ierr = ISCreateGeneral(PetscObjectComm((PetscObject)sub_schurs->is_I),n_local_dofs-n_B,local_numbering+n_B,PETSC_COPY_VALUES,&is_I_layer);CHKERRQ(ierr); 461 ierr = PetscFree(local_numbering);CHKERRQ(ierr); 462 ierr = ISSort(is_I_layer);CHKERRQ(ierr); 463 /* IS for I layer dofs in I numbering */ 464 if (!sub_schurs->use_mumps) { 465 ISLocalToGlobalMapping ItoNmap; 466 ierr = ISLocalToGlobalMappingCreateIS(sub_schurs->is_I,&ItoNmap);CHKERRQ(ierr); 467 ierr = ISGlobalToLocalMappingApplyIS(ItoNmap,IS_GTOLM_DROP,is_I_layer,&is_I);CHKERRQ(ierr); 468 ierr = ISLocalToGlobalMappingDestroy(&ItoNmap);CHKERRQ(ierr); 469 470 /* II block */ 471 ierr = MatGetSubMatrix(A_II,is_I,is_I,MAT_INITIAL_MATRIX,&AE_II);CHKERRQ(ierr); 472 } 473 } else { 474 PetscInt n_I; 475 476 /* IS for I dofs in original numbering */ 477 ierr = PetscObjectReference((PetscObject)sub_schurs->is_I);CHKERRQ(ierr); 478 is_I_layer = sub_schurs->is_I; 479 480 /* IS for I dofs in I numbering (strided 1) */ 481 if (!sub_schurs->use_mumps) { 482 ierr = ISGetSize(sub_schurs->is_I,&n_I);CHKERRQ(ierr); 483 ierr = ISCreateStride(PetscObjectComm((PetscObject)sub_schurs->is_I),n_I,0,1,&is_I);CHKERRQ(ierr); 484 485 /* II block is the same */ 486 ierr = PetscObjectReference((PetscObject)A_II);CHKERRQ(ierr); 487 AE_II = A_II; 488 } 489 } 490 491 /* Get info on subset sizes and sum of all subsets sizes */ 492 max_subset_size = 0; 493 local_size = 0; 494 for (i=0;i<sub_schurs->n_subs;i++) { 495 ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); 496 max_subset_size = PetscMax(subset_size,max_subset_size); 497 local_size += subset_size; 498 } 499 500 /* Work arrays for local indices */ 501 extra = 0; 502 if (sub_schurs->use_mumps) { 503 ierr = ISGetLocalSize(is_I_layer,&extra);CHKERRQ(ierr); 504 } 505 ierr = PetscMalloc1(local_size+extra,&all_local_idx_N);CHKERRQ(ierr); 506 if (extra) { 507 const PetscInt *idxs; 508 ierr = ISGetIndices(is_I_layer,&idxs);CHKERRQ(ierr); 509 ierr = PetscMemcpy(all_local_idx_N,idxs,extra*sizeof(PetscInt));CHKERRQ(ierr); 510 ierr = ISRestoreIndices(is_I_layer,&idxs);CHKERRQ(ierr); 511 } 512 ierr = PetscMalloc1(local_size,&nnz);CHKERRQ(ierr); 513 ierr = PetscMalloc2(sub_schurs->n_subs,&auxnum1,sub_schurs->n_subs,&auxnum2);CHKERRQ(ierr); 514 515 /* Get local indices in local numbering */ 516 local_size = 0; 517 for (i=0;i<sub_schurs->n_subs;i++) { 518 PetscInt j; 519 const PetscInt *idxs; 520 521 ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); 522 ierr = ISGetIndices(sub_schurs->is_subs[i],&idxs);CHKERRQ(ierr); 523 /* start (smallest in global ordering) and multiplicity */ 524 auxnum1[i] = idxs[0]; 525 auxnum2[i] = subset_size; 526 /* subset indices in local numbering */ 527 ierr = PetscMemcpy(all_local_idx_N+local_size+extra,idxs,subset_size*sizeof(PetscInt));CHKERRQ(ierr); 528 ierr = ISRestoreIndices(sub_schurs->is_subs[i],&idxs);CHKERRQ(ierr); 529 for (j=0;j<subset_size;j++) nnz[local_size+j] = subset_size; 530 local_size += subset_size; 531 } 532 533 /* allocate extra workspace needed only for GETRI */ 534 Bwork = NULL; 535 pivots = NULL; 536 if (sub_schurs->n_subs && !sub_schurs->is_hermitian) { 537 PetscScalar lwork; 538 539 B_lwork = -1; 540 ierr = PetscBLASIntCast(local_size,&B_N);CHKERRQ(ierr); 541 ierr = PetscFPTrapPush(PETSC_FP_TRAP_OFF);CHKERRQ(ierr); 542 PetscStackCallBLAS("LAPACKgetri",LAPACKgetri_(&B_N,Bwork,&B_N,pivots,&lwork,&B_lwork,&B_ierr)); 543 ierr = PetscFPTrapPop();CHKERRQ(ierr); 544 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in query to GETRI Lapack routine %d",(int)B_ierr); 545 ierr = PetscBLASIntCast((PetscInt)PetscRealPart(lwork),&B_lwork);CHKERRQ(ierr); 546 ierr = PetscMalloc2(B_lwork,&Bwork,B_N,&pivots);CHKERRQ(ierr); 547 } 548 549 /* prepare parallel matrices for summing up properly schurs on subsets */ 550 ierr = PCBDDCSubsetNumbering(comm_n,sub_schurs->l2gmap,sub_schurs->n_subs,auxnum1,auxnum2,&global_size,&all_local_idx_G_rep);CHKERRQ(ierr); 551 ierr = PetscMalloc1(local_size,&all_local_idx_G);CHKERRQ(ierr); 552 local_size = 0; 553 for (i=0;i<sub_schurs->n_subs;i++) { 554 PetscInt j; 555 for (j=0;j<auxnum2[i];j++) all_local_idx_G[local_size++] = all_local_idx_G_rep[i] + j; 556 } 557 ierr = PetscFree(all_local_idx_G_rep);CHKERRQ(ierr); 558 ierr = PetscFree2(auxnum1,auxnum2);CHKERRQ(ierr); 559 ierr = ISLocalToGlobalMappingCreate(comm_n,1,local_size,all_local_idx_G,PETSC_COPY_VALUES,&l2gmap_subsets);CHKERRQ(ierr); 560 ierr = MatCreateIS(comm_n,1,PETSC_DECIDE,PETSC_DECIDE,global_size,global_size,l2gmap_subsets,&work_mat);CHKERRQ(ierr); 561 ierr = ISLocalToGlobalMappingDestroy(&l2gmap_subsets);CHKERRQ(ierr); 562 ierr = MatCreate(PetscObjectComm((PetscObject)work_mat),&global_schur_subsets);CHKERRQ(ierr); 563 ierr = MatSetSizes(global_schur_subsets,PETSC_DECIDE,PETSC_DECIDE,global_size,global_size);CHKERRQ(ierr); 564 ierr = MatSetType(global_schur_subsets,MATMPIAIJ);CHKERRQ(ierr); 565 566 /* subset indices in local boundary numbering */ 567 if (!sub_schurs->is_Ej_all) { 568 PetscInt *all_local_idx_B; 569 570 ierr = PetscMalloc1(local_size,&all_local_idx_B);CHKERRQ(ierr); 571 ierr = ISGlobalToLocalMappingApply(sub_schurs->BtoNmap,IS_GTOLM_DROP,local_size,all_local_idx_N+extra,&subset_size,all_local_idx_B);CHKERRQ(ierr); 572 if (subset_size != local_size) { 573 SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in sub_schurs serial (BtoNmap)! %d != %d\n",subset_size,local_size); 574 } 575 ierr = ISCreateGeneral(PETSC_COMM_SELF,local_size,all_local_idx_B,PETSC_OWN_POINTER,&sub_schurs->is_Ej_all);CHKERRQ(ierr); 576 } 577 578 /* Local matrix of all local Schur on subsets (transposed) */ 579 if (!sub_schurs->S_Ej_all) { 580 ierr = MatCreate(PETSC_COMM_SELF,&sub_schurs->S_Ej_all);CHKERRQ(ierr); 581 ierr = MatSetSizes(sub_schurs->S_Ej_all,PETSC_DECIDE,PETSC_DECIDE,local_size,local_size);CHKERRQ(ierr); 582 ierr = MatSetType(sub_schurs->S_Ej_all,MATAIJ);CHKERRQ(ierr); 583 ierr = MatSeqAIJSetPreallocation(sub_schurs->S_Ej_all,0,nnz);CHKERRQ(ierr); 584 } else { 585 ierr = MatZeroEntries(sub_schurs->S_Ej_all);CHKERRQ(ierr); 586 } 587 588 /* Compute Schur complements explicitly */ 589 F = NULL; 590 ierr = PetscBTMemzero(sub_schurs->n_subs,sub_schurs->computed_Stilda_subs);CHKERRQ(ierr); 591 if (!sub_schurs->use_mumps) { 592 Mat S_Ej_expl; 593 PetscScalar *work; 594 PetscInt j,*dummy_idx; 595 PetscBool Sdense; 596 597 ierr = PetscMalloc2(max_subset_size,&dummy_idx,max_subset_size*max_subset_size,&work);CHKERRQ(ierr); 598 local_size = 0; 599 for (i=0;i<sub_schurs->n_subs;i++) { 600 IS is_subset_B; 601 Mat AE_EE,AE_IE,AE_EI,S_Ej; 602 603 /* subsets in original and boundary numbering */ 604 ierr = ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap,IS_GTOLM_DROP,sub_schurs->is_subs[i],&is_subset_B);CHKERRQ(ierr); 605 /* EE block */ 606 ierr = MatGetSubMatrix(A_BB,is_subset_B,is_subset_B,MAT_INITIAL_MATRIX,&AE_EE);CHKERRQ(ierr); 607 /* IE block */ 608 ierr = MatGetSubMatrix(A_IB,is_I,is_subset_B,MAT_INITIAL_MATRIX,&AE_IE);CHKERRQ(ierr); 609 /* EI block */ 610 if (sub_schurs->is_hermitian) { 611 ierr = MatCreateTranspose(AE_IE,&AE_EI);CHKERRQ(ierr); 612 } else { 613 ierr = MatGetSubMatrix(A_BI,is_subset_B,is_I,MAT_INITIAL_MATRIX,&AE_EI);CHKERRQ(ierr); 614 } 615 ierr = ISDestroy(&is_subset_B);CHKERRQ(ierr); 616 ierr = MatCreateSchurComplement(AE_II,AE_II,AE_IE,AE_EI,AE_EE,&S_Ej);CHKERRQ(ierr); 617 ierr = MatDestroy(&AE_EE);CHKERRQ(ierr); 618 ierr = MatDestroy(&AE_IE);CHKERRQ(ierr); 619 ierr = MatDestroy(&AE_EI);CHKERRQ(ierr); 620 if (AE_II == A_II) { /* we can reuse the same ksp */ 621 KSP ksp; 622 ierr = MatSchurComplementGetKSP(sub_schurs->S,&ksp);CHKERRQ(ierr); 623 ierr = MatSchurComplementSetKSP(S_Ej,ksp);CHKERRQ(ierr); 624 } else { /* build new ksp object which inherits ksp and pc types from the original one */ 625 KSP origksp,schurksp; 626 PC origpc,schurpc; 627 KSPType ksp_type; 628 PetscInt n_internal; 629 PetscBool ispcnone; 630 631 ierr = MatSchurComplementGetKSP(sub_schurs->S,&origksp);CHKERRQ(ierr); 632 ierr = MatSchurComplementGetKSP(S_Ej,&schurksp);CHKERRQ(ierr); 633 ierr = KSPGetType(origksp,&ksp_type);CHKERRQ(ierr); 634 ierr = KSPSetType(schurksp,ksp_type);CHKERRQ(ierr); 635 ierr = KSPGetPC(schurksp,&schurpc);CHKERRQ(ierr); 636 ierr = KSPGetPC(origksp,&origpc);CHKERRQ(ierr); 637 ierr = PetscObjectTypeCompare((PetscObject)origpc,PCNONE,&ispcnone);CHKERRQ(ierr); 638 if (!ispcnone) { 639 PCType pc_type; 640 ierr = PCGetType(origpc,&pc_type);CHKERRQ(ierr); 641 ierr = PCSetType(schurpc,pc_type);CHKERRQ(ierr); 642 } else { 643 ierr = PCSetType(schurpc,PCLU);CHKERRQ(ierr); 644 } 645 ierr = ISGetSize(is_I,&n_internal);CHKERRQ(ierr); 646 if (n_internal) { /* UMFPACK gives error with 0 sized problems */ 647 MatSolverPackage solver=NULL; 648 ierr = PCFactorGetMatSolverPackage(origpc,(const MatSolverPackage*)&solver);CHKERRQ(ierr); 649 if (solver) { 650 ierr = PCFactorSetMatSolverPackage(schurpc,solver);CHKERRQ(ierr); 651 } 652 } 653 ierr = KSPSetUp(schurksp);CHKERRQ(ierr); 654 } 655 ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); 656 ierr = MatCreateSeqDense(PETSC_COMM_SELF,subset_size,subset_size,work,&S_Ej_expl);CHKERRQ(ierr); 657 ierr = PCBDDCComputeExplicitSchur(S_Ej,sub_schurs->is_hermitian,MAT_REUSE_MATRIX,&S_Ej_expl);CHKERRQ(ierr); 658 ierr = PetscObjectTypeCompare((PetscObject)S_Ej_expl,MATSEQDENSE,&Sdense);CHKERRQ(ierr); 659 if (Sdense) { 660 for (j=0;j<subset_size;j++) { 661 dummy_idx[j]=local_size+j; 662 } 663 ierr = MatSetValues(sub_schurs->S_Ej_all,subset_size,dummy_idx,subset_size,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); 664 } else { 665 SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not yet implemented for sparse matrices"); 666 } 667 ierr = MatDestroy(&S_Ej);CHKERRQ(ierr); 668 ierr = MatDestroy(&S_Ej_expl);CHKERRQ(ierr); 669 local_size += subset_size; 670 } 671 ierr = PetscFree2(dummy_idx,work);CHKERRQ(ierr); 672 /* free */ 673 ierr = ISDestroy(&is_I);CHKERRQ(ierr); 674 ierr = MatDestroy(&AE_II);CHKERRQ(ierr); 675 ierr = PetscFree(all_local_idx_N);CHKERRQ(ierr); 676 } else { 677 Mat A; 678 IS is_A_all; 679 PetscScalar *work,*S_data; 680 PetscInt *idxs_schur,n_I,n_I_all,*dummy_idx,size_schur,size_active_schur,cum,cum2; 681 PetscBool mumps_S; 682 683 /* get working mat */ 684 ierr = ISGetLocalSize(is_I_layer,&n_I);CHKERRQ(ierr); 685 if (!sub_schurs->is_dir) { 686 ierr = ISCreateGeneral(PETSC_COMM_SELF,local_size+n_I,all_local_idx_N,PETSC_COPY_VALUES,&is_A_all);CHKERRQ(ierr); 687 size_schur = local_size; 688 } else { 689 IS list[2]; 690 691 ierr = ISCreateGeneral(PETSC_COMM_SELF,local_size+n_I,all_local_idx_N,PETSC_COPY_VALUES,&list[0]);CHKERRQ(ierr); 692 list[1] = sub_schurs->is_dir; 693 ierr = ISConcatenate(PETSC_COMM_SELF,2,list,&is_A_all);CHKERRQ(ierr); 694 ierr = ISDestroy(&list[0]);CHKERRQ(ierr); 695 ierr = ISGetLocalSize(sub_schurs->is_dir,&size_schur);CHKERRQ(ierr); 696 size_schur += local_size; 697 } 698 ierr = PetscFree(all_local_idx_N);CHKERRQ(ierr); 699 size_active_schur = local_size; /* size active schurs does not count any dirichlet dof on the interface */ 700 ierr = MatGetSubMatrix(sub_schurs->A,is_A_all,is_A_all,MAT_INITIAL_MATRIX,&A);CHKERRQ(ierr); 701 ierr = MatSetOptionsPrefix(A,"sub_schurs_");CHKERRQ(ierr); 702 ierr = MatSetOption(A,MAT_SYMMETRIC,sub_schurs->is_hermitian);CHKERRQ(ierr); 703 ierr = MatSetOption(A,MAT_HERMITIAN,sub_schurs->is_hermitian);CHKERRQ(ierr); 704 ierr = MatSetOption(A,MAT_SPD,sub_schurs->is_posdef);CHKERRQ(ierr); 705 706 if (n_I) { 707 if (sub_schurs->is_hermitian && sub_schurs->is_posdef) { 708 ierr = MatGetFactor(A,MATSOLVERMUMPS,MAT_FACTOR_CHOLESKY,&F);CHKERRQ(ierr); 709 } else { 710 ierr = MatGetFactor(A,MATSOLVERMUMPS,MAT_FACTOR_LU,&F);CHKERRQ(ierr); 711 } 712 713 /* subsets ordered last */ 714 ierr = PetscMalloc1(size_schur,&idxs_schur);CHKERRQ(ierr); 715 for (i=0;i<size_schur;i++) { 716 idxs_schur[i] = n_I+i+1; 717 } 718 #if defined(PETSC_HAVE_MUMPS) 719 ierr = MatMumpsSetSchurIndices(F,size_schur,idxs_schur);CHKERRQ(ierr); 720 #endif 721 ierr = PetscFree(idxs_schur);CHKERRQ(ierr); 722 723 /* factorization step */ 724 if (sub_schurs->is_hermitian && sub_schurs->is_posdef) { 725 ierr = MatCholeskyFactorSymbolic(F,A,NULL,NULL);CHKERRQ(ierr); 726 #if defined(PETSC_HAVE_MUMPS) /* be sure that icntl 19 is not set by command line */ 727 ierr = MatMumpsSetIcntl(F,19,2);CHKERRQ(ierr); 728 #endif 729 ierr = MatCholeskyFactorNumeric(F,A,NULL);CHKERRQ(ierr); 730 } else { 731 ierr = MatLUFactorSymbolic(F,A,NULL,NULL,NULL);CHKERRQ(ierr); 732 #if defined(PETSC_HAVE_MUMPS) /* be sure that icntl 19 is not set by command line */ 733 ierr = MatMumpsSetIcntl(F,19,3);CHKERRQ(ierr); 734 #endif 735 ierr = MatLUFactorNumeric(F,A,NULL);CHKERRQ(ierr); 736 } 737 738 /* get explicit Schur Complement computed during numeric factorization */ 739 #if defined(PETSC_HAVE_MUMPS) 740 ierr = MatMumpsGetSchurComplement(F,&S_all);CHKERRQ(ierr); 741 #endif 742 743 /* we can reuse the solvers if we are not using the economic version */ 744 ierr = ISGetLocalSize(sub_schurs->is_I,&n_I_all);CHKERRQ(ierr); 745 reuse_solvers = (PetscBool)(reuse_solvers && (n_I == n_I_all)); 746 mumps_S = PETSC_TRUE; 747 } else { /* we can't use MUMPS when size_schur == size_of_the_problem */ 748 ierr = MatConvert(A,MATSEQDENSE,MAT_INITIAL_MATRIX,&S_all);CHKERRQ(ierr); 749 reuse_solvers = PETSC_FALSE; 750 mumps_S = PETSC_FALSE; 751 } 752 753 if (reuse_solvers) { 754 Mat A_II; 755 Vec vec1_B; 756 PCBDDCReuseMumps msolv_ctx; 757 758 if (sub_schurs->reuse_mumps) { 759 ierr = PCBDDCReuseMumpsReset(sub_schurs->reuse_mumps);CHKERRQ(ierr); 760 } else { 761 ierr = PetscNew(&sub_schurs->reuse_mumps);CHKERRQ(ierr); 762 } 763 msolv_ctx = sub_schurs->reuse_mumps; 764 ierr = MatSchurComplementGetSubMatrices(sub_schurs->S,&A_II,NULL,NULL,NULL,NULL);CHKERRQ(ierr); 765 ierr = MatGetSize(A_II,&msolv_ctx->n_I,NULL);CHKERRQ(ierr); 766 ierr = PetscObjectReference((PetscObject)F);CHKERRQ(ierr); 767 msolv_ctx->F = F; 768 ierr = MatCreateVecs(F,&msolv_ctx->sol,&msolv_ctx->rhs);CHKERRQ(ierr); 769 770 /* interior solver */ 771 ierr = PCCreate(PETSC_COMM_SELF,&msolv_ctx->interior_solver);CHKERRQ(ierr); 772 ierr = PCSetOperators(msolv_ctx->interior_solver,A_II,A_II);CHKERRQ(ierr); 773 ierr = PCSetType(msolv_ctx->interior_solver,PCSHELL);CHKERRQ(ierr); 774 ierr = PCShellSetContext(msolv_ctx->interior_solver,msolv_ctx);CHKERRQ(ierr); 775 ierr = PCShellSetApply(msolv_ctx->interior_solver,PCBDDCMumpsInteriorSolve);CHKERRQ(ierr); 776 ierr = PCShellSetApplyTranspose(msolv_ctx->interior_solver,PCBDDCMumpsInteriorSolveTranspose);CHKERRQ(ierr); 777 778 /* correction solver */ 779 ierr = PCCreate(PETSC_COMM_SELF,&msolv_ctx->correction_solver);CHKERRQ(ierr); 780 ierr = PCSetOperators(msolv_ctx->correction_solver,A,A);CHKERRQ(ierr); 781 ierr = PCSetType(msolv_ctx->correction_solver,PCSHELL);CHKERRQ(ierr); 782 ierr = PCShellSetContext(msolv_ctx->correction_solver,msolv_ctx);CHKERRQ(ierr); 783 ierr = PCShellSetApply(msolv_ctx->correction_solver,PCBDDCMumpsCorrectionSolve);CHKERRQ(ierr); 784 ierr = PCShellSetApplyTranspose(msolv_ctx->correction_solver,PCBDDCMumpsCorrectionSolveTranspose);CHKERRQ(ierr); 785 786 /* scatter and vecs for Schur complement solver */ 787 ierr = MatCreateVecs(S_all,&msolv_ctx->sol_B,&msolv_ctx->rhs_B);CHKERRQ(ierr); 788 ierr = MatCreateVecs(sub_schurs->S,&vec1_B,NULL);CHKERRQ(ierr); 789 ierr = ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap,IS_GTOLM_DROP,is_A_all,&msolv_ctx->is_B);CHKERRQ(ierr); 790 ierr = VecScatterCreate(vec1_B,msolv_ctx->is_B,msolv_ctx->sol_B,NULL,&msolv_ctx->correction_scatter_B);CHKERRQ(ierr); 791 ierr = VecDestroy(&vec1_B);CHKERRQ(ierr); 792 ierr = PetscObjectReference((PetscObject)is_A_all);CHKERRQ(ierr); 793 msolv_ctx->is_R = is_A_all; 794 } 795 ierr = MatDestroy(&A);CHKERRQ(ierr); 796 ierr = ISDestroy(&is_A_all);CHKERRQ(ierr); 797 798 /* Work arrays */ 799 ierr = PetscMalloc2(max_subset_size,&dummy_idx,max_subset_size*max_subset_size,&work);CHKERRQ(ierr); 800 if (compute_Stilda) { 801 ierr = MatCreate(PETSC_COMM_SELF,&S_Ej_tilda_all);CHKERRQ(ierr); 802 ierr = MatSetSizes(S_Ej_tilda_all,PETSC_DECIDE,PETSC_DECIDE,size_active_schur,size_active_schur);CHKERRQ(ierr); 803 ierr = MatSetType(S_Ej_tilda_all,MATAIJ);CHKERRQ(ierr); 804 ierr = MatSeqAIJSetPreallocation(S_Ej_tilda_all,0,nnz);CHKERRQ(ierr); 805 ierr = MatCreate(PETSC_COMM_SELF,&S_Ej_inv_all);CHKERRQ(ierr); 806 ierr = MatSetSizes(S_Ej_inv_all,PETSC_DECIDE,PETSC_DECIDE,size_active_schur,size_active_schur);CHKERRQ(ierr); 807 ierr = MatSetType(S_Ej_inv_all,MATAIJ);CHKERRQ(ierr); 808 ierr = MatSeqAIJSetPreallocation(S_Ej_inv_all,0,nnz);CHKERRQ(ierr); 809 } 810 811 /* S_Ej_all */ 812 cum = cum2 = 0; 813 ierr = MatDenseGetArray(S_all,&S_data);CHKERRQ(ierr); 814 for (i=0;i<sub_schurs->n_subs;i++) { 815 PetscInt j; 816 817 /* get S_E */ 818 ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); 819 if (mumps_S && sub_schurs->is_hermitian) { /* When using MUMPS data I need to expand to upper triangular (column oriented) */ 820 PetscInt k; 821 for (k=0;k<subset_size;k++) { 822 for (j=k;j<subset_size;j++) { 823 work[k*subset_size+j] = S_data[cum2+k*size_schur+j]; 824 work[j*subset_size+k] = S_data[cum2+k*size_schur+j]; 825 } 826 } 827 } else { /* copy to workspace */ 828 PetscInt k; 829 for (k=0;k<subset_size;k++) { 830 for (j=0;j<subset_size;j++) { 831 work[k*subset_size+j] = S_data[cum2+k*size_schur+j]; 832 } 833 } 834 } 835 /* insert S_E values */ 836 for (j=0;j<subset_size;j++) dummy_idx[j] = cum+j; 837 ierr = MatSetValues(sub_schurs->S_Ej_all,subset_size,dummy_idx,subset_size,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); 838 839 /* if adaptivity is requested, invert S_E block */ 840 if (compute_Stilda && ((PetscBTLookup(sub_schurs->is_edge,i) && use_edges) || (!PetscBTLookup(sub_schurs->is_edge,i) && use_faces))) { 841 ierr = PetscBLASIntCast(subset_size,&B_N);CHKERRQ(ierr); 842 ierr = PetscFPTrapPush(PETSC_FP_TRAP_OFF);CHKERRQ(ierr); 843 if (!sub_schurs->is_hermitian) { /* TODO add sytrf/i for symmetric non hermitian */ 844 PetscStackCallBLAS("LAPACKgetrf",LAPACKgetrf_(&B_N,&B_N,work,&B_N,pivots,&B_ierr)); 845 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GETRF Lapack routine %d",(int)B_ierr); 846 PetscStackCallBLAS("LAPACKgetri",LAPACKgetri_(&B_N,work,&B_N,pivots,Bwork,&B_lwork,&B_ierr)); 847 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GETRI Lapack routine %d",(int)B_ierr); 848 } else { 849 PetscStackCallBLAS("LAPACKpotrf",LAPACKpotrf_("L",&B_N,work,&B_N,&B_ierr)); 850 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRF Lapack routine %d",(int)B_ierr); 851 PetscStackCallBLAS("LAPACKpotri",LAPACKpotri_("L",&B_N,work,&B_N,&B_ierr)); 852 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRI Lapack routine %d",(int)B_ierr); 853 } 854 ierr = PetscFPTrapPop();CHKERRQ(ierr); 855 ierr = MatSetValues(S_Ej_inv_all,subset_size,dummy_idx,subset_size,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); 856 } 857 cum += subset_size; 858 cum2 += subset_size*(size_schur + 1); 859 } 860 ierr = MatDenseRestoreArray(S_all,&S_data);CHKERRQ(ierr); 861 862 #if defined(PETSC_HAVE_MUMPS) 863 if (mumps_S) { 864 ierr = MatMumpsRestoreSchurComplement(F,&S_all);CHKERRQ(ierr); 865 } 866 #endif 867 868 if (compute_Stilda) { 869 if (sub_schurs->n_subs == 1 && size_schur == size_active_schur) { /* we already computed the inverse */ 870 PetscInt j; 871 for (j=0;j<size_schur;j++) dummy_idx[j] = j; 872 ierr = MatSetValues(S_Ej_tilda_all,size_schur,dummy_idx,size_schur,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); 873 ierr = PetscBTSet(sub_schurs->computed_Stilda_subs,0);CHKERRQ(ierr); 874 } else { 875 if (mumps_S) { /* use MatMumps calls to invert S */ 876 #if defined(PETSC_HAVE_MUMPS) 877 ierr = MatMumpsInvertSchurComplement(F);CHKERRQ(ierr); 878 ierr = MatMumpsGetSchurComplement(F,&S_all);CHKERRQ(ierr); 879 #endif 880 } else { /* we need to invert explicitly since we are not using MUMPS for S */ 881 ierr = MatDenseGetArray(S_all,&S_data);CHKERRQ(ierr); 882 ierr = PetscBLASIntCast(size_schur,&B_N);CHKERRQ(ierr); 883 ierr = PetscFPTrapPush(PETSC_FP_TRAP_OFF);CHKERRQ(ierr); 884 if (!sub_schurs->is_hermitian) { /* TODO add sytrf/i for symmetric non hermitian */ 885 PetscStackCallBLAS("LAPACKgetrf",LAPACKgetrf_(&B_N,&B_N,S_data,&B_N,pivots,&B_ierr)); 886 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GETRF Lapack routine %d",(int)B_ierr); 887 PetscStackCallBLAS("LAPACKgetri",LAPACKgetri_(&B_N,S_data,&B_N,pivots,Bwork,&B_lwork,&B_ierr)); 888 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GETRI Lapack routine %d",(int)B_ierr); 889 } else { 890 PetscStackCallBLAS("LAPACKpotrf",LAPACKpotrf_("L",&B_N,S_data,&B_N,&B_ierr)); 891 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRF Lapack routine %d",(int)B_ierr); 892 PetscStackCallBLAS("LAPACKpotri",LAPACKpotri_("L",&B_N,S_data,&B_N,&B_ierr)); 893 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRI Lapack routine %d",(int)B_ierr); 894 } 895 ierr = PetscFPTrapPop();CHKERRQ(ierr); 896 ierr = MatDenseRestoreArray(S_all,&S_data);CHKERRQ(ierr); 897 } 898 /* S_Ej_tilda_all */ 899 cum = cum2 = 0; 900 ierr = MatDenseGetArray(S_all,&S_data);CHKERRQ(ierr); 901 for (i=0;i<sub_schurs->n_subs;i++) { 902 ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); 903 /* if adaptivity is requested, invert S_E and insert St_E^-1 blocks */ 904 if (((PetscBTLookup(sub_schurs->is_edge,i) && use_edges) || (!PetscBTLookup(sub_schurs->is_edge,i) && use_faces))) { 905 PetscInt j; 906 /* get (St^-1)_E */ 907 if (sub_schurs->is_hermitian) { /* Here I don't need to expand to upper triangular (column oriented) */ 908 PetscInt k; 909 for (k=0;k<subset_size;k++) { 910 for (j=k;j<subset_size;j++) { 911 work[k*subset_size+j] = S_data[cum2+k*size_schur+j]; 912 } 913 } 914 } else { /* copy to workspace */ 915 PetscInt k; 916 for (k=0;k<subset_size;k++) { 917 for (j=0;j<subset_size;j++) { 918 work[k*subset_size+j] = S_data[cum2+k*size_schur+j]; 919 } 920 } 921 } 922 for (j=0;j<subset_size;j++) dummy_idx[j] = cum+j; 923 ierr = MatSetValues(S_Ej_tilda_all,subset_size,dummy_idx,subset_size,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); 924 ierr = PetscBTSet(sub_schurs->computed_Stilda_subs,i);CHKERRQ(ierr); 925 } 926 cum += subset_size; 927 cum2 += subset_size*(size_schur + 1); 928 } 929 ierr = MatDenseRestoreArray(S_all,&S_data);CHKERRQ(ierr); 930 #if defined(PETSC_HAVE_MUMPS) 931 if (mumps_S) { 932 ierr = MatMumpsRestoreSchurComplement(F,&S_all);CHKERRQ(ierr); 933 } 934 #endif 935 } 936 } 937 ierr = PetscFree2(dummy_idx,work);CHKERRQ(ierr); 938 } 939 ierr = MatDestroy(&F);CHKERRQ(ierr); 940 ierr = ISDestroy(&is_I_layer);CHKERRQ(ierr); 941 ierr = PetscFree(nnz);CHKERRQ(ierr); 942 ierr = MatDestroy(&S_all);CHKERRQ(ierr); 943 ierr = MatDestroy(&A_BB);CHKERRQ(ierr); 944 ierr = MatDestroy(&A_IB);CHKERRQ(ierr); 945 ierr = MatDestroy(&A_BI);CHKERRQ(ierr); 946 ierr = MatAssemblyBegin(sub_schurs->S_Ej_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 947 ierr = MatAssemblyEnd(sub_schurs->S_Ej_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 948 if (compute_Stilda) { 949 ierr = MatAssemblyBegin(S_Ej_tilda_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 950 ierr = MatAssemblyEnd(S_Ej_tilda_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 951 ierr = MatAssemblyBegin(S_Ej_inv_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 952 ierr = MatAssemblyEnd(S_Ej_inv_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 953 } 954 955 /* Global matrix of all assembled Schur on subsets */ 956 ierr = MatISSetLocalMat(work_mat,sub_schurs->S_Ej_all);CHKERRQ(ierr); 957 ierr = MatISSetMPIXAIJPreallocation_Private(work_mat,global_schur_subsets,PETSC_TRUE);CHKERRQ(ierr); 958 ierr = MatISGetMPIXAIJ(work_mat,MAT_REUSE_MATRIX,&global_schur_subsets);CHKERRQ(ierr); 959 960 /* Get local part of (\sum_j S_Ej) */ 961 ierr = ISCreateGeneral(comm_n,local_size,all_local_idx_G,PETSC_OWN_POINTER,&temp_is);CHKERRQ(ierr); 962 ierr = MatDestroy(&sub_schurs->sum_S_Ej_all);CHKERRQ(ierr); 963 ierr = MatGetSubMatrixUnsorted(global_schur_subsets,temp_is,temp_is,&sub_schurs->sum_S_Ej_all);CHKERRQ(ierr); 964 965 /* Compute explicitly (\sum_j S_Ej)^-1 (faster scaling during PCApply, needs extra work when doing setup) */ 966 if (faster_deluxe) { 967 Mat tmpmat; 968 PetscScalar *array; 969 PetscInt cum; 970 971 ierr = MatSeqAIJGetArray(sub_schurs->sum_S_Ej_all,&array);CHKERRQ(ierr); 972 cum = 0; 973 for (i=0;i<sub_schurs->n_subs;i++) { 974 ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); 975 ierr = PetscBLASIntCast(subset_size,&B_N);CHKERRQ(ierr); 976 ierr = PetscFPTrapPush(PETSC_FP_TRAP_OFF);CHKERRQ(ierr); 977 if (!sub_schurs->is_hermitian) { 978 PetscStackCallBLAS("LAPACKgetrf",LAPACKgetrf_(&B_N,&B_N,array+cum,&B_N,pivots,&B_ierr)); 979 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GETRF Lapack routine %d",(int)B_ierr); 980 PetscStackCallBLAS("LAPACKgetri",LAPACKgetri_(&B_N,array+cum,&B_N,pivots,Bwork,&B_lwork,&B_ierr)); 981 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GETRI Lapack routine %d",(int)B_ierr); 982 } else { 983 PetscInt j,k; 984 985 PetscStackCallBLAS("LAPACKpotrf",LAPACKpotrf_("L",&B_N,array+cum,&B_N,&B_ierr)); 986 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRF Lapack routine %d",(int)B_ierr); 987 PetscStackCallBLAS("LAPACKpotri",LAPACKpotri_("L",&B_N,array+cum,&B_N,&B_ierr)); 988 if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRI Lapack routine %d",(int)B_ierr); 989 for (j=0;j<B_N;j++) { 990 for (k=j+1;k<B_N;k++) { 991 array[k*B_N+j+cum] = array[j*B_N+k+cum]; 992 } 993 } 994 } 995 ierr = PetscFPTrapPop();CHKERRQ(ierr); 996 cum += subset_size*subset_size; 997 } 998 ierr = MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_all,&array);CHKERRQ(ierr); 999 ierr = MatMatMult(sub_schurs->S_Ej_all,sub_schurs->sum_S_Ej_all,MAT_INITIAL_MATRIX,1.0,&tmpmat);CHKERRQ(ierr); 1000 ierr = MatDestroy(&sub_schurs->S_Ej_all);CHKERRQ(ierr); 1001 ierr = MatDestroy(&sub_schurs->sum_S_Ej_all);CHKERRQ(ierr); 1002 sub_schurs->S_Ej_all = tmpmat; 1003 } 1004 1005 /* Get local part of (\sum_j S^-1_Ej) (\sum_j St^-1_Ej) */ 1006 if (compute_Stilda) { 1007 ierr = MatISSetLocalMat(work_mat,S_Ej_tilda_all);CHKERRQ(ierr); 1008 ierr = MatISGetMPIXAIJ(work_mat,MAT_REUSE_MATRIX,&global_schur_subsets);CHKERRQ(ierr); 1009 ierr = MatDestroy(&sub_schurs->sum_S_Ej_tilda_all);CHKERRQ(ierr); 1010 ierr = MatGetSubMatrixUnsorted(global_schur_subsets,temp_is,temp_is,&sub_schurs->sum_S_Ej_tilda_all);CHKERRQ(ierr); 1011 ierr = MatISSetLocalMat(work_mat,S_Ej_inv_all);CHKERRQ(ierr); 1012 ierr = MatISGetMPIXAIJ(work_mat,MAT_REUSE_MATRIX,&global_schur_subsets);CHKERRQ(ierr); 1013 ierr = MatDestroy(&sub_schurs->sum_S_Ej_inv_all);CHKERRQ(ierr); 1014 ierr = MatGetSubMatrixUnsorted(global_schur_subsets,temp_is,temp_is,&sub_schurs->sum_S_Ej_inv_all);CHKERRQ(ierr); 1015 } 1016 1017 /* free workspace */ 1018 ierr = PetscFree2(Bwork,pivots);CHKERRQ(ierr); 1019 ierr = MatDestroy(&global_schur_subsets);CHKERRQ(ierr); 1020 ierr = MatDestroy(&S_Ej_tilda_all);CHKERRQ(ierr); 1021 ierr = MatDestroy(&S_Ej_inv_all);CHKERRQ(ierr); 1022 ierr = MatDestroy(&work_mat);CHKERRQ(ierr); 1023 ierr = ISDestroy(&temp_is);CHKERRQ(ierr); 1024 ierr = PetscCommDestroy(&comm_n);CHKERRQ(ierr); 1025 PetscFunctionReturn(0); 1026 } 1027 1028 #undef __FUNCT__ 1029 #define __FUNCT__ "PCBDDCSubSchursInit" 1030 PetscErrorCode PCBDDCSubSchursInit(PCBDDCSubSchurs sub_schurs, IS is_I, IS is_B, PCBDDCGraph graph, ISLocalToGlobalMapping BtoNmap) 1031 { 1032 IS *faces,*edges,*all_cc,vertices; 1033 PetscInt i,n_faces,n_edges,n_all_cc; 1034 PetscBool is_sorted; 1035 PetscErrorCode ierr; 1036 1037 PetscFunctionBegin; 1038 ierr = ISSorted(is_I,&is_sorted);CHKERRQ(ierr); 1039 if (!is_sorted) { 1040 SETERRQ(PetscObjectComm((PetscObject)is_I),PETSC_ERR_PLIB,"IS for I dofs should be shorted"); 1041 } 1042 ierr = ISSorted(is_B,&is_sorted);CHKERRQ(ierr); 1043 if (!is_sorted) { 1044 SETERRQ(PetscObjectComm((PetscObject)is_B),PETSC_ERR_PLIB,"IS for B dofs should be shorted"); 1045 } 1046 1047 /* reset any previous data */ 1048 ierr = PCBDDCSubSchursReset(sub_schurs);CHKERRQ(ierr); 1049 1050 /* get index sets for faces and edges (already sorted by global ordering) */ 1051 ierr = PCBDDCGraphGetCandidatesIS(graph,&n_faces,&faces,&n_edges,&edges,&vertices);CHKERRQ(ierr); 1052 n_all_cc = n_faces+n_edges; 1053 ierr = PetscBTCreate(n_all_cc,&sub_schurs->is_edge);CHKERRQ(ierr); 1054 ierr = PetscBTCreate(n_all_cc,&sub_schurs->computed_Stilda_subs);CHKERRQ(ierr); 1055 ierr = PetscMalloc1(n_all_cc,&all_cc);CHKERRQ(ierr); 1056 for (i=0;i<n_faces;i++) { 1057 all_cc[i] = faces[i]; 1058 } 1059 for (i=0;i<n_edges;i++) { 1060 all_cc[n_faces+i] = edges[i]; 1061 ierr = PetscBTSet(sub_schurs->is_edge,n_faces+i);CHKERRQ(ierr); 1062 } 1063 ierr = PetscFree(faces);CHKERRQ(ierr); 1064 ierr = PetscFree(edges);CHKERRQ(ierr); 1065 sub_schurs->is_dir = NULL; 1066 ierr = PCBDDCGraphGetDirichletDofsB(graph,&sub_schurs->is_dir);CHKERRQ(ierr); 1067 1068 /* Determine if MUMPS can be used */ 1069 sub_schurs->use_mumps = PETSC_FALSE; 1070 #if defined(PETSC_HAVE_MUMPS) 1071 sub_schurs->use_mumps = PETSC_TRUE; 1072 #endif 1073 1074 ierr = PetscObjectReference((PetscObject)is_I);CHKERRQ(ierr); 1075 sub_schurs->is_I = is_I; 1076 ierr = PetscObjectReference((PetscObject)is_B);CHKERRQ(ierr); 1077 sub_schurs->is_B = is_B; 1078 ierr = PetscObjectReference((PetscObject)graph->l2gmap);CHKERRQ(ierr); 1079 sub_schurs->l2gmap = graph->l2gmap; 1080 ierr = PetscObjectReference((PetscObject)BtoNmap);CHKERRQ(ierr); 1081 sub_schurs->BtoNmap = BtoNmap; 1082 sub_schurs->n_subs = n_all_cc; 1083 sub_schurs->is_subs = all_cc; 1084 if (!sub_schurs->use_mumps) { /* sort by local ordering mumps is not present */ 1085 for (i=0;i<sub_schurs->n_subs;i++) { 1086 ierr = ISSort(sub_schurs->is_subs[i]);CHKERRQ(ierr); 1087 } 1088 } 1089 sub_schurs->is_vertices = vertices; 1090 sub_schurs->S_Ej_all = NULL; 1091 sub_schurs->sum_S_Ej_all = NULL; 1092 sub_schurs->sum_S_Ej_inv_all = NULL; 1093 sub_schurs->sum_S_Ej_tilda_all = NULL; 1094 sub_schurs->is_Ej_all = NULL; 1095 PetscFunctionReturn(0); 1096 } 1097 1098 #undef __FUNCT__ 1099 #define __FUNCT__ "PCBDDCSubSchursCreate" 1100 PetscErrorCode PCBDDCSubSchursCreate(PCBDDCSubSchurs *sub_schurs) 1101 { 1102 PCBDDCSubSchurs schurs_ctx; 1103 PetscErrorCode ierr; 1104 1105 PetscFunctionBegin; 1106 ierr = PetscNew(&schurs_ctx);CHKERRQ(ierr); 1107 schurs_ctx->n_subs = 0; 1108 *sub_schurs = schurs_ctx; 1109 PetscFunctionReturn(0); 1110 } 1111 1112 #undef __FUNCT__ 1113 #define __FUNCT__ "PCBDDCSubSchursDestroy" 1114 PetscErrorCode PCBDDCSubSchursDestroy(PCBDDCSubSchurs *sub_schurs) 1115 { 1116 PetscErrorCode ierr; 1117 1118 PetscFunctionBegin; 1119 ierr = PCBDDCSubSchursReset(*sub_schurs);CHKERRQ(ierr); 1120 ierr = PetscFree(*sub_schurs);CHKERRQ(ierr); 1121 PetscFunctionReturn(0); 1122 } 1123 1124 #undef __FUNCT__ 1125 #define __FUNCT__ "PCBDDCSubSchursReset" 1126 PetscErrorCode PCBDDCSubSchursReset(PCBDDCSubSchurs sub_schurs) 1127 { 1128 PetscInt i; 1129 PetscErrorCode ierr; 1130 1131 PetscFunctionBegin; 1132 ierr = MatDestroy(&sub_schurs->A);CHKERRQ(ierr); 1133 ierr = MatDestroy(&sub_schurs->S);CHKERRQ(ierr); 1134 ierr = ISDestroy(&sub_schurs->is_I);CHKERRQ(ierr); 1135 ierr = ISDestroy(&sub_schurs->is_B);CHKERRQ(ierr); 1136 ierr = ISLocalToGlobalMappingDestroy(&sub_schurs->l2gmap);CHKERRQ(ierr); 1137 ierr = ISLocalToGlobalMappingDestroy(&sub_schurs->BtoNmap);CHKERRQ(ierr); 1138 ierr = MatDestroy(&sub_schurs->S_Ej_all);CHKERRQ(ierr); 1139 ierr = MatDestroy(&sub_schurs->sum_S_Ej_all);CHKERRQ(ierr); 1140 ierr = MatDestroy(&sub_schurs->sum_S_Ej_inv_all);CHKERRQ(ierr); 1141 ierr = MatDestroy(&sub_schurs->sum_S_Ej_tilda_all);CHKERRQ(ierr); 1142 ierr = ISDestroy(&sub_schurs->is_Ej_all);CHKERRQ(ierr); 1143 ierr = ISDestroy(&sub_schurs->is_vertices);CHKERRQ(ierr); 1144 ierr = ISDestroy(&sub_schurs->is_dir);CHKERRQ(ierr); 1145 ierr = PetscBTDestroy(&sub_schurs->is_edge);CHKERRQ(ierr); 1146 ierr = PetscBTDestroy(&sub_schurs->computed_Stilda_subs);CHKERRQ(ierr); 1147 for (i=0;i<sub_schurs->n_subs;i++) { 1148 ierr = ISDestroy(&sub_schurs->is_subs[i]);CHKERRQ(ierr); 1149 } 1150 if (sub_schurs->n_subs) { 1151 ierr = PetscFree(sub_schurs->is_subs);CHKERRQ(ierr); 1152 } 1153 if (sub_schurs->reuse_mumps) { 1154 ierr = PCBDDCReuseMumpsReset(sub_schurs->reuse_mumps);CHKERRQ(ierr); 1155 } 1156 ierr = PetscFree(sub_schurs->reuse_mumps);CHKERRQ(ierr); 1157 sub_schurs->n_subs = 0; 1158 PetscFunctionReturn(0); 1159 } 1160 1161 #undef __FUNCT__ 1162 #define __FUNCT__ "PCBDDCAdjGetNextLayer_Private" 1163 PETSC_STATIC_INLINE PetscErrorCode PCBDDCAdjGetNextLayer_Private(PetscInt* queue_tip,PetscInt n_prev,PetscBT touched,PetscInt* xadj,PetscInt* adjncy,PetscInt* n_added) 1164 { 1165 PetscInt i,j,n; 1166 PetscErrorCode ierr; 1167 1168 PetscFunctionBegin; 1169 n = 0; 1170 for (i=-n_prev;i<0;i++) { 1171 PetscInt start_dof = queue_tip[i]; 1172 for (j=xadj[start_dof];j<xadj[start_dof+1];j++) { 1173 PetscInt dof = adjncy[j]; 1174 if (!PetscBTLookup(touched,dof)) { 1175 ierr = PetscBTSet(touched,dof);CHKERRQ(ierr); 1176 queue_tip[n] = dof; 1177 n++; 1178 } 1179 } 1180 } 1181 *n_added = n; 1182 PetscFunctionReturn(0); 1183 } 1184