#include <../src/ksp/pc/impls/bddc/bddc.h> #include <../src/ksp/pc/impls/bddc/bddcprivate.h> #include PETSC_STATIC_INLINE PetscErrorCode PCBDDCAdjGetNextLayer_Private(PetscInt*,PetscInt,PetscBT,PetscInt*,PetscInt*,PetscInt*); static PetscErrorCode PCBDDCComputeExplicitSchur(Mat,PetscBool,MatReuse,Mat*); static PetscErrorCode PCBDDCMumpsInteriorSolve(PC,Vec,Vec); static PetscErrorCode PCBDDCMumpsCorrectionSolve(PC,Vec,Vec); #undef __FUNCT__ #define __FUNCT__ "SparseRankOneUpdate" PETSC_STATIC_INLINE PetscErrorCode SparseRankOneUpdate(PetscScalar *S,PetscInt n,PetscScalar a,PetscScalar *v1,PetscScalar *v2) { PetscInt i; PetscFunctionBegin; for (i=0;i PETSC_SMALL)) { PetscScalar v2v = a*v2[i]; PetscBLASInt B_N = n-i,B_one = 1; PetscStackCallBLAS("BLASaxpy",BLASaxpy_(&B_N,&v2v,v1+i,&B_one,S+i*(n+1),&B_one)); } } PetscFunctionReturn(0); } /* if v2 is not present, correction is done in-place */ #undef __FUNCT__ #define __FUNCT__ "PCBDDCReuseSolversChangeInterior" static PetscErrorCode PCBDDCReuseSolversChangeInterior(PCBDDCReuseMumps ctx, Vec v, Vec v2, PetscBool sol) { PetscScalar *array; PetscScalar *array2; PetscErrorCode ierr; PetscFunctionBegin; if (!ctx->benign_n) PetscFunctionReturn(0); if (v2) { PetscInt nl; ierr = VecGetArrayRead(v,(const PetscScalar**)&array);CHKERRQ(ierr); ierr = VecGetLocalSize(v2,&nl);CHKERRQ(ierr); ierr = VecGetArray(v2,&array2);CHKERRQ(ierr); ierr = PetscMemcpy(array2,array,nl*sizeof(PetscScalar));CHKERRQ(ierr); } else { ierr = VecGetArray(v,&array);CHKERRQ(ierr); array2 = array; } if (!sol) { /* change rhs */ PetscInt n; for (n=0;nbenign_n;n++) { PetscScalar sum = 0.; const PetscInt *cols; PetscInt nz,i; ierr = ISGetLocalSize(ctx->benign_zerodiag_subs[n],&nz);CHKERRQ(ierr); ierr = ISGetIndices(ctx->benign_zerodiag_subs[n],&cols);CHKERRQ(ierr); for (i=0;ibenign_save_vals[n] = array2[cols[nz-1]]; array2[cols[nz-1]] = sum; ierr = ISRestoreIndices(ctx->benign_zerodiag_subs[n],&cols);CHKERRQ(ierr); } } else { PetscInt n; for (n=0;nbenign_n;n++) { PetscScalar sum = 0.; const PetscInt *cols; PetscInt nz,i; ierr = ISGetLocalSize(ctx->benign_zerodiag_subs[n],&nz);CHKERRQ(ierr); ierr = ISGetIndices(ctx->benign_zerodiag_subs[n],&cols);CHKERRQ(ierr); for (i=0;ibenign_save_vals[n]; ierr = ISRestoreIndices(ctx->benign_zerodiag_subs[n],&cols);CHKERRQ(ierr); } } if (v2) { ierr = VecRestoreArrayRead(v,(const PetscScalar**)&array);CHKERRQ(ierr); ierr = VecRestoreArray(v2,&array);CHKERRQ(ierr); } else { ierr = VecRestoreArray(v,&array);CHKERRQ(ierr); } PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCMumpsReuseSolve_Private" static PetscErrorCode PCBDDCMumpsReuseSolve_Private(PC pc, Vec rhs, Vec sol, PetscBool transpose, PetscBool full) { PCBDDCReuseMumps ctx; PetscBool copy = PETSC_FALSE; PetscErrorCode ierr; PetscFunctionBegin; ierr = PCShellGetContext(pc,(void **)&ctx);CHKERRQ(ierr); if (full) { #if defined(PETSC_HAVE_MUMPS) ierr = MatMumpsSetIcntl(ctx->F,26,-1);CHKERRQ(ierr); #endif copy = ctx->has_vertices; } else { /* interior solver */ #if defined(PETSC_HAVE_MUMPS) ierr = MatMumpsSetIcntl(ctx->F,26,0);CHKERRQ(ierr); #endif #if defined(PETSC_HAVE_MKL_PARDISO) ierr = MatMkl_PardisoSetCntl(ctx->F,70,1);CHKERRQ(ierr); #endif copy = PETSC_TRUE; } /* copy rhs into factored matrix workspace */ if (copy) { PetscInt n; PetscScalar *array,*array_mumps; ierr = VecGetLocalSize(rhs,&n);CHKERRQ(ierr); ierr = VecGetArrayRead(rhs,(const PetscScalar**)&array);CHKERRQ(ierr); ierr = VecGetArray(ctx->rhs,&array_mumps);CHKERRQ(ierr); ierr = PetscMemcpy(array_mumps,array,n*sizeof(PetscScalar));CHKERRQ(ierr); ierr = VecRestoreArray(ctx->rhs,&array_mumps);CHKERRQ(ierr); ierr = VecRestoreArrayRead(rhs,(const PetscScalar**)&array);CHKERRQ(ierr); ierr = PCBDDCReuseSolversChangeInterior(ctx,ctx->rhs,NULL,PETSC_FALSE);CHKERRQ(ierr); if (transpose) { ierr = MatSolveTranspose(ctx->F,ctx->rhs,ctx->sol);CHKERRQ(ierr); } else { ierr = MatSolve(ctx->F,ctx->rhs,ctx->sol);CHKERRQ(ierr); } ierr = PCBDDCReuseSolversChangeInterior(ctx,ctx->sol,NULL,PETSC_TRUE);CHKERRQ(ierr); /* get back data to caller worskpace */ ierr = VecGetArrayRead(ctx->sol,(const PetscScalar**)&array_mumps);CHKERRQ(ierr); ierr = VecGetArray(sol,&array);CHKERRQ(ierr); ierr = PetscMemcpy(array,array_mumps,n*sizeof(PetscScalar));CHKERRQ(ierr); ierr = VecRestoreArray(sol,&array);CHKERRQ(ierr); ierr = VecRestoreArrayRead(ctx->sol,(const PetscScalar**)&array_mumps);CHKERRQ(ierr); } else { if (ctx->benign_n) { ierr = PCBDDCReuseSolversChangeInterior(ctx,rhs,ctx->rhs,PETSC_FALSE);CHKERRQ(ierr); if (transpose) { ierr = MatSolveTranspose(ctx->F,ctx->rhs,sol);CHKERRQ(ierr); } else { ierr = MatSolve(ctx->F,ctx->rhs,sol);CHKERRQ(ierr); } ierr = PCBDDCReuseSolversChangeInterior(ctx,sol,NULL,PETSC_TRUE);CHKERRQ(ierr); } else { if (transpose) { ierr = MatSolveTranspose(ctx->F,rhs,sol);CHKERRQ(ierr); } else { ierr = MatSolve(ctx->F,rhs,sol);CHKERRQ(ierr); } } } #if defined(PETSC_HAVE_MKL_PARDISO) ierr = MatMkl_PardisoSetCntl(ctx->F,70,0);CHKERRQ(ierr); #endif PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCMumpsCorrectionSolve" static PetscErrorCode PCBDDCMumpsCorrectionSolve(PC pc, Vec rhs, Vec sol) { PetscErrorCode ierr; PetscFunctionBegin; ierr = PCBDDCMumpsReuseSolve_Private(pc,rhs,sol,PETSC_FALSE,PETSC_TRUE);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCMumpsCorrectionSolveTranspose" static PetscErrorCode PCBDDCMumpsCorrectionSolveTranspose(PC pc, Vec rhs, Vec sol) { PetscErrorCode ierr; PetscFunctionBegin; ierr = PCBDDCMumpsReuseSolve_Private(pc,rhs,sol,PETSC_TRUE,PETSC_TRUE);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCMumpsInteriorSolve" static PetscErrorCode PCBDDCMumpsInteriorSolve(PC pc, Vec rhs, Vec sol) { PetscErrorCode ierr; PetscFunctionBegin; ierr = PCBDDCMumpsReuseSolve_Private(pc,rhs,sol,PETSC_FALSE,PETSC_FALSE);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCMumpsInteriorSolveTranspose" static PetscErrorCode PCBDDCMumpsInteriorSolveTranspose(PC pc, Vec rhs, Vec sol) { PetscErrorCode ierr; PetscFunctionBegin; ierr = PCBDDCMumpsReuseSolve_Private(pc,rhs,sol,PETSC_TRUE,PETSC_FALSE);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCReuseMumpsReset" static PetscErrorCode PCBDDCReuseMumpsReset(PCBDDCReuseMumps reuse) { PetscInt i; PetscErrorCode ierr; PetscFunctionBegin; ierr = MatDestroy(&reuse->F);CHKERRQ(ierr); ierr = VecDestroy(&reuse->sol);CHKERRQ(ierr); ierr = VecDestroy(&reuse->rhs);CHKERRQ(ierr); ierr = PCDestroy(&reuse->interior_solver);CHKERRQ(ierr); ierr = PCDestroy(&reuse->correction_solver);CHKERRQ(ierr); ierr = ISDestroy(&reuse->is_R);CHKERRQ(ierr); ierr = ISDestroy(&reuse->is_B);CHKERRQ(ierr); ierr = VecScatterDestroy(&reuse->correction_scatter_B);CHKERRQ(ierr); ierr = VecDestroy(&reuse->sol_B);CHKERRQ(ierr); ierr = VecDestroy(&reuse->rhs_B);CHKERRQ(ierr); for (i=0;ibenign_n;i++) { ierr = ISDestroy(&reuse->benign_zerodiag_subs[i]);CHKERRQ(ierr); } ierr = PetscFree(reuse->benign_zerodiag_subs);CHKERRQ(ierr); ierr = PetscFree(reuse->benign_save_vals);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCComputeExplicitSchur" static PetscErrorCode PCBDDCComputeExplicitSchur(Mat M, PetscBool issym, MatReuse reuse, Mat *S) { Mat B, C, D, Bd, Cd, AinvBd; KSP ksp; PC pc; PetscBool isLU, isILU, isCHOL, Bdense, Cdense; PetscReal fill = 2.0; PetscInt n_I; PetscMPIInt size; PetscErrorCode ierr; PetscFunctionBegin; ierr = MPI_Comm_size(PetscObjectComm((PetscObject)M),&size);CHKERRQ(ierr); if (size != 1) { SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not for parallel matrices"); } if (reuse == MAT_REUSE_MATRIX) { PetscBool Sdense; ierr = PetscObjectTypeCompare((PetscObject)*S, MATSEQDENSE, &Sdense);CHKERRQ(ierr); if (!Sdense) { SETERRQ(PetscObjectComm((PetscObject)M),PETSC_ERR_SUP,"S should be dense"); } } ierr = MatSchurComplementGetSubMatrices(M, NULL, NULL, &B, &C, &D);CHKERRQ(ierr); ierr = MatSchurComplementGetKSP(M, &ksp);CHKERRQ(ierr); ierr = KSPGetPC(ksp, &pc);CHKERRQ(ierr); ierr = PetscObjectTypeCompare((PetscObject) pc, PCLU, &isLU);CHKERRQ(ierr); ierr = PetscObjectTypeCompare((PetscObject) pc, PCILU, &isILU);CHKERRQ(ierr); ierr = PetscObjectTypeCompare((PetscObject) pc, PCCHOLESKY, &isCHOL);CHKERRQ(ierr); ierr = PetscObjectTypeCompare((PetscObject) B, MATSEQDENSE, &Bdense);CHKERRQ(ierr); ierr = PetscObjectTypeCompare((PetscObject) C, MATSEQDENSE, &Cdense);CHKERRQ(ierr); ierr = MatGetSize(B,&n_I,NULL);CHKERRQ(ierr); if (n_I) { if (!Bdense) { ierr = MatConvert(B, MATSEQDENSE, MAT_INITIAL_MATRIX, &Bd);CHKERRQ(ierr); } else { Bd = B; } if (isLU || isILU || isCHOL) { Mat fact; ierr = KSPSetUp(ksp);CHKERRQ(ierr); ierr = PCFactorGetMatrix(pc, &fact);CHKERRQ(ierr); ierr = MatDuplicate(Bd, MAT_DO_NOT_COPY_VALUES, &AinvBd);CHKERRQ(ierr); ierr = MatMatSolve(fact, Bd, AinvBd);CHKERRQ(ierr); } else { PetscBool ex = PETSC_TRUE; if (ex) { Mat Ainvd; ierr = PCComputeExplicitOperator(pc, &Ainvd);CHKERRQ(ierr); ierr = MatMatMult(Ainvd, Bd, MAT_INITIAL_MATRIX, fill, &AinvBd);CHKERRQ(ierr); ierr = MatDestroy(&Ainvd);CHKERRQ(ierr); } else { Vec sol,rhs; PetscScalar *arrayrhs,*arraysol; PetscInt i,nrhs,n; ierr = MatDuplicate(Bd, MAT_DO_NOT_COPY_VALUES, &AinvBd);CHKERRQ(ierr); ierr = MatGetSize(Bd,&n,&nrhs);CHKERRQ(ierr); ierr = MatDenseGetArray(Bd,&arrayrhs);CHKERRQ(ierr); ierr = MatDenseGetArray(AinvBd,&arraysol);CHKERRQ(ierr); ierr = KSPGetSolution(ksp,&sol);CHKERRQ(ierr); ierr = KSPGetRhs(ksp,&rhs);CHKERRQ(ierr); for (i=0;iA);CHKERRQ(ierr); ierr = MatDestroy(&sub_schurs->S);CHKERRQ(ierr); sub_schurs->is_hermitian = PETSC_FALSE; sub_schurs->is_posdef = PETSC_FALSE; if (Ain) { PetscBool isseqaij; /* determine if we are dealing with hermitian positive definite problems */ #if !defined(PETSC_USE_COMPLEX) if (Ain->symmetric_set) { sub_schurs->is_hermitian = Ain->symmetric; } #else if (Ain->hermitian_set) { sub_schurs->is_hermitian = Ain->hermitian; } #endif if (Ain->spd_set) { sub_schurs->is_posdef = Ain->spd; } /* check */ ierr = PetscObjectTypeCompare((PetscObject)Ain,MATSEQAIJ,&isseqaij);CHKERRQ(ierr); if (compute_Stilda && (!Ain->hermitian_set || !Ain->spd_set)) { /* these are lazy checks, maybe I should throw an error if they are not set */ PetscInt lsize; ierr = MatGetSize(Ain,&lsize,NULL);CHKERRQ(ierr); if (lsize) { PetscScalar val; PetscReal norm; Vec vec1,vec2,vec3; ierr = MatCreateVecs(Ain,&vec1,&vec2);CHKERRQ(ierr); ierr = VecDuplicate(vec1,&vec3);CHKERRQ(ierr); ierr = VecSetRandom(vec1,NULL);CHKERRQ(ierr); ierr = MatMult(Ain,vec1,vec2);CHKERRQ(ierr); #if !defined(PETSC_USE_COMPLEX) ierr = MatMultTranspose(Ain,vec1,vec3);CHKERRQ(ierr); #else ierr = MatMultHermitianTranspose(Ain,vec1,vec3);CHKERRQ(ierr); #endif ierr = VecAXPY(vec3,-1.0,vec2);CHKERRQ(ierr); ierr = VecNorm(vec3,NORM_INFINITY,&norm);CHKERRQ(ierr); if (!Ain->hermitian_set) { if (norm > PetscSqrtReal(PETSC_SMALL)) { sub_schurs->is_hermitian = PETSC_FALSE; } else { sub_schurs->is_hermitian = PETSC_TRUE; } } if (!Ain->spd_set && !benign_trick) { ierr = VecDot(vec1,vec2,&val);CHKERRQ(ierr); if (PetscRealPart(val) > 0. && PetscAbsReal(PetscImaginaryPart(val)) < PETSC_SMALL) sub_schurs->is_posdef = PETSC_TRUE; } ierr = VecDestroy(&vec1);CHKERRQ(ierr); ierr = VecDestroy(&vec2);CHKERRQ(ierr); ierr = VecDestroy(&vec3);CHKERRQ(ierr); } else { sub_schurs->is_hermitian = PETSC_TRUE; sub_schurs->is_posdef = PETSC_TRUE; } } if (isseqaij) { ierr = PetscObjectReference((PetscObject)Ain);CHKERRQ(ierr); sub_schurs->A = Ain; } else { ierr = MatConvert(Ain,MATSEQAIJ,MAT_INITIAL_MATRIX,&sub_schurs->A);CHKERRQ(ierr); } } ierr = PetscObjectReference((PetscObject)Sin);CHKERRQ(ierr); sub_schurs->S = Sin; if (sub_schurs->use_mumps) { sub_schurs->use_mumps = (PetscBool)(!!sub_schurs->A); } /* preliminary checks */ if (!sub_schurs->use_mumps && compute_Stilda) { SETERRQ(PetscObjectComm((PetscObject)sub_schurs->l2gmap),PETSC_ERR_SUP,"Adaptive selection of constraints requires MUMPS"); } /* restrict work on active processes */ color = 0; if (!sub_schurs->n_subs) color = 1; /* this can happen if we are in a multilevel case or if the subdomain is disconnected */ ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)sub_schurs->l2gmap),&rank);CHKERRQ(ierr); ierr = PetscSubcommCreate(PetscObjectComm((PetscObject)sub_schurs->l2gmap),&subcomm);CHKERRQ(ierr); ierr = PetscSubcommSetNumber(subcomm,2);CHKERRQ(ierr); ierr = PetscSubcommSetTypeGeneral(subcomm,color,rank);CHKERRQ(ierr); ierr = PetscCommDuplicate(PetscSubcommChild(subcomm),&comm_n,NULL);CHKERRQ(ierr); ierr = PetscSubcommDestroy(&subcomm);CHKERRQ(ierr); if (!sub_schurs->n_subs) { ierr = PetscCommDestroy(&comm_n);CHKERRQ(ierr); PetscFunctionReturn(0); } /* ierr = PetscCommDuplicate(PetscObjectComm((PetscObject)sub_schurs->l2gmap),&comm_n,NULL);CHKERRQ(ierr); */ /* get Schur complement matrices */ if (!sub_schurs->use_mumps) { Mat tA_IB,tA_BI,tA_BB; PetscBool isseqsbaij; ierr = MatSchurComplementGetSubMatrices(sub_schurs->S,&A_II,NULL,&tA_IB,&tA_BI,&tA_BB);CHKERRQ(ierr); ierr = PetscObjectTypeCompare((PetscObject)tA_BB,MATSEQSBAIJ,&isseqsbaij);CHKERRQ(ierr); if (isseqsbaij) { ierr = MatConvert(tA_BB,MATSEQAIJ,MAT_INITIAL_MATRIX,&A_BB);CHKERRQ(ierr); ierr = MatConvert(tA_IB,MATSEQAIJ,MAT_INITIAL_MATRIX,&A_IB);CHKERRQ(ierr); ierr = MatConvert(tA_BI,MATSEQAIJ,MAT_INITIAL_MATRIX,&A_BI);CHKERRQ(ierr); } else { ierr = PetscObjectReference((PetscObject)tA_BB);CHKERRQ(ierr); A_BB = tA_BB; ierr = PetscObjectReference((PetscObject)tA_IB);CHKERRQ(ierr); A_IB = tA_IB; ierr = PetscObjectReference((PetscObject)tA_BI);CHKERRQ(ierr); A_BI = tA_BI; } } else { A_II = NULL; A_IB = NULL; A_BI = NULL; A_BB = NULL; } S_all = NULL; /* determine interior problems */ ierr = ISGetLocalSize(sub_schurs->is_I,&i);CHKERRQ(ierr); if (nlayers >= 0 && i) { /* Interior problems can be different from the original one */ PetscBT touched; const PetscInt* idx_B; PetscInt n_I,n_B,n_local_dofs,n_prev_added,j,layer,*local_numbering; if (xadj == NULL || adjncy == NULL) { SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Cannot request layering without adjacency"); } /* get sizes */ ierr = ISGetLocalSize(sub_schurs->is_I,&n_I);CHKERRQ(ierr); ierr = ISGetLocalSize(sub_schurs->is_B,&n_B);CHKERRQ(ierr); ierr = PetscMalloc1(n_I+n_B,&local_numbering);CHKERRQ(ierr); ierr = PetscBTCreate(n_I+n_B,&touched);CHKERRQ(ierr); ierr = PetscBTMemzero(n_I+n_B,touched);CHKERRQ(ierr); /* all boundary dofs must be skipped when adding layers */ ierr = ISGetIndices(sub_schurs->is_B,&idx_B);CHKERRQ(ierr); for (j=0;jis_B,&idx_B);CHKERRQ(ierr); /* add prescribed number of layers of dofs */ n_local_dofs = n_B; n_prev_added = n_B; for (layer=0;layer n_I+n_B) { SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error querying layer %d. Out of bound access (%d > %d)",layer,n_local_dofs,n_I+n_B); } ierr = PCBDDCAdjGetNextLayer_Private(local_numbering+n_local_dofs,n_prev_added,touched,xadj,adjncy,&n_added);CHKERRQ(ierr); n_prev_added = n_added; n_local_dofs += n_added; if (!n_added) break; } ierr = PetscBTDestroy(&touched);CHKERRQ(ierr); /* IS for I layer dofs in original numbering */ ierr = ISCreateGeneral(PetscObjectComm((PetscObject)sub_schurs->is_I),n_local_dofs-n_B,local_numbering+n_B,PETSC_COPY_VALUES,&is_I_layer);CHKERRQ(ierr); ierr = PetscFree(local_numbering);CHKERRQ(ierr); ierr = ISSort(is_I_layer);CHKERRQ(ierr); /* IS for I layer dofs in I numbering */ if (!sub_schurs->use_mumps) { ISLocalToGlobalMapping ItoNmap; ierr = ISLocalToGlobalMappingCreateIS(sub_schurs->is_I,&ItoNmap);CHKERRQ(ierr); ierr = ISGlobalToLocalMappingApplyIS(ItoNmap,IS_GTOLM_DROP,is_I_layer,&is_I);CHKERRQ(ierr); ierr = ISLocalToGlobalMappingDestroy(&ItoNmap);CHKERRQ(ierr); /* II block */ ierr = MatGetSubMatrix(A_II,is_I,is_I,MAT_INITIAL_MATRIX,&AE_II);CHKERRQ(ierr); } } else { PetscInt n_I; /* IS for I dofs in original numbering */ ierr = PetscObjectReference((PetscObject)sub_schurs->is_I);CHKERRQ(ierr); is_I_layer = sub_schurs->is_I; /* IS for I dofs in I numbering (strided 1) */ if (!sub_schurs->use_mumps) { ierr = ISGetSize(sub_schurs->is_I,&n_I);CHKERRQ(ierr); ierr = ISCreateStride(PetscObjectComm((PetscObject)sub_schurs->is_I),n_I,0,1,&is_I);CHKERRQ(ierr); /* II block is the same */ ierr = PetscObjectReference((PetscObject)A_II);CHKERRQ(ierr); AE_II = A_II; } } /* Get info on subset sizes and sum of all subsets sizes */ max_subset_size = 0; local_size = 0; for (i=0;in_subs;i++) { ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); max_subset_size = PetscMax(subset_size,max_subset_size); local_size += subset_size; } /* Work arrays for local indices */ extra = 0; ierr = ISGetLocalSize(sub_schurs->is_B,&n_B);CHKERRQ(ierr); if (sub_schurs->use_mumps && is_I_layer) { ierr = ISGetLocalSize(is_I_layer,&extra);CHKERRQ(ierr); } ierr = PetscMalloc1(n_B+extra,&all_local_idx_N);CHKERRQ(ierr); if (extra) { const PetscInt *idxs; ierr = ISGetIndices(is_I_layer,&idxs);CHKERRQ(ierr); ierr = PetscMemcpy(all_local_idx_N,idxs,extra*sizeof(PetscInt));CHKERRQ(ierr); ierr = ISRestoreIndices(is_I_layer,&idxs);CHKERRQ(ierr); } ierr = PetscMalloc1(local_size,&nnz);CHKERRQ(ierr); ierr = PetscMalloc1(sub_schurs->n_subs,&auxnum1);CHKERRQ(ierr); ierr = PetscMalloc1(sub_schurs->n_subs,&auxnum2);CHKERRQ(ierr); /* Get local indices in local numbering */ local_size = 0; for (i=0;in_subs;i++) { PetscInt j; const PetscInt *idxs; ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); ierr = ISGetIndices(sub_schurs->is_subs[i],&idxs);CHKERRQ(ierr); /* start (smallest in global ordering) and multiplicity */ auxnum1[i] = idxs[0]; auxnum2[i] = subset_size; /* subset indices in local numbering */ ierr = PetscMemcpy(all_local_idx_N+local_size+extra,idxs,subset_size*sizeof(PetscInt));CHKERRQ(ierr); ierr = ISRestoreIndices(sub_schurs->is_subs[i],&idxs);CHKERRQ(ierr); for (j=0;jis_hermitian || !sub_schurs->is_posdef)) { PetscScalar lwork; use_getr = PETSC_TRUE; B_lwork = -1; ierr = PetscBLASIntCast(local_size,&B_N);CHKERRQ(ierr); ierr = PetscFPTrapPush(PETSC_FP_TRAP_OFF);CHKERRQ(ierr); PetscStackCallBLAS("LAPACKgetri",LAPACKgetri_(&B_N,Bwork,&B_N,pivots,&lwork,&B_lwork,&B_ierr)); ierr = PetscFPTrapPop();CHKERRQ(ierr); if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in query to GETRI Lapack routine %d",(int)B_ierr); ierr = PetscBLASIntCast((PetscInt)PetscRealPart(lwork),&B_lwork);CHKERRQ(ierr); ierr = PetscMalloc2(B_lwork,&Bwork,B_N,&pivots);CHKERRQ(ierr); } /* prepare parallel matrices for summing up properly schurs on subsets */ ierr = ISCreateGeneral(comm_n,sub_schurs->n_subs,auxnum1,PETSC_OWN_POINTER,&all_subsets_n);CHKERRQ(ierr); ierr = ISLocalToGlobalMappingApplyIS(sub_schurs->l2gmap,all_subsets_n,&all_subsets);CHKERRQ(ierr); ierr = ISDestroy(&all_subsets_n);CHKERRQ(ierr); ierr = ISCreateGeneral(comm_n,sub_schurs->n_subs,auxnum2,PETSC_OWN_POINTER,&all_subsets_mult);CHKERRQ(ierr); ierr = PCBDDCSubsetNumbering(all_subsets,all_subsets_mult,&global_size,&all_subsets_n);CHKERRQ(ierr); ierr = ISDestroy(&all_subsets);CHKERRQ(ierr); ierr = ISDestroy(&all_subsets_mult);CHKERRQ(ierr); ierr = ISGetLocalSize(all_subsets_n,&i);CHKERRQ(ierr); if (i != local_size) { SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Invalid size of new subset! %d != %d",i,local_size); } ierr = ISLocalToGlobalMappingCreateIS(all_subsets_n,&l2gmap_subsets);CHKERRQ(ierr); ierr = MatCreateIS(comm_n,1,PETSC_DECIDE,PETSC_DECIDE,global_size,global_size,l2gmap_subsets,NULL,&work_mat);CHKERRQ(ierr); ierr = ISLocalToGlobalMappingDestroy(&l2gmap_subsets);CHKERRQ(ierr); ierr = MatCreate(PetscObjectComm((PetscObject)work_mat),&global_schur_subsets);CHKERRQ(ierr); ierr = MatSetSizes(global_schur_subsets,PETSC_DECIDE,PETSC_DECIDE,global_size,global_size);CHKERRQ(ierr); ierr = MatSetType(global_schur_subsets,MATMPIAIJ);CHKERRQ(ierr); /* subset indices in local boundary numbering */ if (!sub_schurs->is_Ej_all) { PetscInt *all_local_idx_B; ierr = PetscMalloc1(local_size,&all_local_idx_B);CHKERRQ(ierr); ierr = ISGlobalToLocalMappingApply(sub_schurs->BtoNmap,IS_GTOLM_DROP,local_size,all_local_idx_N+extra,&subset_size,all_local_idx_B);CHKERRQ(ierr); if (subset_size != local_size) { SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in sub_schurs serial (BtoNmap)! %d != %d\n",subset_size,local_size); } ierr = ISCreateGeneral(PETSC_COMM_SELF,local_size,all_local_idx_B,PETSC_OWN_POINTER,&sub_schurs->is_Ej_all);CHKERRQ(ierr); } /* Local matrix of all local Schur on subsets (transposed) */ if (!sub_schurs->S_Ej_all) { ierr = MatCreate(PETSC_COMM_SELF,&sub_schurs->S_Ej_all);CHKERRQ(ierr); ierr = MatSetSizes(sub_schurs->S_Ej_all,PETSC_DECIDE,PETSC_DECIDE,local_size,local_size);CHKERRQ(ierr); ierr = MatSetType(sub_schurs->S_Ej_all,MATAIJ);CHKERRQ(ierr); ierr = MatSeqAIJSetPreallocation(sub_schurs->S_Ej_all,0,nnz);CHKERRQ(ierr); } /* Compute Schur complements explicitly */ F = NULL; if (!sub_schurs->use_mumps) { /* this code branch is used when MUMPS is not present; it is not very efficient, unless the economic version of the scaling is required */ Mat S_Ej_expl; PetscScalar *work; PetscInt j,*dummy_idx; PetscBool Sdense; ierr = PetscMalloc2(max_subset_size,&dummy_idx,max_subset_size*max_subset_size,&work);CHKERRQ(ierr); local_size = 0; for (i=0;in_subs;i++) { IS is_subset_B; Mat AE_EE,AE_IE,AE_EI,S_Ej; /* subsets in original and boundary numbering */ ierr = ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap,IS_GTOLM_DROP,sub_schurs->is_subs[i],&is_subset_B);CHKERRQ(ierr); /* EE block */ ierr = MatGetSubMatrix(A_BB,is_subset_B,is_subset_B,MAT_INITIAL_MATRIX,&AE_EE);CHKERRQ(ierr); /* IE block */ ierr = MatGetSubMatrix(A_IB,is_I,is_subset_B,MAT_INITIAL_MATRIX,&AE_IE);CHKERRQ(ierr); /* EI block */ if (sub_schurs->is_hermitian) { ierr = MatCreateTranspose(AE_IE,&AE_EI);CHKERRQ(ierr); } else { ierr = MatGetSubMatrix(A_BI,is_subset_B,is_I,MAT_INITIAL_MATRIX,&AE_EI);CHKERRQ(ierr); } ierr = ISDestroy(&is_subset_B);CHKERRQ(ierr); ierr = MatCreateSchurComplement(AE_II,AE_II,AE_IE,AE_EI,AE_EE,&S_Ej);CHKERRQ(ierr); ierr = MatDestroy(&AE_EE);CHKERRQ(ierr); ierr = MatDestroy(&AE_IE);CHKERRQ(ierr); ierr = MatDestroy(&AE_EI);CHKERRQ(ierr); if (AE_II == A_II) { /* we can reuse the same ksp */ KSP ksp; ierr = MatSchurComplementGetKSP(sub_schurs->S,&ksp);CHKERRQ(ierr); ierr = MatSchurComplementSetKSP(S_Ej,ksp);CHKERRQ(ierr); } else { /* build new ksp object which inherits ksp and pc types from the original one */ KSP origksp,schurksp; PC origpc,schurpc; KSPType ksp_type; PetscInt n_internal; PetscBool ispcnone; ierr = MatSchurComplementGetKSP(sub_schurs->S,&origksp);CHKERRQ(ierr); ierr = MatSchurComplementGetKSP(S_Ej,&schurksp);CHKERRQ(ierr); ierr = KSPGetType(origksp,&ksp_type);CHKERRQ(ierr); ierr = KSPSetType(schurksp,ksp_type);CHKERRQ(ierr); ierr = KSPGetPC(schurksp,&schurpc);CHKERRQ(ierr); ierr = KSPGetPC(origksp,&origpc);CHKERRQ(ierr); ierr = PetscObjectTypeCompare((PetscObject)origpc,PCNONE,&ispcnone);CHKERRQ(ierr); if (!ispcnone) { PCType pc_type; ierr = PCGetType(origpc,&pc_type);CHKERRQ(ierr); ierr = PCSetType(schurpc,pc_type);CHKERRQ(ierr); } else { ierr = PCSetType(schurpc,PCLU);CHKERRQ(ierr); } ierr = ISGetSize(is_I,&n_internal);CHKERRQ(ierr); if (n_internal) { /* UMFPACK gives error with 0 sized problems */ MatSolverPackage solver=NULL; ierr = PCFactorGetMatSolverPackage(origpc,(const MatSolverPackage*)&solver);CHKERRQ(ierr); if (solver) { ierr = PCFactorSetMatSolverPackage(schurpc,solver);CHKERRQ(ierr); } } ierr = KSPSetUp(schurksp);CHKERRQ(ierr); } ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); ierr = MatCreateSeqDense(PETSC_COMM_SELF,subset_size,subset_size,work,&S_Ej_expl);CHKERRQ(ierr); ierr = PCBDDCComputeExplicitSchur(S_Ej,sub_schurs->is_hermitian,MAT_REUSE_MATRIX,&S_Ej_expl);CHKERRQ(ierr); ierr = PetscObjectTypeCompare((PetscObject)S_Ej_expl,MATSEQDENSE,&Sdense);CHKERRQ(ierr); if (Sdense) { for (j=0;jS_Ej_all,subset_size,dummy_idx,subset_size,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); } else { SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Not yet implemented for sparse matrices"); } ierr = MatDestroy(&S_Ej);CHKERRQ(ierr); ierr = MatDestroy(&S_Ej_expl);CHKERRQ(ierr); local_size += subset_size; } ierr = PetscFree2(dummy_idx,work);CHKERRQ(ierr); /* free */ ierr = ISDestroy(&is_I);CHKERRQ(ierr); ierr = MatDestroy(&AE_II);CHKERRQ(ierr); ierr = PetscFree(all_local_idx_N);CHKERRQ(ierr); } else { Mat A; Vec *benign_AIIm1_ones = NULL; IS is_A_all,*is_p_r = NULL; PetscScalar *work,*S_data,*schur_factor,*cs_AIB = NULL; PetscInt n,n_I,*dummy_idx,size_schur,size_active_schur,cum,cum2; PetscBool economic,mumps_S,S_lower_triangular = PETSC_FALSE,factor_workaround; char solver[256]; /* get sizes */ n_I = 0; if (is_I_layer) { ierr = ISGetLocalSize(is_I_layer,&n_I);CHKERRQ(ierr); } economic = PETSC_FALSE; ierr = ISGetLocalSize(sub_schurs->is_I,&cum);CHKERRQ(ierr); if (cum != n_I) economic = PETSC_TRUE; ierr = MatGetLocalSize(sub_schurs->A,&n,NULL);CHKERRQ(ierr); /* size active schurs does not count any dirichlet or vertex dof on the interface */ size_active_schur = local_size; cum = n_I+size_active_schur; if (sub_schurs->is_dir) { const PetscInt* idxs; PetscInt n_dir; ierr = ISGetLocalSize(sub_schurs->is_dir,&n_dir);CHKERRQ(ierr); ierr = ISGetIndices(sub_schurs->is_dir,&idxs);CHKERRQ(ierr); ierr = PetscMemcpy(all_local_idx_N+cum,idxs,n_dir*sizeof(PetscInt));CHKERRQ(ierr); ierr = ISRestoreIndices(sub_schurs->is_dir,&idxs);CHKERRQ(ierr); cum += n_dir; } factor_workaround = PETSC_FALSE; /* include the primal vertices in the Schur complement */ if (exact_schur && sub_schurs->is_vertices && compute_Stilda) { PetscInt n_v; ierr = ISGetLocalSize(sub_schurs->is_vertices,&n_v);CHKERRQ(ierr); if (n_v) { const PetscInt* idxs; ierr = ISGetIndices(sub_schurs->is_vertices,&idxs);CHKERRQ(ierr); ierr = PetscMemcpy(all_local_idx_N+cum,idxs,n_v*sizeof(PetscInt));CHKERRQ(ierr); ierr = ISRestoreIndices(sub_schurs->is_vertices,&idxs);CHKERRQ(ierr); cum += n_v; factor_workaround = PETSC_TRUE; } } size_schur = cum - n_I; ierr = ISCreateGeneral(PETSC_COMM_SELF,cum,all_local_idx_N,PETSC_OWN_POINTER,&is_A_all);CHKERRQ(ierr); /* get working mat (TODO: factorize without actually permuting) */ if (cum == n) { ierr = ISSetPermutation(is_A_all);CHKERRQ(ierr); ierr = MatPermute(sub_schurs->A,is_A_all,is_A_all,&A);CHKERRQ(ierr); } else { ierr = MatGetSubMatrix(sub_schurs->A,is_A_all,is_A_all,MAT_INITIAL_MATRIX,&A);CHKERRQ(ierr); } ierr = MatSetOptionsPrefix(A,"sub_schurs_");CHKERRQ(ierr); /* if we actually change the basis for the pressures, LDL^T factors will use a lot of memory more than n^2 instead of n^1.5 or something. This is a workaround */ if (benign_n) { Vec v; ISLocalToGlobalMapping N_to_reor; IS is_p0,is_p0_p; ierr = ISLocalToGlobalMappingCreateIS(is_A_all,&N_to_reor);CHKERRQ(ierr); ierr = ISCreateGeneral(PETSC_COMM_SELF,benign_n,benign_p0_lidx,PETSC_COPY_VALUES,&is_p0);CHKERRQ(ierr); ierr = ISGlobalToLocalMappingApplyIS(N_to_reor,IS_GTOLM_DROP,is_p0,&is_p0_p);CHKERRQ(ierr); ierr = ISDestroy(&is_p0);CHKERRQ(ierr); ierr = MatCreateVecs(A,&v,NULL);CHKERRQ(ierr); ierr = VecDuplicateVecs(v,benign_n,&benign_AIIm1_ones);CHKERRQ(ierr); ierr = PetscMalloc1(size_schur*benign_n,&cs_AIB);CHKERRQ(ierr); ierr = PetscMalloc1(benign_n,&is_p_r);CHKERRQ(ierr); /* compute colsum of A_IB restricted to pressures */ for (i=0;iis_hermitian);CHKERRQ(ierr); ierr = MatSetOption(A,MAT_HERMITIAN,sub_schurs->is_hermitian);CHKERRQ(ierr); ierr = MatSetOption(A,MAT_SPD,sub_schurs->is_posdef);CHKERRQ(ierr); ierr = PetscStrcpy(solver,MATSOLVERMUMPS);CHKERRQ(ierr); ierr = PetscOptionsGetString("sub_schurs_","-mat_solver_package",solver,256,NULL);CHKERRQ(ierr); /* when using the benign subspace trick, the local Schur complements are SPD */ if (benign_trick) sub_schurs->is_posdef = PETSC_TRUE; if (n_I) { /* TODO add ordering from options */ IS is_schur; if (sub_schurs->is_hermitian && sub_schurs->is_posdef) { ierr = MatGetFactor(A,solver,MAT_FACTOR_CHOLESKY,&F);CHKERRQ(ierr); } else { ierr = MatGetFactor(A,solver,MAT_FACTOR_LU,&F);CHKERRQ(ierr); } /* subsets ordered last */ ierr = ISCreateStride(PETSC_COMM_SELF,size_schur,n_I,1,&is_schur);CHKERRQ(ierr); ierr = MatFactorSetSchurIS(F,is_schur);CHKERRQ(ierr); ierr = ISDestroy(&is_schur);CHKERRQ(ierr); /* factorization step */ if (sub_schurs->is_hermitian && sub_schurs->is_posdef) { ierr = MatCholeskyFactorSymbolic(F,A,NULL,NULL);CHKERRQ(ierr); #if defined(PETSC_HAVE_MUMPS) /* be sure that icntl 19 is not set by command line */ ierr = MatMumpsSetIcntl(F,19,2);CHKERRQ(ierr); #endif if (sub_schurs->is_posdef) { ierr = MatFactorSetSchurComplementSolverType(F,1);CHKERRQ(ierr); } else { ierr = MatFactorSetSchurComplementSolverType(F,2);CHKERRQ(ierr); } ierr = MatCholeskyFactorNumeric(F,A,NULL);CHKERRQ(ierr); S_lower_triangular = PETSC_TRUE; } else { ierr = MatLUFactorSymbolic(F,A,NULL,NULL,NULL);CHKERRQ(ierr); #if defined(PETSC_HAVE_MUMPS) /* be sure that icntl 19 is not set by command line */ ierr = MatMumpsSetIcntl(F,19,3);CHKERRQ(ierr); #endif ierr = MatLUFactorNumeric(F,A,NULL);CHKERRQ(ierr); } /* get explicit Schur Complement computed during numeric factorization */ ierr = MatFactorGetSchurComplement(F,&S_all);CHKERRQ(ierr); /* we can reuse the solvers if we are not using the economic version */ reuse_solvers = (PetscBool)(reuse_solvers && !economic); factor_workaround = (PetscBool)(reuse_solvers && factor_workaround); mumps_S = PETSC_TRUE; /* update the Schur complement with the change of basis */ if (benign_n) { PetscScalar *S_data; Vec v; ierr = MatDenseGetArray(S_all,&S_data);CHKERRQ(ierr); ierr = VecDuplicate(benign_AIIm1_ones[0],&v);CHKERRQ(ierr); #if defined(PETSC_HAVE_MUMPS) ierr = MatMumpsSetIcntl(F,26,0);CHKERRQ(ierr); #endif #if defined(PETSC_HAVE_MKL_PARDISO) ierr = MatMkl_PardisoSetCntl(F,70,1);CHKERRQ(ierr); #endif for (i=0;ireuse_mumps) { ierr = PCBDDCReuseMumpsReset(sub_schurs->reuse_mumps);CHKERRQ(ierr); } else { ierr = PetscNew(&sub_schurs->reuse_mumps);CHKERRQ(ierr); } msolv_ctx = sub_schurs->reuse_mumps; ierr = MatSchurComplementGetSubMatrices(sub_schurs->S,&A_II,NULL,NULL,NULL,NULL);CHKERRQ(ierr); ierr = PetscObjectReference((PetscObject)F);CHKERRQ(ierr); msolv_ctx->F = F; ierr = MatCreateVecs(F,&msolv_ctx->sol,NULL);CHKERRQ(ierr); /* currently PETSc has no support for MatSolve(F,x,x), so cheat and let rhs and sol share the same memory */ { PetscScalar *array; PetscInt n; ierr = VecGetLocalSize(msolv_ctx->sol,&n);CHKERRQ(ierr); ierr = VecGetArray(msolv_ctx->sol,&array);CHKERRQ(ierr); ierr = VecCreateSeqWithArray(PetscObjectComm((PetscObject)msolv_ctx->sol),1,n,array,&msolv_ctx->rhs);CHKERRQ(ierr); ierr = VecRestoreArray(msolv_ctx->sol,&array);CHKERRQ(ierr); } msolv_ctx->has_vertices = factor_workaround; /* interior solver */ ierr = PCCreate(PetscObjectComm((PetscObject)A_II),&msolv_ctx->interior_solver);CHKERRQ(ierr); ierr = PCSetOperators(msolv_ctx->interior_solver,A_II,A_II);CHKERRQ(ierr); ierr = PCSetType(msolv_ctx->interior_solver,PCSHELL);CHKERRQ(ierr); ierr = PCShellSetContext(msolv_ctx->interior_solver,msolv_ctx);CHKERRQ(ierr); ierr = PCShellSetApply(msolv_ctx->interior_solver,PCBDDCMumpsInteriorSolve);CHKERRQ(ierr); ierr = PCShellSetApplyTranspose(msolv_ctx->interior_solver,PCBDDCMumpsInteriorSolveTranspose);CHKERRQ(ierr); /* correction solver */ ierr = PCCreate(PetscObjectComm((PetscObject)A),&msolv_ctx->correction_solver);CHKERRQ(ierr); ierr = PCSetOperators(msolv_ctx->correction_solver,A,A);CHKERRQ(ierr); ierr = PCSetType(msolv_ctx->correction_solver,PCSHELL);CHKERRQ(ierr); ierr = PCShellSetContext(msolv_ctx->correction_solver,msolv_ctx);CHKERRQ(ierr); ierr = PCShellSetApply(msolv_ctx->correction_solver,PCBDDCMumpsCorrectionSolve);CHKERRQ(ierr); ierr = PCShellSetApplyTranspose(msolv_ctx->correction_solver,PCBDDCMumpsCorrectionSolveTranspose);CHKERRQ(ierr); /* scatter and vecs for Schur complement solver */ ierr = MatCreateVecs(S_all,&msolv_ctx->sol_B,&msolv_ctx->rhs_B);CHKERRQ(ierr); ierr = MatCreateVecs(sub_schurs->S,&vec1_B,NULL);CHKERRQ(ierr); if (!factor_workaround) { ierr = ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap,IS_GTOLM_DROP,is_A_all,&msolv_ctx->is_B);CHKERRQ(ierr); ierr = VecScatterCreate(vec1_B,msolv_ctx->is_B,msolv_ctx->sol_B,NULL,&msolv_ctx->correction_scatter_B);CHKERRQ(ierr); ierr = PetscObjectReference((PetscObject)is_A_all);CHKERRQ(ierr); msolv_ctx->is_R = is_A_all; } else { IS is_B_all; const PetscInt* idxs; PetscInt dual,n_v,n; ierr = ISGetLocalSize(sub_schurs->is_vertices,&n_v);CHKERRQ(ierr); dual = size_schur - n_v; ierr = ISGetLocalSize(is_A_all,&n);CHKERRQ(ierr); ierr = ISGetIndices(is_A_all,&idxs);CHKERRQ(ierr); ierr = ISCreateGeneral(PetscObjectComm((PetscObject)is_A_all),dual,idxs+n_I,PETSC_COPY_VALUES,&is_B_all);CHKERRQ(ierr); ierr = ISGlobalToLocalMappingApplyIS(sub_schurs->BtoNmap,IS_GTOLM_DROP,is_B_all,&msolv_ctx->is_B);CHKERRQ(ierr); ierr = ISDestroy(&is_B_all);CHKERRQ(ierr); ierr = ISCreateStride(PetscObjectComm((PetscObject)is_A_all),dual,0,1,&is_B_all);CHKERRQ(ierr); ierr = VecScatterCreate(vec1_B,msolv_ctx->is_B,msolv_ctx->sol_B,is_B_all,&msolv_ctx->correction_scatter_B);CHKERRQ(ierr); ierr = ISDestroy(&is_B_all);CHKERRQ(ierr); ierr = ISCreateGeneral(PetscObjectComm((PetscObject)is_A_all),n-n_v,idxs,PETSC_COPY_VALUES,&msolv_ctx->is_R);CHKERRQ(ierr); ierr = ISRestoreIndices(is_A_all,&idxs);CHKERRQ(ierr); } ierr = VecDestroy(&vec1_B);CHKERRQ(ierr); /* communicate benign info to solver context */ if (benign_n) { msolv_ctx->benign_n = benign_n; msolv_ctx->benign_zerodiag_subs = is_p_r; ierr = PetscMalloc1(benign_n,&msolv_ctx->benign_save_vals);CHKERRQ(ierr); } } ierr = MatDestroy(&A);CHKERRQ(ierr); ierr = ISDestroy(&is_A_all);CHKERRQ(ierr); /* Work arrays */ ierr = PetscMalloc2(max_subset_size,&dummy_idx,max_subset_size*max_subset_size,&work);CHKERRQ(ierr); /* matrices for adaptive selection */ if (compute_Stilda) { if (!sub_schurs->sum_S_Ej_tilda_all) { ierr = MatCreate(PETSC_COMM_SELF,&sub_schurs->sum_S_Ej_tilda_all);CHKERRQ(ierr); ierr = MatSetSizes(sub_schurs->sum_S_Ej_tilda_all,PETSC_DECIDE,PETSC_DECIDE,size_active_schur,size_active_schur);CHKERRQ(ierr); ierr = MatSetType(sub_schurs->sum_S_Ej_tilda_all,MATAIJ);CHKERRQ(ierr); ierr = MatSeqAIJSetPreallocation(sub_schurs->sum_S_Ej_tilda_all,0,nnz);CHKERRQ(ierr); } if (!sub_schurs->sum_S_Ej_inv_all) { ierr = MatCreate(PETSC_COMM_SELF,&sub_schurs->sum_S_Ej_inv_all);CHKERRQ(ierr); ierr = MatSetSizes(sub_schurs->sum_S_Ej_inv_all,PETSC_DECIDE,PETSC_DECIDE,size_active_schur,size_active_schur);CHKERRQ(ierr); ierr = MatSetType(sub_schurs->sum_S_Ej_inv_all,MATAIJ);CHKERRQ(ierr); ierr = MatSeqAIJSetPreallocation(sub_schurs->sum_S_Ej_inv_all,0,nnz);CHKERRQ(ierr); } } /* S_Ej_all */ cum = cum2 = 0; ierr = MatDenseGetArray(S_all,&S_data);CHKERRQ(ierr); for (i=0;in_subs;i++) { PetscInt j; /* get S_E */ ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); if (S_lower_triangular) { /* I need to expand the upper triangular data (column oriented) */ PetscInt k; for (k=0;kS_Ej_all,subset_size,dummy_idx,subset_size,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); /* if adaptivity is requested, invert S_E blocks */ if (compute_Stilda) { ierr = PetscBLASIntCast(subset_size,&B_N);CHKERRQ(ierr); ierr = PetscFPTrapPush(PETSC_FP_TRAP_OFF);CHKERRQ(ierr); if (!use_getr) { /* TODO add sytrf/i for symmetric non hermitian */ PetscStackCallBLAS("LAPACKpotrf",LAPACKpotrf_("L",&B_N,work,&B_N,&B_ierr)); if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRF Lapack routine %d",(int)B_ierr); PetscStackCallBLAS("LAPACKpotri",LAPACKpotri_("L",&B_N,work,&B_N,&B_ierr)); if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRI Lapack routine %d",(int)B_ierr); } else { PetscStackCallBLAS("LAPACKgetrf",LAPACKgetrf_(&B_N,&B_N,work,&B_N,pivots,&B_ierr)); if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GETRF Lapack routine %d",(int)B_ierr); PetscStackCallBLAS("LAPACKgetri",LAPACKgetri_(&B_N,work,&B_N,pivots,Bwork,&B_lwork,&B_ierr)); if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in GETRI Lapack routine %d",(int)B_ierr); } ierr = PetscFPTrapPop();CHKERRQ(ierr); ierr = MatSetValues(sub_schurs->sum_S_Ej_inv_all,subset_size,dummy_idx,subset_size,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); } cum += subset_size; cum2 += subset_size*(size_schur + 1); } ierr = MatDenseRestoreArray(S_all,&S_data);CHKERRQ(ierr); if (mumps_S) { ierr = MatFactorRestoreSchurComplement(F,&S_all);CHKERRQ(ierr); } schur_factor = NULL; if (compute_Stilda && size_active_schur) { if (sub_schurs->n_subs == 1 && size_schur == size_active_schur) { /* we already computed the inverse */ PetscInt j; for (j=0;jsum_S_Ej_tilda_all,size_schur,dummy_idx,size_schur,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); } else { Mat S_all_inv=NULL; if (mumps_S) { /* use MatFactor calls to invert S */ /* let MatFactor factorize the Schur complement */ ierr = MatFactorFactorizeSchurComplement(F);CHKERRQ(ierr); /* for adaptive selection we need S^-1; for solver reusage we need S_\Delta\Delta^-1. 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 */ if (factor_workaround) { PetscScalar *data; PetscInt nd = 0; if (!sub_schurs->is_posdef) { SETERRQ(PETSC_COMM_SELF,PETSC_ERR_SUP,"Factor update not yet implemented for non SPD matrices"); } ierr = MatFactorGetSchurComplement(F,&S_all_inv);CHKERRQ(ierr); ierr = MatDenseGetArray(S_all_inv,&data);CHKERRQ(ierr); if (sub_schurs->is_dir) { /* dirichlet dofs could have different scalings */ ierr = ISGetLocalSize(sub_schurs->is_dir,&nd);CHKERRQ(ierr); } ierr = PetscMalloc1((size_active_schur*(size_active_schur+1))/2+nd,&schur_factor);CHKERRQ(ierr); cum = 0; for (i=0;in_subs;i++) { PetscInt j; ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); /* get (St^-1)_E */ /* Here I don't need to expand to upper triangular since St^-1 will be properly accessed later during adaptive selection */ if (S_lower_triangular) { PetscInt k; for (k=0;ksum_S_Ej_tilda_all,subset_size,dummy_idx,subset_size,dummy_idx,work,INSERT_VALUES);CHKERRQ(ierr); cum += subset_size; cum2 += subset_size*(size_schur + 1); } ierr = MatDenseRestoreArray(S_all_inv,&S_data);CHKERRQ(ierr); if (mumps_S) { ierr = MatFactorRestoreSchurComplement(F,&S_all_inv);CHKERRQ(ierr); } ierr = MatDestroy(&S_all_inv);CHKERRQ(ierr); } /* move back factors to Schur data into F */ if (factor_workaround) { Mat S_tmp; PetscInt nv,nd=0; if (!mumps_S) { SETERRQ(PETSC_COMM_SELF,PETSC_ERR_PLIB,"This should not happen"); } ierr = ISGetLocalSize(sub_schurs->is_vertices,&nv);CHKERRQ(ierr); ierr = MatFactorGetSchurComplement(F,&S_tmp);CHKERRQ(ierr); if (sub_schurs->is_posdef) { PetscScalar *data; ierr = MatZeroEntries(S_tmp);CHKERRQ(ierr); ierr = MatDenseGetArray(S_tmp,&data);CHKERRQ(ierr); if (S_lower_triangular) { cum = 0; for (i=0;iis_dir) { ierr = ISGetLocalSize(sub_schurs->is_dir,&nd);CHKERRQ(ierr); for (i=0;iS_Ej_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); ierr = MatAssemblyEnd(sub_schurs->S_Ej_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); if (compute_Stilda) { ierr = MatAssemblyBegin(sub_schurs->sum_S_Ej_tilda_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); ierr = MatAssemblyEnd(sub_schurs->sum_S_Ej_tilda_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); ierr = MatAssemblyBegin(sub_schurs->sum_S_Ej_inv_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); ierr = MatAssemblyEnd(sub_schurs->sum_S_Ej_inv_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); } /* Global matrix of all assembled Schur on subsets */ ierr = MatISSetLocalMat(work_mat,sub_schurs->S_Ej_all);CHKERRQ(ierr); ierr = MatISSetMPIXAIJPreallocation_Private(work_mat,global_schur_subsets,PETSC_TRUE);CHKERRQ(ierr); ierr = MatISGetMPIXAIJ(work_mat,MAT_REUSE_MATRIX,&global_schur_subsets);CHKERRQ(ierr); /* Get local part of (\sum_j S_Ej) */ if (!sub_schurs->sum_S_Ej_all) { ierr = MatGetSubMatrices(global_schur_subsets,1,&all_subsets_n,&all_subsets_n,MAT_INITIAL_MATRIX,&submats);CHKERRQ(ierr); sub_schurs->sum_S_Ej_all = submats[0]; } else { ierr = PetscMalloc1(1,&submats);CHKERRQ(ierr); submats[0] = sub_schurs->sum_S_Ej_all; ierr = MatGetSubMatrices(global_schur_subsets,1,&all_subsets_n,&all_subsets_n,MAT_REUSE_MATRIX,&submats);CHKERRQ(ierr); } /* Compute explicitly (\sum_j S_Ej)^-1 (faster scaling during PCApply, needs extra work when doing setup) */ if (faster_deluxe) { Mat tmpmat; PetscScalar *array; PetscInt cum; ierr = MatSeqAIJGetArray(sub_schurs->sum_S_Ej_all,&array);CHKERRQ(ierr); cum = 0; for (i=0;in_subs;i++) { ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); ierr = PetscBLASIntCast(subset_size,&B_N);CHKERRQ(ierr); ierr = PetscFPTrapPush(PETSC_FP_TRAP_OFF);CHKERRQ(ierr); if (!use_getr) { PetscInt j,k; PetscStackCallBLAS("LAPACKpotrf",LAPACKpotrf_("L",&B_N,array+cum,&B_N,&B_ierr)); if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRF Lapack routine %d",(int)B_ierr); PetscStackCallBLAS("LAPACKpotri",LAPACKpotri_("L",&B_N,array+cum,&B_N,&B_ierr)); if (B_ierr) SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_LIB,"Error in POTRI Lapack routine %d",(int)B_ierr); for (j=0;jsum_S_Ej_all,&array);CHKERRQ(ierr); ierr = MatMatMult(sub_schurs->S_Ej_all,sub_schurs->sum_S_Ej_all,MAT_INITIAL_MATRIX,1.0,&tmpmat);CHKERRQ(ierr); ierr = MatDestroy(&sub_schurs->S_Ej_all);CHKERRQ(ierr); ierr = MatDestroy(&sub_schurs->sum_S_Ej_all);CHKERRQ(ierr); sub_schurs->S_Ej_all = tmpmat; } /* Get local part of (\sum_j S^-1_Ej) (\sum_j St^-1_Ej) */ if (compute_Stilda) { ierr = MatISSetLocalMat(work_mat,sub_schurs->sum_S_Ej_tilda_all);CHKERRQ(ierr); ierr = MatISGetMPIXAIJ(work_mat,MAT_REUSE_MATRIX,&global_schur_subsets);CHKERRQ(ierr); submats[0] = sub_schurs->sum_S_Ej_tilda_all; ierr = MatGetSubMatrices(global_schur_subsets,1,&all_subsets_n,&all_subsets_n,MAT_REUSE_MATRIX,&submats);CHKERRQ(ierr); ierr = MatISSetLocalMat(work_mat,sub_schurs->sum_S_Ej_inv_all);CHKERRQ(ierr); ierr = MatISGetMPIXAIJ(work_mat,MAT_REUSE_MATRIX,&global_schur_subsets);CHKERRQ(ierr); submats[0] = sub_schurs->sum_S_Ej_inv_all; ierr = MatGetSubMatrices(global_schur_subsets,1,&all_subsets_n,&all_subsets_n,MAT_REUSE_MATRIX,&submats);CHKERRQ(ierr); } /* free workspace */ ierr = PetscFree(submats);CHKERRQ(ierr); ierr = PetscFree2(Bwork,pivots);CHKERRQ(ierr); ierr = MatDestroy(&global_schur_subsets);CHKERRQ(ierr); ierr = MatDestroy(&work_mat);CHKERRQ(ierr); ierr = ISDestroy(&all_subsets_n);CHKERRQ(ierr); ierr = PetscCommDestroy(&comm_n);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCSubSchursInit" PetscErrorCode PCBDDCSubSchursInit(PCBDDCSubSchurs sub_schurs, IS is_I, IS is_B, PCBDDCGraph graph, ISLocalToGlobalMapping BtoNmap) { IS *faces,*edges,*all_cc,vertices; PetscInt i,n_faces,n_edges,n_all_cc; PetscBool is_sorted; PetscErrorCode ierr; PetscFunctionBegin; ierr = ISSorted(is_I,&is_sorted);CHKERRQ(ierr); if (!is_sorted) { SETERRQ(PetscObjectComm((PetscObject)is_I),PETSC_ERR_PLIB,"IS for I dofs should be shorted"); } ierr = ISSorted(is_B,&is_sorted);CHKERRQ(ierr); if (!is_sorted) { SETERRQ(PetscObjectComm((PetscObject)is_B),PETSC_ERR_PLIB,"IS for B dofs should be shorted"); } /* reset any previous data */ ierr = PCBDDCSubSchursReset(sub_schurs);CHKERRQ(ierr); /* get index sets for faces and edges (already sorted by global ordering) */ ierr = PCBDDCGraphGetCandidatesIS(graph,&n_faces,&faces,&n_edges,&edges,&vertices);CHKERRQ(ierr); n_all_cc = n_faces+n_edges; ierr = PetscBTCreate(n_all_cc,&sub_schurs->is_edge);CHKERRQ(ierr); ierr = PetscMalloc1(n_all_cc,&all_cc);CHKERRQ(ierr); for (i=0;iis_edge,n_faces+i);CHKERRQ(ierr); } ierr = PetscFree(faces);CHKERRQ(ierr); ierr = PetscFree(edges);CHKERRQ(ierr); sub_schurs->is_dir = NULL; ierr = PCBDDCGraphGetDirichletDofsB(graph,&sub_schurs->is_dir);CHKERRQ(ierr); /* Determine if MUMPS can be used */ sub_schurs->use_mumps = PETSC_FALSE; #if defined(PETSC_HAVE_MUMPS) sub_schurs->use_mumps = PETSC_TRUE; #endif ierr = PetscObjectReference((PetscObject)is_I);CHKERRQ(ierr); sub_schurs->is_I = is_I; ierr = PetscObjectReference((PetscObject)is_B);CHKERRQ(ierr); sub_schurs->is_B = is_B; ierr = PetscObjectReference((PetscObject)graph->l2gmap);CHKERRQ(ierr); sub_schurs->l2gmap = graph->l2gmap; ierr = PetscObjectReference((PetscObject)BtoNmap);CHKERRQ(ierr); sub_schurs->BtoNmap = BtoNmap; sub_schurs->n_subs = n_all_cc; sub_schurs->is_subs = all_cc; if (!sub_schurs->use_mumps) { /* sort by local ordering mumps is not present */ for (i=0;in_subs;i++) { ierr = ISSort(sub_schurs->is_subs[i]);CHKERRQ(ierr); } } sub_schurs->is_vertices = vertices; sub_schurs->S_Ej_all = NULL; sub_schurs->sum_S_Ej_all = NULL; sub_schurs->sum_S_Ej_inv_all = NULL; sub_schurs->sum_S_Ej_tilda_all = NULL; sub_schurs->is_Ej_all = NULL; PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCSubSchursCreate" PetscErrorCode PCBDDCSubSchursCreate(PCBDDCSubSchurs *sub_schurs) { PCBDDCSubSchurs schurs_ctx; PetscErrorCode ierr; PetscFunctionBegin; ierr = PetscNew(&schurs_ctx);CHKERRQ(ierr); schurs_ctx->n_subs = 0; *sub_schurs = schurs_ctx; PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCSubSchursDestroy" PetscErrorCode PCBDDCSubSchursDestroy(PCBDDCSubSchurs *sub_schurs) { PetscErrorCode ierr; PetscFunctionBegin; ierr = PCBDDCSubSchursReset(*sub_schurs);CHKERRQ(ierr); ierr = PetscFree(*sub_schurs);CHKERRQ(ierr); PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCSubSchursReset" PetscErrorCode PCBDDCSubSchursReset(PCBDDCSubSchurs sub_schurs) { PetscInt i; PetscErrorCode ierr; PetscFunctionBegin; ierr = MatDestroy(&sub_schurs->A);CHKERRQ(ierr); ierr = MatDestroy(&sub_schurs->S);CHKERRQ(ierr); ierr = ISDestroy(&sub_schurs->is_I);CHKERRQ(ierr); ierr = ISDestroy(&sub_schurs->is_B);CHKERRQ(ierr); ierr = ISLocalToGlobalMappingDestroy(&sub_schurs->l2gmap);CHKERRQ(ierr); ierr = ISLocalToGlobalMappingDestroy(&sub_schurs->BtoNmap);CHKERRQ(ierr); ierr = MatDestroy(&sub_schurs->S_Ej_all);CHKERRQ(ierr); ierr = MatDestroy(&sub_schurs->sum_S_Ej_all);CHKERRQ(ierr); ierr = MatDestroy(&sub_schurs->sum_S_Ej_inv_all);CHKERRQ(ierr); ierr = MatDestroy(&sub_schurs->sum_S_Ej_tilda_all);CHKERRQ(ierr); ierr = ISDestroy(&sub_schurs->is_Ej_all);CHKERRQ(ierr); ierr = ISDestroy(&sub_schurs->is_vertices);CHKERRQ(ierr); ierr = ISDestroy(&sub_schurs->is_dir);CHKERRQ(ierr); ierr = PetscBTDestroy(&sub_schurs->is_edge);CHKERRQ(ierr); for (i=0;in_subs;i++) { ierr = ISDestroy(&sub_schurs->is_subs[i]);CHKERRQ(ierr); } if (sub_schurs->n_subs) { ierr = PetscFree(sub_schurs->is_subs);CHKERRQ(ierr); } if (sub_schurs->reuse_mumps) { ierr = PCBDDCReuseMumpsReset(sub_schurs->reuse_mumps);CHKERRQ(ierr); } ierr = PetscFree(sub_schurs->reuse_mumps);CHKERRQ(ierr); sub_schurs->n_subs = 0; PetscFunctionReturn(0); } #undef __FUNCT__ #define __FUNCT__ "PCBDDCAdjGetNextLayer_Private" PETSC_STATIC_INLINE PetscErrorCode PCBDDCAdjGetNextLayer_Private(PetscInt* queue_tip,PetscInt n_prev,PetscBT touched,PetscInt* xadj,PetscInt* adjncy,PetscInt* n_added) { PetscInt i,j,n; PetscErrorCode ierr; PetscFunctionBegin; n = 0; for (i=-n_prev;i<0;i++) { PetscInt start_dof = queue_tip[i]; for (j=xadj[start_dof];j