1 #include <petsc/private/pcbddcimpl.h> 2 #include <petsc/private/pcbddcprivateimpl.h> 3 #include <../src/mat/impls/dense/seq/dense.h> 4 #include <petscblaslapack.h> 5 6 static inline PetscErrorCode PCBDDCAdjGetNextLayer_Private(PetscInt *, PetscInt, PetscBT, PetscInt *, PetscInt *, PetscInt *); 7 static PetscErrorCode PCBDDCComputeExplicitSchur(Mat, PetscBool, MatReuse, Mat *); 8 static PetscErrorCode PCBDDCReuseSolvers_Interior(PC, Vec, Vec); 9 static PetscErrorCode PCBDDCReuseSolvers_Correction(PC, Vec, Vec); 10 11 /* if v2 is not present, correction is done in-place */ 12 PetscErrorCode PCBDDCReuseSolversBenignAdapt(PCBDDCReuseSolvers ctx, Vec v, Vec v2, PetscBool sol, PetscBool full) 13 { 14 PetscScalar *array; 15 PetscScalar *array2; 16 17 PetscFunctionBegin; 18 if (!ctx->benign_n) PetscFunctionReturn(PETSC_SUCCESS); 19 if (sol && full) { 20 PetscInt n_I, size_schur; 21 22 /* get sizes */ 23 PetscCall(MatGetSize(ctx->benign_csAIB, &size_schur, NULL)); 24 PetscCall(VecGetSize(v, &n_I)); 25 n_I = n_I - size_schur; 26 /* get schur sol from array */ 27 PetscCall(VecGetArray(v, &array)); 28 PetscCall(VecPlaceArray(ctx->benign_dummy_schur_vec, array + n_I)); 29 PetscCall(VecRestoreArray(v, &array)); 30 /* apply interior sol correction */ 31 PetscCall(MatMultTranspose(ctx->benign_csAIB, ctx->benign_dummy_schur_vec, ctx->benign_corr_work)); 32 PetscCall(VecResetArray(ctx->benign_dummy_schur_vec)); 33 PetscCall(MatMultAdd(ctx->benign_AIIm1ones, ctx->benign_corr_work, v, v)); 34 } 35 if (v2) { 36 PetscInt nl; 37 38 PetscCall(VecGetArrayRead(v, (const PetscScalar **)&array)); 39 PetscCall(VecGetLocalSize(v2, &nl)); 40 PetscCall(VecGetArray(v2, &array2)); 41 PetscCall(PetscArraycpy(array2, array, nl)); 42 } else { 43 PetscCall(VecGetArray(v, &array)); 44 array2 = array; 45 } 46 if (!sol) { /* change rhs */ 47 PetscInt n; 48 for (n = 0; n < ctx->benign_n; n++) { 49 PetscScalar sum = 0.; 50 const PetscInt *cols; 51 PetscInt nz, i; 52 53 PetscCall(ISGetLocalSize(ctx->benign_zerodiag_subs[n], &nz)); 54 PetscCall(ISGetIndices(ctx->benign_zerodiag_subs[n], &cols)); 55 for (i = 0; i < nz - 1; i++) sum += array[cols[i]]; 56 #if defined(PETSC_USE_COMPLEX) 57 sum = -(PetscRealPart(sum) / nz + PETSC_i * (PetscImaginaryPart(sum) / nz)); 58 #else 59 sum = -sum / nz; 60 #endif 61 for (i = 0; i < nz - 1; i++) array2[cols[i]] += sum; 62 ctx->benign_save_vals[n] = array2[cols[nz - 1]]; 63 array2[cols[nz - 1]] = sum; 64 PetscCall(ISRestoreIndices(ctx->benign_zerodiag_subs[n], &cols)); 65 } 66 } else { 67 PetscInt n; 68 for (n = 0; n < ctx->benign_n; n++) { 69 PetscScalar sum = 0.; 70 const PetscInt *cols; 71 PetscInt nz, i; 72 PetscCall(ISGetLocalSize(ctx->benign_zerodiag_subs[n], &nz)); 73 PetscCall(ISGetIndices(ctx->benign_zerodiag_subs[n], &cols)); 74 for (i = 0; i < nz - 1; i++) sum += array[cols[i]]; 75 #if defined(PETSC_USE_COMPLEX) 76 sum = -(PetscRealPart(sum) / nz + PETSC_i * (PetscImaginaryPart(sum) / nz)); 77 #else 78 sum = -sum / nz; 79 #endif 80 for (i = 0; i < nz - 1; i++) array2[cols[i]] += sum; 81 array2[cols[nz - 1]] = ctx->benign_save_vals[n]; 82 PetscCall(ISRestoreIndices(ctx->benign_zerodiag_subs[n], &cols)); 83 } 84 } 85 if (v2) { 86 PetscCall(VecRestoreArrayRead(v, (const PetscScalar **)&array)); 87 PetscCall(VecRestoreArray(v2, &array2)); 88 } else { 89 PetscCall(VecRestoreArray(v, &array)); 90 } 91 if (!sol && full) { 92 Vec usedv; 93 PetscInt n_I, size_schur; 94 95 /* get sizes */ 96 PetscCall(MatGetSize(ctx->benign_csAIB, &size_schur, NULL)); 97 PetscCall(VecGetSize(v, &n_I)); 98 n_I = n_I - size_schur; 99 /* compute schur rhs correction */ 100 if (v2) { 101 usedv = v2; 102 } else { 103 usedv = v; 104 } 105 /* apply schur rhs correction */ 106 PetscCall(MatMultTranspose(ctx->benign_AIIm1ones, usedv, ctx->benign_corr_work)); 107 PetscCall(VecGetArrayRead(usedv, (const PetscScalar **)&array)); 108 PetscCall(VecPlaceArray(ctx->benign_dummy_schur_vec, array + n_I)); 109 PetscCall(VecRestoreArrayRead(usedv, (const PetscScalar **)&array)); 110 PetscCall(MatMultAdd(ctx->benign_csAIB, ctx->benign_corr_work, ctx->benign_dummy_schur_vec, ctx->benign_dummy_schur_vec)); 111 PetscCall(VecResetArray(ctx->benign_dummy_schur_vec)); 112 } 113 PetscFunctionReturn(PETSC_SUCCESS); 114 } 115 116 static PetscErrorCode PCBDDCReuseSolvers_Solve_Private(PC pc, Vec rhs, Vec sol, PetscBool transpose, PetscBool full) 117 { 118 PCBDDCReuseSolvers ctx; 119 PetscBool copy = PETSC_FALSE; 120 121 PetscFunctionBegin; 122 PetscCall(PCShellGetContext(pc, &ctx)); 123 if (full) { 124 PetscCall(MatMumpsSetIcntl(ctx->F, 26, -1)); 125 #if defined(PETSC_HAVE_MKL_PARDISO) 126 PetscCall(MatMkl_PardisoSetCntl(ctx->F, 70, 0)); 127 #endif 128 copy = ctx->has_vertices; 129 } else { /* interior solver */ 130 PetscCall(MatMumpsSetIcntl(ctx->F, 26, 0)); 131 #if defined(PETSC_HAVE_MKL_PARDISO) 132 PetscCall(MatMkl_PardisoSetCntl(ctx->F, 70, 1)); 133 #endif 134 copy = PETSC_TRUE; 135 } 136 /* copy rhs into factored matrix workspace */ 137 if (copy) { 138 PetscInt n; 139 PetscScalar *array, *array_solver; 140 141 PetscCall(VecGetLocalSize(rhs, &n)); 142 PetscCall(VecGetArrayRead(rhs, (const PetscScalar **)&array)); 143 PetscCall(VecGetArray(ctx->rhs, &array_solver)); 144 PetscCall(PetscArraycpy(array_solver, array, n)); 145 PetscCall(VecRestoreArray(ctx->rhs, &array_solver)); 146 PetscCall(VecRestoreArrayRead(rhs, (const PetscScalar **)&array)); 147 148 PetscCall(PCBDDCReuseSolversBenignAdapt(ctx, ctx->rhs, NULL, PETSC_FALSE, full)); 149 if (transpose) { 150 PetscCall(MatSolveTranspose(ctx->F, ctx->rhs, ctx->sol)); 151 } else { 152 PetscCall(MatSolve(ctx->F, ctx->rhs, ctx->sol)); 153 } 154 PetscCall(PCBDDCReuseSolversBenignAdapt(ctx, ctx->sol, NULL, PETSC_TRUE, full)); 155 156 /* get back data to caller worskpace */ 157 PetscCall(VecGetArrayRead(ctx->sol, (const PetscScalar **)&array_solver)); 158 PetscCall(VecGetArray(sol, &array)); 159 PetscCall(PetscArraycpy(array, array_solver, n)); 160 PetscCall(VecRestoreArray(sol, &array)); 161 PetscCall(VecRestoreArrayRead(ctx->sol, (const PetscScalar **)&array_solver)); 162 } else { 163 if (ctx->benign_n) { 164 PetscCall(PCBDDCReuseSolversBenignAdapt(ctx, rhs, ctx->rhs, PETSC_FALSE, full)); 165 if (transpose) { 166 PetscCall(MatSolveTranspose(ctx->F, ctx->rhs, sol)); 167 } else { 168 PetscCall(MatSolve(ctx->F, ctx->rhs, sol)); 169 } 170 PetscCall(PCBDDCReuseSolversBenignAdapt(ctx, sol, NULL, PETSC_TRUE, full)); 171 } else { 172 if (transpose) { 173 PetscCall(MatSolveTranspose(ctx->F, rhs, sol)); 174 } else { 175 PetscCall(MatSolve(ctx->F, rhs, sol)); 176 } 177 } 178 } 179 /* restore defaults */ 180 PetscCall(MatMumpsSetIcntl(ctx->F, 26, -1)); 181 #if defined(PETSC_HAVE_MKL_PARDISO) 182 PetscCall(MatMkl_PardisoSetCntl(ctx->F, 70, 0)); 183 #endif 184 PetscFunctionReturn(PETSC_SUCCESS); 185 } 186 187 static PetscErrorCode PCBDDCReuseSolvers_Correction(PC pc, Vec rhs, Vec sol) 188 { 189 PetscFunctionBegin; 190 PetscCall(PCBDDCReuseSolvers_Solve_Private(pc, rhs, sol, PETSC_FALSE, PETSC_TRUE)); 191 PetscFunctionReturn(PETSC_SUCCESS); 192 } 193 194 static PetscErrorCode PCBDDCReuseSolvers_CorrectionTranspose(PC pc, Vec rhs, Vec sol) 195 { 196 PetscFunctionBegin; 197 PetscCall(PCBDDCReuseSolvers_Solve_Private(pc, rhs, sol, PETSC_TRUE, PETSC_TRUE)); 198 PetscFunctionReturn(PETSC_SUCCESS); 199 } 200 201 static PetscErrorCode PCBDDCReuseSolvers_Interior(PC pc, Vec rhs, Vec sol) 202 { 203 PetscFunctionBegin; 204 PetscCall(PCBDDCReuseSolvers_Solve_Private(pc, rhs, sol, PETSC_FALSE, PETSC_FALSE)); 205 PetscFunctionReturn(PETSC_SUCCESS); 206 } 207 208 static PetscErrorCode PCBDDCReuseSolvers_InteriorTranspose(PC pc, Vec rhs, Vec sol) 209 { 210 PetscFunctionBegin; 211 PetscCall(PCBDDCReuseSolvers_Solve_Private(pc, rhs, sol, PETSC_TRUE, PETSC_FALSE)); 212 PetscFunctionReturn(PETSC_SUCCESS); 213 } 214 215 static PetscErrorCode PCBDDCReuseSolvers_View(PC pc, PetscViewer viewer) 216 { 217 PCBDDCReuseSolvers ctx; 218 PetscBool iascii; 219 220 PetscFunctionBegin; 221 PetscCall(PCShellGetContext(pc, &ctx)); 222 PetscCall(PetscObjectTypeCompare((PetscObject)viewer, PETSCVIEWERASCII, &iascii)); 223 if (iascii) PetscCall(PetscViewerPushFormat(viewer, PETSC_VIEWER_ASCII_INFO)); 224 PetscCall(MatView(ctx->F, viewer)); 225 if (iascii) PetscCall(PetscViewerPopFormat(viewer)); 226 PetscFunctionReturn(PETSC_SUCCESS); 227 } 228 229 static PetscErrorCode PCBDDCReuseSolversReset(PCBDDCReuseSolvers reuse) 230 { 231 PetscInt i; 232 233 PetscFunctionBegin; 234 PetscCall(MatDestroy(&reuse->F)); 235 PetscCall(VecDestroy(&reuse->sol)); 236 PetscCall(VecDestroy(&reuse->rhs)); 237 PetscCall(PCDestroy(&reuse->interior_solver)); 238 PetscCall(PCDestroy(&reuse->correction_solver)); 239 PetscCall(ISDestroy(&reuse->is_R)); 240 PetscCall(ISDestroy(&reuse->is_B)); 241 PetscCall(VecScatterDestroy(&reuse->correction_scatter_B)); 242 PetscCall(VecDestroy(&reuse->sol_B)); 243 PetscCall(VecDestroy(&reuse->rhs_B)); 244 for (i = 0; i < reuse->benign_n; i++) PetscCall(ISDestroy(&reuse->benign_zerodiag_subs[i])); 245 PetscCall(PetscFree(reuse->benign_zerodiag_subs)); 246 PetscCall(PetscFree(reuse->benign_save_vals)); 247 PetscCall(MatDestroy(&reuse->benign_csAIB)); 248 PetscCall(MatDestroy(&reuse->benign_AIIm1ones)); 249 PetscCall(VecDestroy(&reuse->benign_corr_work)); 250 PetscCall(VecDestroy(&reuse->benign_dummy_schur_vec)); 251 PetscFunctionReturn(PETSC_SUCCESS); 252 } 253 254 static PetscErrorCode PCBDDCReuseSolvers_Destroy(PC pc) 255 { 256 PCBDDCReuseSolvers ctx; 257 258 PetscFunctionBegin; 259 PetscCall(PCShellGetContext(pc, &ctx)); 260 PetscCall(PCBDDCReuseSolversReset(ctx)); 261 PetscCall(PetscFree(ctx)); 262 PetscCall(PCShellSetContext(pc, NULL)); 263 PetscFunctionReturn(PETSC_SUCCESS); 264 } 265 266 static PetscErrorCode PCBDDCComputeExplicitSchur(Mat M, PetscBool issym, MatReuse reuse, Mat *S) 267 { 268 Mat B, C, D, Bd, Cd, AinvBd; 269 KSP ksp; 270 PC pc; 271 PetscBool isLU, isILU, isCHOL, Bdense, Cdense; 272 PetscReal fill = 2.0; 273 PetscInt n_I; 274 PetscMPIInt size; 275 276 PetscFunctionBegin; 277 PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)M), &size)); 278 PetscCheck(size == 1, PETSC_COMM_SELF, PETSC_ERR_SUP, "Not for parallel matrices"); 279 if (reuse == MAT_REUSE_MATRIX) { 280 PetscBool Sdense; 281 282 PetscCall(PetscObjectTypeCompare((PetscObject)*S, MATSEQDENSE, &Sdense)); 283 PetscCheck(Sdense, PetscObjectComm((PetscObject)M), PETSC_ERR_SUP, "S should dense"); 284 } 285 PetscCall(MatSchurComplementGetSubMatrices(M, NULL, NULL, &B, &C, &D)); 286 PetscCall(MatSchurComplementGetKSP(M, &ksp)); 287 PetscCall(KSPGetPC(ksp, &pc)); 288 PetscCall(PetscObjectTypeCompare((PetscObject)pc, PCLU, &isLU)); 289 PetscCall(PetscObjectTypeCompare((PetscObject)pc, PCILU, &isILU)); 290 PetscCall(PetscObjectTypeCompare((PetscObject)pc, PCCHOLESKY, &isCHOL)); 291 PetscCall(PetscObjectTypeCompare((PetscObject)B, MATSEQDENSE, &Bdense)); 292 PetscCall(PetscObjectTypeCompare((PetscObject)C, MATSEQDENSE, &Cdense)); 293 PetscCall(MatGetSize(B, &n_I, NULL)); 294 if (n_I) { 295 if (!Bdense) { 296 PetscCall(MatConvert(B, MATSEQDENSE, MAT_INITIAL_MATRIX, &Bd)); 297 } else { 298 Bd = B; 299 } 300 301 if (isLU || isILU || isCHOL) { 302 Mat fact; 303 PetscCall(KSPSetUp(ksp)); 304 PetscCall(PCFactorGetMatrix(pc, &fact)); 305 PetscCall(MatDuplicate(Bd, MAT_DO_NOT_COPY_VALUES, &AinvBd)); 306 PetscCall(MatMatSolve(fact, Bd, AinvBd)); 307 } else { 308 PetscBool ex = PETSC_TRUE; 309 310 if (ex) { 311 Mat Ainvd; 312 313 PetscCall(PCComputeOperator(pc, MATDENSE, &Ainvd)); 314 PetscCall(MatMatMult(Ainvd, Bd, MAT_INITIAL_MATRIX, fill, &AinvBd)); 315 PetscCall(MatDestroy(&Ainvd)); 316 } else { 317 Vec sol, rhs; 318 PetscScalar *arrayrhs, *arraysol; 319 PetscInt i, nrhs, n; 320 321 PetscCall(MatDuplicate(Bd, MAT_DO_NOT_COPY_VALUES, &AinvBd)); 322 PetscCall(MatGetSize(Bd, &n, &nrhs)); 323 PetscCall(MatDenseGetArray(Bd, &arrayrhs)); 324 PetscCall(MatDenseGetArray(AinvBd, &arraysol)); 325 PetscCall(KSPGetSolution(ksp, &sol)); 326 PetscCall(KSPGetRhs(ksp, &rhs)); 327 for (i = 0; i < nrhs; i++) { 328 PetscCall(VecPlaceArray(rhs, arrayrhs + i * n)); 329 PetscCall(VecPlaceArray(sol, arraysol + i * n)); 330 PetscCall(KSPSolve(ksp, rhs, sol)); 331 PetscCall(VecResetArray(rhs)); 332 PetscCall(VecResetArray(sol)); 333 } 334 PetscCall(MatDenseRestoreArray(Bd, &arrayrhs)); 335 PetscCall(MatDenseRestoreArray(AinvBd, &arrayrhs)); 336 } 337 } 338 if (!Bdense & !issym) PetscCall(MatDestroy(&Bd)); 339 340 if (!issym) { 341 if (!Cdense) { 342 PetscCall(MatConvert(C, MATSEQDENSE, MAT_INITIAL_MATRIX, &Cd)); 343 } else { 344 Cd = C; 345 } 346 PetscCall(MatMatMult(Cd, AinvBd, reuse, fill, S)); 347 if (!Cdense) PetscCall(MatDestroy(&Cd)); 348 } else { 349 PetscCall(MatTransposeMatMult(Bd, AinvBd, reuse, fill, S)); 350 if (!Bdense) PetscCall(MatDestroy(&Bd)); 351 } 352 PetscCall(MatDestroy(&AinvBd)); 353 } 354 355 if (D) { 356 Mat Dd; 357 PetscBool Ddense; 358 359 PetscCall(PetscObjectTypeCompare((PetscObject)D, MATSEQDENSE, &Ddense)); 360 if (!Ddense) { 361 PetscCall(MatConvert(D, MATSEQDENSE, MAT_INITIAL_MATRIX, &Dd)); 362 } else { 363 Dd = D; 364 } 365 if (n_I) { 366 PetscCall(MatAYPX(*S, -1.0, Dd, SAME_NONZERO_PATTERN)); 367 } else { 368 if (reuse == MAT_INITIAL_MATRIX) { 369 PetscCall(MatDuplicate(Dd, MAT_COPY_VALUES, S)); 370 } else { 371 PetscCall(MatCopy(Dd, *S, SAME_NONZERO_PATTERN)); 372 } 373 } 374 if (!Ddense) PetscCall(MatDestroy(&Dd)); 375 } else { 376 PetscCall(MatScale(*S, -1.0)); 377 } 378 PetscFunctionReturn(PETSC_SUCCESS); 379 } 380 381 PetscErrorCode PCBDDCSubSchursSetUp(PCBDDCSubSchurs sub_schurs, Mat Ain, Mat Sin, PetscBool exact_schur, PetscInt xadj[], PetscInt adjncy[], PetscInt nlayers, Vec scaling, PetscBool compute_Stilda, PetscBool reuse_solvers, PetscBool benign_trick, PetscInt benign_n, PetscInt benign_p0_lidx[], IS benign_zerodiag_subs[], Mat change, IS change_primal) 382 { 383 Mat F, A_II, A_IB, A_BI, A_BB, AE_II; 384 Mat S_all; 385 Vec gstash, lstash; 386 VecScatter sstash; 387 IS is_I, is_I_layer; 388 IS all_subsets, all_subsets_mult, all_subsets_n; 389 PetscScalar *stasharray, *Bwork; 390 PetscInt *nnz, *all_local_idx_N; 391 PetscInt *auxnum1, *auxnum2; 392 PetscInt i, subset_size, max_subset_size; 393 PetscInt n_B, extra, local_size, global_size; 394 PetscInt local_stash_size; 395 PetscBLASInt B_N, B_ierr, B_lwork, *pivots; 396 MPI_Comm comm_n; 397 PetscBool deluxe = PETSC_TRUE; 398 PetscBool use_potr = PETSC_FALSE, use_sytr = PETSC_FALSE; 399 PetscViewer matl_dbg_viewer = NULL; 400 PetscBool flg; 401 402 PetscFunctionBegin; 403 PetscCall(MatDestroy(&sub_schurs->A)); 404 PetscCall(MatDestroy(&sub_schurs->S)); 405 if (Ain) { 406 PetscCall(PetscObjectReference((PetscObject)Ain)); 407 sub_schurs->A = Ain; 408 } 409 410 PetscCall(PetscObjectReference((PetscObject)Sin)); 411 sub_schurs->S = Sin; 412 if (sub_schurs->schur_explicit) sub_schurs->schur_explicit = (PetscBool)(!!sub_schurs->A); 413 414 /* preliminary checks */ 415 PetscCheck(sub_schurs->schur_explicit || !compute_Stilda, PetscObjectComm((PetscObject)sub_schurs->l2gmap), PETSC_ERR_SUP, "Adaptive selection of constraints requires MUMPS and/or MKL_PARDISO"); 416 417 if (benign_trick) sub_schurs->is_posdef = PETSC_FALSE; 418 419 /* debug (MATLAB) */ 420 if (sub_schurs->debug) { 421 PetscMPIInt size, rank; 422 PetscInt nr, *print_schurs_ranks, print_schurs = PETSC_FALSE; 423 424 PetscCallMPI(MPI_Comm_size(PetscObjectComm((PetscObject)sub_schurs->l2gmap), &size)); 425 PetscCallMPI(MPI_Comm_rank(PetscObjectComm((PetscObject)sub_schurs->l2gmap), &rank)); 426 nr = size; 427 PetscCall(PetscMalloc1(nr, &print_schurs_ranks)); 428 PetscOptionsBegin(PetscObjectComm((PetscObject)sub_schurs->l2gmap), sub_schurs->prefix, "BDDC sub_schurs options", "PC"); 429 PetscCall(PetscOptionsIntArray("-sub_schurs_debug_ranks", "Ranks to debug (all if the option is not used)", NULL, print_schurs_ranks, &nr, &flg)); 430 if (!flg) print_schurs = PETSC_TRUE; 431 else { 432 print_schurs = PETSC_FALSE; 433 for (i = 0; i < nr; i++) 434 if (print_schurs_ranks[i] == rank) { 435 print_schurs = PETSC_TRUE; 436 break; 437 } 438 } 439 PetscOptionsEnd(); 440 PetscCall(PetscFree(print_schurs_ranks)); 441 if (print_schurs) { 442 char filename[256]; 443 444 PetscCall(PetscSNPrintf(filename, sizeof(filename), "sub_schurs_Schur_r%d.m", PetscGlobalRank)); 445 PetscCall(PetscViewerASCIIOpen(PETSC_COMM_SELF, filename, &matl_dbg_viewer)); 446 PetscCall(PetscViewerPushFormat(matl_dbg_viewer, PETSC_VIEWER_ASCII_MATLAB)); 447 } 448 } 449 450 /* restrict work on active processes */ 451 if (sub_schurs->restrict_comm) { 452 PetscSubcomm subcomm; 453 PetscMPIInt color, rank; 454 455 color = 0; 456 if (!sub_schurs->n_subs) color = 1; /* this can happen if we are in a multilevel case or if the subdomain is disconnected */ 457 PetscCallMPI(MPI_Comm_rank(PetscObjectComm((PetscObject)sub_schurs->l2gmap), &rank)); 458 PetscCall(PetscSubcommCreate(PetscObjectComm((PetscObject)sub_schurs->l2gmap), &subcomm)); 459 PetscCall(PetscSubcommSetNumber(subcomm, 2)); 460 PetscCall(PetscSubcommSetTypeGeneral(subcomm, color, rank)); 461 PetscCall(PetscCommDuplicate(PetscSubcommChild(subcomm), &comm_n, NULL)); 462 PetscCall(PetscSubcommDestroy(&subcomm)); 463 if (!sub_schurs->n_subs) { 464 PetscCall(PetscCommDestroy(&comm_n)); 465 PetscFunctionReturn(PETSC_SUCCESS); 466 } 467 } else { 468 PetscCall(PetscCommDuplicate(PetscObjectComm((PetscObject)sub_schurs->l2gmap), &comm_n, NULL)); 469 } 470 471 /* get Schur complement matrices */ 472 if (!sub_schurs->schur_explicit) { 473 Mat tA_IB, tA_BI, tA_BB; 474 PetscBool isseqsbaij; 475 PetscCall(MatSchurComplementGetSubMatrices(sub_schurs->S, &A_II, NULL, &tA_IB, &tA_BI, &tA_BB)); 476 PetscCall(PetscObjectTypeCompare((PetscObject)tA_BB, MATSEQSBAIJ, &isseqsbaij)); 477 if (isseqsbaij) { 478 PetscCall(MatConvert(tA_BB, MATSEQAIJ, MAT_INITIAL_MATRIX, &A_BB)); 479 PetscCall(MatConvert(tA_IB, MATSEQAIJ, MAT_INITIAL_MATRIX, &A_IB)); 480 PetscCall(MatConvert(tA_BI, MATSEQAIJ, MAT_INITIAL_MATRIX, &A_BI)); 481 } else { 482 PetscCall(PetscObjectReference((PetscObject)tA_BB)); 483 A_BB = tA_BB; 484 PetscCall(PetscObjectReference((PetscObject)tA_IB)); 485 A_IB = tA_IB; 486 PetscCall(PetscObjectReference((PetscObject)tA_BI)); 487 A_BI = tA_BI; 488 } 489 } else { 490 A_II = NULL; 491 A_IB = NULL; 492 A_BI = NULL; 493 A_BB = NULL; 494 } 495 S_all = NULL; 496 497 /* determine interior problems */ 498 PetscCall(ISGetLocalSize(sub_schurs->is_I, &i)); 499 if (nlayers >= 0 && i) { /* Interior problems can be different from the original one */ 500 PetscBT touched; 501 const PetscInt *idx_B; 502 PetscInt n_I, n_B, n_local_dofs, n_prev_added, j, layer, *local_numbering; 503 504 PetscCheck(xadj, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Cannot request layering without adjacency"); 505 /* get sizes */ 506 PetscCall(ISGetLocalSize(sub_schurs->is_I, &n_I)); 507 PetscCall(ISGetLocalSize(sub_schurs->is_B, &n_B)); 508 509 PetscCall(PetscMalloc1(n_I + n_B, &local_numbering)); 510 PetscCall(PetscBTCreate(n_I + n_B, &touched)); 511 PetscCall(PetscBTMemzero(n_I + n_B, touched)); 512 513 /* all boundary dofs must be skipped when adding layers */ 514 PetscCall(ISGetIndices(sub_schurs->is_B, &idx_B)); 515 for (j = 0; j < n_B; j++) PetscCall(PetscBTSet(touched, idx_B[j])); 516 PetscCall(PetscArraycpy(local_numbering, idx_B, n_B)); 517 PetscCall(ISRestoreIndices(sub_schurs->is_B, &idx_B)); 518 519 /* add prescribed number of layers of dofs */ 520 n_local_dofs = n_B; 521 n_prev_added = n_B; 522 for (layer = 0; layer < nlayers; layer++) { 523 PetscInt n_added = 0; 524 if (n_local_dofs == n_I + n_B) break; 525 PetscCheck(n_local_dofs <= n_I + n_B, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Error querying layer %" PetscInt_FMT ". Out of bound access (%" PetscInt_FMT " > %" PetscInt_FMT ")", layer, n_local_dofs, n_I + n_B); 526 PetscCall(PCBDDCAdjGetNextLayer_Private(local_numbering + n_local_dofs, n_prev_added, touched, xadj, adjncy, &n_added)); 527 n_prev_added = n_added; 528 n_local_dofs += n_added; 529 if (!n_added) break; 530 } 531 PetscCall(PetscBTDestroy(&touched)); 532 533 /* IS for I layer dofs in original numbering */ 534 PetscCall(ISCreateGeneral(PetscObjectComm((PetscObject)sub_schurs->is_I), n_local_dofs - n_B, local_numbering + n_B, PETSC_COPY_VALUES, &is_I_layer)); 535 PetscCall(PetscFree(local_numbering)); 536 PetscCall(ISSort(is_I_layer)); 537 /* IS for I layer dofs in I numbering */ 538 if (!sub_schurs->schur_explicit) { 539 ISLocalToGlobalMapping ItoNmap; 540 PetscCall(ISLocalToGlobalMappingCreateIS(sub_schurs->is_I, &ItoNmap)); 541 PetscCall(ISGlobalToLocalMappingApplyIS(ItoNmap, IS_GTOLM_DROP, is_I_layer, &is_I)); 542 PetscCall(ISLocalToGlobalMappingDestroy(&ItoNmap)); 543 544 /* II block */ 545 PetscCall(MatCreateSubMatrix(A_II, is_I, is_I, MAT_INITIAL_MATRIX, &AE_II)); 546 } 547 } else { 548 PetscInt n_I; 549 550 /* IS for I dofs in original numbering */ 551 PetscCall(PetscObjectReference((PetscObject)sub_schurs->is_I)); 552 is_I_layer = sub_schurs->is_I; 553 554 /* IS for I dofs in I numbering (strided 1) */ 555 if (!sub_schurs->schur_explicit) { 556 PetscCall(ISGetSize(sub_schurs->is_I, &n_I)); 557 PetscCall(ISCreateStride(PetscObjectComm((PetscObject)sub_schurs->is_I), n_I, 0, 1, &is_I)); 558 559 /* II block is the same */ 560 PetscCall(PetscObjectReference((PetscObject)A_II)); 561 AE_II = A_II; 562 } 563 } 564 565 /* Get info on subset sizes and sum of all subsets sizes */ 566 max_subset_size = 0; 567 local_size = 0; 568 for (i = 0; i < sub_schurs->n_subs; i++) { 569 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 570 max_subset_size = PetscMax(subset_size, max_subset_size); 571 local_size += subset_size; 572 } 573 574 /* Work arrays for local indices */ 575 extra = 0; 576 PetscCall(ISGetLocalSize(sub_schurs->is_B, &n_B)); 577 if (sub_schurs->schur_explicit && is_I_layer) PetscCall(ISGetLocalSize(is_I_layer, &extra)); 578 PetscCall(PetscMalloc1(n_B + extra, &all_local_idx_N)); 579 if (extra) { 580 const PetscInt *idxs; 581 PetscCall(ISGetIndices(is_I_layer, &idxs)); 582 PetscCall(PetscArraycpy(all_local_idx_N, idxs, extra)); 583 PetscCall(ISRestoreIndices(is_I_layer, &idxs)); 584 } 585 PetscCall(PetscMalloc1(sub_schurs->n_subs, &auxnum1)); 586 PetscCall(PetscMalloc1(sub_schurs->n_subs, &auxnum2)); 587 588 /* Get local indices in local numbering */ 589 local_size = 0; 590 local_stash_size = 0; 591 for (i = 0; i < sub_schurs->n_subs; i++) { 592 const PetscInt *idxs; 593 594 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 595 PetscCall(ISGetIndices(sub_schurs->is_subs[i], &idxs)); 596 /* start (smallest in global ordering) and multiplicity */ 597 auxnum1[i] = idxs[0]; 598 auxnum2[i] = subset_size * subset_size; 599 /* subset indices in local numbering */ 600 PetscCall(PetscArraycpy(all_local_idx_N + local_size + extra, idxs, subset_size)); 601 PetscCall(ISRestoreIndices(sub_schurs->is_subs[i], &idxs)); 602 local_size += subset_size; 603 local_stash_size += subset_size * subset_size; 604 } 605 606 /* allocate extra workspace needed only for GETRI or SYTRF */ 607 use_potr = use_sytr = PETSC_FALSE; 608 if (benign_trick || (sub_schurs->is_hermitian && sub_schurs->is_posdef)) { 609 use_potr = PETSC_TRUE; 610 } else if (sub_schurs->is_symmetric) { 611 use_sytr = PETSC_TRUE; 612 } 613 if (local_size && !use_potr) { 614 PetscScalar lwork, dummyscalar = 0.; 615 PetscBLASInt dummyint = 0; 616 617 B_lwork = -1; 618 PetscCall(PetscBLASIntCast(local_size, &B_N)); 619 PetscCall(PetscFPTrapPush(PETSC_FP_TRAP_OFF)); 620 if (use_sytr) { 621 PetscCallBLAS("LAPACKsytrf", LAPACKsytrf_("L", &B_N, &dummyscalar, &B_N, &dummyint, &lwork, &B_lwork, &B_ierr)); 622 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in query to SYTRF Lapack routine %" PetscBLASInt_FMT, B_ierr); 623 } else { 624 PetscCallBLAS("LAPACKgetri", LAPACKgetri_(&B_N, &dummyscalar, &B_N, &dummyint, &lwork, &B_lwork, &B_ierr)); 625 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in query to GETRI Lapack routine %" PetscBLASInt_FMT, B_ierr); 626 } 627 PetscCall(PetscFPTrapPop()); 628 PetscCall(PetscBLASIntCast((PetscInt)PetscRealPart(lwork), &B_lwork)); 629 PetscCall(PetscMalloc2(B_lwork, &Bwork, B_N, &pivots)); 630 } else { 631 Bwork = NULL; 632 pivots = NULL; 633 } 634 635 /* prepare data for summing up properly schurs on subsets */ 636 PetscCall(ISCreateGeneral(comm_n, sub_schurs->n_subs, auxnum1, PETSC_OWN_POINTER, &all_subsets_n)); 637 PetscCall(ISLocalToGlobalMappingApplyIS(sub_schurs->l2gmap, all_subsets_n, &all_subsets)); 638 PetscCall(ISDestroy(&all_subsets_n)); 639 PetscCall(ISCreateGeneral(comm_n, sub_schurs->n_subs, auxnum2, PETSC_OWN_POINTER, &all_subsets_mult)); 640 PetscCall(ISRenumber(all_subsets, all_subsets_mult, &global_size, &all_subsets_n)); 641 PetscCall(ISDestroy(&all_subsets)); 642 PetscCall(ISDestroy(&all_subsets_mult)); 643 PetscCall(ISGetLocalSize(all_subsets_n, &i)); 644 PetscCheck(i == local_stash_size, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Invalid size of new subset! %" PetscInt_FMT " != %" PetscInt_FMT, i, local_stash_size); 645 PetscCall(VecCreateSeqWithArray(PETSC_COMM_SELF, 1, local_stash_size, NULL, &lstash)); 646 PetscCall(VecCreateMPI(comm_n, PETSC_DECIDE, global_size, &gstash)); 647 PetscCall(VecScatterCreate(lstash, NULL, gstash, all_subsets_n, &sstash)); 648 PetscCall(ISDestroy(&all_subsets_n)); 649 650 /* subset indices in local boundary numbering */ 651 if (!sub_schurs->is_Ej_all) { 652 PetscInt *all_local_idx_B; 653 654 PetscCall(PetscMalloc1(local_size, &all_local_idx_B)); 655 PetscCall(ISGlobalToLocalMappingApply(sub_schurs->BtoNmap, IS_GTOLM_DROP, local_size, all_local_idx_N + extra, &subset_size, all_local_idx_B)); 656 PetscCheck(subset_size == local_size, PETSC_COMM_SELF, PETSC_ERR_PLIB, "Error in sub_schurs serial (BtoNmap)! %" PetscInt_FMT " != %" PetscInt_FMT, subset_size, local_size); 657 PetscCall(ISCreateGeneral(PETSC_COMM_SELF, local_size, all_local_idx_B, PETSC_OWN_POINTER, &sub_schurs->is_Ej_all)); 658 } 659 660 if (change) { 661 ISLocalToGlobalMapping BtoS; 662 IS change_primal_B; 663 IS change_primal_all; 664 665 PetscCheck(!sub_schurs->change_primal_sub, PETSC_COMM_SELF, PETSC_ERR_PLIB, "This should not happen"); 666 PetscCheck(!sub_schurs->change, PETSC_COMM_SELF, PETSC_ERR_PLIB, "This should not happen"); 667 PetscCall(PetscMalloc1(sub_schurs->n_subs, &sub_schurs->change_primal_sub)); 668 for (i = 0; i < sub_schurs->n_subs; i++) { 669 ISLocalToGlobalMapping NtoS; 670 PetscCall(ISLocalToGlobalMappingCreateIS(sub_schurs->is_subs[i], &NtoS)); 671 PetscCall(ISGlobalToLocalMappingApplyIS(NtoS, IS_GTOLM_DROP, change_primal, &sub_schurs->change_primal_sub[i])); 672 PetscCall(ISLocalToGlobalMappingDestroy(&NtoS)); 673 } 674 PetscCall(ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap, IS_GTOLM_DROP, change_primal, &change_primal_B)); 675 PetscCall(ISLocalToGlobalMappingCreateIS(sub_schurs->is_Ej_all, &BtoS)); 676 PetscCall(ISGlobalToLocalMappingApplyIS(BtoS, IS_GTOLM_DROP, change_primal_B, &change_primal_all)); 677 PetscCall(ISLocalToGlobalMappingDestroy(&BtoS)); 678 PetscCall(ISDestroy(&change_primal_B)); 679 PetscCall(PetscMalloc1(sub_schurs->n_subs, &sub_schurs->change)); 680 for (i = 0; i < sub_schurs->n_subs; i++) { 681 Mat change_sub; 682 683 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 684 PetscCall(KSPCreate(PETSC_COMM_SELF, &sub_schurs->change[i])); 685 PetscCall(KSPSetNestLevel(sub_schurs->change[i], 1)); /* do not seem to have direct access to a PC from which to get the level of nests */ 686 PetscCall(KSPSetType(sub_schurs->change[i], KSPPREONLY)); 687 if (!sub_schurs->change_with_qr) { 688 PetscCall(MatCreateSubMatrix(change, sub_schurs->is_subs[i], sub_schurs->is_subs[i], MAT_INITIAL_MATRIX, &change_sub)); 689 } else { 690 Mat change_subt; 691 PetscCall(MatCreateSubMatrix(change, sub_schurs->is_subs[i], sub_schurs->is_subs[i], MAT_INITIAL_MATRIX, &change_subt)); 692 PetscCall(MatConvert(change_subt, MATSEQDENSE, MAT_INITIAL_MATRIX, &change_sub)); 693 PetscCall(MatDestroy(&change_subt)); 694 } 695 PetscCall(KSPSetOperators(sub_schurs->change[i], change_sub, change_sub)); 696 PetscCall(MatDestroy(&change_sub)); 697 PetscCall(KSPSetOptionsPrefix(sub_schurs->change[i], sub_schurs->prefix)); 698 PetscCall(KSPAppendOptionsPrefix(sub_schurs->change[i], "sub_schurs_change_")); 699 } 700 PetscCall(ISDestroy(&change_primal_all)); 701 } 702 703 /* Local matrix of all local Schur on subsets (transposed) */ 704 if (!sub_schurs->S_Ej_all) { 705 Mat T; 706 PetscScalar *v; 707 PetscInt *ii, *jj; 708 PetscInt cum, i, j, k; 709 710 /* MatSeqAIJSetPreallocation + MatSetValues is slow for these kind of matrices (may have large blocks) 711 Allocate properly a representative matrix and duplicate */ 712 PetscCall(PetscMalloc3(local_size + 1, &ii, local_stash_size, &jj, local_stash_size, &v)); 713 ii[0] = 0; 714 cum = 0; 715 for (i = 0; i < sub_schurs->n_subs; i++) { 716 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 717 for (j = 0; j < subset_size; j++) { 718 const PetscInt row = cum + j; 719 PetscInt col = cum; 720 721 ii[row + 1] = ii[row] + subset_size; 722 for (k = ii[row]; k < ii[row + 1]; k++) { 723 jj[k] = col; 724 col++; 725 } 726 } 727 cum += subset_size; 728 } 729 PetscCall(MatCreateSeqAIJWithArrays(PETSC_COMM_SELF, local_size, local_size, ii, jj, v, &T)); 730 PetscCall(MatDuplicate(T, MAT_DO_NOT_COPY_VALUES, &sub_schurs->S_Ej_all)); 731 PetscCall(MatDestroy(&T)); 732 PetscCall(PetscFree3(ii, jj, v)); 733 } 734 /* matrices for deluxe scaling and adaptive selection */ 735 if (compute_Stilda) { 736 if (!sub_schurs->sum_S_Ej_tilda_all) PetscCall(MatDuplicate(sub_schurs->S_Ej_all, MAT_DO_NOT_COPY_VALUES, &sub_schurs->sum_S_Ej_tilda_all)); 737 if (!sub_schurs->sum_S_Ej_inv_all && deluxe) PetscCall(MatDuplicate(sub_schurs->S_Ej_all, MAT_DO_NOT_COPY_VALUES, &sub_schurs->sum_S_Ej_inv_all)); 738 } 739 740 /* Compute Schur complements explicitly */ 741 F = NULL; 742 if (!sub_schurs->schur_explicit) { 743 /* this code branch is used when MatFactor with Schur complement support is not present or when explicitly requested; 744 it is not efficient, unless the economic version of the scaling is used */ 745 Mat S_Ej_expl; 746 PetscScalar *work; 747 PetscInt j, *dummy_idx; 748 PetscBool Sdense; 749 750 PetscCall(PetscMalloc2(max_subset_size, &dummy_idx, max_subset_size * max_subset_size, &work)); 751 local_size = 0; 752 for (i = 0; i < sub_schurs->n_subs; i++) { 753 IS is_subset_B; 754 Mat AE_EE, AE_IE, AE_EI, S_Ej; 755 756 /* subsets in original and boundary numbering */ 757 PetscCall(ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap, IS_GTOLM_DROP, sub_schurs->is_subs[i], &is_subset_B)); 758 /* EE block */ 759 PetscCall(MatCreateSubMatrix(A_BB, is_subset_B, is_subset_B, MAT_INITIAL_MATRIX, &AE_EE)); 760 /* IE block */ 761 PetscCall(MatCreateSubMatrix(A_IB, is_I, is_subset_B, MAT_INITIAL_MATRIX, &AE_IE)); 762 /* EI block */ 763 if (sub_schurs->is_symmetric) { 764 PetscCall(MatCreateTranspose(AE_IE, &AE_EI)); 765 } else if (sub_schurs->is_hermitian) { 766 PetscCall(MatCreateHermitianTranspose(AE_IE, &AE_EI)); 767 } else { 768 PetscCall(MatCreateSubMatrix(A_BI, is_subset_B, is_I, MAT_INITIAL_MATRIX, &AE_EI)); 769 } 770 PetscCall(ISDestroy(&is_subset_B)); 771 PetscCall(MatCreateSchurComplement(AE_II, AE_II, AE_IE, AE_EI, AE_EE, &S_Ej)); 772 PetscCall(MatDestroy(&AE_EE)); 773 PetscCall(MatDestroy(&AE_IE)); 774 PetscCall(MatDestroy(&AE_EI)); 775 if (AE_II == A_II) { /* we can reuse the same ksp */ 776 KSP ksp; 777 PetscCall(MatSchurComplementGetKSP(sub_schurs->S, &ksp)); 778 PetscCall(MatSchurComplementSetKSP(S_Ej, ksp)); 779 } else { /* build new ksp object which inherits ksp and pc types from the original one */ 780 KSP origksp, schurksp; 781 PC origpc, schurpc; 782 KSPType ksp_type; 783 PetscInt n_internal; 784 PetscBool ispcnone; 785 786 PetscCall(MatSchurComplementGetKSP(sub_schurs->S, &origksp)); 787 PetscCall(MatSchurComplementGetKSP(S_Ej, &schurksp)); 788 PetscCall(KSPGetType(origksp, &ksp_type)); 789 PetscCall(KSPSetType(schurksp, ksp_type)); 790 PetscCall(KSPGetPC(schurksp, &schurpc)); 791 PetscCall(KSPGetPC(origksp, &origpc)); 792 PetscCall(PetscObjectTypeCompare((PetscObject)origpc, PCNONE, &ispcnone)); 793 if (!ispcnone) { 794 PCType pc_type; 795 PetscCall(PCGetType(origpc, &pc_type)); 796 PetscCall(PCSetType(schurpc, pc_type)); 797 } else { 798 PetscCall(PCSetType(schurpc, PCLU)); 799 } 800 PetscCall(ISGetSize(is_I, &n_internal)); 801 if (!n_internal) { /* UMFPACK gives error with 0 sized problems */ 802 MatSolverType solver = NULL; 803 PetscCall(PCFactorGetMatSolverType(origpc, &solver)); 804 if (solver) PetscCall(PCFactorSetMatSolverType(schurpc, solver)); 805 } 806 PetscCall(KSPSetUp(schurksp)); 807 } 808 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 809 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, subset_size, subset_size, work, &S_Ej_expl)); 810 PetscCall(PCBDDCComputeExplicitSchur(S_Ej, sub_schurs->is_symmetric, MAT_REUSE_MATRIX, &S_Ej_expl)); 811 PetscCall(PetscObjectTypeCompare((PetscObject)S_Ej_expl, MATSEQDENSE, &Sdense)); 812 PetscCheck(Sdense, PETSC_COMM_SELF, PETSC_ERR_SUP, "Not yet implemented for sparse matrices"); 813 for (j = 0; j < subset_size; j++) dummy_idx[j] = local_size + j; 814 PetscCall(MatSetValues(sub_schurs->S_Ej_all, subset_size, dummy_idx, subset_size, dummy_idx, work, INSERT_VALUES)); 815 PetscCall(MatDestroy(&S_Ej)); 816 PetscCall(MatDestroy(&S_Ej_expl)); 817 local_size += subset_size; 818 } 819 PetscCall(PetscFree2(dummy_idx, work)); 820 /* free */ 821 PetscCall(ISDestroy(&is_I)); 822 PetscCall(MatDestroy(&AE_II)); 823 PetscCall(PetscFree(all_local_idx_N)); 824 } else { 825 Mat A, cs_AIB_mat = NULL, benign_AIIm1_ones_mat = NULL; 826 Mat *gdswA; 827 Vec Dall = NULL; 828 IS is_A_all, *is_p_r = NULL; 829 MatType Stype; 830 PetscScalar *work, *S_data, *schur_factor, infty = PETSC_MAX_REAL; 831 PetscScalar *SEj_arr = NULL, *SEjinv_arr = NULL; 832 const PetscScalar *rS_data; 833 PetscInt n, n_I, size_schur, size_active_schur, cum, cum2; 834 PetscBool economic, solver_S, S_lower_triangular = PETSC_FALSE; 835 PetscBool schur_has_vertices, factor_workaround; 836 PetscBool use_cholesky; 837 #if defined(PETSC_HAVE_VIENNACL) || defined(PETSC_HAVE_CUDA) 838 PetscBool oldpin; 839 #endif 840 841 /* get sizes */ 842 n_I = 0; 843 if (is_I_layer) PetscCall(ISGetLocalSize(is_I_layer, &n_I)); 844 economic = PETSC_FALSE; 845 PetscCall(ISGetLocalSize(sub_schurs->is_I, &cum)); 846 if (cum != n_I) economic = PETSC_TRUE; 847 PetscCall(MatGetLocalSize(sub_schurs->A, &n, NULL)); 848 size_active_schur = local_size; 849 850 /* import scaling vector (wrong formulation if we have 3D edges) */ 851 if (scaling && compute_Stilda) { 852 const PetscScalar *array; 853 PetscScalar *array2; 854 const PetscInt *idxs; 855 PetscInt i; 856 857 PetscCall(ISGetIndices(sub_schurs->is_Ej_all, &idxs)); 858 PetscCall(VecCreateSeq(PETSC_COMM_SELF, size_active_schur, &Dall)); 859 PetscCall(VecGetArrayRead(scaling, &array)); 860 PetscCall(VecGetArray(Dall, &array2)); 861 for (i = 0; i < size_active_schur; i++) array2[i] = array[idxs[i]]; 862 PetscCall(VecRestoreArray(Dall, &array2)); 863 PetscCall(VecRestoreArrayRead(scaling, &array)); 864 PetscCall(ISRestoreIndices(sub_schurs->is_Ej_all, &idxs)); 865 deluxe = PETSC_FALSE; 866 } 867 868 /* size active schurs does not count any dirichlet or vertex dof on the interface */ 869 factor_workaround = PETSC_FALSE; 870 schur_has_vertices = PETSC_FALSE; 871 cum = n_I + size_active_schur; 872 if (sub_schurs->is_dir) { 873 const PetscInt *idxs; 874 PetscInt n_dir; 875 876 PetscCall(ISGetLocalSize(sub_schurs->is_dir, &n_dir)); 877 PetscCall(ISGetIndices(sub_schurs->is_dir, &idxs)); 878 PetscCall(PetscArraycpy(all_local_idx_N + cum, idxs, n_dir)); 879 PetscCall(ISRestoreIndices(sub_schurs->is_dir, &idxs)); 880 cum += n_dir; 881 if (!sub_schurs->gdsw) factor_workaround = PETSC_TRUE; 882 } 883 /* include the primal vertices in the Schur complement */ 884 if (exact_schur && sub_schurs->is_vertices && (compute_Stilda || benign_n)) { 885 PetscInt n_v; 886 887 PetscCall(ISGetLocalSize(sub_schurs->is_vertices, &n_v)); 888 if (n_v) { 889 const PetscInt *idxs; 890 891 PetscCall(ISGetIndices(sub_schurs->is_vertices, &idxs)); 892 PetscCall(PetscArraycpy(all_local_idx_N + cum, idxs, n_v)); 893 PetscCall(ISRestoreIndices(sub_schurs->is_vertices, &idxs)); 894 cum += n_v; 895 if (!sub_schurs->gdsw) factor_workaround = PETSC_TRUE; 896 schur_has_vertices = PETSC_TRUE; 897 } 898 } 899 size_schur = cum - n_I; 900 PetscCall(ISCreateGeneral(PETSC_COMM_SELF, cum, all_local_idx_N, PETSC_OWN_POINTER, &is_A_all)); 901 #if defined(PETSC_HAVE_VIENNACL) || defined(PETSC_HAVE_CUDA) 902 oldpin = sub_schurs->A->boundtocpu; 903 PetscCall(MatBindToCPU(sub_schurs->A, PETSC_TRUE)); 904 #endif 905 if (cum == n) { 906 PetscCall(ISSetPermutation(is_A_all)); 907 PetscCall(MatPermute(sub_schurs->A, is_A_all, is_A_all, &A)); 908 } else { 909 PetscCall(MatCreateSubMatrix(sub_schurs->A, is_A_all, is_A_all, MAT_INITIAL_MATRIX, &A)); 910 } 911 #if defined(PETSC_HAVE_VIENNACL) || defined(PETSC_HAVE_CUDA) 912 PetscCall(MatBindToCPU(sub_schurs->A, oldpin)); 913 #endif 914 PetscCall(MatSetOptionsPrefixFactor(A, sub_schurs->prefix)); 915 PetscCall(MatAppendOptionsPrefixFactor(A, "sub_schurs_")); 916 917 /* if we actually change the basis for the pressures, LDL^T factors will use a lot of memory 918 this is a workaround */ 919 if (benign_n) { 920 Vec v, benign_AIIm1_ones; 921 ISLocalToGlobalMapping N_to_reor; 922 IS is_p0, is_p0_p; 923 PetscScalar *cs_AIB, *AIIm1_data; 924 PetscInt sizeA; 925 926 PetscCall(ISLocalToGlobalMappingCreateIS(is_A_all, &N_to_reor)); 927 PetscCall(ISCreateGeneral(PETSC_COMM_SELF, benign_n, benign_p0_lidx, PETSC_COPY_VALUES, &is_p0)); 928 PetscCall(ISGlobalToLocalMappingApplyIS(N_to_reor, IS_GTOLM_DROP, is_p0, &is_p0_p)); 929 PetscCall(ISDestroy(&is_p0)); 930 PetscCall(MatCreateVecs(A, &v, &benign_AIIm1_ones)); 931 PetscCall(VecGetSize(v, &sizeA)); 932 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, sizeA, benign_n, NULL, &benign_AIIm1_ones_mat)); 933 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, size_schur, benign_n, NULL, &cs_AIB_mat)); 934 PetscCall(MatDenseGetArray(cs_AIB_mat, &cs_AIB)); 935 PetscCall(MatDenseGetArray(benign_AIIm1_ones_mat, &AIIm1_data)); 936 PetscCall(PetscMalloc1(benign_n, &is_p_r)); 937 /* compute colsum of A_IB restricted to pressures */ 938 for (i = 0; i < benign_n; i++) { 939 const PetscScalar *array; 940 const PetscInt *idxs; 941 PetscInt j, nz; 942 943 PetscCall(ISGlobalToLocalMappingApplyIS(N_to_reor, IS_GTOLM_DROP, benign_zerodiag_subs[i], &is_p_r[i])); 944 PetscCall(ISGetLocalSize(is_p_r[i], &nz)); 945 PetscCall(ISGetIndices(is_p_r[i], &idxs)); 946 for (j = 0; j < nz; j++) AIIm1_data[idxs[j] + sizeA * i] = 1.; 947 PetscCall(ISRestoreIndices(is_p_r[i], &idxs)); 948 PetscCall(VecPlaceArray(benign_AIIm1_ones, AIIm1_data + sizeA * i)); 949 PetscCall(MatMult(A, benign_AIIm1_ones, v)); 950 PetscCall(VecResetArray(benign_AIIm1_ones)); 951 PetscCall(VecGetArrayRead(v, &array)); 952 for (j = 0; j < size_schur; j++) { 953 #if defined(PETSC_USE_COMPLEX) 954 cs_AIB[i * size_schur + j] = (PetscRealPart(array[j + n_I]) / nz + PETSC_i * (PetscImaginaryPart(array[j + n_I]) / nz)); 955 #else 956 cs_AIB[i * size_schur + j] = array[j + n_I] / nz; 957 #endif 958 } 959 PetscCall(VecRestoreArrayRead(v, &array)); 960 } 961 PetscCall(MatDenseRestoreArray(cs_AIB_mat, &cs_AIB)); 962 PetscCall(MatDenseRestoreArray(benign_AIIm1_ones_mat, &AIIm1_data)); 963 PetscCall(VecDestroy(&v)); 964 PetscCall(VecDestroy(&benign_AIIm1_ones)); 965 PetscCall(MatSetOption(A, MAT_KEEP_NONZERO_PATTERN, PETSC_FALSE)); 966 PetscCall(MatSetOption(A, MAT_NEW_NONZERO_LOCATION_ERR, PETSC_FALSE)); 967 PetscCall(MatSetOption(A, MAT_NEW_NONZERO_ALLOCATION_ERR, PETSC_FALSE)); 968 PetscCall(MatZeroRowsColumnsIS(A, is_p0_p, 1.0, NULL, NULL)); 969 PetscCall(ISDestroy(&is_p0_p)); 970 PetscCall(ISLocalToGlobalMappingDestroy(&N_to_reor)); 971 } 972 PetscCall(MatSetOption(A, MAT_SYMMETRIC, sub_schurs->is_symmetric)); 973 PetscCall(MatSetOption(A, MAT_HERMITIAN, sub_schurs->is_hermitian)); 974 PetscCall(MatSetOption(A, MAT_SPD, sub_schurs->is_posdef)); 975 976 /* for complexes, symmetric and hermitian at the same time implies null imaginary part */ 977 use_cholesky = (PetscBool)((use_potr || use_sytr) && sub_schurs->is_hermitian && sub_schurs->is_symmetric); 978 979 /* when using the benign subspace trick, the local Schur complements are SPD */ 980 /* MKL_PARDISO does not handle well the computation of a Schur complement from a symmetric indefinite factorization 981 Use LU and adapt pivoting perturbation (still, solution is not as accurate as with using MUMPS) */ 982 if (benign_trick) { 983 sub_schurs->is_posdef = PETSC_TRUE; 984 PetscCall(PetscStrcmp(sub_schurs->mat_solver_type, MATSOLVERMKL_PARDISO, &flg)); 985 if (flg) use_cholesky = PETSC_FALSE; 986 } 987 988 if (n_I) { 989 IS is_schur; 990 char stype[64]; 991 PetscBool gpu = PETSC_FALSE; 992 993 if (use_cholesky) { 994 PetscCall(MatGetFactor(A, sub_schurs->mat_solver_type, MAT_FACTOR_CHOLESKY, &F)); 995 } else { 996 PetscCall(MatGetFactor(A, sub_schurs->mat_solver_type, MAT_FACTOR_LU, &F)); 997 } 998 PetscCheck(F, PetscObjectComm((PetscObject)A), PETSC_ERR_SUP, "MatGetFactor not supported by matrix instance of type %s. Rerun with \"-info :mat | grep MatGetFactor_\" for additional information", ((PetscObject)A)->type_name); 999 PetscCall(MatSetErrorIfFailure(A, PETSC_TRUE)); 1000 #if defined(PETSC_HAVE_MKL_PARDISO) 1001 if (benign_trick) PetscCall(MatMkl_PardisoSetCntl(F, 10, 10)); 1002 #endif 1003 /* subsets ordered last */ 1004 PetscCall(ISCreateStride(PETSC_COMM_SELF, size_schur, n_I, 1, &is_schur)); 1005 PetscCall(MatFactorSetSchurIS(F, is_schur)); 1006 PetscCall(ISDestroy(&is_schur)); 1007 1008 /* factorization step */ 1009 if (use_cholesky) { 1010 PetscCall(MatCholeskyFactorSymbolic(F, A, NULL, NULL)); 1011 /* be sure that icntl 19 is not set by command line */ 1012 PetscCall(MatMumpsSetIcntl(F, 19, 2)); 1013 PetscCall(MatCholeskyFactorNumeric(F, A, NULL)); 1014 S_lower_triangular = PETSC_TRUE; 1015 } else { 1016 PetscCall(MatLUFactorSymbolic(F, A, NULL, NULL, NULL)); 1017 /* be sure that icntl 19 is not set by command line */ 1018 PetscCall(MatMumpsSetIcntl(F, 19, 3)); 1019 PetscCall(MatLUFactorNumeric(F, A, NULL)); 1020 } 1021 PetscCall(MatViewFromOptions(F, (PetscObject)A, "-mat_factor_view")); 1022 1023 if (matl_dbg_viewer) { 1024 Mat S; 1025 IS is; 1026 1027 PetscCall(PetscObjectSetName((PetscObject)A, "A")); 1028 PetscCall(MatView(A, matl_dbg_viewer)); 1029 PetscCall(MatFactorCreateSchurComplement(F, &S, NULL)); 1030 PetscCall(PetscObjectSetName((PetscObject)S, "S")); 1031 PetscCall(MatView(S, matl_dbg_viewer)); 1032 PetscCall(MatDestroy(&S)); 1033 PetscCall(ISCreateStride(PETSC_COMM_SELF, n_I, 0, 1, &is)); 1034 PetscCall(PetscObjectSetName((PetscObject)is, "I")); 1035 PetscCall(ISView(is, matl_dbg_viewer)); 1036 PetscCall(ISDestroy(&is)); 1037 PetscCall(ISCreateStride(PETSC_COMM_SELF, size_schur, n_I, 1, &is)); 1038 PetscCall(PetscObjectSetName((PetscObject)is, "B")); 1039 PetscCall(ISView(is, matl_dbg_viewer)); 1040 PetscCall(ISDestroy(&is)); 1041 PetscCall(PetscObjectSetName((PetscObject)is_A_all, "IA")); 1042 PetscCall(ISView(is_A_all, matl_dbg_viewer)); 1043 for (i = 0, cum = 0; i < sub_schurs->n_subs; i++) { 1044 IS is; 1045 char name[16]; 1046 1047 PetscCall(PetscSNPrintf(name, sizeof(name), "IE%" PetscInt_FMT, i)); 1048 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 1049 PetscCall(ISCreateStride(PETSC_COMM_SELF, subset_size, cum, 1, &is)); 1050 PetscCall(PetscObjectSetName((PetscObject)is, name)); 1051 PetscCall(ISView(is, matl_dbg_viewer)); 1052 PetscCall(ISDestroy(&is)); 1053 if (sub_schurs->change) { 1054 Mat T; 1055 1056 PetscCall(PetscSNPrintf(name, sizeof(name), "TE%" PetscInt_FMT, i)); 1057 PetscCall(KSPGetOperators(sub_schurs->change[i], &T, NULL)); 1058 PetscCall(PetscObjectSetName((PetscObject)T, name)); 1059 PetscCall(MatView(T, matl_dbg_viewer)); 1060 PetscCall(PetscSNPrintf(name, sizeof(name), "ITE%" PetscInt_FMT, i)); 1061 PetscCall(PetscObjectSetName((PetscObject)sub_schurs->change_primal_sub[i], name)); 1062 PetscCall(ISView(sub_schurs->change_primal_sub[i], matl_dbg_viewer)); 1063 } 1064 cum += subset_size; 1065 } 1066 PetscCall(PetscViewerFlush(matl_dbg_viewer)); 1067 } 1068 1069 /* get explicit Schur Complement computed during numeric factorization */ 1070 PetscCall(MatFactorGetSchurComplement(F, &S_all, NULL)); 1071 PetscCall(PetscStrncpy(stype, MATSEQDENSE, sizeof(stype))); 1072 #if defined(PETSC_HAVE_CUDA) 1073 PetscCall(PetscObjectTypeCompareAny((PetscObject)A, &gpu, MATSEQAIJVIENNACL, MATSEQAIJCUSPARSE, "")); 1074 #endif 1075 if (gpu) PetscCall(PetscStrncpy(stype, MATSEQDENSECUDA, sizeof(stype))); 1076 PetscCall(PetscOptionsGetString(NULL, sub_schurs->prefix, "-sub_schurs_schur_mat_type", stype, sizeof(stype), NULL)); 1077 PetscCall(MatConvert(S_all, stype, MAT_INPLACE_MATRIX, &S_all)); 1078 PetscCall(MatSetOption(S_all, MAT_SPD, sub_schurs->is_posdef)); 1079 PetscCall(MatSetOption(S_all, MAT_HERMITIAN, sub_schurs->is_hermitian)); 1080 PetscCall(MatGetType(S_all, &Stype)); 1081 1082 /* we can reuse the solvers if we are not using the economic version */ 1083 reuse_solvers = (PetscBool)(reuse_solvers && !economic); 1084 if (!sub_schurs->gdsw) { 1085 factor_workaround = (PetscBool)(reuse_solvers && factor_workaround); 1086 if (!sub_schurs->is_posdef && factor_workaround && compute_Stilda && size_active_schur) reuse_solvers = factor_workaround = PETSC_FALSE; 1087 } 1088 solver_S = PETSC_TRUE; 1089 1090 /* update the Schur complement with the change of basis on the pressures */ 1091 if (benign_n) { 1092 const PetscScalar *cs_AIB; 1093 PetscScalar *S_data, *AIIm1_data; 1094 Mat S2 = NULL, S3 = NULL; /* dbg */ 1095 PetscScalar *S2_data, *S3_data; /* dbg */ 1096 Vec v, benign_AIIm1_ones; 1097 PetscInt sizeA; 1098 1099 PetscCall(MatDenseGetArray(S_all, &S_data)); 1100 PetscCall(MatCreateVecs(A, &v, &benign_AIIm1_ones)); 1101 PetscCall(VecGetSize(v, &sizeA)); 1102 PetscCall(MatMumpsSetIcntl(F, 26, 0)); 1103 #if defined(PETSC_HAVE_MKL_PARDISO) 1104 PetscCall(MatMkl_PardisoSetCntl(F, 70, 1)); 1105 #endif 1106 PetscCall(MatDenseGetArrayRead(cs_AIB_mat, &cs_AIB)); 1107 PetscCall(MatDenseGetArray(benign_AIIm1_ones_mat, &AIIm1_data)); 1108 if (matl_dbg_viewer) { 1109 PetscCall(MatDuplicate(S_all, MAT_DO_NOT_COPY_VALUES, &S2)); 1110 PetscCall(MatDuplicate(S_all, MAT_DO_NOT_COPY_VALUES, &S3)); 1111 PetscCall(MatDenseGetArray(S2, &S2_data)); 1112 PetscCall(MatDenseGetArray(S3, &S3_data)); 1113 } 1114 for (i = 0; i < benign_n; i++) { 1115 PetscScalar *array, sum = 0., one = 1., *sums; 1116 const PetscInt *idxs; 1117 PetscInt k, j, nz; 1118 PetscBLASInt B_k, B_n; 1119 1120 PetscCall(PetscCalloc1(benign_n, &sums)); 1121 PetscCall(VecPlaceArray(benign_AIIm1_ones, AIIm1_data + sizeA * i)); 1122 PetscCall(VecCopy(benign_AIIm1_ones, v)); 1123 PetscCall(MatSolve(F, v, benign_AIIm1_ones)); 1124 PetscCall(MatMult(A, benign_AIIm1_ones, v)); 1125 PetscCall(VecResetArray(benign_AIIm1_ones)); 1126 /* p0 dofs (eliminated) are excluded from the sums */ 1127 for (k = 0; k < benign_n; k++) { 1128 PetscCall(ISGetLocalSize(is_p_r[k], &nz)); 1129 PetscCall(ISGetIndices(is_p_r[k], &idxs)); 1130 for (j = 0; j < nz - 1; j++) sums[k] -= AIIm1_data[idxs[j] + sizeA * i]; 1131 PetscCall(ISRestoreIndices(is_p_r[k], &idxs)); 1132 } 1133 PetscCall(VecGetArrayRead(v, (const PetscScalar **)&array)); 1134 if (matl_dbg_viewer) { 1135 Vec vv; 1136 char name[16]; 1137 1138 PetscCall(VecCreateSeqWithArray(PETSC_COMM_SELF, 1, size_schur, array + n_I, &vv)); 1139 PetscCall(PetscSNPrintf(name, sizeof(name), "Pvs%" PetscInt_FMT, i)); 1140 PetscCall(PetscObjectSetName((PetscObject)vv, name)); 1141 PetscCall(VecView(vv, matl_dbg_viewer)); 1142 } 1143 /* perform sparse rank updates on symmetric Schur (TODO: move outside of the loop?) */ 1144 /* cs_AIB already scaled by 1./nz */ 1145 B_k = 1; 1146 PetscCall(PetscBLASIntCast(size_schur, &B_n)); 1147 for (k = 0; k < benign_n; k++) { 1148 sum = sums[k]; 1149 1150 if (PetscAbsScalar(sum) == 0.0) continue; 1151 if (k == i) { 1152 if (B_n) PetscCallBLAS("BLASsyrk", BLASsyrk_("L", "N", &B_n, &B_k, &sum, cs_AIB + i * size_schur, &B_n, &one, S_data, &B_n)); 1153 if (matl_dbg_viewer && B_n) PetscCallBLAS("BLASsyrk", BLASsyrk_("L", "N", &B_n, &B_k, &sum, cs_AIB + i * size_schur, &B_n, &one, S3_data, &B_n)); 1154 } else { /* XXX Is it correct to use symmetric rank-2 update with half of the sum? */ 1155 sum /= 2.0; 1156 if (B_n) PetscCallBLAS("BLASsyr2k", BLASsyr2k_("L", "N", &B_n, &B_k, &sum, cs_AIB + k * size_schur, &B_n, cs_AIB + i * size_schur, &B_n, &one, S_data, &B_n)); 1157 if (matl_dbg_viewer && B_n) PetscCallBLAS("BLASsyr2k", BLASsyr2k_("L", "N", &B_n, &B_k, &sum, cs_AIB + k * size_schur, &B_n, cs_AIB + i * size_schur, &B_n, &one, S3_data, &B_n)); 1158 } 1159 } 1160 sum = 1.; 1161 if (B_n) PetscCallBLAS("BLASsyr2k", BLASsyr2k_("L", "N", &B_n, &B_k, &sum, array + n_I, &B_n, cs_AIB + i * size_schur, &B_n, &one, S_data, &B_n)); 1162 if (matl_dbg_viewer && B_n) PetscCallBLAS("BLASsyr2k", BLASsyr2k_("L", "N", &B_n, &B_k, &sum, array + n_I, &B_n, cs_AIB + i * size_schur, &B_n, &one, S2_data, &B_n)); 1163 PetscCall(VecRestoreArrayRead(v, (const PetscScalar **)&array)); 1164 /* set p0 entry of AIIm1_ones to zero */ 1165 PetscCall(ISGetLocalSize(is_p_r[i], &nz)); 1166 PetscCall(ISGetIndices(is_p_r[i], &idxs)); 1167 for (j = 0; j < benign_n; j++) AIIm1_data[idxs[nz - 1] + sizeA * j] = 0.; 1168 PetscCall(ISRestoreIndices(is_p_r[i], &idxs)); 1169 PetscCall(PetscFree(sums)); 1170 } 1171 PetscCall(VecDestroy(&benign_AIIm1_ones)); 1172 if (matl_dbg_viewer) { 1173 PetscCall(MatDenseRestoreArray(S2, &S2_data)); 1174 PetscCall(MatDenseRestoreArray(S3, &S3_data)); 1175 } 1176 if (!S_lower_triangular) { /* I need to expand the upper triangular data (column-oriented) */ 1177 PetscInt k, j; 1178 for (k = 0; k < size_schur; k++) { 1179 for (j = k; j < size_schur; j++) S_data[j * size_schur + k] = PetscConj(S_data[k * size_schur + j]); 1180 } 1181 } 1182 1183 /* restore defaults */ 1184 PetscCall(MatMumpsSetIcntl(F, 26, -1)); 1185 #if defined(PETSC_HAVE_MKL_PARDISO) 1186 PetscCall(MatMkl_PardisoSetCntl(F, 70, 0)); 1187 #endif 1188 PetscCall(MatDenseRestoreArrayRead(cs_AIB_mat, &cs_AIB)); 1189 PetscCall(MatDenseRestoreArray(benign_AIIm1_ones_mat, &AIIm1_data)); 1190 PetscCall(VecDestroy(&v)); 1191 PetscCall(MatDenseRestoreArray(S_all, &S_data)); 1192 if (matl_dbg_viewer) { 1193 Mat S; 1194 1195 PetscCall(MatFactorRestoreSchurComplement(F, &S_all, MAT_FACTOR_SCHUR_UNFACTORED)); 1196 PetscCall(MatFactorCreateSchurComplement(F, &S, NULL)); 1197 PetscCall(PetscObjectSetName((PetscObject)S, "Sb")); 1198 PetscCall(MatView(S, matl_dbg_viewer)); 1199 PetscCall(MatDestroy(&S)); 1200 PetscCall(PetscObjectSetName((PetscObject)S2, "S2P")); 1201 PetscCall(MatView(S2, matl_dbg_viewer)); 1202 PetscCall(PetscObjectSetName((PetscObject)S3, "S3P")); 1203 PetscCall(MatView(S3, matl_dbg_viewer)); 1204 PetscCall(PetscObjectSetName((PetscObject)cs_AIB_mat, "cs")); 1205 PetscCall(MatView(cs_AIB_mat, matl_dbg_viewer)); 1206 PetscCall(MatFactorGetSchurComplement(F, &S_all, NULL)); 1207 } 1208 PetscCall(MatDestroy(&S2)); 1209 PetscCall(MatDestroy(&S3)); 1210 } 1211 if (!reuse_solvers) { 1212 for (i = 0; i < benign_n; i++) PetscCall(ISDestroy(&is_p_r[i])); 1213 PetscCall(PetscFree(is_p_r)); 1214 PetscCall(MatDestroy(&cs_AIB_mat)); 1215 PetscCall(MatDestroy(&benign_AIIm1_ones_mat)); 1216 } 1217 } else { /* we can't use MatFactor when size_schur == size_of_the_problem */ 1218 PetscCall(MatConvert(A, MATSEQDENSE, MAT_INITIAL_MATRIX, &S_all)); 1219 PetscCall(MatGetType(S_all, &Stype)); 1220 reuse_solvers = PETSC_FALSE; /* TODO: why we can't reuse the solvers here? */ 1221 factor_workaround = PETSC_FALSE; 1222 solver_S = PETSC_FALSE; 1223 } 1224 1225 if (reuse_solvers) { 1226 Mat A_II, pA_II, Afake; 1227 Vec vec1_B; 1228 PCBDDCReuseSolvers msolv_ctx; 1229 PetscInt n_R; 1230 1231 if (sub_schurs->reuse_solver) { 1232 PetscCall(PCBDDCReuseSolversReset(sub_schurs->reuse_solver)); 1233 } else { 1234 PetscCall(PetscNew(&sub_schurs->reuse_solver)); 1235 } 1236 msolv_ctx = sub_schurs->reuse_solver; 1237 PetscCall(MatSchurComplementGetSubMatrices(sub_schurs->S, &A_II, &pA_II, NULL, NULL, NULL)); 1238 PetscCall(PetscObjectReference((PetscObject)F)); 1239 msolv_ctx->F = F; 1240 PetscCall(MatCreateVecs(F, &msolv_ctx->sol, NULL)); 1241 /* currently PETSc has no support for MatSolve(F,x,x), so cheat and let rhs and sol share the same memory */ 1242 { 1243 PetscScalar *array; 1244 PetscInt n; 1245 1246 PetscCall(VecGetLocalSize(msolv_ctx->sol, &n)); 1247 PetscCall(VecGetArray(msolv_ctx->sol, &array)); 1248 PetscCall(VecCreateSeqWithArray(PetscObjectComm((PetscObject)msolv_ctx->sol), 1, n, array, &msolv_ctx->rhs)); 1249 PetscCall(VecRestoreArray(msolv_ctx->sol, &array)); 1250 } 1251 msolv_ctx->has_vertices = schur_has_vertices; 1252 1253 /* interior solver */ 1254 PetscCall(PCCreate(PetscObjectComm((PetscObject)A_II), &msolv_ctx->interior_solver)); 1255 PetscCall(PCSetOperators(msolv_ctx->interior_solver, A_II, pA_II)); 1256 PetscCall(PCSetType(msolv_ctx->interior_solver, PCSHELL)); 1257 PetscCall(PCShellSetName(msolv_ctx->interior_solver, "Interior solver (w/o Schur factorization)")); 1258 PetscCall(PCShellSetContext(msolv_ctx->interior_solver, msolv_ctx)); 1259 PetscCall(PCShellSetView(msolv_ctx->interior_solver, PCBDDCReuseSolvers_View)); 1260 PetscCall(PCShellSetApply(msolv_ctx->interior_solver, PCBDDCReuseSolvers_Interior)); 1261 PetscCall(PCShellSetApplyTranspose(msolv_ctx->interior_solver, PCBDDCReuseSolvers_InteriorTranspose)); 1262 if (sub_schurs->gdsw) PetscCall(PCShellSetDestroy(msolv_ctx->interior_solver, PCBDDCReuseSolvers_Destroy)); 1263 1264 /* correction solver */ 1265 if (!sub_schurs->gdsw) { 1266 PetscCall(PCCreate(PetscObjectComm((PetscObject)A_II), &msolv_ctx->correction_solver)); 1267 PetscCall(PCSetType(msolv_ctx->correction_solver, PCSHELL)); 1268 PetscCall(PCShellSetName(msolv_ctx->correction_solver, "Correction solver (with Schur factorization)")); 1269 PetscCall(PCShellSetContext(msolv_ctx->correction_solver, msolv_ctx)); 1270 PetscCall(PCShellSetView(msolv_ctx->interior_solver, PCBDDCReuseSolvers_View)); 1271 PetscCall(PCShellSetApply(msolv_ctx->correction_solver, PCBDDCReuseSolvers_Correction)); 1272 PetscCall(PCShellSetApplyTranspose(msolv_ctx->correction_solver, PCBDDCReuseSolvers_CorrectionTranspose)); 1273 1274 /* scatter and vecs for Schur complement solver */ 1275 PetscCall(MatCreateVecs(S_all, &msolv_ctx->sol_B, &msolv_ctx->rhs_B)); 1276 PetscCall(MatCreateVecs(sub_schurs->S, &vec1_B, NULL)); 1277 if (!schur_has_vertices) { 1278 PetscCall(ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap, IS_GTOLM_DROP, is_A_all, &msolv_ctx->is_B)); 1279 PetscCall(VecScatterCreate(vec1_B, msolv_ctx->is_B, msolv_ctx->sol_B, NULL, &msolv_ctx->correction_scatter_B)); 1280 PetscCall(PetscObjectReference((PetscObject)is_A_all)); 1281 msolv_ctx->is_R = is_A_all; 1282 } else { 1283 IS is_B_all; 1284 const PetscInt *idxs; 1285 PetscInt dual, n_v, n; 1286 1287 PetscCall(ISGetLocalSize(sub_schurs->is_vertices, &n_v)); 1288 dual = size_schur - n_v; 1289 PetscCall(ISGetLocalSize(is_A_all, &n)); 1290 PetscCall(ISGetIndices(is_A_all, &idxs)); 1291 PetscCall(ISCreateGeneral(PetscObjectComm((PetscObject)is_A_all), dual, idxs + n_I, PETSC_COPY_VALUES, &is_B_all)); 1292 PetscCall(ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap, IS_GTOLM_DROP, is_B_all, &msolv_ctx->is_B)); 1293 PetscCall(ISDestroy(&is_B_all)); 1294 PetscCall(ISCreateStride(PetscObjectComm((PetscObject)is_A_all), dual, 0, 1, &is_B_all)); 1295 PetscCall(VecScatterCreate(vec1_B, msolv_ctx->is_B, msolv_ctx->sol_B, is_B_all, &msolv_ctx->correction_scatter_B)); 1296 PetscCall(ISDestroy(&is_B_all)); 1297 PetscCall(ISCreateGeneral(PetscObjectComm((PetscObject)is_A_all), n - n_v, idxs, PETSC_COPY_VALUES, &msolv_ctx->is_R)); 1298 PetscCall(ISRestoreIndices(is_A_all, &idxs)); 1299 } 1300 PetscCall(ISGetLocalSize(msolv_ctx->is_R, &n_R)); 1301 PetscCall(MatCreateSeqAIJ(PETSC_COMM_SELF, n_R, n_R, 0, NULL, &Afake)); 1302 PetscCall(MatAssemblyBegin(Afake, MAT_FINAL_ASSEMBLY)); 1303 PetscCall(MatAssemblyEnd(Afake, MAT_FINAL_ASSEMBLY)); 1304 PetscCall(PCSetOperators(msolv_ctx->correction_solver, Afake, Afake)); 1305 PetscCall(MatDestroy(&Afake)); 1306 PetscCall(VecDestroy(&vec1_B)); 1307 } 1308 /* communicate benign info to solver context */ 1309 if (benign_n) { 1310 PetscScalar *array; 1311 1312 msolv_ctx->benign_n = benign_n; 1313 msolv_ctx->benign_zerodiag_subs = is_p_r; 1314 PetscCall(PetscMalloc1(benign_n, &msolv_ctx->benign_save_vals)); 1315 msolv_ctx->benign_csAIB = cs_AIB_mat; 1316 PetscCall(MatCreateVecs(cs_AIB_mat, &msolv_ctx->benign_corr_work, NULL)); 1317 PetscCall(VecGetArray(msolv_ctx->benign_corr_work, &array)); 1318 PetscCall(VecCreateSeqWithArray(PETSC_COMM_SELF, 1, size_schur, array, &msolv_ctx->benign_dummy_schur_vec)); 1319 PetscCall(VecRestoreArray(msolv_ctx->benign_corr_work, &array)); 1320 msolv_ctx->benign_AIIm1ones = benign_AIIm1_ones_mat; 1321 } 1322 } else { 1323 if (sub_schurs->reuse_solver) PetscCall(PCBDDCReuseSolversReset(sub_schurs->reuse_solver)); 1324 PetscCall(PetscFree(sub_schurs->reuse_solver)); 1325 } 1326 PetscCall(MatDestroy(&A)); 1327 PetscCall(ISDestroy(&is_A_all)); 1328 1329 /* Work arrays */ 1330 PetscCall(PetscMalloc1(max_subset_size * max_subset_size, &work)); 1331 1332 /* S_Ej_all */ 1333 cum = cum2 = 0; 1334 PetscCall(MatDenseGetArrayRead(S_all, &rS_data)); 1335 PetscCall(MatSeqAIJGetArray(sub_schurs->S_Ej_all, &SEj_arr)); 1336 if (sub_schurs->sum_S_Ej_inv_all) PetscCall(MatSeqAIJGetArray(sub_schurs->sum_S_Ej_inv_all, &SEjinv_arr)); 1337 if (sub_schurs->gdsw) PetscCall(MatCreateSubMatrices(sub_schurs->A, sub_schurs->n_subs, sub_schurs->is_subs, sub_schurs->is_subs, MAT_INITIAL_MATRIX, &gdswA)); 1338 for (i = 0; i < sub_schurs->n_subs; i++) { 1339 PetscInt j; 1340 1341 /* get S_E (or K^i_EE for GDSW) */ 1342 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 1343 if (sub_schurs->gdsw) { 1344 Mat T; 1345 1346 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, subset_size, subset_size, work, &T)); 1347 PetscCall(MatConvert(gdswA[i], MATDENSE, MAT_REUSE_MATRIX, &T)); 1348 PetscCall(MatDestroy(&T)); 1349 } else { 1350 if (S_lower_triangular) { /* I need to expand the upper triangular data (column-oriented) */ 1351 PetscInt k; 1352 for (k = 0; k < subset_size; k++) { 1353 for (j = k; j < subset_size; j++) { 1354 work[k * subset_size + j] = rS_data[cum2 + k * size_schur + j]; 1355 work[j * subset_size + k] = PetscConj(rS_data[cum2 + k * size_schur + j]); 1356 } 1357 } 1358 } else { /* just copy to workspace */ 1359 PetscInt k; 1360 for (k = 0; k < subset_size; k++) { 1361 for (j = 0; j < subset_size; j++) work[k * subset_size + j] = rS_data[cum2 + k * size_schur + j]; 1362 } 1363 } 1364 } 1365 /* insert S_E values */ 1366 if (sub_schurs->change) { 1367 Mat change_sub, SEj, T; 1368 1369 /* change basis */ 1370 PetscCall(KSPGetOperators(sub_schurs->change[i], &change_sub, NULL)); 1371 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, subset_size, subset_size, work, &SEj)); 1372 if (!sub_schurs->change_with_qr) { /* currently there's no support for PtAP with P SeqAIJ */ 1373 Mat T2; 1374 PetscCall(MatTransposeMatMult(change_sub, SEj, MAT_INITIAL_MATRIX, 1.0, &T2)); 1375 PetscCall(MatMatMult(T2, change_sub, MAT_INITIAL_MATRIX, 1.0, &T)); 1376 PetscCall(MatConvert(T, MATSEQDENSE, MAT_INPLACE_MATRIX, &T)); 1377 PetscCall(MatDestroy(&T2)); 1378 } else { 1379 PetscCall(MatPtAP(SEj, change_sub, MAT_INITIAL_MATRIX, 1.0, &T)); 1380 } 1381 PetscCall(MatCopy(T, SEj, SAME_NONZERO_PATTERN)); 1382 PetscCall(MatDestroy(&T)); 1383 PetscCall(MatZeroRowsColumnsIS(SEj, sub_schurs->change_primal_sub[i], 1.0, NULL, NULL)); 1384 PetscCall(MatDestroy(&SEj)); 1385 } 1386 PetscCall(PetscArraycpy(SEj_arr, work, subset_size * subset_size)); 1387 if (compute_Stilda) { 1388 if (deluxe) { /* if adaptivity is requested, invert S_E blocks */ 1389 Mat M; 1390 const PetscScalar *vals; 1391 PetscBool isdense, isdensecuda; 1392 1393 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, subset_size, subset_size, work, &M)); 1394 PetscCall(MatSetOption(M, MAT_SPD, sub_schurs->is_posdef)); 1395 PetscCall(MatSetOption(M, MAT_HERMITIAN, sub_schurs->is_hermitian)); 1396 if (!PetscBTLookup(sub_schurs->is_edge, i)) PetscCall(MatSetType(M, Stype)); 1397 PetscCall(PetscObjectTypeCompare((PetscObject)M, MATSEQDENSE, &isdense)); 1398 PetscCall(PetscObjectTypeCompare((PetscObject)M, MATSEQDENSECUDA, &isdensecuda)); 1399 if (use_cholesky) { 1400 PetscCall(MatCholeskyFactor(M, NULL, NULL)); 1401 } else { 1402 PetscCall(MatLUFactor(M, NULL, NULL, NULL)); 1403 } 1404 if (isdense) { 1405 PetscCall(MatSeqDenseInvertFactors_Private(M)); 1406 #if defined(PETSC_HAVE_CUDA) 1407 } else if (isdensecuda) { 1408 PetscCall(MatSeqDenseCUDAInvertFactors_Internal(M)); 1409 #endif 1410 } else SETERRQ(PetscObjectComm((PetscObject)M), PETSC_ERR_SUP, "Not implemented for type %s", Stype); 1411 PetscCall(MatDenseGetArrayRead(M, &vals)); 1412 PetscCall(PetscArraycpy(SEjinv_arr, vals, subset_size * subset_size)); 1413 PetscCall(MatDenseRestoreArrayRead(M, &vals)); 1414 PetscCall(MatDestroy(&M)); 1415 } else if (scaling) { /* not using deluxe */ 1416 Mat SEj; 1417 Vec D; 1418 PetscScalar *array; 1419 1420 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, subset_size, subset_size, work, &SEj)); 1421 PetscCall(VecGetArray(Dall, &array)); 1422 PetscCall(VecCreateSeqWithArray(PETSC_COMM_SELF, 1, subset_size, array + cum, &D)); 1423 PetscCall(VecRestoreArray(Dall, &array)); 1424 PetscCall(VecShift(D, -1.)); 1425 PetscCall(MatDiagonalScale(SEj, D, D)); 1426 PetscCall(MatDestroy(&SEj)); 1427 PetscCall(VecDestroy(&D)); 1428 PetscCall(PetscArraycpy(SEj_arr, work, subset_size * subset_size)); 1429 } 1430 } 1431 cum += subset_size; 1432 cum2 += subset_size * (size_schur + 1); 1433 SEj_arr += subset_size * subset_size; 1434 if (SEjinv_arr) SEjinv_arr += subset_size * subset_size; 1435 } 1436 if (sub_schurs->gdsw) PetscCall(MatDestroySubMatrices(sub_schurs->n_subs, &gdswA)); 1437 PetscCall(MatDenseRestoreArrayRead(S_all, &rS_data)); 1438 PetscCall(MatSeqAIJRestoreArray(sub_schurs->S_Ej_all, &SEj_arr)); 1439 if (sub_schurs->sum_S_Ej_inv_all) PetscCall(MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_inv_all, &SEjinv_arr)); 1440 if (solver_S) PetscCall(MatFactorRestoreSchurComplement(F, &S_all, MAT_FACTOR_SCHUR_UNFACTORED)); 1441 1442 /* may prevent from unneeded copies, since MUMPS or MKL_Pardiso always use CPU memory 1443 however, preliminary tests indicate using GPUs is still faster in the solve phase */ 1444 #if defined(PETSC_HAVE_VIENNACL) || defined(PETSC_HAVE_CUDA) 1445 if (reuse_solvers) { 1446 Mat St; 1447 MatFactorSchurStatus st; 1448 1449 flg = PETSC_FALSE; 1450 PetscCall(PetscOptionsGetBool(NULL, sub_schurs->prefix, "-sub_schurs_schur_pin_to_cpu", &flg, NULL)); 1451 PetscCall(MatFactorGetSchurComplement(F, &St, &st)); 1452 PetscCall(MatBindToCPU(St, flg)); 1453 PetscCall(MatFactorRestoreSchurComplement(F, &St, st)); 1454 } 1455 #endif 1456 1457 schur_factor = NULL; 1458 if (compute_Stilda && size_active_schur) { 1459 if (sub_schurs->n_subs == 1 && size_schur == size_active_schur && deluxe) { /* we already computed the inverse */ 1460 PetscCall(MatSeqAIJGetArrayWrite(sub_schurs->sum_S_Ej_tilda_all, &SEjinv_arr)); 1461 PetscCall(PetscArraycpy(SEjinv_arr, work, size_schur * size_schur)); 1462 PetscCall(MatSeqAIJRestoreArrayWrite(sub_schurs->sum_S_Ej_tilda_all, &SEjinv_arr)); 1463 } else { 1464 Mat S_all_inv = NULL; 1465 1466 if (solver_S && !sub_schurs->gdsw) { 1467 /* for adaptive selection we need S^-1; for solver reusage we need S_\Delta\Delta^-1. 1468 The latter is not the principal subminor for S^-1. However, the factors can be reused since S_\Delta\Delta is the leading principal submatrix of S */ 1469 if (factor_workaround) { /* invert without calling MatFactorInvertSchurComplement, since we are hacking */ 1470 PetscScalar *data; 1471 PetscInt nd = 0; 1472 1473 PetscCheck(use_potr, PETSC_COMM_SELF, PETSC_ERR_SUP, "Factor update not yet implemented for non SPD matrices"); 1474 PetscCall(MatFactorGetSchurComplement(F, &S_all_inv, NULL)); 1475 PetscCall(MatDenseGetArray(S_all_inv, &data)); 1476 if (sub_schurs->is_dir) { /* dirichlet dofs could have different scalings */ 1477 PetscCall(ISGetLocalSize(sub_schurs->is_dir, &nd)); 1478 } 1479 1480 /* factor and invert activedofs and vertices (dirichlet dofs does not contribute) */ 1481 if (schur_has_vertices) { 1482 Mat M; 1483 PetscScalar *tdata; 1484 PetscInt nv = 0, news; 1485 1486 PetscCall(ISGetLocalSize(sub_schurs->is_vertices, &nv)); 1487 news = size_active_schur + nv; 1488 PetscCall(PetscCalloc1(news * news, &tdata)); 1489 for (i = 0; i < size_active_schur; i++) { 1490 PetscCall(PetscArraycpy(tdata + i * (news + 1), data + i * (size_schur + 1), size_active_schur - i)); 1491 PetscCall(PetscArraycpy(tdata + i * (news + 1) + size_active_schur - i, data + i * size_schur + size_active_schur + nd, nv)); 1492 } 1493 for (i = 0; i < nv; i++) { 1494 PetscInt k = i + size_active_schur; 1495 PetscCall(PetscArraycpy(tdata + k * (news + 1), data + (k + nd) * (size_schur + 1), nv - i)); 1496 } 1497 1498 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, news, news, tdata, &M)); 1499 PetscCall(MatSetOption(M, MAT_SPD, PETSC_TRUE)); 1500 PetscCall(MatCholeskyFactor(M, NULL, NULL)); 1501 /* save the factors */ 1502 cum = 0; 1503 PetscCall(PetscMalloc1((size_active_schur * (size_active_schur + 1)) / 2 + nd, &schur_factor)); 1504 for (i = 0; i < size_active_schur; i++) { 1505 PetscCall(PetscArraycpy(schur_factor + cum, tdata + i * (news + 1), size_active_schur - i)); 1506 cum += size_active_schur - i; 1507 } 1508 for (i = 0; i < nd; i++) schur_factor[cum + i] = PetscSqrtReal(PetscRealPart(data[(i + size_active_schur) * (size_schur + 1)])); 1509 PetscCall(MatSeqDenseInvertFactors_Private(M)); 1510 /* move back just the active dofs to the Schur complement */ 1511 for (i = 0; i < size_active_schur; i++) PetscCall(PetscArraycpy(data + i * size_schur, tdata + i * news, size_active_schur)); 1512 PetscCall(PetscFree(tdata)); 1513 PetscCall(MatDestroy(&M)); 1514 } else { /* we can factorize and invert just the activedofs */ 1515 Mat M; 1516 PetscScalar *aux; 1517 1518 PetscCall(PetscMalloc1(nd, &aux)); 1519 for (i = 0; i < nd; i++) aux[i] = 1.0 / data[(i + size_active_schur) * (size_schur + 1)]; 1520 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, size_active_schur, size_active_schur, data, &M)); 1521 PetscCall(MatDenseSetLDA(M, size_schur)); 1522 PetscCall(MatSetOption(M, MAT_SPD, PETSC_TRUE)); 1523 PetscCall(MatCholeskyFactor(M, NULL, NULL)); 1524 PetscCall(MatSeqDenseInvertFactors_Private(M)); 1525 PetscCall(MatDestroy(&M)); 1526 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, size_schur, nd, data + size_active_schur * size_schur, &M)); 1527 PetscCall(MatZeroEntries(M)); 1528 PetscCall(MatDestroy(&M)); 1529 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, nd, size_schur, data + size_active_schur, &M)); 1530 PetscCall(MatDenseSetLDA(M, size_schur)); 1531 PetscCall(MatZeroEntries(M)); 1532 PetscCall(MatDestroy(&M)); 1533 for (i = 0; i < nd; i++) data[(i + size_active_schur) * (size_schur + 1)] = aux[i]; 1534 PetscCall(PetscFree(aux)); 1535 } 1536 PetscCall(MatDenseRestoreArray(S_all_inv, &data)); 1537 } else { /* use MatFactor calls to invert S */ 1538 PetscCall(MatFactorInvertSchurComplement(F)); 1539 PetscCall(MatFactorGetSchurComplement(F, &S_all_inv, NULL)); 1540 } 1541 } else if (!sub_schurs->gdsw) { /* we need to invert explicitly since we are not using MatFactor for S */ 1542 PetscCall(PetscObjectReference((PetscObject)S_all)); 1543 S_all_inv = S_all; 1544 PetscCall(MatDenseGetArray(S_all_inv, &S_data)); 1545 PetscCall(PetscBLASIntCast(size_schur, &B_N)); 1546 PetscCall(PetscFPTrapPush(PETSC_FP_TRAP_OFF)); 1547 if (use_potr) { 1548 PetscCallBLAS("LAPACKpotrf", LAPACKpotrf_("L", &B_N, S_data, &B_N, &B_ierr)); 1549 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in POTRF Lapack routine %" PetscBLASInt_FMT, B_ierr); 1550 PetscCallBLAS("LAPACKpotri", LAPACKpotri_("L", &B_N, S_data, &B_N, &B_ierr)); 1551 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in POTRI Lapack routine %" PetscBLASInt_FMT, B_ierr); 1552 } else if (use_sytr) { 1553 PetscCallBLAS("LAPACKsytrf", LAPACKsytrf_("L", &B_N, S_data, &B_N, pivots, Bwork, &B_lwork, &B_ierr)); 1554 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in SYTRF Lapack routine %" PetscBLASInt_FMT, B_ierr); 1555 PetscCallBLAS("LAPACKsytri", LAPACKsytri_("L", &B_N, S_data, &B_N, pivots, Bwork, &B_ierr)); 1556 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in SYTRI Lapack routine %" PetscBLASInt_FMT, B_ierr); 1557 } else { 1558 PetscCallBLAS("LAPACKgetrf", LAPACKgetrf_(&B_N, &B_N, S_data, &B_N, pivots, &B_ierr)); 1559 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in GETRF Lapack routine %" PetscBLASInt_FMT, B_ierr); 1560 PetscCallBLAS("LAPACKgetri", LAPACKgetri_(&B_N, S_data, &B_N, pivots, Bwork, &B_lwork, &B_ierr)); 1561 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in GETRI Lapack routine %" PetscBLASInt_FMT, B_ierr); 1562 } 1563 PetscCall(PetscLogFlops(1.0 * size_schur * size_schur * size_schur)); 1564 PetscCall(PetscFPTrapPop()); 1565 PetscCall(MatDenseRestoreArray(S_all_inv, &S_data)); 1566 } else if (sub_schurs->gdsw) { 1567 Mat tS, tX, SEj, S_II, S_IE, S_EE; 1568 KSP pS_II; 1569 PC pS_II_pc; 1570 IS EE, II; 1571 PetscInt nS; 1572 1573 PetscCall(MatFactorCreateSchurComplement(F, &tS, NULL)); 1574 PetscCall(MatGetSize(tS, &nS, NULL)); 1575 PetscCall(MatSeqAIJGetArray(sub_schurs->sum_S_Ej_tilda_all, &SEjinv_arr)); 1576 for (i = 0, cum = 0; i < sub_schurs->n_subs; i++) { /* naive implementation */ 1577 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 1578 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, subset_size, subset_size, SEjinv_arr, &SEj)); 1579 1580 PetscCall(ISCreateStride(PETSC_COMM_SELF, subset_size, cum, 1, &EE)); 1581 PetscCall(ISComplement(EE, 0, nS, &II)); 1582 PetscCall(MatCreateSubMatrix(tS, II, II, MAT_INITIAL_MATRIX, &S_II)); 1583 PetscCall(MatCreateSubMatrix(tS, II, EE, MAT_INITIAL_MATRIX, &S_IE)); 1584 PetscCall(MatCreateSubMatrix(tS, EE, EE, MAT_INITIAL_MATRIX, &S_EE)); 1585 PetscCall(ISDestroy(&II)); 1586 PetscCall(ISDestroy(&EE)); 1587 1588 PetscCall(KSPCreate(PETSC_COMM_SELF, &pS_II)); 1589 PetscCall(KSPSetNestLevel(pS_II, 1)); /* do not have direct access to a PC to provide the level of nesting of the KSP */ 1590 PetscCall(KSPSetType(pS_II, KSPPREONLY)); 1591 PetscCall(KSPGetPC(pS_II, &pS_II_pc)); 1592 PetscCall(PCSetType(pS_II_pc, PCSVD)); 1593 PetscCall(KSPSetOptionsPrefix(pS_II, sub_schurs->prefix)); 1594 PetscCall(KSPAppendOptionsPrefix(pS_II, "pseudo_")); 1595 PetscCall(KSPSetOperators(pS_II, S_II, S_II)); 1596 PetscCall(MatDestroy(&S_II)); 1597 PetscCall(KSPSetFromOptions(pS_II)); 1598 PetscCall(KSPSetUp(pS_II)); 1599 PetscCall(MatDuplicate(S_IE, MAT_DO_NOT_COPY_VALUES, &tX)); 1600 PetscCall(KSPMatSolve(pS_II, S_IE, tX)); 1601 PetscCall(KSPDestroy(&pS_II)); 1602 1603 PetscCall(MatTransposeMatMult(S_IE, tX, MAT_REUSE_MATRIX, PETSC_DETERMINE, &SEj)); 1604 PetscCall(MatDestroy(&S_IE)); 1605 PetscCall(MatDestroy(&tX)); 1606 PetscCall(MatAYPX(SEj, -1, S_EE, SAME_NONZERO_PATTERN)); 1607 PetscCall(MatDestroy(&S_EE)); 1608 1609 PetscCall(MatDestroy(&SEj)); 1610 cum += subset_size; 1611 SEjinv_arr += subset_size * subset_size; 1612 } 1613 PetscCall(MatDestroy(&tS)); 1614 PetscCall(MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_tilda_all, &SEjinv_arr)); 1615 } 1616 /* S_Ej_tilda_all */ 1617 cum = cum2 = 0; 1618 rS_data = NULL; 1619 if (S_all_inv) PetscCall(MatDenseGetArrayRead(S_all_inv, &rS_data)); 1620 PetscCall(MatSeqAIJGetArrayWrite(sub_schurs->sum_S_Ej_tilda_all, &SEjinv_arr)); 1621 for (i = 0; i < sub_schurs->n_subs; i++) { 1622 PetscInt j; 1623 1624 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 1625 /* get (St^-1)_E */ 1626 /* Unless we are changing the variables, I don't need to expand to upper triangular since St^-1 1627 will be properly accessed later during adaptive selection */ 1628 if (rS_data) { 1629 if (S_lower_triangular) { 1630 PetscInt k; 1631 if (sub_schurs->change) { 1632 for (k = 0; k < subset_size; k++) { 1633 for (j = k; j < subset_size; j++) { 1634 work[k * subset_size + j] = rS_data[cum2 + k * size_schur + j]; 1635 work[j * subset_size + k] = work[k * subset_size + j]; 1636 } 1637 } 1638 } else { 1639 for (k = 0; k < subset_size; k++) { 1640 for (j = k; j < subset_size; j++) work[k * subset_size + j] = rS_data[cum2 + k * size_schur + j]; 1641 } 1642 } 1643 } else { 1644 PetscInt k; 1645 for (k = 0; k < subset_size; k++) { 1646 for (j = 0; j < subset_size; j++) work[k * subset_size + j] = rS_data[cum2 + k * size_schur + j]; 1647 } 1648 } 1649 } 1650 if (sub_schurs->change) { 1651 Mat change_sub, SEj, T; 1652 PetscScalar val = sub_schurs->gdsw ? PETSC_SMALL : 1. / PETSC_SMALL; 1653 1654 /* change basis */ 1655 PetscCall(KSPGetOperators(sub_schurs->change[i], &change_sub, NULL)); 1656 PetscCall(MatCreateSeqDense(PETSC_COMM_SELF, subset_size, subset_size, rS_data ? work : SEjinv_arr, &SEj)); 1657 if (!sub_schurs->change_with_qr) { /* currently there's no support for PtAP with P SeqAIJ */ 1658 Mat T2; 1659 PetscCall(MatTransposeMatMult(change_sub, SEj, MAT_INITIAL_MATRIX, 1.0, &T2)); 1660 PetscCall(MatMatMult(T2, change_sub, MAT_INITIAL_MATRIX, 1.0, &T)); 1661 PetscCall(MatDestroy(&T2)); 1662 PetscCall(MatConvert(T, MATSEQDENSE, MAT_INPLACE_MATRIX, &T)); 1663 } else { 1664 PetscCall(MatPtAP(SEj, change_sub, MAT_INITIAL_MATRIX, 1.0, &T)); 1665 } 1666 PetscCall(MatCopy(T, SEj, SAME_NONZERO_PATTERN)); 1667 PetscCall(MatDestroy(&T)); 1668 PetscCall(MatZeroRowsColumnsIS(SEj, sub_schurs->change_primal_sub[i], val, NULL, NULL)); 1669 PetscCall(MatDestroy(&SEj)); 1670 } 1671 if (rS_data) PetscCall(PetscArraycpy(SEjinv_arr, work, subset_size * subset_size)); 1672 cum += subset_size; 1673 cum2 += subset_size * (size_schur + 1); 1674 SEjinv_arr += subset_size * subset_size; 1675 } 1676 PetscCall(MatSeqAIJRestoreArrayWrite(sub_schurs->sum_S_Ej_tilda_all, &SEjinv_arr)); 1677 if (S_all_inv) { 1678 PetscCall(MatDenseRestoreArrayRead(S_all_inv, &rS_data)); 1679 if (solver_S) { 1680 if (schur_has_vertices) { 1681 PetscCall(MatFactorRestoreSchurComplement(F, &S_all_inv, MAT_FACTOR_SCHUR_FACTORED)); 1682 } else { 1683 PetscCall(MatFactorRestoreSchurComplement(F, &S_all_inv, MAT_FACTOR_SCHUR_INVERTED)); 1684 } 1685 } 1686 } 1687 PetscCall(MatDestroy(&S_all_inv)); 1688 } 1689 1690 /* move back factors if needed */ 1691 if (schur_has_vertices && factor_workaround && !sub_schurs->gdsw) { 1692 Mat S_tmp; 1693 PetscInt nd = 0; 1694 PetscScalar *data; 1695 1696 PetscCheck(use_potr, PETSC_COMM_SELF, PETSC_ERR_SUP, "Factor update not yet implemented for non SPD matrices"); 1697 PetscCheck(solver_S, PETSC_COMM_SELF, PETSC_ERR_PLIB, "This should not happen"); 1698 PetscCall(MatFactorGetSchurComplement(F, &S_tmp, NULL)); 1699 PetscCall(MatDenseGetArray(S_tmp, &data)); 1700 PetscCall(PetscArrayzero(data, size_schur * size_schur)); 1701 1702 if (S_lower_triangular) { 1703 cum = 0; 1704 for (i = 0; i < size_active_schur; i++) { 1705 PetscCall(PetscArraycpy(data + i * (size_schur + 1), schur_factor + cum, size_active_schur - i)); 1706 cum += size_active_schur - i; 1707 } 1708 } else { 1709 PetscCall(PetscArraycpy(data, schur_factor, size_schur * size_schur)); 1710 } 1711 if (sub_schurs->is_dir) { 1712 PetscCall(ISGetLocalSize(sub_schurs->is_dir, &nd)); 1713 for (i = 0; i < nd; i++) data[(i + size_active_schur) * (size_schur + 1)] = schur_factor[cum + i]; 1714 } 1715 /* workaround: since I cannot modify the matrices used inside the solvers for the forward and backward substitutions, 1716 set the diagonal entry of the Schur factor to a very large value */ 1717 for (i = size_active_schur + nd; i < size_schur; i++) data[i * (size_schur + 1)] = infty; 1718 PetscCall(MatDenseRestoreArray(S_tmp, &data)); 1719 PetscCall(MatFactorRestoreSchurComplement(F, &S_tmp, MAT_FACTOR_SCHUR_FACTORED)); 1720 } 1721 } else if (factor_workaround && !sub_schurs->gdsw) { /* we need to eliminate any unneeded coupling */ 1722 PetscScalar *data; 1723 PetscInt nd = 0; 1724 1725 if (sub_schurs->is_dir) { /* dirichlet dofs could have different scalings */ 1726 PetscCall(ISGetLocalSize(sub_schurs->is_dir, &nd)); 1727 } 1728 PetscCall(MatFactorGetSchurComplement(F, &S_all, NULL)); 1729 PetscCall(MatDenseGetArray(S_all, &data)); 1730 for (i = 0; i < size_active_schur; i++) PetscCall(PetscArrayzero(data + i * size_schur + size_active_schur, size_schur - size_active_schur)); 1731 for (i = size_active_schur + nd; i < size_schur; i++) { 1732 PetscCall(PetscArrayzero(data + i * size_schur + size_active_schur, size_schur - size_active_schur)); 1733 data[i * (size_schur + 1)] = infty; 1734 } 1735 PetscCall(MatDenseRestoreArray(S_all, &data)); 1736 PetscCall(MatFactorRestoreSchurComplement(F, &S_all, MAT_FACTOR_SCHUR_UNFACTORED)); 1737 } 1738 PetscCall(PetscFree(work)); 1739 PetscCall(PetscFree(schur_factor)); 1740 PetscCall(VecDestroy(&Dall)); 1741 } 1742 PetscCall(ISDestroy(&is_I_layer)); 1743 PetscCall(MatDestroy(&S_all)); 1744 PetscCall(MatDestroy(&A_BB)); 1745 PetscCall(MatDestroy(&A_IB)); 1746 PetscCall(MatDestroy(&A_BI)); 1747 PetscCall(MatDestroy(&F)); 1748 1749 PetscCall(PetscMalloc1(sub_schurs->n_subs, &nnz)); 1750 for (i = 0; i < sub_schurs->n_subs; i++) PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &nnz[i])); 1751 PetscCall(ISCreateGeneral(PETSC_COMM_SELF, sub_schurs->n_subs, nnz, PETSC_OWN_POINTER, &is_I_layer)); 1752 PetscCall(MatSetVariableBlockSizes(sub_schurs->S_Ej_all, sub_schurs->n_subs, nnz)); 1753 PetscCall(MatAssemblyBegin(sub_schurs->S_Ej_all, MAT_FINAL_ASSEMBLY)); 1754 PetscCall(MatAssemblyEnd(sub_schurs->S_Ej_all, MAT_FINAL_ASSEMBLY)); 1755 if (compute_Stilda) { 1756 PetscCall(MatSetVariableBlockSizes(sub_schurs->sum_S_Ej_tilda_all, sub_schurs->n_subs, nnz)); 1757 PetscCall(MatAssemblyBegin(sub_schurs->sum_S_Ej_tilda_all, MAT_FINAL_ASSEMBLY)); 1758 PetscCall(MatAssemblyEnd(sub_schurs->sum_S_Ej_tilda_all, MAT_FINAL_ASSEMBLY)); 1759 if (deluxe) { 1760 PetscCall(MatSetVariableBlockSizes(sub_schurs->sum_S_Ej_inv_all, sub_schurs->n_subs, nnz)); 1761 PetscCall(MatAssemblyBegin(sub_schurs->sum_S_Ej_inv_all, MAT_FINAL_ASSEMBLY)); 1762 PetscCall(MatAssemblyEnd(sub_schurs->sum_S_Ej_inv_all, MAT_FINAL_ASSEMBLY)); 1763 } 1764 } 1765 PetscCall(ISDestroy(&is_I_layer)); 1766 1767 /* Get local part of (\sum_j S_Ej) */ 1768 if (!sub_schurs->sum_S_Ej_all) PetscCall(MatDuplicate(sub_schurs->S_Ej_all, MAT_DO_NOT_COPY_VALUES, &sub_schurs->sum_S_Ej_all)); 1769 PetscCall(VecSet(gstash, 0.0)); 1770 PetscCall(MatSeqAIJGetArray(sub_schurs->S_Ej_all, &stasharray)); 1771 PetscCall(VecPlaceArray(lstash, stasharray)); 1772 PetscCall(VecScatterBegin(sstash, lstash, gstash, ADD_VALUES, SCATTER_FORWARD)); 1773 PetscCall(VecScatterEnd(sstash, lstash, gstash, ADD_VALUES, SCATTER_FORWARD)); 1774 PetscCall(MatSeqAIJRestoreArray(sub_schurs->S_Ej_all, &stasharray)); 1775 PetscCall(VecResetArray(lstash)); 1776 PetscCall(MatSeqAIJGetArray(sub_schurs->sum_S_Ej_all, &stasharray)); 1777 PetscCall(VecPlaceArray(lstash, stasharray)); 1778 PetscCall(VecScatterBegin(sstash, gstash, lstash, INSERT_VALUES, SCATTER_REVERSE)); 1779 PetscCall(VecScatterEnd(sstash, gstash, lstash, INSERT_VALUES, SCATTER_REVERSE)); 1780 PetscCall(MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_all, &stasharray)); 1781 PetscCall(VecResetArray(lstash)); 1782 1783 /* Get local part of (\sum_j S^-1_Ej) (\sum_j St^-1_Ej) */ 1784 if (compute_Stilda) { 1785 PetscCall(VecSet(gstash, 0.0)); 1786 PetscCall(MatSeqAIJGetArray(sub_schurs->sum_S_Ej_tilda_all, &stasharray)); 1787 PetscCall(VecPlaceArray(lstash, stasharray)); 1788 PetscCall(VecScatterBegin(sstash, lstash, gstash, ADD_VALUES, SCATTER_FORWARD)); 1789 PetscCall(VecScatterEnd(sstash, lstash, gstash, ADD_VALUES, SCATTER_FORWARD)); 1790 PetscCall(VecScatterBegin(sstash, gstash, lstash, INSERT_VALUES, SCATTER_REVERSE)); 1791 PetscCall(VecScatterEnd(sstash, gstash, lstash, INSERT_VALUES, SCATTER_REVERSE)); 1792 PetscCall(MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_tilda_all, &stasharray)); 1793 PetscCall(VecResetArray(lstash)); 1794 if (deluxe) { 1795 PetscCall(VecSet(gstash, 0.0)); 1796 PetscCall(MatSeqAIJGetArray(sub_schurs->sum_S_Ej_inv_all, &stasharray)); 1797 PetscCall(VecPlaceArray(lstash, stasharray)); 1798 PetscCall(VecScatterBegin(sstash, lstash, gstash, ADD_VALUES, SCATTER_FORWARD)); 1799 PetscCall(VecScatterEnd(sstash, lstash, gstash, ADD_VALUES, SCATTER_FORWARD)); 1800 PetscCall(VecScatterBegin(sstash, gstash, lstash, INSERT_VALUES, SCATTER_REVERSE)); 1801 PetscCall(VecScatterEnd(sstash, gstash, lstash, INSERT_VALUES, SCATTER_REVERSE)); 1802 PetscCall(MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_inv_all, &stasharray)); 1803 PetscCall(VecResetArray(lstash)); 1804 } else if (!sub_schurs->gdsw) { 1805 PetscScalar *array; 1806 PetscInt cum; 1807 1808 PetscCall(MatSeqAIJGetArray(sub_schurs->sum_S_Ej_tilda_all, &array)); 1809 cum = 0; 1810 for (i = 0; i < sub_schurs->n_subs; i++) { 1811 PetscCall(ISGetLocalSize(sub_schurs->is_subs[i], &subset_size)); 1812 PetscCall(PetscBLASIntCast(subset_size, &B_N)); 1813 PetscCall(PetscFPTrapPush(PETSC_FP_TRAP_OFF)); 1814 if (use_potr) { 1815 PetscCallBLAS("LAPACKpotrf", LAPACKpotrf_("L", &B_N, array + cum, &B_N, &B_ierr)); 1816 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in POTRF Lapack routine %" PetscBLASInt_FMT, B_ierr); 1817 PetscCallBLAS("LAPACKpotri", LAPACKpotri_("L", &B_N, array + cum, &B_N, &B_ierr)); 1818 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in POTRI Lapack routine %" PetscBLASInt_FMT, B_ierr); 1819 } else if (use_sytr) { 1820 PetscCallBLAS("LAPACKsytrf", LAPACKsytrf_("L", &B_N, array + cum, &B_N, pivots, Bwork, &B_lwork, &B_ierr)); 1821 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in SYTRF Lapack routine %" PetscBLASInt_FMT, B_ierr); 1822 PetscCallBLAS("LAPACKsytri", LAPACKsytri_("L", &B_N, array + cum, &B_N, pivots, Bwork, &B_ierr)); 1823 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in SYTRI Lapack routine %" PetscBLASInt_FMT, B_ierr); 1824 } else { 1825 PetscCallBLAS("LAPACKgetrf", LAPACKgetrf_(&B_N, &B_N, array + cum, &B_N, pivots, &B_ierr)); 1826 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in GETRF Lapack routine %" PetscBLASInt_FMT, B_ierr); 1827 PetscCallBLAS("LAPACKgetri", LAPACKgetri_(&B_N, array + cum, &B_N, pivots, Bwork, &B_lwork, &B_ierr)); 1828 PetscCheck(!B_ierr, PETSC_COMM_SELF, PETSC_ERR_LIB, "Error in GETRI Lapack routine %" PetscBLASInt_FMT, B_ierr); 1829 } 1830 PetscCall(PetscLogFlops(1.0 * subset_size * subset_size * subset_size)); 1831 PetscCall(PetscFPTrapPop()); 1832 cum += subset_size * subset_size; 1833 } 1834 PetscCall(MatSeqAIJRestoreArray(sub_schurs->sum_S_Ej_tilda_all, &array)); 1835 PetscCall(PetscObjectReference((PetscObject)sub_schurs->sum_S_Ej_all)); 1836 PetscCall(MatDestroy(&sub_schurs->sum_S_Ej_inv_all)); 1837 sub_schurs->sum_S_Ej_inv_all = sub_schurs->sum_S_Ej_all; 1838 } 1839 } 1840 PetscCall(VecDestroy(&lstash)); 1841 PetscCall(VecDestroy(&gstash)); 1842 PetscCall(VecScatterDestroy(&sstash)); 1843 1844 if (matl_dbg_viewer) { 1845 if (sub_schurs->S_Ej_all) { 1846 PetscCall(PetscObjectSetName((PetscObject)sub_schurs->S_Ej_all, "SE")); 1847 PetscCall(MatView(sub_schurs->S_Ej_all, matl_dbg_viewer)); 1848 } 1849 if (sub_schurs->sum_S_Ej_all) { 1850 PetscCall(PetscObjectSetName((PetscObject)sub_schurs->sum_S_Ej_all, "SSE")); 1851 PetscCall(MatView(sub_schurs->sum_S_Ej_all, matl_dbg_viewer)); 1852 } 1853 if (sub_schurs->sum_S_Ej_inv_all) { 1854 PetscCall(PetscObjectSetName((PetscObject)sub_schurs->sum_S_Ej_inv_all, "SSEm")); 1855 PetscCall(MatView(sub_schurs->sum_S_Ej_inv_all, matl_dbg_viewer)); 1856 } 1857 if (sub_schurs->sum_S_Ej_tilda_all) { 1858 PetscCall(PetscObjectSetName((PetscObject)sub_schurs->sum_S_Ej_tilda_all, "SSEt")); 1859 PetscCall(MatView(sub_schurs->sum_S_Ej_tilda_all, matl_dbg_viewer)); 1860 } 1861 } 1862 1863 /* free workspace */ 1864 if (matl_dbg_viewer) PetscCall(PetscViewerFlush(matl_dbg_viewer)); 1865 if (sub_schurs->debug) PetscCallMPI(MPI_Barrier(comm_n)); 1866 PetscCall(PetscViewerDestroy(&matl_dbg_viewer)); 1867 PetscCall(PetscFree2(Bwork, pivots)); 1868 PetscCall(PetscCommDestroy(&comm_n)); 1869 PetscFunctionReturn(PETSC_SUCCESS); 1870 } 1871 1872 PetscErrorCode PCBDDCSubSchursInit(PCBDDCSubSchurs sub_schurs, const char *prefix, IS is_I, IS is_B, PCBDDCGraph graph, ISLocalToGlobalMapping BtoNmap, PetscBool copycc, PetscBool gdsw) 1873 { 1874 IS *faces, *edges, *all_cc, vertices; 1875 PetscInt s, i, n_faces, n_edges, n_all_cc; 1876 PetscBool is_sorted, ispardiso, ismumps; 1877 1878 PetscFunctionBegin; 1879 PetscCall(ISSorted(is_I, &is_sorted)); 1880 PetscCheck(is_sorted, PetscObjectComm((PetscObject)is_I), PETSC_ERR_PLIB, "IS for I dofs should be shorted"); 1881 PetscCall(ISSorted(is_B, &is_sorted)); 1882 PetscCheck(is_sorted, PetscObjectComm((PetscObject)is_B), PETSC_ERR_PLIB, "IS for B dofs should be shorted"); 1883 1884 /* reset any previous data */ 1885 PetscCall(PCBDDCSubSchursReset(sub_schurs)); 1886 1887 sub_schurs->gdsw = gdsw; 1888 1889 /* get index sets for faces and edges (already sorted by global ordering) */ 1890 PetscCall(PCBDDCGraphGetCandidatesIS(graph, &n_faces, &faces, &n_edges, &edges, &vertices)); 1891 n_all_cc = n_faces + n_edges; 1892 PetscCall(PetscBTCreate(n_all_cc, &sub_schurs->is_edge)); 1893 PetscCall(PetscMalloc1(n_all_cc, &all_cc)); 1894 n_all_cc = 0; 1895 for (i = 0; i < n_faces; i++) { 1896 PetscCall(ISGetSize(faces[i], &s)); 1897 if (!s) continue; 1898 if (copycc) { 1899 PetscCall(ISDuplicate(faces[i], &all_cc[n_all_cc])); 1900 } else { 1901 PetscCall(PetscObjectReference((PetscObject)faces[i])); 1902 all_cc[n_all_cc] = faces[i]; 1903 } 1904 n_all_cc++; 1905 } 1906 for (i = 0; i < n_edges; i++) { 1907 PetscCall(ISGetSize(edges[i], &s)); 1908 if (!s) continue; 1909 if (copycc) { 1910 PetscCall(ISDuplicate(edges[i], &all_cc[n_all_cc])); 1911 } else { 1912 PetscCall(PetscObjectReference((PetscObject)edges[i])); 1913 all_cc[n_all_cc] = edges[i]; 1914 } 1915 PetscCall(PetscBTSet(sub_schurs->is_edge, n_all_cc)); 1916 n_all_cc++; 1917 } 1918 PetscCall(PetscObjectReference((PetscObject)vertices)); 1919 sub_schurs->is_vertices = vertices; 1920 PetscCall(PCBDDCGraphRestoreCandidatesIS(graph, &n_faces, &faces, &n_edges, &edges, &vertices)); 1921 sub_schurs->is_dir = NULL; 1922 PetscCall(PCBDDCGraphGetDirichletDofsB(graph, &sub_schurs->is_dir)); 1923 1924 /* Determine if MatFactor can be used */ 1925 PetscCall(PetscStrallocpy(prefix, &sub_schurs->prefix)); 1926 #if defined(PETSC_HAVE_MUMPS) 1927 PetscCall(PetscStrncpy(sub_schurs->mat_solver_type, MATSOLVERMUMPS, sizeof(sub_schurs->mat_solver_type))); 1928 #elif defined(PETSC_HAVE_MKL_PARDISO) 1929 PetscCall(PetscStrncpy(sub_schurs->mat_solver_type, MATSOLVERMKL_PARDISO, sizeof(sub_schurs->mat_solver_type))); 1930 #else 1931 PetscCall(PetscStrncpy(sub_schurs->mat_solver_type, MATSOLVERPETSC, sizeof(sub_schurs->mat_solver_type))); 1932 #endif 1933 #if defined(PETSC_USE_COMPLEX) 1934 sub_schurs->is_hermitian = PETSC_FALSE; /* Hermitian Cholesky is not supported by PETSc and external packages */ 1935 #else 1936 sub_schurs->is_hermitian = PETSC_TRUE; 1937 #endif 1938 sub_schurs->is_posdef = PETSC_TRUE; 1939 sub_schurs->is_symmetric = PETSC_TRUE; 1940 sub_schurs->debug = PETSC_FALSE; 1941 sub_schurs->restrict_comm = PETSC_FALSE; 1942 PetscOptionsBegin(PetscObjectComm((PetscObject)graph->l2gmap), sub_schurs->prefix, "BDDC sub_schurs options", "PC"); 1943 PetscCall(PetscOptionsString("-sub_schurs_mat_solver_type", "Specific direct solver to use", NULL, sub_schurs->mat_solver_type, sub_schurs->mat_solver_type, sizeof(sub_schurs->mat_solver_type), NULL)); 1944 PetscCall(PetscOptionsBool("-sub_schurs_symmetric", "Symmetric problem", NULL, sub_schurs->is_symmetric, &sub_schurs->is_symmetric, NULL)); 1945 PetscCall(PetscOptionsBool("-sub_schurs_hermitian", "Hermitian problem", NULL, sub_schurs->is_hermitian, &sub_schurs->is_hermitian, NULL)); 1946 PetscCall(PetscOptionsBool("-sub_schurs_posdef", "Positive definite problem", NULL, sub_schurs->is_posdef, &sub_schurs->is_posdef, NULL)); 1947 PetscCall(PetscOptionsBool("-sub_schurs_restrictcomm", "Restrict communicator on active processes only", NULL, sub_schurs->restrict_comm, &sub_schurs->restrict_comm, NULL)); 1948 PetscCall(PetscOptionsBool("-sub_schurs_debug", "Debug output", NULL, sub_schurs->debug, &sub_schurs->debug, NULL)); 1949 PetscOptionsEnd(); 1950 PetscCall(PetscStrcmp(sub_schurs->mat_solver_type, MATSOLVERMUMPS, &ismumps)); 1951 PetscCall(PetscStrcmp(sub_schurs->mat_solver_type, MATSOLVERMKL_PARDISO, &ispardiso)); 1952 sub_schurs->schur_explicit = (PetscBool)(ispardiso || ismumps); 1953 1954 /* for reals, symmetric and Hermitian are synonyms */ 1955 #if !defined(PETSC_USE_COMPLEX) 1956 sub_schurs->is_symmetric = (PetscBool)(sub_schurs->is_symmetric && sub_schurs->is_hermitian); 1957 sub_schurs->is_hermitian = sub_schurs->is_symmetric; 1958 #endif 1959 1960 PetscCall(PetscObjectReference((PetscObject)is_I)); 1961 sub_schurs->is_I = is_I; 1962 PetscCall(PetscObjectReference((PetscObject)is_B)); 1963 sub_schurs->is_B = is_B; 1964 PetscCall(PetscObjectReference((PetscObject)graph->l2gmap)); 1965 sub_schurs->l2gmap = graph->l2gmap; 1966 PetscCall(PetscObjectReference((PetscObject)BtoNmap)); 1967 sub_schurs->BtoNmap = BtoNmap; 1968 sub_schurs->n_subs = n_all_cc; 1969 sub_schurs->is_subs = all_cc; 1970 sub_schurs->S_Ej_all = NULL; 1971 sub_schurs->sum_S_Ej_all = NULL; 1972 sub_schurs->sum_S_Ej_inv_all = NULL; 1973 sub_schurs->sum_S_Ej_tilda_all = NULL; 1974 sub_schurs->is_Ej_all = NULL; 1975 PetscFunctionReturn(PETSC_SUCCESS); 1976 } 1977 1978 PetscErrorCode PCBDDCSubSchursCreate(PCBDDCSubSchurs *sub_schurs) 1979 { 1980 PCBDDCSubSchurs schurs_ctx; 1981 1982 PetscFunctionBegin; 1983 PetscCall(PetscNew(&schurs_ctx)); 1984 schurs_ctx->n_subs = 0; 1985 *sub_schurs = schurs_ctx; 1986 PetscFunctionReturn(PETSC_SUCCESS); 1987 } 1988 1989 PetscErrorCode PCBDDCSubSchursReset(PCBDDCSubSchurs sub_schurs) 1990 { 1991 PetscInt i; 1992 1993 PetscFunctionBegin; 1994 if (!sub_schurs) PetscFunctionReturn(PETSC_SUCCESS); 1995 PetscCall(PetscFree(sub_schurs->prefix)); 1996 PetscCall(MatDestroy(&sub_schurs->A)); 1997 PetscCall(MatDestroy(&sub_schurs->S)); 1998 PetscCall(ISDestroy(&sub_schurs->is_I)); 1999 PetscCall(ISDestroy(&sub_schurs->is_B)); 2000 PetscCall(ISLocalToGlobalMappingDestroy(&sub_schurs->l2gmap)); 2001 PetscCall(ISLocalToGlobalMappingDestroy(&sub_schurs->BtoNmap)); 2002 PetscCall(MatDestroy(&sub_schurs->S_Ej_all)); 2003 PetscCall(MatDestroy(&sub_schurs->sum_S_Ej_all)); 2004 PetscCall(MatDestroy(&sub_schurs->sum_S_Ej_inv_all)); 2005 PetscCall(MatDestroy(&sub_schurs->sum_S_Ej_tilda_all)); 2006 PetscCall(ISDestroy(&sub_schurs->is_Ej_all)); 2007 PetscCall(ISDestroy(&sub_schurs->is_vertices)); 2008 PetscCall(ISDestroy(&sub_schurs->is_dir)); 2009 PetscCall(PetscBTDestroy(&sub_schurs->is_edge)); 2010 for (i = 0; i < sub_schurs->n_subs; i++) PetscCall(ISDestroy(&sub_schurs->is_subs[i])); 2011 if (sub_schurs->n_subs) PetscCall(PetscFree(sub_schurs->is_subs)); 2012 if (sub_schurs->reuse_solver) PetscCall(PCBDDCReuseSolversReset(sub_schurs->reuse_solver)); 2013 PetscCall(PetscFree(sub_schurs->reuse_solver)); 2014 if (sub_schurs->change) { 2015 for (i = 0; i < sub_schurs->n_subs; i++) { 2016 PetscCall(KSPDestroy(&sub_schurs->change[i])); 2017 PetscCall(ISDestroy(&sub_schurs->change_primal_sub[i])); 2018 } 2019 } 2020 PetscCall(PetscFree(sub_schurs->change)); 2021 PetscCall(PetscFree(sub_schurs->change_primal_sub)); 2022 sub_schurs->n_subs = 0; 2023 PetscFunctionReturn(PETSC_SUCCESS); 2024 } 2025 2026 PetscErrorCode PCBDDCSubSchursDestroy(PCBDDCSubSchurs *sub_schurs) 2027 { 2028 PetscFunctionBegin; 2029 PetscCall(PCBDDCSubSchursReset(*sub_schurs)); 2030 PetscCall(PetscFree(*sub_schurs)); 2031 PetscFunctionReturn(PETSC_SUCCESS); 2032 } 2033 2034 static inline PetscErrorCode PCBDDCAdjGetNextLayer_Private(PetscInt *queue_tip, PetscInt n_prev, PetscBT touched, PetscInt *xadj, PetscInt *adjncy, PetscInt *n_added) 2035 { 2036 PetscInt i, j, n; 2037 2038 PetscFunctionBegin; 2039 n = 0; 2040 for (i = -n_prev; i < 0; i++) { 2041 PetscInt start_dof = queue_tip[i]; 2042 for (j = xadj[start_dof]; j < xadj[start_dof + 1]; j++) { 2043 PetscInt dof = adjncy[j]; 2044 if (!PetscBTLookup(touched, dof)) { 2045 PetscCall(PetscBTSet(touched, dof)); 2046 queue_tip[n] = dof; 2047 n++; 2048 } 2049 } 2050 } 2051 *n_added = n; 2052 PetscFunctionReturn(PETSC_SUCCESS); 2053 } 2054