PenaltyOperator.cc 7.18 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
#include "PenaltyOperator.h"

#include "SurfaceOperator.h"

double 
PenaltyOperator::getPenaltyCoeff(const ElInfo *elInfo)
{
  if (penaltyCoeffFlag) {
    eps = pow(fabs(elInfo->getDet()), degree*1.0/dim) * factor;
    return 1.0/eps;
  }
  else {
    eps = 1.0;
    return 1.0;
  }
}

void 
PenaltyOperator::getElementMatrix(const ElInfo *elInfo, 
				  ElementMatrix *userMat, 
				  double factor)
{
  FUNCNAME("PenaltyOperator::getElementMatrix");

  VectorOfFixVecs<DimVec<double> > *intersecPoints = NULL;
  double penaltyCoeff = getPenaltyCoeff(elInfo);

  /**
   * Get element status. Does element lie completely inside the integration 
   * domain, completely outside of the integration domain or is it 
   * intersected by the boundary ?
   */
  elStatus = elLS->createElementLevelSet(elInfo);

  /**
   * element status == completely inside or outside  
   *                                         --->  penalty term does not
   *                                               depend on this element;
   *                                               no integration has to
   *                                               be done
   *                                                       
   * element status == lies on boundary  ---> surface integration on boundary
   */
  if (elStatus == ElementLevelSet::LEVEL_SET_BOUNDARY) {

    /**
     * Get intersection points.
     */
    intersecPoints = elLS->getElIntersecPoints();

    /**
     * Create SurfaceOperator and calculate element matrix.
     */
    if (dim == 3  &&  elLS->getNumElIntersecPoints() == 4) {

      /**
       * Intersection plane must be divided into two simplices.
       *
       * Note: The intersection points S0, S1, S2, S3 are supposed to be 
       *       alligned in such a manner that a line through S1 and S2 
       *       divides the intersection plane.
       */
      
      // Treat first simplex.
      (*tempCoords)[0] = (*intersecPoints)[0];
      (*tempCoords)[1] = (*intersecPoints)[1];
      (*tempCoords)[2] = (*intersecPoints)[2];
      if (!surfaceOp) {
	surfaceOp = NEW SurfaceOperator(this, (*tempCoords));
      }
      else {
	surfaceOp->adaptSurfaceOperator((*tempCoords));
      }
      surfaceOp->getElementMatrix(elInfo, userMat, factor*penaltyCoeff);
      
      // Treat second simplex.
      (*tempCoords)[0] = (*intersecPoints)[3];
      surfaceOp->adaptSurfaceOperator((*tempCoords));
      surfaceOp->getElementMatrix(elInfo, userMat, factor*penaltyCoeff);
    }

    else {
      
      /**
       * Intersection points form a simplex.
       */      

      // *intersecPoints always has MAX_INTERSECTION_POINTS entries
      (*tempCoords)[0] = (*intersecPoints)[0];
      if (dim > 1)
	(*tempCoords)[1] = (*intersecPoints)[1];
      if (dim == 3) {
	(*tempCoords)[2] = (*intersecPoints)[2];
      }

      if (!surfaceOp) {
	surfaceOp = NEW SurfaceOperator(this, *tempCoords);
      }
      else {
	surfaceOp->adaptSurfaceOperator(*tempCoords);
      }
      surfaceOp->getElementMatrix(elInfo, userMat, factor*penaltyCoeff);
    }
    
  } // if (elstatus == LEVEL_SET_BOUNDARY)

//   else if (dim == 1 && ElementLevelSet::getNumVertIntPoints() != 0) {

//     // ===== intersection points are element vertices =====
//     DimVec<double> lambda(dim, DEFAULT_VALUE, 0.0);
//     const int *statusVec = ElementLevelSet::getElVertStatusVec();

//     for (int i=0; i<dim; ++i) {

//       if (statusVec[i] == ElementLevelSet::LEVEL_SET_BOUNDARY) {
// 	lambda[i] = 1.0;
// 	(*tempCoords)[0] = lambda;

// 	if (!surfaceOp) {
// 	  surfaceOp = NEW SurfaceOperator(this, *tempCoords);
// 	}
// 	else {
// 	  surfaceOp->adaptSurfaceOperator(*tempCoords);
// 	}
// 	surfaceOp->getElementMatrix(elInfo, userMat, factor*penaltyCoeff);

// 	lambda[i] = 0.0;
//       }
//     }

//   }

  return;
}

