ResidualEstimator.cc 16.5 KB
Newer Older
1
2
3
4
5
6
7
8
9
10
11
12
//
// Software License for AMDiS
//
// Copyright (c) 2010 Dresden University of Technology 
// All rights reserved.
// Authors: Simon Vey, Thomas Witkowski et al.
//
// This file is part of AMDiS
//
// See also license.opensource.txt in the distribution.


13
14
15
16
17
18
19
20
#include "ResidualEstimator.h"
#include "Operator.h"
#include "DOFMatrix.h"
#include "DOFVector.h"
#include "Assembler.h"
#include "Traverse.h"
#include "Parameters.h"

21
22
23
24
#ifdef HAVE_PARALLEL_DOMAIN_AMDIS
#include "mpi.h"
#endif

25
26
namespace AMDiS {

27
  ResidualEstimator::ResidualEstimator(std::string name, int r) 
28
    : Estimator(name, r),
29
30
      C0(0.0), 
      C1(0.0), 
31
      C2(0.0), 
32
      C3(0.0),
33
      jumpResidualOnly(false)
34
  {
35
36
    FUNCNAME("ResidualEstimator::ResidualEstimator()");

37
38
39
40
41
42
43
44
45
    GET_PARAMETER(0, name + "->C0", "%f", &C0);
    GET_PARAMETER(0, name + "->C1", "%f", &C1);
    GET_PARAMETER(0, name + "->C2", "%f", &C2);
    GET_PARAMETER(0, name + "->C3", "%f", &C3);

    C0 = C0 > 1.e-25 ? sqr(C0) : 0.0;
    C1 = C1 > 1.e-25 ? sqr(C1) : 0.0;
    C2 = C2 > 1.e-25 ? sqr(C2) : 0.0;
    C3 = C3 > 1.e-25 ? sqr(C3) : 0.0;
46

47
48
49
50
    if (C1 != 0.0 && C0 == 0.0 && C3 == 0.0)
      jumpResidualOnly = true;
      

51
    TEST_EXIT(C2 == 0.0)("C2 is not used! Please remove it or set it to 0.0!\n");
52
53
  }

54

55
56
57
  void ResidualEstimator::init(double ts)
  {
    FUNCNAME("ResidualEstimator::init()");
58

59
    timestep = ts;
Thomas Witkowski's avatar
Thomas Witkowski committed
60
    nSystems = static_cast<int>(uh.size());
61

Thomas Witkowski's avatar
Thomas Witkowski committed
62
    TEST_EXIT_DBG(nSystems > 0)("no system set\n");
63
64

    dim = mesh->getDim();
65
66
    basFcts = new const BasisFunction*[nSystems];
    quadFast = new FastQuadrature*[nSystems];
67
68

    degree = 0;
Thomas Witkowski's avatar
Thomas Witkowski committed
69
    for (int system = 0; system < nSystems; system++) {
70
      basFcts[system] = uh[system]->getFeSpace()->getBasisFcts();
71
      degree = std::max(degree, basFcts[system]->getDegree());
72
73
74
75
    }
    degree *= 2;

    quad = Quadrature::provideQuadrature(dim, degree);
Thomas Witkowski's avatar
Thomas Witkowski committed
76
    nPoints = quad->getNumPoints();
77
78

    Flag flag = INIT_PHI | INIT_GRD_PHI;
79
80
    if (degree > 2)
      flag |= INIT_D2_PHI;    
81

82
    for (int system = 0; system < nSystems; system++)
83
84
      quadFast[system] = FastQuadrature::provideFastQuadrature(basFcts[system], 
							       *quad, 
85
							       flag);    
86
  
87
88
89
90
    uhEl.resize(nSystems);
    uhNeigh.resize(nSystems);
    if (timestep)
      uhOldEl.resize(nSystems);
91

Thomas Witkowski's avatar
Thomas Witkowski committed
92
    for (int system = 0; system < nSystems; system++) {
93
94
      uhEl[system].change_dim(basFcts[system]->getNumber()); 
      uhNeigh[system].change_dim(basFcts[system]->getNumber());
95
      if (timestep)
96
	uhOldEl[system].change_dim(basFcts[system]->getNumber());
97
98
    }

99
100
101
102
    if (timestep) {
      uhQP.change_dim(nPoints);
      uhOldQP.change_dim(nPoints);
    }
103
104

    riq.change_dim(nPoints);
105
106
107
    grdUh_qp = NULL;
    D2uhqp = NULL;

108
    // clear error indicators and mark elements for jumpRes
109
110
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh, -1, Mesh::CALL_LEAF_EL);
111
112
113
114
115
116
117
118
119
120
    while (elInfo) {
      elInfo->getElement()->setEstimation(0.0, row);
      elInfo->getElement()->setMark(1);
      elInfo = stack.traverseNext(elInfo);
    }

