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
#include "ResidualEstimator.h"
#include "Operator.h"
#include "DOFMatrix.h"
#include "DOFVector.h"
#include "Assembler.h"
#include "Traverse.h"
19
#include "Initfile.h"
20

21
#ifdef HAVE_PARALLEL_DOMAIN_AMDIS
Thomas Witkowski's avatar
Thomas Witkowski committed
22
#include <mpi.h>
23
24
#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
    Parameters::get(name + "->C0", C0);
    Parameters::get(name + "->C1", C1);
    Parameters::get(name + "->C2", C2);
    Parameters::get(name + "->C3", C3);
41
42
43
44
45

    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
    if (C1 != 0.0 && C0 == 0.0 && C3 == 0.0)
      jumpResidualOnly = true;
      
50
    TEST_EXIT(C2 == 0.0)("C2 is not used! Please remove it or set it to 0.0!\n");
51
52
  }

53

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

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

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

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

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

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

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

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

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

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

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

107
    // clear error indicators and mark elements for jumpRes
108
109
    TraverseStack stack;
    ElInfo *elInfo = stack.traverseFirst(mesh, -1, Mesh::CALL_LEAF_EL);
110
    while (elInfo) {
111
112
113
      // SIMON: DEL LINE BELOW
      elInfo->getElement()->setEstimation(0.0, row);

114
115
116
117
118
119
120
121
      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;
122

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

133
    // === Prepare date for computing jump residual. ===
134
135
136
137
138
139
140
141
142
143
    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);
144
145
146
147
148

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

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

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

159

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

164
165
166
167
168
169
170
171
172
173
174
175
#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

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

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

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

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

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

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

201

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

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

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

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

219
220
221
222
223
      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)
224
225
226
227
228
229
230
	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)
231
232
233
	    (*it)->getAssembler()->initElement(dualElInfo->smallElInfo, 
					       dualElInfo->largeElInfo,
					       quad);
234
	  else
235
	    (*it)->getAssembler()->initElement(elInfo, NULL, quad);	  
236
	}
237

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


    // === 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;
262
    est_max = std::max(est_max, est_el);
263
264
265
266
267
268
269
270
  }


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

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

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

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

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

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

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

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

360

361
362
363
364
365
366
367
368
369
370
371
  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);
372

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

376
377
      if (!(neigh && neigh->getMark()))
	continue;
378

379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
      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) {
399
	    for (int i = 0; i < dim; i++) {
400
401
	      int i1 = faceIndEl[i];
	      int i2 = faceIndNeigh[i];
402
	      
403
404
405
406
	      int j = 0;
	      for (; j < dim; j++)
		if (i1 == el->getVertexOfPosition(INDEX_OF_DIM(dim - 1, dim), face, j))
		  break;
407
	      
408
	      TEST_EXIT_DBG(j != dim)("vertex i1 not on face ???\n");
409
	      
410
	      neighInfo->getCoord(i2) = (*(it->periodicCoords))[j];
411
	    }
412
413
	    periodicCoords = true;
	    break;
414
	  }
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
	}
      }  // 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);	  
430

431
432
433
434
435
436
437
438
      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;
439
	      
440
	uh[system]->getLocalVector(el, uhEl[system]);	
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
467
468
	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);
	    
469
	    (*it)->weakEvalSecondOrder(grdUhEl, localJump);
470

471
472
473
474
475
476
477
478
479
480
481
482
483
484
	    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
485

486
487
      double d = 0.5 * (det + detNeigh);
   
488
      if (norm == NO_NORM || norm == L2_NORM)
489
	val *= C1 * h2_from_det(d, dim) * d;
490
      else
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
	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;
507

508
    return result;
509
510
  }

Thomas Witkowski's avatar
Thomas Witkowski committed
511

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

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

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

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

554
555
      double factor = *fac ? **fac : 1.0;

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

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

572
	  for (int iq = 0; iq < nPoints; iq++)
573
574
575
576
577
578
579
580
	    result[iq] -= factor * fx[iq];
	}
      }
    }    
  }


}