1 #include <../src/ksp/pc/impls/bddc/bddc.h> 2 #include <../src/ksp/pc/impls/bddc/bddcprivate.h> 3 4 /* prototypes for deluxe functions */ 5 static PetscErrorCode PCBDDCScalingCreate_Deluxe(PC); 6 static PetscErrorCode PCBDDCScalingDestroy_Deluxe(PC); 7 static PetscErrorCode PCBDDCScalingSetUp_Deluxe(PC); 8 static PetscErrorCode PCBDDCScalingSetUp_Deluxe_Par(PC,PetscInt,PetscInt,PetscInt[],PetscInt[]); 9 static PetscErrorCode PCBDDCScalingSetUp_Deluxe_Seq(PC,PetscInt,PetscInt,PetscInt[],PetscInt[]); 10 static PetscErrorCode PCBDDCScalingReset_Deluxe_Solvers(PCBDDCDeluxeScaling); 11 12 #undef __FUNCT__ 13 #define __FUNCT__ "PCBDDCScalingExtension_Basic" 14 static PetscErrorCode PCBDDCScalingExtension_Basic(PC pc, Vec local_interface_vector, Vec global_vector) 15 { 16 PC_IS* pcis = (PC_IS*)pc->data; 17 PC_BDDC* pcbddc = (PC_BDDC*)pc->data; 18 PetscErrorCode ierr; 19 20 PetscFunctionBegin; 21 /* Apply partition of unity */ 22 ierr = VecPointwiseMult(pcbddc->work_scaling,pcis->D,local_interface_vector);CHKERRQ(ierr); 23 ierr = VecSet(global_vector,0.0);CHKERRQ(ierr); 24 ierr = VecScatterBegin(pcis->global_to_B,pcbddc->work_scaling,global_vector,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 25 ierr = VecScatterEnd(pcis->global_to_B,pcbddc->work_scaling,global_vector,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 26 PetscFunctionReturn(0); 27 } 28 29 #undef __FUNCT__ 30 #define __FUNCT__ "PCBDDCScalingExtension_Deluxe" 31 static PetscErrorCode PCBDDCScalingExtension_Deluxe(PC pc, Vec x, Vec y) 32 { 33 PC_IS* pcis=(PC_IS*)pc->data; 34 PC_BDDC* pcbddc=(PC_BDDC*)pc->data; 35 PCBDDCDeluxeScaling deluxe_ctx = pcbddc->deluxe_ctx; 36 PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs[1]; 37 PetscInt i; 38 PetscErrorCode ierr; 39 40 /* TODO CHECK STUFF RELATED WITH FAKE WORK */ 41 PetscFunctionBegin; 42 ierr = VecSet(pcbddc->work_scaling,0.0);CHKERRQ(ierr); /* needed by the fake work below */ 43 if (deluxe_ctx->n_simple) { 44 /* scale deluxe vertices using diagonal scaling */ 45 PetscScalar *array_x,*array_D,*array; 46 ierr = VecGetArray(x,&array_x);CHKERRQ(ierr); 47 ierr = VecGetArray(pcis->D,&array_D);CHKERRQ(ierr); 48 ierr = VecGetArray(pcbddc->work_scaling,&array);CHKERRQ(ierr); 49 for (i=0;i<deluxe_ctx->n_simple;i++) { 50 array[deluxe_ctx->idx_simple_B[i]] = array_x[deluxe_ctx->idx_simple_B[i]]*array_D[deluxe_ctx->idx_simple_B[i]]; 51 } 52 ierr = VecRestoreArray(pcbddc->work_scaling,&array);CHKERRQ(ierr); 53 ierr = VecRestoreArray(pcis->D,&array_D);CHKERRQ(ierr); 54 ierr = VecRestoreArray(x,&array_x);CHKERRQ(ierr); 55 } 56 /* sequential part : all problems and Schur applications collapsed into a single matrix vector multiplication and ksp solution */ 57 if (deluxe_ctx->seq_ksp) { 58 ierr = VecScatterBegin(deluxe_ctx->seq_scctx,x,deluxe_ctx->seq_work1,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 59 ierr = VecScatterEnd(deluxe_ctx->seq_scctx,x,deluxe_ctx->seq_work1,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 60 ierr = MatMult(sub_schurs->S_Ej_all,deluxe_ctx->seq_work1,deluxe_ctx->seq_work2);CHKERRQ(ierr); 61 ierr = KSPSolve(deluxe_ctx->seq_ksp,deluxe_ctx->seq_work2,deluxe_ctx->seq_work1);CHKERRQ(ierr); 62 /* fake work due to final ADD VALUES and vertices scaling needed? TODO: check it */ 63 ierr = VecScatterBegin(deluxe_ctx->seq_scctx,deluxe_ctx->seq_work1,pcbddc->work_scaling,INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 64 ierr = VecScatterEnd(deluxe_ctx->seq_scctx,deluxe_ctx->seq_work1,pcbddc->work_scaling,INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 65 } 66 /* parallel part */ 67 for (i=0;i<deluxe_ctx->par_colors;i++) { 68 if (deluxe_ctx->par_ksp[i]) { 69 PetscMPIInt color_rank; 70 PetscInt subidx = deluxe_ctx->par_col2sub[i]; 71 /* restrict on subset */ 72 ierr = VecScatterBegin(deluxe_ctx->par_scctx_s[i],x,sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 73 ierr = VecScatterEnd(deluxe_ctx->par_scctx_s[i],x,sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 74 /* S_Ej */ 75 ierr = MatMult(sub_schurs->S_Ej[subidx],sub_schurs->work1[subidx],sub_schurs->work2[subidx]);CHKERRQ(ierr); 76 /* (\sum_j S_Ej)^-1 */ 77 ierr = VecSet(deluxe_ctx->par_vec[i],0.0);CHKERRQ(ierr); 78 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],sub_schurs->work2[subidx],deluxe_ctx->par_vec[i],ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 79 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],sub_schurs->work2[subidx],deluxe_ctx->par_vec[i],ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 80 ierr = KSPSolve(deluxe_ctx->par_ksp[i],deluxe_ctx->par_vec[i],deluxe_ctx->par_vec[i]);CHKERRQ(ierr); 81 ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)deluxe_ctx->par_ksp[i]),&color_rank);CHKERRQ(ierr); 82 /* get back solution on subset */ 83 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],deluxe_ctx->par_vec[i],sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 84 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],deluxe_ctx->par_vec[i],sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 85 if (!color_rank) { /* only the master process in coloured comm copies the computed values */ 86 ierr = VecScatterBegin(deluxe_ctx->par_scctx_s[i],sub_schurs->work1[subidx],pcbddc->work_scaling,INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 87 ierr = VecScatterEnd(deluxe_ctx->par_scctx_s[i],sub_schurs->work1[subidx],pcbddc->work_scaling,INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 88 } 89 } 90 } 91 /* put local boundary part in global vector */ 92 ierr = VecSet(y,0.0);CHKERRQ(ierr); 93 ierr = VecScatterBegin(pcis->global_to_B,pcbddc->work_scaling,y,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 94 ierr = VecScatterEnd(pcis->global_to_B,pcbddc->work_scaling,y,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 95 PetscFunctionReturn(0); 96 } 97 98 #undef __FUNCT__ 99 #define __FUNCT__ "PCBDDCScalingExtension" 100 PetscErrorCode PCBDDCScalingExtension(PC pc, Vec local_interface_vector, Vec global_vector) 101 { 102 PC_BDDC *pcbddc=(PC_BDDC*)pc->data; 103 PetscErrorCode ierr; 104 105 PetscFunctionBegin; 106 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 107 PetscValidHeaderSpecific(local_interface_vector,VEC_CLASSID,2); 108 PetscValidHeaderSpecific(global_vector,VEC_CLASSID,3); 109 if (local_interface_vector == pcbddc->work_scaling) { 110 SETERRQ(PETSC_COMM_WORLD,PETSC_ERR_SUP,"Local vector cannot be pcbddc->work_scaling!\n"); 111 } 112 ierr = PetscTryMethod(pc,"PCBDDCScalingExtension_C",(PC,Vec,Vec),(pc,local_interface_vector,global_vector));CHKERRQ(ierr); 113 PetscFunctionReturn(0); 114 } 115 116 #undef __FUNCT__ 117 #define __FUNCT__ "PCBDDCScalingRestriction_Basic" 118 static PetscErrorCode PCBDDCScalingRestriction_Basic(PC pc, Vec global_vector, Vec local_interface_vector) 119 { 120 PetscErrorCode ierr; 121 PC_IS* pcis = (PC_IS*)pc->data; 122 123 PetscFunctionBegin; 124 ierr = VecScatterBegin(pcis->global_to_B,global_vector,local_interface_vector,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 125 ierr = VecScatterEnd(pcis->global_to_B,global_vector,local_interface_vector,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 126 /* Apply partition of unity */ 127 ierr = VecPointwiseMult(local_interface_vector,pcis->D,local_interface_vector);CHKERRQ(ierr); 128 PetscFunctionReturn(0); 129 } 130 131 #undef __FUNCT__ 132 #define __FUNCT__ "PCBDDCScalingRestriction_Deluxe" 133 static PetscErrorCode PCBDDCScalingRestriction_Deluxe(PC pc, Vec x, Vec y) 134 { 135 PC_IS* pcis=(PC_IS*)pc->data; 136 PC_BDDC* pcbddc=(PC_BDDC*)pc->data; 137 PCBDDCDeluxeScaling deluxe_ctx = pcbddc->deluxe_ctx; 138 PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs[1]; 139 PetscInt i; 140 PetscErrorCode ierr; 141 142 PetscFunctionBegin; 143 /* get local boundary part of global vector */ 144 ierr = VecScatterBegin(pcis->global_to_B,x,y,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 145 ierr = VecScatterEnd(pcis->global_to_B,x,y,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 146 if (deluxe_ctx->n_simple) { 147 /* scale deluxe vertices using diagonal scaling */ 148 PetscScalar *array_y,*array_D; 149 ierr = VecGetArray(y,&array_y);CHKERRQ(ierr); 150 ierr = VecGetArray(pcis->D,&array_D);CHKERRQ(ierr); 151 for (i=0;i<deluxe_ctx->n_simple;i++) { 152 array_y[deluxe_ctx->idx_simple_B[i]] *= array_D[deluxe_ctx->idx_simple_B[i]]; 153 } 154 ierr = VecRestoreArray(pcis->D,&array_D);CHKERRQ(ierr); 155 ierr = VecRestoreArray(y,&array_y);CHKERRQ(ierr); 156 } 157 /* sequential part : all problems and Schur applications collapsed into a single matrix vector multiplication and ksp solution */ 158 if (deluxe_ctx->seq_ksp) { 159 ierr = VecScatterBegin(deluxe_ctx->seq_scctx,y,deluxe_ctx->seq_work1,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 160 ierr = VecScatterEnd(deluxe_ctx->seq_scctx,y,deluxe_ctx->seq_work1,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 161 ierr = KSPSolveTranspose(deluxe_ctx->seq_ksp,deluxe_ctx->seq_work1,deluxe_ctx->seq_work2);CHKERRQ(ierr); 162 ierr = MatMultTranspose(sub_schurs->S_Ej_all,deluxe_ctx->seq_work2,deluxe_ctx->seq_work1);CHKERRQ(ierr); 163 ierr = VecScatterBegin(deluxe_ctx->seq_scctx,deluxe_ctx->seq_work1,y,INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 164 ierr = VecScatterEnd(deluxe_ctx->seq_scctx,deluxe_ctx->seq_work1,y,INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 165 } 166 /* parallel part */ 167 for (i=0;i<deluxe_ctx->par_colors;i++) { 168 if (deluxe_ctx->par_ksp[i]) { 169 PetscInt subidx = deluxe_ctx->par_col2sub[i]; 170 /* restrict on subset */ 171 ierr = VecScatterBegin(deluxe_ctx->par_scctx_s[i],y,sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 172 ierr = VecScatterEnd(deluxe_ctx->par_scctx_s[i],y,sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 173 /* (\sum_j S_Ej)^-T */ 174 ierr = VecSet(deluxe_ctx->par_vec[i],0.0);CHKERRQ(ierr); 175 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],sub_schurs->work1[subidx],deluxe_ctx->par_vec[i],INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 176 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],sub_schurs->work1[subidx],deluxe_ctx->par_vec[i],INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 177 ierr = KSPSolveTranspose(deluxe_ctx->par_ksp[i],deluxe_ctx->par_vec[i],deluxe_ctx->par_vec[i]);CHKERRQ(ierr); 178 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],deluxe_ctx->par_vec[i],sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 179 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],deluxe_ctx->par_vec[i],sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 180 /* S_Ej^T */ 181 ierr = MatMultTranspose(sub_schurs->S_Ej[subidx],sub_schurs->work1[subidx],sub_schurs->work2[subidx]);CHKERRQ(ierr); 182 /* extend to boundary */ 183 ierr = VecScatterBegin(deluxe_ctx->par_scctx_s[i],sub_schurs->work2[subidx],y,INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 184 ierr = VecScatterEnd(deluxe_ctx->par_scctx_s[i],sub_schurs->work2[subidx],y,INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 185 } 186 } 187 PetscFunctionReturn(0); 188 } 189 190 #undef __FUNCT__ 191 #define __FUNCT__ "PCBDDCScalingRestriction" 192 PetscErrorCode PCBDDCScalingRestriction(PC pc, Vec global_vector, Vec local_interface_vector) 193 { 194 PC_BDDC *pcbddc=(PC_BDDC*)pc->data; 195 PetscErrorCode ierr; 196 197 PetscFunctionBegin; 198 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 199 PetscValidHeaderSpecific(global_vector,VEC_CLASSID,2); 200 PetscValidHeaderSpecific(local_interface_vector,VEC_CLASSID,3); 201 if (local_interface_vector == pcbddc->work_scaling) { 202 SETERRQ(PETSC_COMM_WORLD,PETSC_ERR_SUP,"Local vector should cannot be pcbddc->work_scaling!\n"); 203 } 204 ierr = PetscTryMethod(pc,"PCBDDCScalingRestriction_C",(PC,Vec,Vec),(pc,global_vector,local_interface_vector));CHKERRQ(ierr); 205 PetscFunctionReturn(0); 206 } 207 208 #undef __FUNCT__ 209 #define __FUNCT__ "PCBDDCScalingSetUp" 210 PetscErrorCode PCBDDCScalingSetUp(PC pc) 211 { 212 PC_IS* pcis=(PC_IS*)pc->data; 213 PC_BDDC* pcbddc=(PC_BDDC*)pc->data; 214 PetscErrorCode ierr; 215 216 PetscFunctionBegin; 217 PetscValidHeaderSpecific(pc,PC_CLASSID,1); 218 /* create work vector for the operator */ 219 ierr = VecDestroy(&pcbddc->work_scaling);CHKERRQ(ierr); 220 ierr = VecDuplicate(pcis->vec1_B,&pcbddc->work_scaling);CHKERRQ(ierr); 221 /* always rebuild pcis->D */ 222 if (pcis->use_stiffness_scaling) { 223 ierr = MatGetDiagonal(pcbddc->local_mat,pcis->vec1_N);CHKERRQ(ierr); 224 ierr = VecScatterBegin(pcis->N_to_B,pcis->vec1_N,pcis->D,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 225 ierr = VecScatterEnd(pcis->N_to_B,pcis->vec1_N,pcis->D,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 226 } 227 ierr = VecCopy(pcis->D,pcis->vec1_B);CHKERRQ(ierr); 228 ierr = VecSet(pcis->vec1_global,0.0);CHKERRQ(ierr); 229 ierr = VecScatterBegin(pcis->global_to_B,pcis->vec1_B,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 230 ierr = VecScatterEnd(pcis->global_to_B,pcis->vec1_B,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 231 ierr = VecScatterBegin(pcis->global_to_B,pcis->vec1_global,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 232 ierr = VecScatterEnd(pcis->global_to_B,pcis->vec1_global,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 233 ierr = VecPointwiseDivide(pcis->D,pcis->D,pcis->vec1_B);CHKERRQ(ierr); 234 /* now setup */ 235 if (pcbddc->use_deluxe_scaling) { 236 if (!pcbddc->deluxe_ctx) { 237 ierr = PCBDDCScalingCreate_Deluxe(pc);CHKERRQ(ierr); 238 } 239 ierr = PCBDDCScalingSetUp_Deluxe(pc);CHKERRQ(ierr); 240 ierr = PetscObjectComposeFunction((PetscObject)pc,"PCBDDCScalingRestriction_C",PCBDDCScalingRestriction_Deluxe);CHKERRQ(ierr); 241 ierr = PetscObjectComposeFunction((PetscObject)pc,"PCBDDCScalingExtension_C",PCBDDCScalingExtension_Deluxe);CHKERRQ(ierr); 242 } else { 243 ierr = PetscObjectComposeFunction((PetscObject)pc,"PCBDDCScalingRestriction_C",PCBDDCScalingRestriction_Basic);CHKERRQ(ierr); 244 ierr = PetscObjectComposeFunction((PetscObject)pc,"PCBDDCScalingExtension_C",PCBDDCScalingExtension_Basic);CHKERRQ(ierr); 245 } 246 247 /* test */ 248 if (pcbddc->dbg_flag) { 249 Vec vec2_global; 250 PetscViewer viewer=pcbddc->dbg_viewer; 251 PetscReal error; 252 253 /* extension -> from local to parallel */ 254 ierr = VecSet(pcis->vec1_global,0.0);CHKERRQ(ierr); 255 ierr = VecSetRandom(pcis->vec1_B,NULL);CHKERRQ(ierr); 256 ierr = VecScatterBegin(pcis->global_to_B,pcis->vec1_B,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 257 ierr = VecScatterEnd(pcis->global_to_B,pcis->vec1_B,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 258 ierr = VecDuplicate(pcis->vec1_global,&vec2_global);CHKERRQ(ierr); 259 ierr = VecCopy(pcis->vec1_global,vec2_global);CHKERRQ(ierr); 260 261 ierr = VecScatterBegin(pcis->global_to_B,pcis->vec1_global,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 262 ierr = VecScatterEnd(pcis->global_to_B,pcis->vec1_global,pcis->vec1_B,INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 263 ierr = PCBDDCScalingExtension(pc,pcis->vec1_B,pcis->vec1_global);CHKERRQ(ierr); 264 ierr = VecAXPY(pcis->vec1_global,-1.0,vec2_global);CHKERRQ(ierr); 265 ierr = VecNorm(pcis->vec1_global,NORM_INFINITY,&error);CHKERRQ(ierr); 266 ierr = PetscViewerASCIIPrintf(viewer,"Error scaling extension %1.14e\n",error);CHKERRQ(ierr); 267 if (error>1.e-8 && pcbddc->dbg_flag>1) { 268 ierr = VecView(pcis->vec1_global,viewer);CHKERRQ(ierr); 269 } 270 ierr = VecDestroy(&vec2_global);CHKERRQ(ierr); 271 272 /* restriction -> from parallel to local */ 273 ierr = VecSet(pcis->vec1_global,0.0);CHKERRQ(ierr); 274 ierr = VecSetRandom(pcis->vec1_B,NULL);CHKERRQ(ierr); 275 ierr = VecScatterBegin(pcis->global_to_B,pcis->vec1_B,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 276 ierr = VecScatterEnd(pcis->global_to_B,pcis->vec1_B,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 277 278 ierr = PCBDDCScalingRestriction(pc,pcis->vec1_global,pcis->vec1_B);CHKERRQ(ierr); 279 ierr = VecScale(pcis->vec1_B,-1.0);CHKERRQ(ierr); 280 ierr = VecScatterBegin(pcis->global_to_B,pcis->vec1_B,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 281 ierr = VecScatterEnd(pcis->global_to_B,pcis->vec1_B,pcis->vec1_global,ADD_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 282 ierr = VecNorm(pcis->vec1_global,NORM_INFINITY,&error);CHKERRQ(ierr); 283 ierr = PetscViewerASCIIPrintf(viewer,"Error scaling restriction %1.14e\n",error);CHKERRQ(ierr); 284 if (error>1.e-8 && pcbddc->dbg_flag>1) { 285 ierr = VecView(pcis->vec1_global,viewer);CHKERRQ(ierr); 286 } 287 } 288 PetscFunctionReturn(0); 289 } 290 291 #undef __FUNCT__ 292 #define __FUNCT__ "PCBDDCScalingDestroy" 293 PetscErrorCode PCBDDCScalingDestroy(PC pc) 294 { 295 PC_BDDC* pcbddc=(PC_BDDC*)pc->data; 296 PetscErrorCode ierr; 297 298 PetscFunctionBegin; 299 if (pcbddc->deluxe_ctx) { 300 ierr = PCBDDCScalingDestroy_Deluxe(pc);CHKERRQ(ierr); 301 } 302 ierr = VecDestroy(&pcbddc->work_scaling);CHKERRQ(ierr); 303 /* remove functions */ 304 ierr = PetscObjectComposeFunction((PetscObject)pc,"PCBDDCScalingRestriction_C",NULL);CHKERRQ(ierr); 305 ierr = PetscObjectComposeFunction((PetscObject)pc,"PCBDDCScalingExtension_C",NULL);CHKERRQ(ierr); 306 PetscFunctionReturn(0); 307 } 308 309 #undef __FUNCT__ 310 #define __FUNCT__ "PCBDDCScalingCreate_Deluxe" 311 static PetscErrorCode PCBDDCScalingCreate_Deluxe(PC pc) 312 { 313 PC_BDDC* pcbddc=(PC_BDDC*)pc->data; 314 PCBDDCDeluxeScaling deluxe_ctx; 315 PetscErrorCode ierr; 316 317 PetscFunctionBegin; 318 ierr = PetscNew(&deluxe_ctx);CHKERRQ(ierr); 319 pcbddc->deluxe_ctx = deluxe_ctx; 320 PetscFunctionReturn(0); 321 } 322 323 #undef __FUNCT__ 324 #define __FUNCT__ "PCBDDCScalingDestroy_Deluxe" 325 static PetscErrorCode PCBDDCScalingDestroy_Deluxe(PC pc) 326 { 327 PC_BDDC* pcbddc=(PC_BDDC*)pc->data; 328 PetscErrorCode ierr; 329 330 PetscFunctionBegin; 331 ierr = PCBDDCScalingReset_Deluxe_Solvers(pcbddc->deluxe_ctx);CHKERRQ(ierr); 332 ierr = PetscFree(pcbddc->deluxe_ctx);CHKERRQ(ierr); 333 PetscFunctionReturn(0); 334 } 335 336 #undef __FUNCT__ 337 #define __FUNCT__ "PCBDDCScalingReset_Deluxe_Solvers" 338 static PetscErrorCode PCBDDCScalingReset_Deluxe_Solvers(PCBDDCDeluxeScaling deluxe_ctx) 339 { 340 PetscErrorCode ierr; 341 342 PetscFunctionBegin; 343 ierr = PetscFree(deluxe_ctx->idx_simple_B);CHKERRQ(ierr); 344 deluxe_ctx->n_simple = 0; 345 if (deluxe_ctx->seq_ksp) { 346 ierr = VecScatterDestroy(&deluxe_ctx->seq_scctx);CHKERRQ(ierr); 347 ierr = VecDestroy(&deluxe_ctx->seq_work1);CHKERRQ(ierr); 348 ierr = VecDestroy(&deluxe_ctx->seq_work2);CHKERRQ(ierr); 349 ierr = KSPDestroy(&deluxe_ctx->seq_ksp);CHKERRQ(ierr); 350 } 351 if (deluxe_ctx->par_colors) { 352 PetscInt i; 353 for (i=0;i<deluxe_ctx->par_colors;i++) { 354 ierr = VecScatterDestroy(&deluxe_ctx->par_scctx_s[i]);CHKERRQ(ierr); 355 ierr = VecScatterDestroy(&deluxe_ctx->par_scctx_p[i]);CHKERRQ(ierr); 356 ierr = VecDestroy(&deluxe_ctx->par_vec[i]);CHKERRQ(ierr); 357 ierr = KSPDestroy(&deluxe_ctx->par_ksp[i]);CHKERRQ(ierr); 358 } 359 ierr = PetscFree5(deluxe_ctx->par_ksp, 360 deluxe_ctx->par_scctx_s, 361 deluxe_ctx->par_scctx_p, 362 deluxe_ctx->par_vec, 363 deluxe_ctx->par_col2sub);CHKERRQ(ierr); 364 } 365 deluxe_ctx->par_colors = 0; 366 PetscFunctionReturn(0); 367 } 368 369 #define OLD_CODE 0 370 #undef __FUNCT__ 371 #define __FUNCT__ "PCBDDCScalingSetUp_Deluxe" 372 static PetscErrorCode PCBDDCScalingSetUp_Deluxe(PC pc) 373 { 374 PC_IS *pcis=(PC_IS*)pc->data; 375 PC_BDDC *pcbddc=(PC_BDDC*)pc->data; 376 PCBDDCDeluxeScaling deluxe_ctx=pcbddc->deluxe_ctx; 377 PCBDDCSubSchurs sub_schurs=pcbddc->sub_schurs[1]; 378 PCBDDCGraph graph; 379 PetscBT bitmask; 380 #if OLD_CODE 381 IS *faces,*edges,*all_cc; 382 PetscInt *index_sequential,*index_parallel; 383 PetscInt *auxlocal_sequential,*auxlocal_parallel; 384 PetscInt *auxglobal_sequential,*auxglobal_parallel; 385 PetscInt *auxmapping,*idxs; 386 PetscInt i,max_subset_size; 387 PetscInt n_sequential_problems,n_local_sequential_problems,n_parallel_problems,n_local_parallel_problems; 388 PetscInt n_faces,n_edges,n_all_cc; 389 #else 390 PetscInt i; 391 const PetscInt* idxs; 392 Mat S_j; 393 PetscBool free_used_adj; 394 PetscInt *used_xadj,*used_adjncy; 395 #endif 396 PetscErrorCode ierr; 397 398 PetscFunctionBegin; 399 /* throw away the solvers */ 400 ierr = PCBDDCScalingReset_Deluxe_Solvers(deluxe_ctx);CHKERRQ(ierr); 401 402 /* attach interface graph for determining subsets */ 403 if (pcbddc->deluxe_rebuild) { /* in case rebuild has been requested, it uses a graph generated only by the neighbouring information */ 404 PetscInt *idx_V_N; 405 IS verticesIS; 406 ierr = PCBDDCGetPrimalVerticesLocalIdx(pc,&i,&idx_V_N);CHKERRQ(ierr); 407 ierr = ISCreateGeneral(PETSC_COMM_SELF,i,idx_V_N,PETSC_OWN_POINTER,&verticesIS);CHKERRQ(ierr); 408 ierr = PCBDDCGraphCreate(&graph);CHKERRQ(ierr); 409 ierr = PCBDDCGraphInit(graph,pcbddc->mat_graph->l2gmap);CHKERRQ(ierr); 410 ierr = PCBDDCGraphSetUp(graph,0,NULL,pcbddc->DirichletBoundariesLocal,0,NULL,verticesIS);CHKERRQ(ierr); 411 ierr = PCBDDCGraphComputeConnectedComponents(graph);CHKERRQ(ierr); 412 ierr = ISDestroy(&verticesIS);CHKERRQ(ierr); 413 /* 414 if (pcbddc->dbg_flag) { 415 ierr = PCBDDCGraphASCIIView(graph,pcbddc->dbg_flag,pcbddc->dbg_viewer);CHKERRQ(ierr); 416 } 417 */ 418 } else { 419 graph = pcbddc->mat_graph; 420 } 421 422 #if OLD_CODE 423 /* get index sets for faces and edges */ 424 ierr = PCBDDCGraphGetCandidatesIS(graph,&n_faces,&faces,&n_edges,&edges,NULL);CHKERRQ(ierr); 425 n_all_cc = n_faces+n_edges; 426 ierr = PetscMalloc1(n_all_cc,&all_cc);CHKERRQ(ierr); 427 for (i=0;i<n_faces;i++) { 428 all_cc[i] = faces[i]; 429 } 430 for (i=0;i<n_edges;i++) { 431 all_cc[n_faces+i] = edges[i]; 432 } 433 ierr = PetscFree(faces);CHKERRQ(ierr); 434 ierr = PetscFree(edges);CHKERRQ(ierr); 435 436 /* map interface's subsets */ 437 max_subset_size = 0; 438 for (i=0;i<n_all_cc;i++) { 439 PetscInt subset_size; 440 ierr = ISGetLocalSize(all_cc[i],&subset_size);CHKERRQ(ierr); 441 max_subset_size = PetscMax(max_subset_size,subset_size); 442 } 443 ierr = PetscMalloc5(max_subset_size,&auxmapping, 444 graph->ncc,&auxlocal_sequential, 445 graph->ncc,&auxlocal_parallel, 446 graph->ncc,&index_sequential, 447 graph->ncc,&index_parallel);CHKERRQ(ierr); 448 449 /* if threshold is negative, uses all sequential problems */ 450 if (pcbddc->deluxe_threshold < 0) pcbddc->deluxe_threshold = max_subset_size; 451 452 /* workspace */ 453 ierr = PetscBTCreate(pcis->n,&bitmask);CHKERRQ(ierr); 454 ierr = ISGetIndices(pcis->is_I_local,(const PetscInt**)&idxs);CHKERRQ(ierr); 455 for (i=0;i<pcis->n-pcis->n_B;i++) { 456 ierr = PetscBTSet(bitmask,idxs[i]);CHKERRQ(ierr); 457 } 458 ierr = ISRestoreIndices(pcis->is_I_local,(const PetscInt**)&idxs);CHKERRQ(ierr); 459 460 /* determine which problem has to be solved in parallel or sequentially */ 461 n_local_sequential_problems = 0; 462 n_local_parallel_problems = 0; 463 for (i=0;i<n_all_cc;i++) { 464 PetscInt subset_size,j,min_loc = 0; 465 466 ierr = ISGetLocalSize(all_cc[i],&subset_size);CHKERRQ(ierr); 467 ierr = ISGetIndices(all_cc[i],(const PetscInt**)&idxs);CHKERRQ(ierr); 468 for (j=0;j<subset_size;j++) { 469 ierr = PetscBTSet(bitmask,idxs[j]);CHKERRQ(ierr); 470 } 471 ierr = ISLocalToGlobalMappingApply(graph->l2gmap,subset_size,idxs,auxmapping);CHKERRQ(ierr); 472 for (j=1;j<subset_size;j++) { 473 if (auxmapping[j]<auxmapping[min_loc]) { 474 min_loc = j; 475 } 476 } 477 if (subset_size > pcbddc->deluxe_threshold) { 478 index_parallel[n_local_parallel_problems] = i; 479 auxlocal_parallel[n_local_parallel_problems] = idxs[min_loc]; 480 n_local_parallel_problems++; 481 } else { 482 index_sequential[n_local_sequential_problems] = i; 483 auxlocal_sequential[n_local_sequential_problems] = idxs[min_loc]; 484 n_local_sequential_problems++; 485 } 486 ierr = ISRestoreIndices(all_cc[i],(const PetscInt**)&idxs);CHKERRQ(ierr); 487 } 488 489 /* diagonal scaling on interface dofs not contained in cc */ 490 deluxe_ctx->n_simple = 0; 491 for (i=0;i<pcis->n;i++) { 492 if (!PetscBTLookup(bitmask,i)) { 493 deluxe_ctx->n_simple++; 494 } 495 } 496 ierr = PetscMalloc1(deluxe_ctx->n_simple,&deluxe_ctx->idx_simple_B);CHKERRQ(ierr); 497 deluxe_ctx->n_simple = 0; 498 for (i=0;i<pcis->n;i++) { 499 if (!PetscBTLookup(bitmask,i)) { 500 deluxe_ctx->idx_simple_B[deluxe_ctx->n_simple++] = i; 501 } 502 } 503 ierr = ISGlobalToLocalMappingApply(pcis->BtoNmap,IS_GTOLM_DROP,deluxe_ctx->n_simple,deluxe_ctx->idx_simple_B,&i,deluxe_ctx->idx_simple_B);CHKERRQ(ierr); 504 if (i != deluxe_ctx->n_simple) { 505 SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error when mapping simple scaling dofs! %d != %d",i,deluxe_ctx->n_simple); 506 } 507 ierr = PetscBTDestroy(&bitmask);CHKERRQ(ierr); 508 509 /* SetUp local schur complements on subsets TODO better reuse procedure */ 510 if (!sub_schurs->n_subs) { 511 Mat S_j; 512 PetscBool free_used_adj; 513 PetscInt *used_xadj,*used_adjncy; 514 515 /* decide the adjacency to be used for determining internal problems for local schur on subsets */ 516 free_used_adj = PETSC_FALSE; 517 if (pcbddc->deluxe_layers == -1) { 518 used_xadj = NULL; 519 used_adjncy = NULL; 520 } else { 521 if ((pcbddc->deluxe_use_useradj && pcbddc->mat_graph->xadj) || !pcbddc->deluxe_compute_rowadj) { 522 used_xadj = pcbddc->mat_graph->xadj; 523 used_adjncy = pcbddc->mat_graph->adjncy; 524 } else { 525 Mat mat_adj; 526 PetscBool flg_row=PETSC_TRUE; 527 const PetscInt *xadj,*adjncy; 528 PetscInt nvtxs; 529 530 ierr = MatConvert(pcbddc->local_mat,MATMPIADJ,MAT_INITIAL_MATRIX,&mat_adj);CHKERRQ(ierr); 531 ierr = MatGetRowIJ(mat_adj,0,PETSC_TRUE,PETSC_FALSE,&nvtxs,&xadj,&adjncy,&flg_row);CHKERRQ(ierr); 532 if (!flg_row) { 533 SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in MatGetRowIJ called in %s\n",__FUNCT__); 534 } 535 ierr = PetscMalloc2(nvtxs+1,&used_xadj,xadj[nvtxs],&used_adjncy);CHKERRQ(ierr); 536 ierr = PetscMemcpy(used_xadj,xadj,(nvtxs+1)*sizeof(*xadj));CHKERRQ(ierr); 537 ierr = PetscMemcpy(used_adjncy,adjncy,(xadj[nvtxs])*sizeof(*adjncy));CHKERRQ(ierr); 538 ierr = MatRestoreRowIJ(mat_adj,0,PETSC_TRUE,PETSC_FALSE,&nvtxs,&xadj,&adjncy,&flg_row);CHKERRQ(ierr); 539 if (!flg_row) { 540 SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in MatRestoreRowIJ called in %s\n",__FUNCT__); 541 } 542 ierr = MatDestroy(&mat_adj);CHKERRQ(ierr); 543 free_used_adj = PETSC_TRUE; 544 } 545 } 546 547 /* Create Schur complement matrix */ 548 ierr = MatCreateSchurComplement(pcis->A_II,pcis->A_II,pcis->A_IB,pcis->A_BI,pcis->A_BB,&S_j);CHKERRQ(ierr); 549 ierr = MatSchurComplementSetKSP(S_j,pcbddc->ksp_D);CHKERRQ(ierr); 550 551 /* setup Schur complements on subsets */ 552 ierr = PCBDDCSubSchursSetUp(sub_schurs,S_j,pcis->is_I_local,pcis->is_B_local,n_all_cc,all_cc,used_xadj,used_adjncy,pcbddc->deluxe_layers);CHKERRQ(ierr); 553 ierr = MatDestroy(&S_j);CHKERRQ(ierr); 554 /* free adjacency */ 555 if (free_used_adj) { 556 ierr = PetscFree2(used_xadj,used_adjncy);CHKERRQ(ierr); 557 } 558 } 559 for (i=0;i<n_all_cc;i++) { 560 ierr = ISDestroy(&all_cc[i]);CHKERRQ(ierr); 561 } 562 ierr = PetscFree(all_cc);CHKERRQ(ierr); 563 564 /* Number parallel problems */ 565 auxglobal_parallel = 0; 566 ierr = PCBDDCSubsetNumbering(PetscObjectComm((PetscObject)pc),graph->l2gmap,n_local_parallel_problems,auxlocal_parallel,PETSC_NULL,&n_parallel_problems,&auxglobal_parallel);CHKERRQ(ierr); 567 if (pcbddc->dbg_flag) { 568 ierr = PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Deluxe global number of parallel subproblems: %d\n",n_parallel_problems); 569 } 570 571 /* Compute data structures to solve parallel problems */ 572 ierr = PCBDDCScalingSetUp_Deluxe_Par(pc,n_local_parallel_problems,n_parallel_problems,auxglobal_parallel,index_parallel);CHKERRQ(ierr); 573 ierr = PetscFree(auxglobal_parallel);CHKERRQ(ierr); 574 575 576 /* Number sequential problems */ 577 auxglobal_sequential = 0; 578 ierr = PCBDDCSubsetNumbering(PetscObjectComm((PetscObject)pc),graph->l2gmap,n_local_sequential_problems,auxlocal_sequential,PETSC_NULL,&n_sequential_problems,&auxglobal_sequential);CHKERRQ(ierr); 579 if (pcbddc->dbg_flag) { 580 ierr = PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Deluxe global number of sequential subproblems: %d\n",n_sequential_problems); 581 } 582 583 /* Compute data structures to solve sequential problems */ 584 ierr = PCBDDCScalingSetUp_Deluxe_Seq(pc,n_local_sequential_problems,n_sequential_problems,auxglobal_sequential,index_sequential);CHKERRQ(ierr); 585 ierr = PetscFree(auxglobal_sequential);CHKERRQ(ierr); 586 587 /* free workspace */ 588 ierr = PetscFree5(auxmapping,auxlocal_sequential,auxlocal_parallel,index_sequential,index_parallel);CHKERRQ(ierr); 589 #else 590 591 /* decide the adjacency to be used for determining internal problems for local schur on subsets */ 592 free_used_adj = PETSC_FALSE; 593 if (pcbddc->deluxe_layers == -1) { 594 used_xadj = NULL; 595 used_adjncy = NULL; 596 } else { 597 if ((pcbddc->deluxe_use_useradj && pcbddc->mat_graph->xadj) || !pcbddc->deluxe_compute_rowadj) { 598 used_xadj = pcbddc->mat_graph->xadj; 599 used_adjncy = pcbddc->mat_graph->adjncy; 600 } else { 601 Mat mat_adj; 602 PetscBool flg_row=PETSC_TRUE; 603 const PetscInt *xadj,*adjncy; 604 PetscInt nvtxs; 605 606 ierr = MatConvert(pcbddc->local_mat,MATMPIADJ,MAT_INITIAL_MATRIX,&mat_adj);CHKERRQ(ierr); 607 ierr = MatGetRowIJ(mat_adj,0,PETSC_TRUE,PETSC_FALSE,&nvtxs,&xadj,&adjncy,&flg_row);CHKERRQ(ierr); 608 if (!flg_row) { 609 SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in MatGetRowIJ called in %s\n",__FUNCT__); 610 } 611 ierr = PetscMalloc2(nvtxs+1,&used_xadj,xadj[nvtxs],&used_adjncy);CHKERRQ(ierr); 612 ierr = PetscMemcpy(used_xadj,xadj,(nvtxs+1)*sizeof(*xadj));CHKERRQ(ierr); 613 ierr = PetscMemcpy(used_adjncy,adjncy,(xadj[nvtxs])*sizeof(*adjncy));CHKERRQ(ierr); 614 ierr = MatRestoreRowIJ(mat_adj,0,PETSC_TRUE,PETSC_FALSE,&nvtxs,&xadj,&adjncy,&flg_row);CHKERRQ(ierr); 615 if (!flg_row) { 616 SETERRQ1(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in MatRestoreRowIJ called in %s\n",__FUNCT__); 617 } 618 ierr = MatDestroy(&mat_adj);CHKERRQ(ierr); 619 free_used_adj = PETSC_TRUE; 620 } 621 } 622 623 624 /* Create Schur complement matrix */ 625 ierr = MatCreateSchurComplement(pcis->A_II,pcis->A_II,pcis->A_IB,pcis->A_BI,pcis->A_BB,&S_j);CHKERRQ(ierr); 626 ierr = MatSchurComplementSetKSP(S_j,pcbddc->ksp_D);CHKERRQ(ierr); 627 628 /* sub_schurs init */ /* TODO reuse adaptive one if valid (i.e. pcbddc->local_mat == matis->A and same graph info (HOW?) ) */ 629 ierr = PCBDDCSubSchursInit(sub_schurs,pcbddc->local_mat,S_j,pcis->is_I_local,pcis->is_B_local,graph,pcbddc->deluxe_threshold);CHKERRQ(ierr); 630 ierr = MatDestroy(&S_j);CHKERRQ(ierr); 631 ierr = PCBDDCSubSchursSetUpNew(sub_schurs,used_xadj,used_adjncy,pcbddc->deluxe_layers);CHKERRQ(ierr); 632 633 /* Compute data structures to solve parallel problems */ 634 ierr = PCBDDCScalingSetUp_Deluxe_Par(pc,sub_schurs->n_subs_par,sub_schurs->n_subs_par_g, 635 sub_schurs->auxglobal_parallel, 636 sub_schurs->index_parallel);CHKERRQ(ierr); 637 /* Compute data structures to solve sequential problems */ 638 ierr = PCBDDCScalingSetUp_Deluxe_Seq(pc,sub_schurs->n_subs_seq,sub_schurs->n_subs_seq_g, 639 sub_schurs->auxglobal_sequential, 640 sub_schurs->index_sequential);CHKERRQ(ierr); 641 /* free adjacency */ 642 if (free_used_adj) { 643 ierr = PetscFree2(used_xadj,used_adjncy);CHKERRQ(ierr); 644 } 645 646 /* diagonal scaling on interface dofs not contained in cc */ 647 ierr = PetscBTCreate(pcis->n,&bitmask);CHKERRQ(ierr); 648 ierr = ISGetIndices(pcis->is_I_local,&idxs);CHKERRQ(ierr); 649 for (i=0;i<pcis->n-pcis->n_B;i++) { 650 ierr = PetscBTSet(bitmask,idxs[i]);CHKERRQ(ierr); 651 } 652 ierr = ISRestoreIndices(pcis->is_I_local,&idxs);CHKERRQ(ierr); 653 654 for (i=0;i<sub_schurs->n_subs;i++) { 655 PetscInt subset_size,j; 656 657 ierr = ISGetLocalSize(sub_schurs->is_subs[i],&subset_size);CHKERRQ(ierr); 658 ierr = ISGetIndices(sub_schurs->is_subs[i],&idxs);CHKERRQ(ierr); 659 for (j=0;j<subset_size;j++) { 660 ierr = PetscBTSet(bitmask,idxs[j]);CHKERRQ(ierr); 661 } 662 ierr = ISRestoreIndices(sub_schurs->is_subs[i],&idxs);CHKERRQ(ierr); 663 } 664 665 deluxe_ctx->n_simple = 0; 666 for (i=0;i<pcis->n;i++) { 667 if (!PetscBTLookup(bitmask,i)) { 668 deluxe_ctx->n_simple++; 669 } 670 } 671 ierr = PetscMalloc1(deluxe_ctx->n_simple,&deluxe_ctx->idx_simple_B);CHKERRQ(ierr); 672 deluxe_ctx->n_simple = 0; 673 for (i=0;i<pcis->n;i++) { 674 if (!PetscBTLookup(bitmask,i)) { 675 deluxe_ctx->idx_simple_B[deluxe_ctx->n_simple++] = i; 676 } 677 } 678 ierr = ISGlobalToLocalMappingApply(pcis->BtoNmap,IS_GTOLM_DROP,deluxe_ctx->n_simple,deluxe_ctx->idx_simple_B,&i,deluxe_ctx->idx_simple_B);CHKERRQ(ierr); 679 if (i != deluxe_ctx->n_simple) { 680 SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error when mapping simple scaling dofs! %d != %d",i,deluxe_ctx->n_simple); 681 } 682 ierr = PetscBTDestroy(&bitmask);CHKERRQ(ierr); 683 684 #endif 685 /* free graph struct */ 686 if (pcbddc->deluxe_rebuild) { 687 ierr = PCBDDCGraphDestroy(&graph);CHKERRQ(ierr); 688 } 689 PetscFunctionReturn(0); 690 } 691 692 #undef __FUNCT__ 693 #define __FUNCT__ "PCBDDCScalingSetUp_Deluxe_Par" 694 static PetscErrorCode PCBDDCScalingSetUp_Deluxe_Par(PC pc, PetscInt n_local_parallel_problems,PetscInt n_parallel_problems,PetscInt global_parallel[],PetscInt index_parallel[]) 695 { 696 PC_BDDC *pcbddc=(PC_BDDC*)pc->data; 697 PCBDDCDeluxeScaling deluxe_ctx=pcbddc->deluxe_ctx; 698 /* coloring */ 699 Mat parallel_problems; 700 MatColoring coloring_obj; 701 ISColoring coloring_parallel_problems; 702 IS *par_is_colors,*is_colors; 703 /* working stuff */ 704 PetscInt i,j; 705 PetscErrorCode ierr; 706 707 PetscFunctionBegin; 708 if (!n_parallel_problems) { 709 PetscFunctionReturn(0); 710 } 711 /* Color parallel subproblems */ 712 ierr = MatCreate(PetscObjectComm((PetscObject)pc),¶llel_problems);CHKERRQ(ierr); 713 ierr = MatSetSizes(parallel_problems,PETSC_DECIDE,PETSC_DECIDE,n_parallel_problems,n_parallel_problems);CHKERRQ(ierr); 714 ierr = MatSetType(parallel_problems,MATAIJ);CHKERRQ(ierr); 715 ierr = MatSetUp(parallel_problems);CHKERRQ(ierr); 716 ierr = MatSetOption(parallel_problems,MAT_NEW_NONZERO_LOCATION_ERR,PETSC_FALSE);CHKERRQ(ierr); 717 ierr = MatSetOption(parallel_problems,MAT_NEW_NONZERO_ALLOCATION_ERR,PETSC_FALSE);CHKERRQ(ierr); 718 for (i=0;i<n_local_parallel_problems;i++) { 719 PetscInt row = global_parallel[i]; 720 for (j=0;j<n_local_parallel_problems;j++) { 721 PetscInt col = global_parallel[j]; 722 if (row != col) { 723 ierr = MatSetValue(parallel_problems,row,col,1.0,INSERT_VALUES);CHKERRQ(ierr); 724 } 725 } 726 } 727 ierr = MatAssemblyBegin(parallel_problems,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 728 ierr = MatAssemblyEnd(parallel_problems,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 729 if (pcbddc->dbg_flag > 1) { 730 ierr = PetscViewerFlush(pcbddc->dbg_viewer);CHKERRQ(ierr); 731 ierr = PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Adj matrix for deluxe parallel problems\n");CHKERRQ(ierr); 732 ierr = MatView(parallel_problems,pcbddc->dbg_viewer);CHKERRQ(ierr); 733 } 734 ierr = MatColoringCreate(parallel_problems,&coloring_obj);CHKERRQ(ierr); 735 ierr = MatColoringSetDistance(coloring_obj,1);CHKERRQ(ierr); 736 ierr = MatColoringSetType(coloring_obj,MATCOLORINGJP);CHKERRQ(ierr); 737 ierr = MatColoringApply(coloring_obj,&coloring_parallel_problems);CHKERRQ(ierr); 738 ierr = ISColoringGetIS(coloring_parallel_problems,&deluxe_ctx->par_colors,&par_is_colors);CHKERRQ(ierr); 739 if (pcbddc->dbg_flag) { 740 ierr = PetscViewerFlush(pcbddc->dbg_viewer);CHKERRQ(ierr); 741 ierr = PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Number of colors %d for parallel part of deluxe\n",deluxe_ctx->par_colors);CHKERRQ(ierr); 742 } 743 744 /* all procs should know the color distribution */ 745 ierr = PetscMalloc1(deluxe_ctx->par_colors,&is_colors);CHKERRQ(ierr); 746 for (i=0;i<deluxe_ctx->par_colors;i++) { 747 if (pcbddc->dbg_flag) { 748 ierr = PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Global problem indexes for color %d\n",i);CHKERRQ(ierr); 749 ierr = ISView(par_is_colors[i],pcbddc->dbg_viewer);CHKERRQ(ierr); 750 ierr = PetscViewerFlush(pcbddc->dbg_viewer);CHKERRQ(ierr); 751 } 752 ierr = ISAllGather(par_is_colors[i],&is_colors[i]);CHKERRQ(ierr); 753 } 754 755 /* free unneeded objects */ 756 ierr = ISColoringRestoreIS(coloring_parallel_problems,&par_is_colors);CHKERRQ(ierr); 757 ierr = ISColoringDestroy(&coloring_parallel_problems);CHKERRQ(ierr); 758 ierr = MatColoringDestroy(&coloring_obj);CHKERRQ(ierr); 759 ierr = MatDestroy(¶llel_problems);CHKERRQ(ierr); 760 761 /* allocate deluxe arrays for parallel problems */ 762 ierr = PetscMalloc5(deluxe_ctx->par_colors,&deluxe_ctx->par_ksp, 763 deluxe_ctx->par_colors,&deluxe_ctx->par_scctx_s, 764 deluxe_ctx->par_colors,&deluxe_ctx->par_scctx_p, 765 deluxe_ctx->par_colors,&deluxe_ctx->par_vec, 766 deluxe_ctx->par_colors,&deluxe_ctx->par_col2sub);CHKERRQ(ierr); 767 768 /* cycle on colors */ 769 for (i=0;i<deluxe_ctx->par_colors;i++) { 770 PetscSubcomm par_subcomm; 771 const PetscInt* idxs_subproblems; 772 PetscInt color_size; 773 PetscMPIInt rank,active_color; 774 775 /* get local index of i-th parallel colored problem */ 776 ierr = ISGetLocalSize(is_colors[i],&color_size);CHKERRQ(ierr); 777 ierr = ISGetIndices(is_colors[i],&idxs_subproblems);CHKERRQ(ierr); 778 /* split comm for computing parallel problems for this color */ 779 /* Processes not partecipating at this stage will have color = color_size */ 780 /* because PetscCommDuplicate does not handle MPI_COMM_NULL */ 781 active_color = color_size; 782 deluxe_ctx->par_col2sub[i] = -1; 783 for (j=0;j<n_local_parallel_problems;j++) { 784 PetscInt local_idx; 785 ierr = PetscFindInt(global_parallel[j],color_size,idxs_subproblems,&local_idx);CHKERRQ(ierr); 786 if (local_idx > -1) { 787 ierr = PetscMPIIntCast(local_idx,&active_color);CHKERRQ(ierr); 788 deluxe_ctx->par_col2sub[i] = index_parallel[j]; 789 break; 790 } 791 } 792 ierr = ISRestoreIndices(is_colors[i],&idxs_subproblems);CHKERRQ(ierr); 793 ierr = PetscSubcommCreate(PetscObjectComm((PetscObject)pc),&par_subcomm);CHKERRQ(ierr); 794 ierr = PetscSubcommSetNumber(par_subcomm,color_size+1);CHKERRQ(ierr); 795 ierr = MPI_Comm_rank(PetscObjectComm((PetscObject)pc),&rank);CHKERRQ(ierr); 796 ierr = PetscSubcommSetTypeGeneral(par_subcomm,active_color,rank);CHKERRQ(ierr); 797 /* print debug info */ 798 if (pcbddc->dbg_flag) { 799 PetscMPIInt crank,csize; 800 ierr = MPI_Comm_rank(par_subcomm->comm,&crank);CHKERRQ(ierr); 801 ierr = MPI_Comm_size(par_subcomm->comm,&csize);CHKERRQ(ierr); 802 ierr = PetscViewerASCIIPrintf(pcbddc->dbg_viewer,"Color %d: size %d, details follows.\n",i,color_size);CHKERRQ(ierr); 803 ierr = PetscViewerFlush(pcbddc->dbg_viewer);CHKERRQ(ierr); 804 ierr = PetscViewerASCIISynchronizedAllow(pcbddc->dbg_viewer,PETSC_TRUE);CHKERRQ(ierr); 805 ierr = PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer," Subdomain %d: color in subcomm %d (rank %d out of %d) (lidx %d)\n",PetscGlobalRank,par_subcomm->color,crank,csize,deluxe_ctx->par_col2sub[i]);CHKERRQ(ierr); 806 ierr = PetscViewerFlush(pcbddc->dbg_viewer);CHKERRQ(ierr); 807 } 808 809 if (deluxe_ctx->par_col2sub[i] >= 0) { 810 PC pctemp; 811 PC_IS *pcis=(PC_IS*)pc->data; 812 Mat color_mat,color_mat_is,temp_mat; 813 ISLocalToGlobalMapping WtoNmap,l2gmap_subset; 814 IS is_local_numbering,isB_local,isW_local,isW; 815 PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs[1]; 816 PetscInt subidx,n_local_dofs,n_global_dofs; 817 PetscInt *global_numbering,*local_numbering; 818 char ksp_prefix[256]; 819 size_t len; 820 821 /* Local index for schur complement on subset */ 822 subidx = deluxe_ctx->par_col2sub[i]; 823 824 /* Parallel numbering for dofs in colored subset */ 825 ierr = ISSum(sub_schurs->is_AEj_I[subidx],sub_schurs->is_AEj_B[subidx],&is_local_numbering);CHKERRQ(ierr); 826 ierr = ISGetLocalSize(is_local_numbering,&n_local_dofs);CHKERRQ(ierr); 827 ierr = ISGetIndices(is_local_numbering,(const PetscInt **)&local_numbering);CHKERRQ(ierr); 828 ierr = PCBDDCSubsetNumbering(par_subcomm->comm,pcbddc->mat_graph->l2gmap,n_local_dofs,local_numbering,PETSC_NULL,&n_global_dofs,&global_numbering);CHKERRQ(ierr); 829 ierr = ISRestoreIndices(is_local_numbering,(const PetscInt **)&local_numbering);CHKERRQ(ierr); 830 831 /* L2Gmap from relevant dofs to local dofs */ 832 ierr = ISLocalToGlobalMappingCreateIS(is_local_numbering,&WtoNmap);CHKERRQ(ierr); 833 834 /* L2Gmap from local to global dofs */ 835 ierr = ISLocalToGlobalMappingCreate(par_subcomm->comm,1,n_local_dofs,global_numbering,PETSC_COPY_VALUES,&l2gmap_subset);CHKERRQ(ierr); 836 837 /* compute parallel matrix (extended dirichlet problem on subset) */ 838 ierr = MatCreateIS(par_subcomm->comm,1,PETSC_DECIDE,PETSC_DECIDE,n_global_dofs,n_global_dofs,l2gmap_subset,&color_mat_is);CHKERRQ(ierr); 839 ierr = MatGetSubMatrix(pcbddc->local_mat,is_local_numbering,is_local_numbering,MAT_INITIAL_MATRIX,&temp_mat);CHKERRQ(ierr); 840 ierr = MatISSetLocalMat(color_mat_is,temp_mat);CHKERRQ(ierr); 841 ierr = MatDestroy(&temp_mat);CHKERRQ(ierr); 842 ierr = MatISGetMPIXAIJ(color_mat_is,MAT_INITIAL_MATRIX,&color_mat);CHKERRQ(ierr); 843 ierr = MatDestroy(&color_mat_is);CHKERRQ(ierr); 844 845 /* work vector for (parallel) extended dirichlet problem */ 846 ierr = MatCreateVecs(color_mat,&deluxe_ctx->par_vec[i],NULL);CHKERRQ(ierr); 847 848 /* compute scatters */ 849 /* deluxe_ctx->par_scctx_p[i] extension from local subset to extended dirichlet problem 850 deluxe_ctx->par_scctx_s[i] restriction from local boundary to subset -> simple copy of selected values */ 851 ierr = ISGlobalToLocalMappingApplyIS(pcis->BtoNmap,IS_GTOLM_DROP,sub_schurs->is_AEj_B[subidx],&isB_local);CHKERRQ(ierr); 852 ierr = VecScatterCreate(pcbddc->work_scaling,isB_local,sub_schurs->work1[subidx],NULL,&deluxe_ctx->par_scctx_s[i]);CHKERRQ(ierr); 853 ierr = ISGlobalToLocalMappingApplyIS(WtoNmap,IS_GTOLM_DROP,sub_schurs->is_AEj_B[subidx],&isW_local);CHKERRQ(ierr); 854 ierr = ISLocalToGlobalMappingApplyIS(l2gmap_subset,isW_local,&isW);CHKERRQ(ierr); 855 ierr = VecScatterCreate(sub_schurs->work1[subidx],NULL,deluxe_ctx->par_vec[i],isW,&deluxe_ctx->par_scctx_p[i]);CHKERRQ(ierr); 856 857 /* free objects no longer neeeded */ 858 ierr = ISDestroy(&isW);CHKERRQ(ierr); 859 ierr = ISDestroy(&isW_local);CHKERRQ(ierr); 860 ierr = ISDestroy(&isB_local);CHKERRQ(ierr); 861 ierr = ISLocalToGlobalMappingDestroy(&WtoNmap);CHKERRQ(ierr); 862 ierr = ISLocalToGlobalMappingDestroy(&l2gmap_subset);CHKERRQ(ierr); 863 ierr = ISDestroy(&is_local_numbering);CHKERRQ(ierr); 864 ierr = PetscFree(global_numbering);CHKERRQ(ierr); 865 866 /* KSP for extended dirichlet problem */ 867 ierr = KSPCreate(par_subcomm->comm,&deluxe_ctx->par_ksp[i]);CHKERRQ(ierr); 868 ierr = KSPSetOperators(deluxe_ctx->par_ksp[i],color_mat,color_mat);CHKERRQ(ierr); 869 ierr = KSPSetTolerances(deluxe_ctx->par_ksp[i],1.e-12,1.e-12,1.e10,10000);CHKERRQ(ierr); 870 ierr = KSPSetType(deluxe_ctx->par_ksp[i],KSPPREONLY);CHKERRQ(ierr); 871 ierr = KSPGetPC(deluxe_ctx->par_ksp[i],&pctemp);CHKERRQ(ierr); 872 ierr = PCSetType(pctemp,PCREDUNDANT);CHKERRQ(ierr); 873 ierr = PetscStrlen(((PetscObject)(pcbddc->ksp_D))->prefix,&len);CHKERRQ(ierr); 874 len -= 10; /* remove "dirichlet_" */ 875 ierr = PetscStrncpy(ksp_prefix,((PetscObject)(pcbddc->ksp_D))->prefix,len+1);CHKERRQ(ierr); /* PetscStrncpy puts a terminating char at the end */ 876 ierr = PetscStrcat(ksp_prefix,"deluxe_par_");CHKERRQ(ierr); 877 ierr = KSPSetOptionsPrefix(deluxe_ctx->par_ksp[i],ksp_prefix);CHKERRQ(ierr); 878 ierr = KSPSetFromOptions(deluxe_ctx->par_ksp[i]);CHKERRQ(ierr); 879 ierr = KSPSetUp(deluxe_ctx->par_ksp[i]);CHKERRQ(ierr); 880 ierr = MatDestroy(&color_mat);CHKERRQ(ierr); 881 } else { /* not partecipating in color */ 882 deluxe_ctx->par_ksp[i] = 0; 883 deluxe_ctx->par_vec[i] = 0; 884 deluxe_ctx->par_scctx_p[i] = 0; 885 deluxe_ctx->par_scctx_s[i] = 0; 886 } 887 ierr = PetscSubcommDestroy(&par_subcomm);CHKERRQ(ierr); 888 } 889 for (i=0;i<deluxe_ctx->par_colors;i++) { 890 ierr = ISDestroy(&is_colors[i]);CHKERRQ(ierr); 891 } 892 ierr = PetscFree(is_colors);CHKERRQ(ierr); 893 894 if (pcbddc->dbg_flag) { 895 Vec test_vec; 896 PetscReal error; 897 PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs[1]; 898 /* test partition of unity of coloured schur complements */ 899 for (i=0;i<deluxe_ctx->par_colors;i++) { 900 PetscInt subidx = deluxe_ctx->par_col2sub[i]; 901 PetscBool error_found = PETSC_FALSE; 902 ierr = PetscViewerASCIISynchronizedAllow(pcbddc->dbg_viewer,PETSC_TRUE);CHKERRQ(ierr); 903 904 if (deluxe_ctx->par_ksp[i]) { 905 /* create random test vec being zero on internal nodes of the extende dirichlet problem */ 906 ierr = VecDuplicate(deluxe_ctx->par_vec[i],&test_vec);CHKERRQ(ierr); 907 ierr = VecSetRandom(sub_schurs->work1[subidx],PETSC_NULL);CHKERRQ(ierr); 908 ierr = VecSet(test_vec,0.0);CHKERRQ(ierr); 909 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],sub_schurs->work1[subidx],test_vec,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 910 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],sub_schurs->work1[subidx],test_vec,ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 911 /* w_j */ 912 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],test_vec,sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 913 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],test_vec,sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 914 /* S_j*w_j */ 915 ierr = MatMult(sub_schurs->S_Ej[subidx],sub_schurs->work1[subidx],sub_schurs->work2[subidx]);CHKERRQ(ierr); 916 /* \sum_j S_j*w_j */ 917 ierr = VecSet(deluxe_ctx->par_vec[i],0.0);CHKERRQ(ierr); 918 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],sub_schurs->work2[subidx],deluxe_ctx->par_vec[i],ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 919 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],sub_schurs->work2[subidx],deluxe_ctx->par_vec[i],ADD_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 920 /* (\sum_j S_j)^(-1)(\sum_j S_j*w_j) */ 921 ierr = KSPSolve(deluxe_ctx->par_ksp[i],deluxe_ctx->par_vec[i],deluxe_ctx->par_vec[i]);CHKERRQ(ierr); 922 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],deluxe_ctx->par_vec[i],sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 923 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],deluxe_ctx->par_vec[i],sub_schurs->work1[subidx],INSERT_VALUES,SCATTER_REVERSE);CHKERRQ(ierr); 924 ierr = VecSet(deluxe_ctx->par_vec[i],0.0);CHKERRQ(ierr); 925 ierr = VecScatterBegin(deluxe_ctx->par_scctx_p[i],sub_schurs->work1[subidx],deluxe_ctx->par_vec[i],INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 926 ierr = VecScatterEnd(deluxe_ctx->par_scctx_p[i],sub_schurs->work1[subidx],deluxe_ctx->par_vec[i],INSERT_VALUES,SCATTER_FORWARD);CHKERRQ(ierr); 927 /* test partition of unity */ 928 ierr = VecAXPY(test_vec,-1.0,deluxe_ctx->par_vec[i]);CHKERRQ(ierr); 929 ierr = VecNorm(test_vec,NORM_INFINITY,&error);CHKERRQ(ierr); 930 if (PetscAbsReal(error) > 1.e-2) { 931 /* ierr = VecView(test_vec,0);CHKERRQ(ierr); */ 932 error_found = PETSC_TRUE; 933 } 934 ierr = VecDestroy(&test_vec);CHKERRQ(ierr); 935 } 936 if (error_found) { 937 ierr = PetscViewerASCIISynchronizedPrintf(pcbddc->dbg_viewer,"Error testing local schur for color %d and subdomain %d\n",i,PetscGlobalRank);CHKERRQ(ierr); 938 } 939 ierr = PetscViewerFlush(pcbddc->dbg_viewer);CHKERRQ(ierr); 940 } 941 } 942 PetscFunctionReturn(0); 943 } 944 945 946 #undef __FUNCT__ 947 #define __FUNCT__ "PCBDDCScalingSetUp_Deluxe_Seq" 948 static PetscErrorCode PCBDDCScalingSetUp_Deluxe_Seq(PC pc,PetscInt n_local_sequential_problems,PetscInt n_sequential_problems,PetscInt global_sequential[],PetscInt local_sequential[]) 949 { 950 PC_BDDC *pcbddc=(PC_BDDC*)pc->data; 951 PCBDDCDeluxeScaling deluxe_ctx=pcbddc->deluxe_ctx; 952 PCBDDCSubSchurs sub_schurs = pcbddc->sub_schurs[1]; 953 ISLocalToGlobalMapping l2gmap_subsets; 954 Mat global_schur_subsets,*submat_global_schur_subsets,work_mat; 955 IS is_to,is_from; 956 PetscScalar *fill_vals; 957 PetscInt *nnz,*all_local_idx_G,*all_local_idx_B,*all_local_idx_N,*all_permutation_G,*dummy_idx; 958 PetscInt i,j,local_problem_index; 959 PetscInt subset_size,max_subset_size; 960 PetscInt local_size,global_size; 961 PC pc_temp; 962 MatSolverPackage solver=NULL; 963 char ksp_prefix[256]; 964 size_t len; 965 PetscErrorCode ierr; 966 967 PetscFunctionBegin; 968 if (!n_sequential_problems) { 969 PetscFunctionReturn(0); 970 } 971 972 /* Get info on subset sizes and sum of all subsets sizes */ 973 max_subset_size = 0; 974 local_size = 0; 975 for (i=0;i<n_local_sequential_problems;i++) { 976 local_problem_index = local_sequential[i]; 977 ierr = ISGetLocalSize(sub_schurs->is_AEj_B[local_problem_index],&subset_size);CHKERRQ(ierr); 978 max_subset_size = PetscMax(subset_size,max_subset_size); 979 local_size += subset_size; 980 } 981 982 /* Work arrays for local indices */ 983 ierr = PetscMalloc1(local_size,&all_local_idx_B);CHKERRQ(ierr); 984 ierr = PetscMalloc1(local_size,&all_local_idx_N);CHKERRQ(ierr); 985 ierr = PetscMalloc1(local_size,&nnz);CHKERRQ(ierr); 986 987 /* Get local indices in local whole numbering and local boundary numbering */ 988 local_size = 0; 989 for (i=0;i<n_local_sequential_problems;i++) { 990 PC_IS *pcis=(PC_IS*)pc->data; 991 PetscInt *idxs; 992 /* get info on local problem */ 993 local_problem_index = local_sequential[i]; 994 ierr = ISGetLocalSize(sub_schurs->is_AEj_B[local_problem_index],&subset_size);CHKERRQ(ierr); 995 ierr = ISGetIndices(sub_schurs->is_AEj_B[local_problem_index],(const PetscInt**)&idxs);CHKERRQ(ierr); 996 /* subset indices in local numbering */ 997 ierr = PetscMemcpy(all_local_idx_N+local_size,idxs,subset_size*sizeof(PetscInt));CHKERRQ(ierr); 998 /* subset indices in local boundary numbering */ 999 ierr = ISGlobalToLocalMappingApply(pcis->BtoNmap,IS_GTOLM_DROP,subset_size,idxs,&j,&all_local_idx_B[local_size]);CHKERRQ(ierr); 1000 ierr = ISRestoreIndices(sub_schurs->is_AEj_B[local_problem_index],(const PetscInt**)&idxs);CHKERRQ(ierr); 1001 if (j != subset_size) { 1002 SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_PLIB,"Error in BDDC deluxe serial %d (BtoNmap)! %d != %d\n",local_problem_index,subset_size,j); 1003 } 1004 for (j=0;j<subset_size;j++) nnz[local_size+j] = subset_size; 1005 local_size += subset_size; 1006 } 1007 1008 /* Number dofs on all subsets (parallel) and sort numbering */ 1009 ierr = PCBDDCSubsetNumbering(PetscObjectComm((PetscObject)pc),pcbddc->mat_graph->l2gmap,local_size,all_local_idx_N,PETSC_NULL,&global_size,&all_local_idx_G);CHKERRQ(ierr); 1010 ierr = PetscMalloc1(local_size,&all_permutation_G);CHKERRQ(ierr); 1011 for (i=0;i<local_size;i++) { 1012 all_permutation_G[i]=i; 1013 } 1014 ierr = PetscSortIntWithPermutation(local_size,all_local_idx_G,all_permutation_G);CHKERRQ(ierr); 1015 1016 /* Local matrix of all local Schur on subsets */ 1017 ierr = MatCreate(PETSC_COMM_SELF,&sub_schurs->S_Ej_all);CHKERRQ(ierr); 1018 ierr = MatSetSizes(sub_schurs->S_Ej_all,PETSC_DECIDE,PETSC_DECIDE,local_size,local_size);CHKERRQ(ierr); 1019 ierr = MatSetType(sub_schurs->S_Ej_all,MATAIJ);CHKERRQ(ierr); 1020 ierr = MatSetOption(sub_schurs->S_Ej_all,MAT_ROW_ORIENTED,PETSC_FALSE);CHKERRQ(ierr); 1021 ierr = MatSeqAIJSetPreallocation(sub_schurs->S_Ej_all,0,nnz);CHKERRQ(ierr); 1022 ierr = PetscFree(nnz);CHKERRQ(ierr); 1023 1024 /* Work arrays */ 1025 ierr = PetscMalloc2(max_subset_size,&dummy_idx,max_subset_size*max_subset_size,&fill_vals);CHKERRQ(ierr); 1026 1027 /* Loop on local problems to compute Schur complements explicitly */ 1028 local_size = 0; 1029 for (i=0;i<n_local_sequential_problems;i++) { 1030 /* get info on local problem */ 1031 local_problem_index = local_sequential[i]; 1032 ierr = ISGetLocalSize(sub_schurs->is_AEj_B[local_problem_index],&subset_size);CHKERRQ(ierr); 1033 /* local Schur */ 1034 for (j=0;j<subset_size;j++) { 1035 ierr = VecSet(sub_schurs->work1[local_problem_index],0.0);CHKERRQ(ierr); 1036 ierr = VecSetValue(sub_schurs->work1[local_problem_index],j,1.0,INSERT_VALUES);CHKERRQ(ierr); 1037 ierr = VecPlaceArray(sub_schurs->work2[local_problem_index],&fill_vals[j*subset_size]);CHKERRQ(ierr); 1038 ierr = MatMult(sub_schurs->S_Ej[local_problem_index],sub_schurs->work1[local_problem_index],sub_schurs->work2[local_problem_index]);CHKERRQ(ierr); 1039 ierr = VecResetArray(sub_schurs->work2[local_problem_index]);CHKERRQ(ierr); 1040 } 1041 for (j=0;j<subset_size;j++) { 1042 dummy_idx[j]=local_size+j; 1043 } 1044 ierr = MatSetValues(sub_schurs->S_Ej_all,subset_size,dummy_idx,subset_size,dummy_idx,fill_vals,INSERT_VALUES);CHKERRQ(ierr); 1045 local_size += subset_size; 1046 } 1047 ierr = PetscFree2(dummy_idx,fill_vals);CHKERRQ(ierr); 1048 ierr = MatAssemblyBegin(sub_schurs->S_Ej_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 1049 ierr = MatAssemblyEnd(sub_schurs->S_Ej_all,MAT_FINAL_ASSEMBLY);CHKERRQ(ierr); 1050 1051 /* Global matrix of all assembled Schur on subsets */ 1052 ierr = ISLocalToGlobalMappingCreate(PetscObjectComm((PetscObject)pc),1,local_size,all_local_idx_G,PETSC_COPY_VALUES,&l2gmap_subsets);CHKERRQ(ierr); 1053 ierr = MatCreateIS(PetscObjectComm((PetscObject)pc),1,PETSC_DECIDE,PETSC_DECIDE,global_size,global_size,l2gmap_subsets,&work_mat);CHKERRQ(ierr); 1054 ierr = ISLocalToGlobalMappingDestroy(&l2gmap_subsets);CHKERRQ(ierr); 1055 ierr = MatISSetLocalMat(work_mat,sub_schurs->S_Ej_all);CHKERRQ(ierr); 1056 ierr = MatISGetMPIXAIJ(work_mat,MAT_INITIAL_MATRIX,&global_schur_subsets);CHKERRQ(ierr); 1057 ierr = MatDestroy(&work_mat);CHKERRQ(ierr); 1058 /* Create work vectors for sequential part of deluxe */ 1059 ierr = MatCreateVecs(sub_schurs->S_Ej_all,&deluxe_ctx->seq_work1,&deluxe_ctx->seq_work2);CHKERRQ(ierr); 1060 1061 /* Compute deluxe sequential scatter */ 1062 ierr = ISCreateGeneral(PETSC_COMM_SELF,local_size,all_local_idx_B,PETSC_OWN_POINTER,&is_from);CHKERRQ(ierr); 1063 ierr = VecScatterCreate(pcbddc->work_scaling,is_from,deluxe_ctx->seq_work1,NULL,&deluxe_ctx->seq_scctx);CHKERRQ(ierr); 1064 ierr = ISDestroy(&is_from);CHKERRQ(ierr); 1065 1066 /* Get local part of (\sum_j S_Ej) */ 1067 for (i=0;i<local_size;i++) { 1068 all_local_idx_N[i] = all_local_idx_G[all_permutation_G[i]]; 1069 } 1070 ierr = ISCreateGeneral(PetscObjectComm((PetscObject)pc),local_size,all_local_idx_N,PETSC_OWN_POINTER,&is_to);CHKERRQ(ierr); 1071 ierr = MatGetSubMatrices(global_schur_subsets,1,&is_to,&is_to,MAT_INITIAL_MATRIX,&submat_global_schur_subsets);CHKERRQ(ierr); 1072 ierr = MatDestroy(&global_schur_subsets);CHKERRQ(ierr); 1073 ierr = ISDestroy(&is_to);CHKERRQ(ierr); 1074 for (i=0;i<local_size;i++) { 1075 all_local_idx_G[all_permutation_G[i]] = i; 1076 } 1077 ierr = ISCreateGeneral(PETSC_COMM_SELF,local_size,all_local_idx_G,PETSC_OWN_POINTER,&is_from);CHKERRQ(ierr); 1078 ierr = ISSetPermutation(is_from);CHKERRQ(ierr); 1079 ierr = MatPermute(submat_global_schur_subsets[0],is_from,is_from,&sub_schurs->sum_S_Ej_all);CHKERRQ(ierr); 1080 ierr = MatDestroyMatrices(1,&submat_global_schur_subsets);CHKERRQ(ierr); 1081 ierr = ISDestroy(&is_from);CHKERRQ(ierr); 1082 ierr = PetscFree(all_permutation_G);CHKERRQ(ierr); 1083 1084 /* Create KSP object for sequential part of deluxe scaling */ 1085 ierr = KSPCreate(PETSC_COMM_SELF,&deluxe_ctx->seq_ksp);CHKERRQ(ierr); 1086 ierr = KSPSetOperators(deluxe_ctx->seq_ksp,sub_schurs->sum_S_Ej_all,sub_schurs->sum_S_Ej_all);CHKERRQ(ierr); 1087 ierr = KSPSetType(deluxe_ctx->seq_ksp,KSPPREONLY);CHKERRQ(ierr); 1088 ierr = KSPGetPC(deluxe_ctx->seq_ksp,&pc_temp);CHKERRQ(ierr); 1089 ierr = PCSetType(pc_temp,PCLU);CHKERRQ(ierr); 1090 ierr = KSPGetPC(pcbddc->ksp_D,&pc_temp);CHKERRQ(ierr); 1091 ierr = PCFactorGetMatSolverPackage(pc_temp,(const MatSolverPackage*)&solver);CHKERRQ(ierr); 1092 if (solver && local_size) { /* if local_size is null, some external packages will report errors */ 1093 PC new_pc; 1094 PCType type; 1095 ierr = PCGetType(pc_temp,&type);CHKERRQ(ierr); 1096 ierr = KSPGetPC(deluxe_ctx->seq_ksp,&new_pc);CHKERRQ(ierr); 1097 ierr = PCSetType(new_pc,type);CHKERRQ(ierr); 1098 ierr = PCFactorSetMatSolverPackage(new_pc,solver);CHKERRQ(ierr); 1099 } 1100 ierr = PetscStrlen(((PetscObject)(pcbddc->ksp_D))->prefix,&len);CHKERRQ(ierr); 1101 len -= 10; /* remove "dirichlet_" */ 1102 ierr = PetscStrncpy(ksp_prefix,((PetscObject)(pcbddc->ksp_D))->prefix,len+1);CHKERRQ(ierr); 1103 ierr = PetscStrcat(ksp_prefix,"deluxe_seq_");CHKERRQ(ierr); 1104 ierr = KSPSetOptionsPrefix(deluxe_ctx->seq_ksp,ksp_prefix);CHKERRQ(ierr); 1105 if (local_size) { 1106 ierr = KSPSetFromOptions(deluxe_ctx->seq_ksp);CHKERRQ(ierr); 1107 } 1108 ierr = KSPSetUp(deluxe_ctx->seq_ksp);CHKERRQ(ierr); 1109 PetscFunctionReturn(0); 1110 } 1111