    est_sum = 0.0;
    est_max = 0.0;
    est_t_sum = 0.0;
    est_t_max = 0.0;
121

122
    traverseFlag = 
123
124
125
126
127
128
      Mesh::FILL_NEIGH      |
      Mesh::FILL_COORDS     |
      Mesh::FILL_OPP_COORDS |
      Mesh::FILL_BOUND      |
      Mesh::FILL_GRD_LAMBDA |
      Mesh::FILL_DET        |
129
      Mesh::CALL_LEAF_EL;
130
131
    neighInfo = mesh->createNewElInfo();

132
    // === Prepare date for computing jump residual. ===
133
134
135
136
137
138
139
140
141
142
    if (C1 > 0.0 && dim > 1) {
      surfaceQuad = Quadrature::provideQuadrature(dim - 1, degree);
      nPointsSurface = surfaceQuad->getNumPoints();
      grdUhEl.resize(nPointsSurface);
      grdUhNeigh.resize(nPointsSurface);
      jump.resize(nPointsSurface);
      localJump.resize(nPointsSurface);
      nNeighbours = Global::getGeo(NEIGH, dim);
      lambdaNeigh = new DimVec<WorldVector<double> >(dim, NO_INIT);
      lambda = new DimVec<double>(dim, NO_INIT);
143
144
145
146
147

      secondOrderTerms.resize(nSystems);
      for (int system = 0; system < nSystems; system++) {
	secondOrderTerms[system] = false;

148
149
150
	if (matrix[system] == NULL)
	  continue;

151
152
153
154
	for (std::vector<Operator*>::iterator it = matrix[system]->getOperators().begin();
	     it != matrix[system]->getOperators().end(); ++it)
	  secondOrderTerms[system] = secondOrderTerms[system] || (*it)->secondOrderTerms();
      }
155
    }
156
157
  }

158

159
160
161
162
  void ResidualEstimator::exit(bool output)
  {
    FUNCNAME("ResidualEstimator::exit()");

163
164
165
166
167
168
169
170
171
172
173
174
#ifdef HAVE_PARALLEL_DOMAIN_AMDIS
    double send_est_sum = est_sum;
    double send_est_max = est_max;
    double send_est_t_sum = est_t_sum;
    double send_est_t_max = est_t_max;

    MPI::COMM_WORLD.Allreduce(&send_est_sum, &est_sum, 1, MPI_DOUBLE, MPI_SUM);
    MPI::COMM_WORLD.Allreduce(&send_est_max, &est_max, 1, MPI_DOUBLE, MPI_MAX);
    MPI::COMM_WORLD.Allreduce(&send_est_t_sum, &est_t_sum, 1, MPI_DOUBLE, MPI_SUM);
    MPI::COMM_WORLD.Allreduce(&send_est_t_max, &est_t_max, 1, MPI_DOUBLE, MPI_MAX);
#endif

175
176
177
178
    est_sum = sqrt(est_sum);
    est_t_sum = sqrt(est_t_sum);

    if (output) {
179
      MSG("estimate for component %d = %.8e\n", row, est_sum);
180
      if (C3)
181
	MSG("time estimate for component %d = %.8e\n", row, est_t_sum);
182
183
    }

184
185
    delete [] basFcts;
    delete [] quadFast;
186

187
188
189
190
    if (grdUh_qp != NULL)
      delete [] grdUh_qp;
    if (D2uhqp != NULL)
      delete [] D2uhqp;
191

192
    if (C1 && (dim > 1)) {
193
194
      delete lambdaNeigh;
      delete lambda;
195
196
    }

Thomas Witkowski's avatar
Thomas Witkowski committed
197
    delete neighInfo;
198
199
  }

200

201
  void ResidualEstimator::estimateElement(ElInfo *elInfo, DualElInfo *dualElInfo)
