亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關(guān)于我們
? 蟲蟲下載站

?? ex11.c

?? 一個用來實現(xiàn)偏微分方程中網(wǎng)格的計算庫
?? C
?? 第 1 頁 / 共 2 頁
字號:
    Kuu(Ke), Kuv(Ke), Kup(Ke),    Kvu(Ke), Kvv(Ke), Kvp(Ke),    Kpu(Ke), Kpv(Ke), Kpp(Ke);  DenseSubVector<Number>    Fu(Fe),    Fv(Fe),    Fp(Fe);  // This vector will hold the degree of freedom indices for  // the element.  These define where in the global system  // the element degrees of freedom get mapped.  std::vector<unsigned int> dof_indices;  std::vector<unsigned int> dof_indices_u;  std::vector<unsigned int> dof_indices_v;  std::vector<unsigned int> dof_indices_p;    // Now we will loop over all the elements in the mesh that  // live on the local processor. We will compute the element  // matrix and right-hand-side contribution.  Since the mesh  // will be refined we want to only consider the ACTIVE elements,  // hence we use a variant of the \p active_elem_iterator.//   const_active_local_elem_iterator           el (mesh.elements_begin());//   const const_active_local_elem_iterator end_el (mesh.elements_end());  MeshBase::const_element_iterator       el     = mesh.active_local_elements_begin();  const MeshBase::const_element_iterator end_el = mesh.active_local_elements_end();     for ( ; el != end_el; ++el)    {          // Store a pointer to the element we are currently      // working on.  This allows for nicer syntax later.      const Elem* elem = *el;            // Get the degree of freedom indices for the      // current element.  These define where in the global      // matrix and right-hand-side this element will      // contribute to.      dof_map.dof_indices (elem, dof_indices);      dof_map.dof_indices (elem, dof_indices_u, u_var);      dof_map.dof_indices (elem, dof_indices_v, v_var);      dof_map.dof_indices (elem, dof_indices_p, p_var);      const unsigned int n_dofs   = dof_indices.size();      const unsigned int n_u_dofs = dof_indices_u.size();       const unsigned int n_v_dofs = dof_indices_v.size();       const unsigned int n_p_dofs = dof_indices_p.size();            // Compute the element-specific data for the current      // element.  This involves computing the location of the      // quadrature points (q_point) and the shape functions      // (phi, dphi) for the current element.      fe_vel->reinit  (elem);      fe_pres->reinit (elem);      // Zero the element matrix and right-hand side before      // summing them.  We use the resize member here because      // the number of degrees of freedom might have changed from      // the last element.  Note that this will be the case if the      // element type is different (i.e. the last element was a      // triangle, now we are on a quadrilateral).      Ke.resize (n_dofs, n_dofs);      Fe.resize (n_dofs);      // Reposition the submatrices...  The idea is this:      //      //         -           -          -  -      //        | Kuu Kuv Kup |        | Fu |      //   Ke = | Kvu Kvv Kvp |;  Fe = | Fv |      //        | Kpu Kpv Kpp |        | Fp |      //         -           -          -  -      //      // The \p DenseSubMatrix.repostition () member takes the      // (row_offset, column_offset, row_size, column_size).      //       // Similarly, the \p DenseSubVector.reposition () member      // takes the (row_offset, row_size)      Kuu.reposition (u_var*n_u_dofs, u_var*n_u_dofs, n_u_dofs, n_u_dofs);      Kuv.reposition (u_var*n_u_dofs, v_var*n_u_dofs, n_u_dofs, n_v_dofs);      Kup.reposition (u_var*n_u_dofs, p_var*n_u_dofs, n_u_dofs, n_p_dofs);            Kvu.reposition (v_var*n_v_dofs, u_var*n_v_dofs, n_v_dofs, n_u_dofs);      Kvv.reposition (v_var*n_v_dofs, v_var*n_v_dofs, n_v_dofs, n_v_dofs);      Kvp.reposition (v_var*n_v_dofs, p_var*n_v_dofs, n_v_dofs, n_p_dofs);            Kpu.reposition (p_var*n_u_dofs, u_var*n_u_dofs, n_p_dofs, n_u_dofs);      Kpv.reposition (p_var*n_u_dofs, v_var*n_u_dofs, n_p_dofs, n_v_dofs);      Kpp.reposition (p_var*n_u_dofs, p_var*n_u_dofs, n_p_dofs, n_p_dofs);      Fu.reposition (u_var*n_u_dofs, n_u_dofs);      Fv.reposition (v_var*n_u_dofs, n_v_dofs);      Fp.reposition (p_var*n_u_dofs, n_p_dofs);            // Now we will build the element matrix.      for (unsigned int qp=0; qp<qrule.n_points(); qp++)        {          // Assemble the u-velocity row          // uu coupling          for (unsigned int i=0; i<n_u_dofs; i++)            for (unsigned int j=0; j<n_u_dofs; j++)              Kuu(i,j) += JxW[qp]*(dphi[i][qp]*dphi[j][qp]);          // up coupling          for (unsigned int i=0; i<n_u_dofs; i++)            for (unsigned int j=0; j<n_p_dofs; j++)              Kup(i,j) += -JxW[qp]*psi[j][qp]*dphi[i][qp](0);          // Assemble the v-velocity row          // vv coupling          for (unsigned int i=0; i<n_v_dofs; i++)            for (unsigned int j=0; j<n_v_dofs; j++)              Kvv(i,j) += JxW[qp]*(dphi[i][qp]*dphi[j][qp]);          // vp coupling          for (unsigned int i=0; i<n_v_dofs; i++)            for (unsigned int j=0; j<n_p_dofs; j++)              Kvp(i,j) += -JxW[qp]*psi[j][qp]*dphi[i][qp](1);                    // Assemble the pressure row          // pu coupling          for (unsigned int i=0; i<n_p_dofs; i++)            for (unsigned int j=0; j<n_u_dofs; j++)              Kpu(i,j) += -JxW[qp]*psi[i][qp]*dphi[j][qp](0);          // pv coupling          for (unsigned int i=0; i<n_p_dofs; i++)            for (unsigned int j=0; j<n_v_dofs; j++)              Kpv(i,j) += -JxW[qp]*psi[i][qp]*dphi[j][qp](1);                  } // end of the quadrature point qp-loop      // At this point the interior element integration has      // been completed.  However, we have not yet addressed      // boundary conditions.  For this example we will only      // consider simple Dirichlet boundary conditions imposed      // via the penalty method. The penalty method used here      // is equivalent (for Lagrange basis functions) to lumping      // the matrix resulting from the L2 projection penalty      // approach introduced in example 3.      {        // The following loops over the sides of the element.        // If the element has no neighbor on a side then that        // side MUST live on a boundary of the domain.        for (unsigned int s=0; s<elem->n_sides(); s++)          if (elem->neighbor(s) == NULL)            {              AutoPtr<Elem> side (elem->build_side(s));                                          // Loop over the nodes on the side.              for (unsigned int ns=0; ns<side->n_nodes(); ns++)                {                  // The location on the boundary of the current                  // node.                                     // const Real xf = side->point(ns)(0);                  const Real yf = side->point(ns)(1);                                    // The penalty value.  \f$ \frac{1}{\epsilon \f$                  const Real penalty = 1.e10;                                    // The boundary values.                                     // Set u = 1 on the top boundary, 0 everywhere else                  const Real u_value = (yf > .99) ? 1. : 0.;                                    // Set v = 0 everywhere                  const Real v_value = 0.;                                    // Find the node on the element matching this node on                  // the side.  That defined where in the element matrix                  // the boundary condition will be applied.                  for (unsigned int n=0; n<elem->n_nodes(); n++)                    if (elem->node(n) == side->node(ns))                      {                        // Matrix contribution.                        Kuu(n,n) += penalty;                        Kvv(n,n) += penalty;                                                            // Right-hand-side contribution.                        Fu(n) += penalty*u_value;                        Fv(n) += penalty*v_value;                      }                } // end face node loop                      } // end if (elem->neighbor(side) == NULL)      } // end boundary condition section                      // The element matrix and right-hand-side are now built      // for this element.  Add them to the global matrix and      // right-hand-side vector.  The \p PetscMatrix::add_matrix()      // and \p PetscVector::add_vector() members do this for us.      system.matrix->add_matrix (Ke, dof_indices);      system.rhs->add_vector    (Fe, dof_indices);    } // end of element loop    // That's it.  return;}