void 
PenaltyOperator::getElementVector(const ElInfo *elInfo, 
				  ElementVector *userVec, 
				  double factor)
{
  FUNCNAME("PenaltyOperator::getElementVector");

  VectorOfFixVecs<DimVec<double> > *intersecPoints = NULL;
  double penaltyCoeff = getPenaltyCoeff(elInfo);

  /**
   * Get element status. Does element lie completely inside the integration 
   * domain, completely outside of the integration domain or is it 
   * intersected by the boundary ?
   */
  elStatus = elLS->createElementLevelSet(elInfo);

  /**
   * element status == completely inside or outside  
   *                                        --->  penalty term does not
   *                                              depend on this element;
   *                                              no integration has to
   *                                              be done
   *                                                       
   * element status == lies on boundary  ---> surface integration on boundary
   */
  if (elStatus == ElementLevelSet::LEVEL_SET_BOUNDARY) {

    /**
     * Get intersection points.
     */
    intersecPoints = elLS->getElIntersecPoints();

    /**
     * Create SurfaceOperator and calculate element vector.
     */
    if (dim == 3  &&  elLS->getNumElIntersecPoints() == 4) {

      /**
       * Intersection plane must be divided into two simplices.
       *
       * Note: The intersection points S0, S1, S2, S3 are supposed to be 
       *       alligned in such a manner that a line through S1 and S2 
       *       divides the intersection plane.
       */
      
      // Treat first simplex.
      (*tempCoords)[0] = (*intersecPoints)[0];
      (*tempCoords)[1] = (*intersecPoints)[1];
      (*tempCoords)[2] = (*intersecPoints)[2];
      if (!surfaceOp) {
	surfaceOp = NEW SurfaceOperator(this, (*tempCoords));
      }
      else {
	surfaceOp->adaptSurfaceOperator((*tempCoords));
      }
      surfaceOp->getElementVector(elInfo, userVec, factor*penaltyCoeff);
      
      // Treat second simplex.
      (*tempCoords)[0] = (*intersecPoints)[3];
      surfaceOp->adaptSurfaceOperator((*tempCoords));
      surfaceOp->getElementVector(elInfo, userVec, factor*penaltyCoeff);
    }

    else {
      
      /**
       * Intersection points form a simplex.
       */

      // *intersecPoints always has MAX_INTERSECTION_POINTS entries
      (*tempCoords)[0] = (*intersecPoints)[0];
      if (dim > 1)
	(*tempCoords)[1] = (*intersecPoints)[1];
      if (dim == 3) {
	(*tempCoords)[2] = (*intersecPoints)[2];
      }

      if (!surfaceOp) {
	surfaceOp = NEW SurfaceOperator(this, *tempCoords);
      }
      else {
	surfaceOp->adaptSurfaceOperator(*tempCoords);
      }
      surfaceOp->getElementVector(elInfo, userVec, factor*penaltyCoeff);
    }

  } // if (elstatus == LEVEL_SET_BOUNDARY)

//   else if (dim == 1 && ElementLevelSet::getNumVertIntPoints() != 0) {

//     // ===== intersection points are element vertices =====
//     DimVec<double> lambda(dim, DEFAULT_VALUE, 0.0);
//     const int *statusVec = ElementLevelSet::getElVertStatusVec();

//     for (int i=0; i<dim; ++i) {

//       if (statusVec[i] == ElementLevelSet::LEVEL_SET_BOUNDARY) {
// 	lambda[i] = 1.0;
// 	(*tempCoords)[0] = lambda;

// 	if (!surfaceOp) {
// 	  surfaceOp = NEW SurfaceOperator(this, *tempCoords);
// 	}
// 	else {
// 	  surfaceOp->adaptSurfaceOperator(*tempCoords);
// 	}
// 	surfaceOp->getElementVector(elInfo, userVec, factor*penaltyCoeff);

// 	lambda[i] = 0.0;
//       }
//     }

//   }

  return;
}