202
  {    
203
204
    FUNCNAME("ResidualEstimator::estimateElement()");

Thomas Witkowski's avatar
Thomas Witkowski committed
205
    TEST_EXIT_DBG(nSystems > 0)("no system set\n");
206

Thomas Witkowski's avatar
Thomas Witkowski committed
207
208
    Element *el = elInfo->getElement();
    double est_el = el->getEstimation(row);
209
210
    std::vector<Operator*>::iterator it;
    std::vector<double*>::iterator itfac;
211

212
    // === Init assemblers. ===
Thomas Witkowski's avatar
Thomas Witkowski committed
213
    for (int system = 0; system < nSystems; system++) {
214
215
216
      if (matrix[system] == NULL) 
	continue;

217
218
219
220
221
      DOFMatrix *dofMat = const_cast<DOFMatrix*>(matrix[system]);
      DOFVector<double> *dofVec = const_cast<DOFVector<double>*>(fh[system]);

      for (it = dofMat->getOperatorsBegin(), itfac = dofMat->getOperatorEstFactorBegin();
	   it != dofMat->getOperatorsEnd(); ++it, ++itfac)
222
223
224
225
226
227
228
	if (*itfac == NULL || **itfac != 0.0) {	  
	  // If the estimator must only compute the jump residual but there are no
	  // second order terms in the operator, it can be skipped.
	  if (jumpResidualOnly && (*it)->secondOrderTerms() == false)
	    continue;
	  
	  if (dualElInfo)
229
230
231
	    (*it)->getAssembler(omp_get_thread_num())->initElement(dualElInfo->smallElInfo, 
								   dualElInfo->largeElInfo,
								   quad);
232
233
	  else
	    (*it)->getAssembler(omp_get_thread_num())->initElement(elInfo, NULL, quad);	  
234
	}
235

236
      if (C0 > 0.0)
237
	for (it = dofVec->getOperatorsBegin(); it != dofVec->getOperatorsEnd(); ++it) {
238
	  if (dualElInfo)
239
240
241
	    (*it)->getAssembler(omp_get_thread_num())->initElement(dualElInfo->smallElInfo, 
								   dualElInfo->largeElInfo,
								   quad);
242
243
	  else
	    (*it)->getAssembler(omp_get_thread_num())->initElement(elInfo, NULL, quad);	  
244
	}
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
    }


    // === Compute element residuals and time error estimation. ===
    if (C0 || C3)
      est_el += computeElementResidual(elInfo, dualElInfo);

    // === Compute jump residuals. ===
    if (C1 && dim > 1)
      est_el += computeJumpResidual(elInfo, dualElInfo);

    // === Update global residual variables. ===
    el->setEstimation(est_el, row);
    el->setMark(0);
    est_sum += est_el;
    est_max = max(est_max, est_el);
  }


  double ResidualEstimator::computeElementResidual(ElInfo *elInfo, 
						   DualElInfo *dualElInfo)
  {
    FUNCNAME("ResidualEstimator::computeElementResidual()");

269
    TEST_EXIT(!dualElInfo)("Not yet implemented!\n");
270
271
272
273
274

    std::vector<Operator*>::iterator it;
    std::vector<double*>::iterator itfac;
    double det = elInfo->getDet();
    double h2 = h2_from_det(det, dim);
275
    riq = 0.0;
276
277
278
279
280

    for (int system = 0; system < nSystems; system++) {
      if (matrix[system] == NULL) 
	continue;

281
      if (timestep && uhOld[system]) {
282
	TEST_EXIT_DBG(uhOld[system])("no uhOld\n");
283
	uhOld[system]->getLocalVector(elInfo->getElement(), uhOldEl[system]);
284
  
285
286
287
	// === Compute time error. ===

	if (C0 > 0.0 || C3 > 0.0) {   
288
289
290
	  uh[system]->getVecAtQPs(elInfo, NULL, quadFast[system], uhQP);
	  uhOld[system]->getVecAtQPs(elInfo, NULL, quadFast[system], uhOldQP);
	  
291
	  if (C3 > 0.0 && system == std::max(row, 0)) {
292
	    double result = 0.0;
Thomas Witkowski's avatar
Thomas Witkowski committed
293
	    for (int iq = 0; iq < nPoints; iq++) {
294
	      double tiq = (uhQP[iq] - uhOldQP[iq]);
295
	      result += quad->getWeight(iq) * tiq * tiq;
296
	    }
297
	    double v = C3 * det * result;
298
299
300
301
302
	    est_t_sum += v;
	    est_t_max = max(est_t_max, v);
	  }
	}
      }
303
           
304
      // === Compute element residual. ===
305
306
307
308
      if (C0 > 0.0) {
	DOFMatrix *dofMat = const_cast<DOFMatrix*>(matrix[system]);
	DOFVector<double> *dofVec = const_cast<DOFVector<double>*>(fh[system]);
  
Thomas Witkowski's avatar
Thomas Witkowski committed
309
	for (it = dofMat->getOperatorsBegin(), itfac = dofMat->getOperatorEstFactorBegin();
310
	     it != dofMat->getOperatorsEnd();  ++it, ++itfac) {
311
	  if (*itfac == NULL || **itfac != 0.0) {
312
313
	    if (num_rows(uhQP) == 0 && (*it)->zeroOrderTerms()) {
	      uhQP.change_dim(nPoints);
314
315
	      uh[system]->getVecAtQPs(elInfo, NULL, quadFast[system], uhQP);
	    }
316
317
	    if (grdUh_qp == NULL && 
		((*it)->firstOrderTermsGrdPsi() || (*it)->firstOrderTermsGrdPhi())) {
318
319
320
	      grdUh_qp = new WorldVector<double>[nPoints];
	      uh[system]->getGrdAtQPs(elInfo, NULL, quadFast[system], grdUh_qp);
	    }
321
	    if (D2uhqp == NULL && degree > 2 && (*it)->secondOrderTerms()) { 
322
323
324
	      D2uhqp = new WorldMatrix<double>[nPoints];
	      uh[system]->getD2AtQPs(elInfo, NULL, quadFast[system], D2uhqp);	    
	    }
325
326
327
	  }
	}
	
328
329
	// === Compute the element residual and store it in irq. ===

330
	r(elInfo,
Thomas Witkowski's avatar
Thomas Witkowski committed
331
	  nPoints, 
332
333
334
335
336
337
	  uhQP,
	  grdUh_qp,
	  D2uhqp,
	  uhOldQP,
	  NULL,  // grdUhOldQP 
	  NULL,  // D2UhOldQP
Thomas Witkowski's avatar
Thomas Witkowski committed
338
339
	  dofMat, 
	  dofVec,
340
	  quad,
341
	  riq);
342
343
344
345
      }     
    }

    // add integral over r square
346
    double result = 0.0;
347
    for (int iq = 0; iq < nPoints; iq++)
348
      result += quad->getWeight(iq) * riq[iq] * riq[iq];
349
   
350
    if (timestep != 0.0 || norm == NO_NORM || norm == L2_NORM)
351
      result = C0 * h2 * h2 * det * result;
352
    else
353
      result = C0 * h2 * det * result;
354
    
355
356
    return result;
  }
