Skip to content
Snippets Groups Projects
Commit 898108b7 authored by Thomas Toulorge's avatar Thomas Toulorge
Browse files

Changed fast Jacobian estimation

parent 011ec862
No related branches found
No related tags found
No related merge requests found
......@@ -124,16 +124,12 @@ JacobianBasis::JacobianBasis(int tag)
delete[] barDPsi;
// Compute "fast" Jacobian evaluation matrices (at 1st order nodes + barycenter)
// numJacNodesFast = numPrimMapNodes+1;
// fullMatrix<double> lagPointsFast(numJacNodesFast,3); // Sampling points
// lagPointsFast.copy(primMapBasis->points,0,numPrimMapNodes,0,3,0,0); // 1st order nodes
// lagPointsFast(numPrimMapNodes,0) = barycenter[0]; // Last point = barycenter
// lagPointsFast(numPrimMapNodes,1) = barycenter[1];
// lagPointsFast(numPrimMapNodes,2) = barycenter[2];
numJacNodesFast = numPrimMapNodes+1;
fullMatrix<double> lagPointsFast(numJacNodesFast,3); // Sampling points
lagPointsFast(0,0) = barycenter[0]; // Last point = barycenter
lagPointsFast(0,1) = barycenter[1];
lagPointsFast(0,2) = barycenter[2];
lagPointsFast.copy(primMapBasis->points,0,numPrimMapNodes,0,3,0,0); // 1st order nodes
lagPointsFast(numPrimMapNodes,0) = barycenter[0]; // Last point = barycenter
lagPointsFast(numPrimMapNodes,1) = barycenter[1];
lagPointsFast(numPrimMapNodes,2) = barycenter[2];
fullMatrix<double> allDPsiFast;
mapBasis->df(lagPointsFast, allDPsiFast);
......
......@@ -23,7 +23,7 @@ class JacobianBasis {
int numJacNodes, numPrimJacNodes;
int numMapNodes, numPrimMapNodes;
static const int numJacNodesFast = 1;
int numJacNodesFast;
void getSignedJacobianGeneral(int nJacNodes, const fullMatrix<double> &gSMatX,
const fullMatrix<double> &gSMatY, const fullMatrix<double> &gSMatZ,
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment