鲁棒且高效的线性六面体单元验证方法
Robust and efficient validation of the linear hexahedral element
AI总结:
本文提出一种高效验证线性六面体单元有效性的方法,通过计算雅可比行列式的贝塞尔系数,仅需20个雅可比行列式即可确定27个系数,实现每秒检查约600万六面体的效率。
摘要:
在有限元分析之前,检查网格有效性是必不可少的步骤。尽管四面体的有效性检查很简单,但六面体的有效性检查却远非显而易见。本文提出了一种鲁棒且高效的计算标准线性六面体单元有效性的方法,该方法是对之前曲面元素有效性研究的显著改进。新实现简单且计算高效。算法的关键仍然是计算雅可比行列式的贝塞尔系数。我们证明仅需计算20个雅可比行列式即可确定27个贝塞尔系数。这些20个雅可比行列式可通过计算20个四面体的体积高效地得到。新实现能够在个人电脑的一个核心上每秒检查约600万个六面体的有效性。通过本文,提供了所有必要的信息,使读者能够轻松复现结果,即编写一个简单的程序,输入8个点的坐标并输出六面体的有效性。
英文摘要:
Checking mesh validity is a mandatory step before doing any finite element analysis. If checking the validity of tetrahedra is trivial, checking the validity of hexahedral elements is far from being obvious. In this paper, a method that robustly and efficiently compute the validity of standard linear hexahedral elements is presented. This method is a significant improvement of a previous work on the validity of curvilinear elements. The new implementation is simple and computationally efficient. The key of the algorithm is still to compute Bézier coefficients of the Jacobian determinant. We show that only 20 Jacobian determinants are necessary to compute the 27 Bézier coefficients. Those 20 Jacobians can be efficiently computed by calculating the volume of 20 tetrahedra. The new implementation is able to check the validity of about 6 million hexahedra per second on one core of a personal computer. Through the paper, all the necessary information is provided that allow to easily reproduce the results, \ie write a simple code that takes the coordinates of 8 points as input and outputs the validity of the hexahedron.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。