357

358

359
360
361
362
363
364
365
366
367
368
369
  double ResidualEstimator::computeJumpResidual(ElInfo *elInfo, 
						DualElInfo *dualElInfo)
  {
    FUNCNAME("ResidualEstimator::computeJumpResidual()");

    double result = 0.0;
    int dow = Global::getGeo(WORLD);
    Element *el = elInfo->getElement();
    const DimVec<WorldVector<double> > &grdLambda = elInfo->getGrdLambda();
    double det = elInfo->getDet();
    double h2 = h2_from_det(det, dim);
370

371
372
    for (int face = 0; face < nNeighbours; face++) {  
      Element *neigh = const_cast<Element*>(elInfo->getNeighbour(face));
373

374
375
      if (!(neigh && neigh->getMark()))
	continue;
376

377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
      int oppV = elInfo->getOppVertex(face);
	
      el->sortFaceIndices(face, &faceIndEl);
      neigh->sortFaceIndices(oppV, &faceIndNeigh);	
      neighInfo->setElement(const_cast<Element*>(neigh));
      neighInfo->setFillFlag(Mesh::FILL_COORDS);
      
      for (int i = 0; i < dow; i++)
	neighInfo->getCoord(oppV)[i] = elInfo->getOppCoord(face)[i];
      
      // periodic leaf data ?
      ElementData *ldp = el->getElementData()->getElementData(PERIODIC);	
      bool periodicCoords = false;
      
      if (ldp) {
	typedef std::list<LeafDataPeriodic::PeriodicInfo> PerInfList;
	PerInfList& infoList = dynamic_cast<LeafDataPeriodic*>(ldp)->getInfoList();
	
	for (PerInfList::iterator it = infoList.begin(); it != infoList.end(); ++it) {
	  if (it->elementSide == face) {
397
	    for (int i = 0; i < dim; i++) {
398
399
	      int i1 = faceIndEl[i];
	      int i2 = faceIndNeigh[i];
400
	      
401
402
403
404
	      int j = 0;
	      for (; j < dim; j++)
		if (i1 == el->getVertexOfPosition(INDEX_OF_DIM(dim - 1, dim), face, j))
		  break;
405
	      
406
	      TEST_EXIT_DBG(j != dim)("vertex i1 not on face ???\n");
407
	      
408
	      neighInfo->getCoord(i2) = (*(it->periodicCoords))[j];
409
	    }
410
411
	    periodicCoords = true;
	    break;
412
	  }
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
	}
      }  // if (ldp)
      
      if (!periodicCoords) {
	for (int i = 0; i < dim; i++) {
	  int i1 = faceIndEl[i];
	  int i2 = faceIndNeigh[i];
	  for (int j = 0; j < dow; j++)
	    neighInfo->getCoord(i2)[j] = elInfo->getCoord(i1)[j];
	}
      }
	
      Parametric *parametric = mesh->getParametric();
      if (parametric)
	neighInfo = parametric->addParametricInfo(neighInfo);	  
428

429
430
431
432
433
434
435
436
      double detNeigh = abs(neighInfo->calcGrdLambda(*lambdaNeigh));
           
      for (int iq = 0; iq < nPointsSurface; iq++)
	jump[iq].set(0.0);     
      
      for (int system = 0; system < nSystems; system++) {
	if (matrix[system] == NULL || secondOrderTerms[system] == false) 
	  continue;
437
	      
438
	uh[system]->getLocalVector(el, uhEl[system]);	
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
	uh[system]->getLocalVector(neigh, uhNeigh[system]);
	  
	for (int iq = 0; iq < nPointsSurface; iq++) {
	  (*lambda)[face] = 0.0;
	  for (int i = 0; i < dim; i++)
	    (*lambda)[faceIndEl[i]] = surfaceQuad->getLambda(iq, i);
	  
	  basFcts[system]->evalGrdUh(*lambda, grdLambda, uhEl[system], &grdUhEl[iq]);
	  
	  (*lambda)[oppV] = 0.0;
	  for (int i = 0; i < dim; i++)
	    (*lambda)[faceIndNeigh[i]] = surfaceQuad->getLambda(iq, i);		  
	  
	  basFcts[system]->evalGrdUh(*lambda, *lambdaNeigh, uhNeigh[system], &grdUhNeigh[iq]);
	  
	  grdUhEl[iq] -= grdUhNeigh[iq];
	} // for iq				
	
	std::vector<double*>::iterator fac;
	std::vector<Operator*>::iterator it;
	DOFMatrix *mat = const_cast<DOFMatrix*>(matrix[system]);
        for (it = mat->getOperatorsBegin(), fac = mat->getOperatorEstFactorBegin(); 
	     it != mat->getOperatorsEnd(); ++it, ++fac) {
	
	  if (*fac == NULL || **fac != 0.0) {
	    for (int iq = 0; iq < nPointsSurface; iq++)
	      localJump[iq].set(0.0);
	    
467
	    (*it)->weakEvalSecondOrder(grdUhEl, localJump);
468

469
470
471
472
473
474
475
476
477
478
479
480
481
482
	    double factor = *fac ? **fac : 1.0;
	    if (factor != 1.0)
	      for (int i = 0; i < nPointsSurface; i++)
		localJump[i] *= factor;
	    
	    for (int i = 0; i < nPointsSurface; i++)
	      jump[i] += localJump[i];
	  }		
	} // for (it = ...
      } // for system
    
      double val = 0.0;
      for (int iq = 0; iq < nPointsSurface; iq++)
	val += surfaceQuad->getWeight(iq) * (jump[iq] * jump[iq]);
Thomas Witkowski's avatar
Thomas Witkowski committed
483

484
485
      double d = 0.5 * (det + detNeigh);
   
486
      if (norm == NO_NORM || norm == L2_NORM)
487
	val *= C1 * h2_from_det(d, dim) * d;
488
      else
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
	val *= C1 * d;
      
      if (parametric)
	neighInfo = parametric->removeParametricInfo(neighInfo);
      
      neigh->setEstimation(neigh->getEstimation(row) + val, row);
      result += val;
    } // for face
    
    double val = fh[std::max(row, 0)]->getBoundaryManager()->
      boundResidual(elInfo, matrix[std::max(row, 0)], uh[std::max(row, 0)]);    
    if (norm == NO_NORM || norm == L2_NORM)
      val *= C1 * h2;
    else
      val *= C1;   
    result += val;
505

506
    return result;
507
508
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
509

510
  void r(const ElInfo *elInfo,
Thomas Witkowski's avatar
Thomas Witkowski committed
511
	 int nPoints,
512
	 const ElementVector& uhIq,
513
514
	 const WorldVector<double> *grdUhIq,
	 const WorldMatrix<double> *D2UhIq,
515
	 const ElementVector& uhOldIq,
516
517
518
519
520
	 const WorldVector<double> *grdUhOldIq,
	 const WorldMatrix<double> *D2UhOldIq,
	 DOFMatrix *A, 
	 DOFVector<double> *fh,
	 Quadrature *quad,
521
	 ElementVector& result)
522
  {
523
524
    std::vector<Operator*>::iterator it;
    std::vector<double*>::iterator fac;
525
526

    // lhs
Thomas Witkowski's avatar
Thomas Witkowski committed
527
528
    for (it = A->getOperatorsBegin(), fac = A->getOperatorEstFactorBegin(); 
	 it != A->getOperatorsEnd(); ++it, ++fac) {
529
530
531
     
      double factor = *fac ? **fac : 1.0;

532
      if (factor) {
Thomas Witkowski's avatar
Thomas Witkowski committed
533
534
	if (D2UhIq)
	  (*it)->evalSecondOrder(nPoints, uhIq, grdUhIq, D2UhIq, result, -factor);	
535
536

	if (grdUhIq) {
Thomas Witkowski's avatar
Thomas Witkowski committed
537
538
	  (*it)->evalFirstOrderGrdPsi(nPoints, uhIq, grdUhIq, D2UhIq, result, factor);
	  (*it)->evalFirstOrderGrdPhi(nPoints, uhIq, grdUhIq, D2UhIq, result, factor);
539
540
	}
	
541
	if (num_rows(uhIq) > 0)
Thomas Witkowski's avatar
Thomas Witkowski committed
542
	  (*it)->evalZeroOrder(nPoints, uhIq, grdUhIq, D2UhIq, result, factor);	
543
544
545
546
      }
    }
    
    // rhs
Thomas Witkowski's avatar
Thomas Witkowski committed
547
548
    for (it = fh->getOperatorsBegin(), fac = fh->getOperatorEstFactorBegin(); 
	 it != fh->getOperatorsEnd(); ++it, ++fac) {
549

550
551
      double factor = *fac ? **fac : 1.0;

552
553
      if (factor) {
	if ((*it)->getUhOld()) {
Thomas Witkowski's avatar
Thomas Witkowski committed
554
555
556
	  if (D2UhOldIq)
	    (*it)->evalSecondOrder(nPoints, uhOldIq, grdUhOldIq, D2UhOldIq, result, factor);
	  
557
	  if (grdUhOldIq) {
Thomas Witkowski's avatar
Thomas Witkowski committed
558
559
	    (*it)->evalFirstOrderGrdPsi(nPoints, uhOldIq, grdUhOldIq, D2UhOldIq, result, -factor);
	    (*it)->evalFirstOrderGrdPhi(nPoints, uhOldIq, grdUhOldIq, D2UhOldIq, result, -factor);
560
	  }
Thomas Witkowski's avatar
Thomas Witkowski committed
561

562
	  if (num_rows(uhOldIq) > 0)
Thomas Witkowski's avatar
Thomas Witkowski committed
563
	    (*it)->evalZeroOrder(nPoints, uhOldIq, grdUhOldIq, D2UhOldIq, result, -factor);	  
564
	} else {
565
	  ElementVector fx(nPoints, 0.0);
Thomas Witkowski's avatar
Thomas Witkowski committed
566
	  (*it)->getC(elInfo, nPoints, fx);
567

568
	  for (int iq = 0; iq < nPoints; iq++)
569
570
571
572
573
574
575
576
	    result[iq] -= factor * fx[iq];
	}
      }
    }    
  }


}