⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 poisson2d_5.h

📁 利用C
💻 H
📖 第 1 页 / 共 5 页
字号:
        // Get coordinates and map to the reference (UFC) element    double x = (element_coordinates[0][1]*element_coordinates[2][0] -\                element_coordinates[0][0]*element_coordinates[2][1] +\                J_11*coordinates[0] - J_01*coordinates[1]) / detJ;    double y = (element_coordinates[1][1]*element_coordinates[0][0] -\                element_coordinates[1][0]*element_coordinates[0][1] -\                J_10*coordinates[0] + J_00*coordinates[1]) / detJ;        // Map coordinates to the reference square    if (std::abs(y - 1.0) < 1e-14)      x = -1.0;    else      x = 2.0 *x/(1.0 - y) - 1.0;    y = 2.0*y - 1.0;        // Compute number of derivatives    unsigned int num_derivatives = 1;        for (unsigned int j = 0; j < n; j++)      num_derivatives *= 2;            // Declare pointer to two dimensional array that holds combinations of derivatives and initialise    unsigned int **combinations = new unsigned int *[num_derivatives];            for (unsigned int j = 0; j < num_derivatives; j++)    {      combinations[j] = new unsigned int [n];      for (unsigned int k = 0; k < n; k++)        combinations[j][k] = 0;    }            // Generate combinations of derivatives    for (unsigned int row = 1; row < num_derivatives; row++)    {      for (unsigned int num = 0; num < row; num++)      {        for (unsigned int col = n-1; col+1 > 0; col--)        {          if (combinations[row][col] + 1 > 1)            combinations[row][col] = 0;          else          {            combinations[row][col] += 1;            break;          }        }      }    }        // Compute inverse of Jacobian    const double Jinv[2][2] =  {{J_11 / detJ, -J_01 / detJ}, {-J_10 / detJ, J_00 / detJ}};        // Declare transformation matrix    // Declare pointer to two dimensional array and initialise    double **transform = new double *[num_derivatives];            for (unsigned int j = 0; j < num_derivatives; j++)    {      transform[j] = new double [num_derivatives];      for (unsigned int k = 0; k < num_derivatives; k++)        transform[j][k] = 1;    }        // Construct transformation matrix    for (unsigned int row = 0; row < num_derivatives; row++)    {      for (unsigned int col = 0; col < num_derivatives; col++)      {        for (unsigned int k = 0; k < n; k++)          transform[row][col] *= Jinv[combinations[col][k]][combinations[row][k]];      }    }        // Reset values    for (unsigned int j = 0; j < 1*num_derivatives; j++)      values[j] = 0;        // Map degree of freedom to element degree of freedom    const unsigned int dof = i;        // Generate scalings    const double scalings_y_0 = 1;    const double scalings_y_1 = scalings_y_0*(0.5 - 0.5*y);    const double scalings_y_2 = scalings_y_1*(0.5 - 0.5*y);    const double scalings_y_3 = scalings_y_2*(0.5 - 0.5*y);    const double scalings_y_4 = scalings_y_3*(0.5 - 0.5*y);    const double scalings_y_5 = scalings_y_4*(0.5 - 0.5*y);        // Compute psitilde_a    const double psitilde_a_0 = 1;    const double psitilde_a_1 = x;    const double psitilde_a_2 = 1.5*x*psitilde_a_1 - 0.5*psitilde_a_0;    const double psitilde_a_3 = 1.66666666666667*x*psitilde_a_2 - 0.666666666666667*psitilde_a_1;    const double psitilde_a_4 = 1.75*x*psitilde_a_3 - 0.75*psitilde_a_2;    const double psitilde_a_5 = 1.8*x*psitilde_a_4 - 0.8*psitilde_a_3;        // Compute psitilde_bs    const double psitilde_bs_0_0 = 1;    const double psitilde_bs_0_1 = 1.5*y + 0.5;    const double psitilde_bs_0_2 = 0.111111111111111*psitilde_bs_0_1 + 1.66666666666667*y*psitilde_bs_0_1 - 0.555555555555556*psitilde_bs_0_0;    const double psitilde_bs_0_3 = 0.05*psitilde_bs_0_2 + 1.75*y*psitilde_bs_0_2 - 0.7*psitilde_bs_0_1;    const double psitilde_bs_0_4 = 0.0285714285714286*psitilde_bs_0_3 + 1.8*y*psitilde_bs_0_3 - 0.771428571428571*psitilde_bs_0_2;    const double psitilde_bs_0_5 = 0.0185185185185185*psitilde_bs_0_4 + 1.83333333333333*y*psitilde_bs_0_4 - 0.814814814814815*psitilde_bs_0_3;    const double psitilde_bs_1_0 = 1;    const double psitilde_bs_1_1 = 2.5*y + 1.5;    const double psitilde_bs_1_2 = 0.54*psitilde_bs_1_1 + 2.1*y*psitilde_bs_1_1 - 0.56*psitilde_bs_1_0;    const double psitilde_bs_1_3 = 0.285714285714286*psitilde_bs_1_2 + 2*y*psitilde_bs_1_2 - 0.714285714285714*psitilde_bs_1_1;    const double psitilde_bs_1_4 = 0.178571428571429*psitilde_bs_1_3 + 1.96428571428571*y*psitilde_bs_1_3 - 0.785714285714286*psitilde_bs_1_2;    const double psitilde_bs_2_0 = 1;    const double psitilde_bs_2_1 = 3.5*y + 2.5;    const double psitilde_bs_2_2 = 1.02040816326531*psitilde_bs_2_1 + 2.57142857142857*y*psitilde_bs_2_1 - 0.551020408163265*psitilde_bs_2_0;    const double psitilde_bs_2_3 = 0.578703703703704*psitilde_bs_2_2 + 2.29166666666667*y*psitilde_bs_2_2 - 0.712962962962963*psitilde_bs_2_1;    const double psitilde_bs_3_0 = 1;    const double psitilde_bs_3_1 = 4.5*y + 3.5;    const double psitilde_bs_3_2 = 1.51234567901235*psitilde_bs_3_1 + 3.05555555555556*y*psitilde_bs_3_1 - 0.54320987654321*psitilde_bs_3_0;    const double psitilde_bs_4_0 = 1;    const double psitilde_bs_4_1 = 5.5*y + 4.5;    const double psitilde_bs_5_0 = 1;        // Compute basisvalues

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -