Marker.h 9.47 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
// ============================================================================
// ==                                                                        ==
// == AMDiS - Adaptive multidimensional simulations                          ==
// ==                                                                        ==
// ============================================================================
// ==                                                                        ==
// ==  crystal growth group                                                  ==
// ==                                                                        ==
// ==  Stiftung caesar                                                       ==
// ==  Ludwig-Erhard-Allee 2                                                 ==
// ==  53175 Bonn                                                            ==
// ==  germany                                                               ==
// ==                                                                        ==
// ============================================================================
// ==                                                                        ==
// ==  http://www.caesar.de/cg/AMDiS                                         ==
// ==                                                                        ==
// ============================================================================

/** \file Marker.h */

#ifndef AMDIS_MARKER_H
#define AMDIS_MARKER_H

#include "Element.h"
#include "ElInfo.h"
#include "Flag.h"
#include "Mesh.h"
#include "AdaptInfo.h"
#include "Traverse.h"
#include "MatrixVector.h"

namespace AMDiS {

  /**
   * \ingroup Adaption
   * 
   * \brief
   * Base class for all scalar markers.
   */
  class Marker
  {
  public:
    /** \brief
     * Constructor.
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
47
    Marker() {}
48
49
50
51

    /** \brief
     * Constructor.
     */
52
    Marker(std::string name_, int row_)
53
54
55
56
      : name(name_), 
	row(row_),
	maximumMarking(false),
	p(2),
57
58
	info(10),
	maxRefineLevel(-1)
59
60
61
    {
      GET_PARAMETER(0, name + "->p", "%f", &p);
      GET_PARAMETER(0, name + "->info", "%d", &info);
62
      GET_PARAMETER(0, name + "->max refinement level", "%d", &maxRefineLevel);
Thomas Witkowski's avatar
Thomas Witkowski committed
63
    }
64
65
66
67

    /** \brief
     * destructor
     */
Thomas Witkowski's avatar
Thomas Witkowski committed
68
    virtual ~Marker() {}
69
70
71
72
73
74
75
76
77
78
79

    /** \brief
     * Marks element with newMark. If \ref maximumMarking is set, the element
     * is marked only if the new mark is bigger than the old one. The return
     * value specifies whether the element has been marked, or not.
     */
    inline void setMark(Element *el, char newMark) {
      char oldMark = el->getMark();

      if (!maximumMarking || (newMark > oldMark)) {
	el->setMark(newMark);
80
81
82
83
84
85
86
87
88
89
90
91
92
93

	if (oldMark > 0) {
	  elMarkRefine--; 
	} else {
	  if (oldMark < 0) 
	    elMarkCoarsen--;
	}

	if (newMark > 0) {
	  elMarkRefine++; 
	} else { 
	  if (newMark < 0) 
	    elMarkCoarsen++;
	}
94
      }
Thomas Witkowski's avatar
Thomas Witkowski committed
95
    }
96
97
98
99

    /** \brief
     * Can be used by sub classes. Called before traversal.
     */ 
100
    virtual void initMarking(AdaptInfo *adaptInfo, Mesh *mesh);
101
102
103
104

    /** \brief
     * Can be used by sub classes. Called after traversal.
     */ 
105
    virtual void finishMarking(AdaptInfo *adaptInfo);
106
107
108
109

    /** \brief
     * Marks one element.
     */
110
    virtual void markElement(AdaptInfo *adaptInfo, ElInfo *elInfo);
111
112
113
114
  
    /** \brief
     * Marking of the mesh.
     */
115
    virtual Flag markMesh(AdaptInfo *adaptInfo, Mesh *mesh);
116
117
118
119
120
121

    /** \brief
     * Sets \ref maximumMarking.
     */
    inline void setMaximumMarking(bool maxMark) {
      maximumMarking = maxMark;
Thomas Witkowski's avatar
Thomas Witkowski committed
122
    }
123
124

    inline int getElMarkRefine() { 
Thomas Witkowski's avatar
Thomas Witkowski committed
125
126
      return elMarkRefine; 
    }
127
128
129

    inline int getElMarkCoarsen() { 
      return elMarkCoarsen; 
Thomas Witkowski's avatar
Thomas Witkowski committed
130
    }
131
132
133
134

    /** \brief
     * Creates a scalr marker depending on the strategy set in parameters.
     */
135
    static Marker *createMarker(std::string name, int row_);
136
137
138
139
140

  protected:
    /** \brief
     * Name of the scalar marker.
     */
141
    std::string name;
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

    /** \brief
     * Equal to -1 for scalar problems. Component number if marker is
     * part of a vector valued marker.
     */
    int row;

    /** \brief
     * estimation sum
     */
    double estSum;

    /** \brief
     * estmation maximum
     */
    double estMax;

    /** \brief
     * If true, elements are marked only if the new value is bigger than
     * the current marking.
     */
    bool maximumMarking;

    /** \brief
     * Lower limit for error estimation, from which an element is marked for
     * refinement
     */
    double markRLimit;

    /** \brief
     * Upper limit for error estimation, from which an element is marked for 
     * coarsening
     */
    double markCLimit;

    /** \brief
     * power in estimator norm
     */
    double p;

    /** \brief
     * Info level.
     */
    int info;

    /** \brief
     * Counter for elements marked for refinement
     */
    int elMarkRefine;

    /** \brief
     * Counter for elements marked for coarsening
     */
    int elMarkCoarsen;

197
198
199
200
    /** \brief
     * Maximal depth for element refinement.
     */
    int maxRefineLevel;
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
  };

