DemkowiczHexAndQuad Namespace Reference

Functions
MoFEMErrorCode	monom_ordering (int *perm, int p, int q, int r=0)
static void	get_ksi_hex (int shift, double *N, double *N_diff, double ksi[3], double diff_ksi[3][3])

Function Documentation

get_ksi_hex()

static void DemkowiczHexAndQuad::get_ksi_hex ( int  shift, double *  N, double *  N_diff, double  ksi[3], double  diff_ksi[3][3]  )

inlinestatic

Definition at line 103 of file EdgeQuadHexPolynomials.cpp.

                                                                     {
 
  constexpr std::array<size_t, 4> ksi_nodes[2][3] = {
 
      {{1, 2, 6, 5}, {3, 2, 6, 7}, {4, 5, 6, 7}},
 
      {{0, 3, 7, 4}, {0, 1, 5, 4}, {0, 1, 2, 3}}
 
  };
 
  for (size_t i = 0; i != 3; ++i) {
    for (auto n : ksi_nodes[0][i])
      ksi[i] += N[shift + n];
    for (auto n : ksi_nodes[1][i])
      ksi[i] -= N[shift + n];
  }
 
  for (size_t i = 0; i != 3; ++i) {
    for (auto d = 0; d != 3; ++d) {
      for (auto n : ksi_nodes[0][i]) {
 
        diff_ksi[i][d] += N_diff[3 * (shift + n) + d];
      }
    }
    for (auto n : ksi_nodes[1][i]) {
      for (auto d = 0; d != 3; ++d) {
        diff_ksi[i][d] -= N_diff[3 * (shift + n) + d];
      }
    }
  }
}

monom_ordering()

MoFEMErrorCode DemkowiczHexAndQuad::monom_ordering	(	int *	perm,
		int	p,
		int	q,
		int	r = 0
	)

Definition at line 11 of file EdgeQuadHexPolynomials.cpp.

                                                                  {
  MoFEMFunctionBeginHot;
 
  if (r > 0) {
 
    for (int m = 0; m != std::max(std::max(p, q), r) + 1; ++m) {
 
      const int i = std::min(m, p);
      const int j = std::min(m, q);
      const int k = std::min(m, r);
 
      if (i == m)
        for (int jj = 0; jj != j; ++jj) {
          for (int kk = 0; kk != k; ++kk) {
            *(perm++) = i;
            *(perm++) = jj;
            *(perm++) = kk;
          }
        }
 
      if (j == m)
        for (int ii = 0; ii != i; ++ii) {
          for (int kk = 0; kk != k; ++kk) {
            *(perm++) = ii;
            *(perm++) = j;
            *(perm++) = kk;
          }
        }
 
      if (k == m)
        for (int ii = 0; ii != i; ++ii) {
          for (int jj = 0; jj != j; ++jj) {
            *(perm++) = ii;
            *(perm++) = jj;
            *(perm++) = k;
          }
        }
 
      if (j == m || k == m)
        for (int ii = 0; ii != i; ++ii) {
          *(perm++) = ii;
          *(perm++) = j;
          *(perm++) = k;
        }
 
      if (i == m || k == m)
        for (int jj = 0; jj != j; ++jj) {
          *(perm++) = i;
          *(perm++) = jj;
          *(perm++) = k;
        }
 
      if (i == m || j == m)
        for (int kk = 0; kk != k; ++kk) {
          *(perm++) = i;
          *(perm++) = j;
          *(perm++) = kk;
        }
 
      *(perm++) = i;
      *(perm++) = j;
      *(perm++) = k;
    }
  } else {
 
    for (int m = 0; m != std::max(p, q) + 1; ++m) {
 
      const int i = std::min(m, p);
      const int j = std::min(m, q);
 
      if (j == m)
        for (int ii = 0; ii != i; ++ii) {
          *(perm++) = ii;
          *(perm++) = j;
          *(perm++) = 0;
        }
 
      if (i == m)
        for (int jj = 0; jj != j; ++jj) {
          *(perm++) = i;
          *(perm++) = jj;
          *(perm++) = 0;
        }
 
      *(perm++) = i;
      *(perm++) = j;
      *(perm++) = 0;
    }
  }
  MoFEMFunctionReturnHot(0);
}