static PetscErrorCode LoadData3D(DM dm, PetscInt Ni, PetscInt Nj, PetscInt Nk, PetscInt clSize, Vec u, AppCtx *user)
{
PetscInt i, j, k, f, c;
PetscErrorCode ierr;
PetscFunctionBeginUser;
for (k = 0; k < Nk; ++k) {
for (j = 0; j < Nj; ++j) {
for (i = 0; i < Ni; ++i) {
PetscScalar closure[clSize];
PetscInt ki, kj, kk, o = 0;
for (f = 0; f < user->Nf; ++f) {
PetscInt ioff = i*user->k[f], joff = j*user->k[f], koff = k*user->k[f];
for (kk = 0; kk <= user->k[f]; ++kk) {
for (kj = 0; kj <= user->k[f]; ++kj) {
for (ki = 0; ki <= user->k[f]; ++ki) {
for (c = 0; c < user->Nc[f]; ++c) {
closure[o++] = (((kk + koff)*(Nj*user->k[f]+1) + kj + joff)*(Ni*user->k[f]+1) + ki + ioff)*user->Nc[f]+c;
}
}
}
}
}
ierr = DMPlexVecSetClosure(dm, NULL, u, (k*Nj+j)*Ni+i, closure, INSERT_VALUES);CHKERRQ(ierr);
}
}
}
PetscFunctionReturn(0);
}
/*@
DMGlobalToLocalSolve - Solve for the global vector that is mapped to a given local vector by DMGlobalToLocalBegin()/DMGlobalToLocalEnd() with mode
= INSERT_VALUES. It is assumed that the sum of all the local vector sizes is greater than or equal to the global vector size, so the solution is
a least-squares solution. It is also assumed that DMLocalToGlobalBegin()/DMLocalToGlobalEnd() with mode = ADD_VALUES is the adjoint of the
global-to-local map, so that the least-squares solution may be found by the normal equations.
collective
Input Parameters:
+ dm - The DM object
. x - The local vector
- y - The global vector: the input value of globalVec is used as an initial guess
Output Parameters:
. y - The least-squares solution
Level: advanced
Note: If the DM is of type DMPLEX, then y is the solution of L' * D * L * y = L' * D * x, where D is a diagonal mask that is 1 for every point in
the union of the closures of the local cells and 0 otherwise. This difference is only relevant if there are anchor points that are not in the
closure of any local cell (see DMPlexGetAnchors()/DMPlexSetAnchors()).
.seealso: DMGlobalToLocalBegin(), DMGlobalToLocalEnd(), DMLocalToGlobalBegin(), DMLocalToGlobalEnd(), DMPlexGetAnchors(), DMPlexSetAnchors()
@*/
PetscErrorCode DMGlobalToLocalSolve(DM dm, Vec x, Vec y)
{
Mat CtC;
PetscInt n, N, cStart, cEnd, c;
PetscBool isPlex;
KSP ksp;
PC pc;
Vec global, mask=NULL;
projectConstraintsCtx ctx;
PetscErrorCode ierr;
PetscFunctionBegin;
ierr = PetscObjectTypeCompare((PetscObject)dm,DMPLEX,&isPlex);CHKERRQ(ierr);
if (isPlex) {
/* mark points in the closure */
ierr = DMGetLocalVector(dm,&mask);CHKERRQ(ierr);
ierr = VecSet(mask,0.0);CHKERRQ(ierr);
ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr);
if (cEnd > cStart) {
PetscScalar *ones;
PetscInt numValues, i;
ierr = DMPlexVecGetClosure(dm,NULL,mask,cStart,&numValues,NULL);CHKERRQ(ierr);
ierr = PetscMalloc1(numValues,&ones);CHKERRQ(ierr);
for (i = 0; i < numValues; i++) {
ones[i] = 1.;
}
for (c = cStart; c < cEnd; c++) {
ierr = DMPlexVecSetClosure(dm,NULL,mask,c,ones,INSERT_VALUES);CHKERRQ(ierr);
}
ierr = PetscFree(ones);CHKERRQ(ierr);
}
}
ctx.dm = dm;
ctx.mask = mask;
ierr = VecGetSize(y,&N);CHKERRQ(ierr);
ierr = VecGetLocalSize(y,&n);CHKERRQ(ierr);
ierr = MatCreate(PetscObjectComm((PetscObject)dm),&CtC);CHKERRQ(ierr);
ierr = MatSetSizes(CtC,n,n,N,N);CHKERRQ(ierr);
ierr = MatSetType(CtC,MATSHELL);CHKERRQ(ierr);
ierr = MatSetUp(CtC);CHKERRQ(ierr);
ierr = MatShellSetContext(CtC,&ctx);CHKERRQ(ierr);
ierr = MatShellSetOperation(CtC,MATOP_MULT,(void(*)(void))MatMult_GlobalToLocalNormal);CHKERRQ(ierr);
ierr = KSPCreate(PetscObjectComm((PetscObject)dm),&ksp);CHKERRQ(ierr);
ierr = KSPSetOperators(ksp,CtC,CtC);CHKERRQ(ierr);
ierr = KSPSetType(ksp,KSPCG);CHKERRQ(ierr);
ierr = KSPGetPC(ksp,&pc);CHKERRQ(ierr);
ierr = PCSetType(pc,PCNONE);CHKERRQ(ierr);
ierr = KSPSetInitialGuessNonzero(ksp,PETSC_TRUE);CHKERRQ(ierr);
ierr = KSPSetUp(ksp);CHKERRQ(ierr);
ierr = DMGetGlobalVector(dm,&global);CHKERRQ(ierr);
ierr = VecSet(global,0.);CHKERRQ(ierr);
if (mask) {ierr = VecPointwiseMult(x,mask,x);CHKERRQ(ierr);}
ierr = DMLocalToGlobalBegin(dm,x,ADD_VALUES,global);CHKERRQ(ierr);
ierr = DMLocalToGlobalEnd(dm,x,ADD_VALUES,global);CHKERRQ(ierr);
ierr = KSPSetFromOptions(ksp);CHKERRQ(ierr);
ierr = KSPSolve(ksp,global,y);CHKERRQ(ierr);
ierr = DMRestoreGlobalVector(dm,&global);CHKERRQ(ierr);
/* clean up */
if (isPlex) {
ierr = DMRestoreLocalVector(dm,&mask);CHKERRQ(ierr);
}
ierr = KSPDestroy(&ksp);CHKERRQ(ierr);
ierr = MatDestroy(&CtC);CHKERRQ(ierr);
PetscFunctionReturn(0);
}
/*@
DMGlobalToLocalSolve - Solve for the global vector that is mapped to a given local vector by DMGlobalToLocalBegin()/DMGlobalToLocalEnd() with mode
= INSERT_VALUES. It is assumed that the sum of all the local vector sizes is greater than or equal to the global vector size, so the solution is
a least-squares solution. It is also assumed that DMLocalToGlobalBegin()/DMLocalToGlobalEnd() with mode = ADD_VALUES is the adjoint of the
global-to-local map, so that the least-squares solution may be found by the normal equations.
collective
Input Parameters:
+ dm - The DM object
. x - The local vector
- y - The global vector: the input value of globalVec is used as an initial guess
Output Parameters:
. y - The least-squares solution
Level: advanced
Note: If the DM is of type DMPLEX, then y is the solution of L' * D * L * y = L' * D * x, where D is a diagonal mask that is 1 for every point in
the union of the closures of the local cells and 0 otherwise. This difference is only relevant if there are anchor points that are not in the
closure of any local cell (see DMPlexGetAnchors()/DMPlexSetAnchors()).
.seealso: DMGlobalToLocalBegin(), DMGlobalToLocalEnd(), DMLocalToGlobalBegin(), DMLocalToGlobalEnd(), DMPlexGetAnchors(), DMPlexSetAnchors()
@*/
PetscErrorCode DMGlobalToLocalSolve(DM dm, Vec x, Vec y)
{
Mat CtC;
PetscInt n, N, cStart, cEnd, cEndInterior, c;
PetscBool isPlex;
KSP ksp;
PC pc;
Vec global, mask=NULL;
projectConstraintsCtx ctx;
PetscErrorCode ierr;
PetscFunctionBegin;
ierr = PetscObjectTypeCompare((PetscObject)dm,DMPLEX,&isPlex);CHKERRQ(ierr);
if (isPlex) {
/* mark points in the closure */
ierr = DMCreateLocalVector(dm,&mask);CHKERRQ(ierr);
ierr = VecSet(mask,0.0);CHKERRQ(ierr);
ierr = DMPlexGetHeightStratum(dm,0,&cStart,&cEnd);CHKERRQ(ierr);
ierr = DMPlexGetHybridBounds(dm,&cEndInterior,NULL,NULL,NULL);CHKERRQ(ierr);
cEnd = cEndInterior < 0 ? cEnd : cEndInterior;
if (cEnd > cStart) {
PetscScalar *ones;
PetscInt numValues, i;
ierr = DMPlexVecGetClosure(dm,NULL,mask,cStart,&numValues,NULL);CHKERRQ(ierr);
ierr = PetscMalloc1(numValues,&ones);CHKERRQ(ierr);
for (i = 0; i < numValues; i++) {
ones[i] = 1.;
}
for (c = cStart; c < cEnd; c++) {
ierr = DMPlexVecSetClosure(dm,NULL,mask,c,ones,INSERT_VALUES);CHKERRQ(ierr);
}
ierr = PetscFree(ones);CHKERRQ(ierr);
}
}
else {
PetscBool hasMask;
ierr = DMHasNamedLocalVector(dm, "_DMGlobalToLocalSolve_mask", &hasMask);CHKERRQ(ierr);
if (!hasMask) {
PetscErrorCode (**func) (PetscInt dim, PetscReal time, const PetscReal x[], PetscInt Nf, PetscScalar *u, void *ctx);
void **ctx;
PetscInt Nf, f;
ierr = DMGetNumFields(dm, &Nf);CHKERRQ(ierr);
ierr = PetscMalloc2(Nf, &func, Nf, &ctx);CHKERRQ(ierr);
for (f = 0; f < Nf; ++f) {
func[f] = DMGlobalToLocalSolve_project1;
ctx[f] = NULL;
}
ierr = DMGetNamedLocalVector(dm, "_DMGlobalToLocalSolve_mask", &mask);CHKERRQ(ierr);
ierr = DMProjectFunctionLocal(dm,0.0,func,ctx,INSERT_ALL_VALUES,mask);CHKERRQ(ierr);
ierr = DMRestoreNamedLocalVector(dm, "_DMGlobalToLocalSolve_mask", &mask);CHKERRQ(ierr);
ierr = PetscFree2(func, ctx);CHKERRQ(ierr);
}
ierr = DMGetNamedLocalVector(dm, "_DMGlobalToLocalSolve_mask", &mask);CHKERRQ(ierr);
}
ctx.dm = dm;
ctx.mask = mask;
ierr = VecGetSize(y,&N);CHKERRQ(ierr);
ierr = VecGetLocalSize(y,&n);CHKERRQ(ierr);
ierr = MatCreate(PetscObjectComm((PetscObject)dm),&CtC);CHKERRQ(ierr);
ierr = MatSetSizes(CtC,n,n,N,N);CHKERRQ(ierr);
ierr = MatSetType(CtC,MATSHELL);CHKERRQ(ierr);
ierr = MatSetUp(CtC);CHKERRQ(ierr);
ierr = MatShellSetContext(CtC,&ctx);CHKERRQ(ierr);
ierr = MatShellSetOperation(CtC,MATOP_MULT,(void(*)(void))MatMult_GlobalToLocalNormal);CHKERRQ(ierr);
ierr = KSPCreate(PetscObjectComm((PetscObject)dm),&ksp);CHKERRQ(ierr);
ierr = KSPSetOperators(ksp,CtC,CtC);CHKERRQ(ierr);
ierr = KSPSetType(ksp,KSPCG);CHKERRQ(ierr);
ierr = KSPGetPC(ksp,&pc);CHKERRQ(ierr);
ierr = PCSetType(pc,PCNONE);CHKERRQ(ierr);
ierr = KSPSetInitialGuessNonzero(ksp,PETSC_TRUE);CHKERRQ(ierr);
ierr = KSPSetUp(ksp);CHKERRQ(ierr);
ierr = DMGetGlobalVector(dm,&global);CHKERRQ(ierr);
ierr = VecSet(global,0.);CHKERRQ(ierr);
if (mask) {ierr = VecPointwiseMult(x,mask,x);CHKERRQ(ierr);}
ierr = DMLocalToGlobalBegin(dm,x,ADD_VALUES,global);CHKERRQ(ierr);
ierr = DMLocalToGlobalEnd(dm,x,ADD_VALUES,global);CHKERRQ(ierr);
ierr = KSPSolve(ksp,global,y);CHKERRQ(ierr);
ierr = DMRestoreGlobalVector(dm,&global);CHKERRQ(ierr);
/* clean up */
ierr = KSPDestroy(&ksp);CHKERRQ(ierr);
ierr = MatDestroy(&CtC);CHKERRQ(ierr);
if (isPlex) {
ierr = VecDestroy(&mask);CHKERRQ(ierr);
}
else {
ierr = DMRestoreNamedLocalVector(dm, "_DMGlobalToLocalSolve_mask", &mask);CHKERRQ(ierr);
}
PetscFunctionReturn(0);
}