?? 快捷鍵說明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
欧美三区在线视频| 中文字幕av资源一区| 精品久久久影院| 欧美国产精品专区| 一级中文字幕一区二区| 蜜桃精品在线观看| 99re8在线精品视频免费播放| 在线观看日韩国产| 国产欧美一区二区精品久导航| 亚洲美腿欧美偷拍| 精彩视频一区二区| 在线看日韩精品电影| 日韩女优av电影在线观看| 欧美丰满一区二区免费视频| 国产性做久久久久久| 亚洲成人1区2区| 99精品欧美一区二区蜜桃免费 | 成人福利视频在线看| 91传媒视频在线播放| 国产三区在线成人av| 三级亚洲高清视频| 色综合天天综合在线视频| 精品福利二区三区| 天堂资源在线中文精品| 色综合天天综合| 欧美国产丝袜视频| 国产在线看一区| 色88888久久久久久影院野外| 精品国产伦一区二区三区观看体验| 亚洲中国最大av网站| 成人免费av在线| 国产拍欧美日韩视频二区| 五月天精品一区二区三区| 97精品久久久午夜一区二区三区 | 久久精品免费在线观看| 免费高清在线视频一区·| 欧美三级一区二区| 一区二区三区在线免费视频| 国产一区久久久| 日韩一区国产二区欧美三区| 一区二区三区在线观看网站| 91丨porny丨首页| 中文字幕一区二区三区四区不卡| 国产成人在线电影| 国产亚洲污的网站| 国产精一区二区三区| 久久综合九色综合久久久精品综合 | 久久精品亚洲国产奇米99| 精品一区二区三区欧美| 精品入口麻豆88视频| 久久超碰97人人做人人爱| 日韩情涩欧美日韩视频| 美女网站一区二区| 久久综合丝袜日本网| 蜜桃一区二区三区在线| 久久久另类综合| 麻豆国产一区二区| 欧美成人vps| 日本午夜一本久久久综合| 精品免费一区二区三区| 美脚の诱脚舐め脚责91| 久久久久久99久久久精品网站| 国产乱子轮精品视频| 国产精品久久久久三级| 在线这里只有精品| 首页国产丝袜综合| 日韩一区二区三区免费观看| 国产一区二区精品久久91| 欧美高清在线一区二区| 在线视频欧美精品| 亚洲视频在线观看一区| 欧美性高清videossexo| 视频一区二区不卡| 久久九九99视频| 91色九色蝌蚪| 日韩av一二三| 欧美国产一区视频在线观看| 欧美在线观看禁18| 国产黄色精品视频| 亚洲美女屁股眼交| 日韩视频在线永久播放| 成人av影院在线| 天使萌一区二区三区免费观看| 久久综合狠狠综合久久综合88| 99久久国产综合精品色伊| 日韩和欧美一区二区三区| 日本一区二区视频在线观看| 欧美日韩美少妇| 丁香亚洲综合激情啪啪综合| 亚洲高清在线精品| 久久久久久电影| 欧洲生活片亚洲生活在线观看| 久久99精品久久久久| 亚洲乱码中文字幕| 久久久亚洲精品一区二区三区| 欧美性生活影院| 国产成人免费在线视频| 国产一区在线观看视频| 午夜精品久久久久久久99水蜜桃| 久久久久9999亚洲精品| 在线观看国产日韩| bt欧美亚洲午夜电影天堂| 日韩激情av在线| 亚洲天堂av一区| 国产偷国产偷亚洲高清人白洁 | 成人精品在线视频观看| 美腿丝袜一区二区三区| 亚洲一区自拍偷拍| 亚洲男人的天堂在线观看| 精品国产一二三区| 91福利国产成人精品照片| 成人免费av资源| 国产精品自拍av| 日韩不卡一区二区| 亚洲电影你懂得| 亚洲精品日韩综合观看成人91| 久久久久久久久久久黄色| 7777精品伊人久久久大香线蕉的| 国产69精品久久久久777| 极品少妇一区二区| 久久av资源网| 免费精品99久久国产综合精品| 亚洲成人动漫av| 亚洲大尺度视频在线观看| 亚洲蜜臀av乱码久久精品 | 中文字幕一区二区三| 国产片一区二区| 国产日本欧洲亚洲| 久久久久久久综合日本| 日韩精品中文字幕一区二区三区| 一本色道久久综合亚洲aⅴ蜜桃| 成人免费av在线| 99精品视频中文字幕| 91蜜桃传媒精品久久久一区二区| eeuss鲁一区二区三区| youjizz久久| 91在线国产观看| 色爱区综合激月婷婷| 欧美怡红院视频| 欧美日本韩国一区二区三区视频| 欧美日韩一区二区在线观看| 777色狠狠一区二区三区| 日韩欧美国产不卡| 正在播放亚洲一区| 精品国产一区二区三区忘忧草| 亚洲精品在线一区二区| 国产亚洲婷婷免费| 国产欧美日韩激情| 亚洲视频网在线直播| 亚洲国产中文字幕在线视频综合| 亚洲成av人综合在线观看| 青青草97国产精品免费观看无弹窗版| 蜜臀av国产精品久久久久| 国产成人免费网站| 91久久精品一区二区三| 欧美一级久久久久久久大片| 国产网站一区二区三区| 亚洲精品欧美激情| 蜜臀av亚洲一区中文字幕| 成人深夜视频在线观看| 欧美中文一区二区三区| 51精品秘密在线观看| 精品第一国产综合精品aⅴ| 久久久蜜桃精品| 一区二区三区鲁丝不卡| 老司机一区二区| 91偷拍与自偷拍精品| 91精品国产色综合久久不卡电影| 久久久久国产精品麻豆ai换脸| 亚洲人成影院在线观看| 另类综合日韩欧美亚洲| 91免费视频大全| 亚洲国产精品成人综合| 久久99九九99精品| 欧美丰满一区二区免费视频| 亚洲精品乱码久久久久| 国产精品99久久久久久久vr | 中文字幕一区二区三区色视频| 人禽交欧美网站| 欧美日韩中文字幕一区二区| 国产精品国产精品国产专区不片| 国产一区在线精品| 精品国产三级a在线观看| 日韩二区在线观看| 欧美视频你懂的| 亚洲图片自拍偷拍| 在线免费一区三区| 亚洲品质自拍视频| 91视频.com| 亚洲欧美电影一区二区| 91碰在线视频| 一区二区三区四区高清精品免费观看| 成人福利在线看| 亚洲欧美区自拍先锋| aaa亚洲精品| 一区二区三区在线观看动漫| 在线观看视频一区| 午夜在线电影亚洲一区| 欧美日韩一区小说| 青青国产91久久久久久|