  // ===========================================================================
  // ===== class GRMarker ======================================================
  // ===========================================================================

  /**
   * \ingroup Adaption
   * 
   * \brief
   * Global refinement.
   */
  class GRMarker : public Marker
  {
  public:
    /** \brief
     * Constructor.
     */
219
    GRMarker(std::string name_, int row_) 
220
      : Marker(name_, row_) 
Thomas Witkowski's avatar
Thomas Witkowski committed
221
    {}
222
223
224
225
226
227
228
229

    /** \brief
     * Implementation of Marker::markElement().
     */
    virtual void markElement(AdaptInfo *adaptInfo, ElInfo *elInfo) {
      Element *el = elInfo->getElement();
      if(adaptInfo->isRefinementAllowed(row == -1 ? 0 : row))
	setMark(el, adaptInfo->getRefineBisections(row == -1 ? 0 : row));
Thomas Witkowski's avatar
Thomas Witkowski committed
230
    }
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
  };

  // ===========================================================================
  // ===== class MSMarker ======================================================
  // ===========================================================================

  /**
   * \ingroup Adaption
   * 
   * \brief
   * Maximum strategy.
   */
  class MSMarker : public Marker
  {
  public:
    /** \brief
     * Constructor.
     */
249
    MSMarker(std::string name_, int row_) 
250
251
252
253
254
255
      : Marker(name_, row_),
	MSGamma(0.5),
	MSGammaC(0.1)
    {
      GET_PARAMETER(0, name + "->MSGamma", "%f", &MSGamma);
      GET_PARAMETER(0, name + "->MSGammaC", "%f", &MSGammaC);
Thomas Witkowski's avatar
Thomas Witkowski committed
256
    }
257
258
259
260
261
262
263
264
265
266
267
268

    /** \brief
     * Implementation of MarkScal::initMarking().
     */
    virtual void initMarking(AdaptInfo *adaptInfo, Mesh *mesh) {
      Marker::initMarking(adaptInfo, mesh);
    
      double MSGammaP = pow(MSGamma, p);
      double MSGammaCP = pow(MSGammaC, p);

      markRLimit = MSGammaP * adaptInfo->getEstMax(row == -1 ? 0 : row);
      markCLimit = MSGammaCP * adaptInfo->getEstMax(row == -1 ? 0 : row);
Thomas Witkowski's avatar
Thomas Witkowski committed
269
    }
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
  
  protected:
    /** \brief
     * Marking parameter.
     */
    double MSGamma;

    /** \brief
     * Marking parameter.
     */
    double MSGammaC;
  };

  // ===========================================================================
  // ===== class ESMarker ======================================================
  // ===========================================================================

  /**
   * \ingroup Adaption
   * 
   * \brief
   * Equidistribution strategy
   */
  class ESMarker : public Marker
  {
  public:
    /** \brief
     * Constructor.
     */
299
    ESMarker(std::string name_, int row_) 
300
301
302
303
304
305
      : Marker(name_, row_),
	ESTheta(0.9),
	ESThetaC(0.2)
    {
      GET_PARAMETER(0, name + "->ESTheta", "%f", &ESTheta);
      GET_PARAMETER(0, name + "->ESThetaC", "%f", &ESThetaC);
Thomas Witkowski's avatar
Thomas Witkowski committed
306
    }
307
308
309
310

    /** \brief
     * Implementation of MarkScal::initMarking().
     */
311
    virtual void initMarking(AdaptInfo *adaptInfo, Mesh *mesh);
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
  
  protected:
    /** \brief
     * Marking parameter.
     */
    double ESTheta;

    /** \brief
     * Marking parameter.
     */
    double ESThetaC;
  };

  // ===========================================================================
  // ===== class GERSMarker ====================================================
  // ===========================================================================

  /**
   * \ingroup Adaption
   * 
   * \brief
   * Guaranteed error reduction strategy 
   */
  class GERSMarker : public Marker
  {
  public:
    /** \brief
     * Constructor.
     */
341
    GERSMarker(std::string name_, int row_) 
342
343
344
345
346
347
348
349
350
      : Marker(name_, row_),
	oldErrSum(0.0),
	GERSThetaStar(0.6),
	GERSNu(0.1),
	GERSThetaC(0.1)
    {
      GET_PARAMETER(0, name + "->GERSThetaStar", "%f", &GERSThetaStar);
      GET_PARAMETER(0, name + "->GERSNu", "%f", &GERSNu);
      GET_PARAMETER(0, name + "->GERSThetaC", "%f", &GERSThetaC);
Thomas Witkowski's avatar
Thomas Witkowski committed
351
    }
352
353
354
355

    /** \brief
     * Implementation of Marker::markMesh().
     */
356
    virtual Flag markMesh(AdaptInfo *adaptInfo, Mesh *mesh);
357
358
359
360
361

  protected:
    /** \brief
     * Refinement marking function.
     */
362
    void markElementForRefinement(AdaptInfo *adaptInfo, ElInfo *elInfo);
363
364
365
366

    /** \brief
     * Coarsening marking function.
     */
367
    void markElementForCoarsening(AdaptInfo *adaptInfo, ElInfo *elInfo);
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398

  protected:
    /** \brief
     * Marking parameter.
     */
    double GERSSum;

    /** \brief
     * Marking parameter.
     */
    double oldErrSum;

    /** \brief
     * Marking parameter.
     */
    double GERSThetaStar;

    /** \brief
     * Marking parameter.
     */
    double GERSNu;

    /** \brief
     * Marking parameter.
     */
    double GERSThetaC;
  };

}

#endif