关于显式和半显式浸入边界有限元方法在波传播问题中的效率研究
On the efficiency of explicit and semi-explicit immersed boundary finite element methods for wave propagation problems
AI总结:
本文研究了显式和半显式浸入边界有限元方法在波传播问题中的效率,探讨了隐式-显式时间推进方案和稳定化方法对提高临界时间步长和计算效率的影响。
摘要:
浸入边界方法在过去几十年中引起了广泛关注,因其在处理复杂几何结构计算中的潜力。通常这些结构无法高效地使用边界适应有限元进行离散化。浸入边界方法提供了一种简单且全自动的离散化方法,基于笛卡尔网格和定制的四阶积分方案,以考虑几何模型。因此,它可以独立于网格描述,例如通过从计算断层扫描获得的图像数据。此类离散化的缺点在于网格中某些元素与几何体之间的重叠可能非常小。这些被错误切割的元素具有较小的物理支撑,对非线性和/或动态模拟构成了特别的挑战。在本研究中,我们专注于结构动力学和声学问题,并集中于使用显式时间推进方案解决这些问题。在这一背景下,被错误切割的元素可能导致不合理的极小临界时间步长。我们研究了隐式-显式时间推进方案和两种在先前工作中开发的稳定化方法作为潜在的解决方案。虽然这些方法之前已被研究过,以评估它们在增加临界时间步长方面的有效性,但它们的数值效率仅在每个自由度的精度方面被考虑。在本文中,我们评估了为给定精度所需的计算时间,这不仅取决于自由度的数量,还取决于所选空间离散化、系统矩阵的稀疏模式以及所采用的时间推进方案。
英文摘要:
Immersed boundary methods have attracted substantial interest in the last decades due to their potential for computations involving complex geometries. Often these cannot be efficiently discretized using boundary-fitted finite elements. Immersed boundary methods provide a simple and fully automatic discretization based on Cartesian grids and tailored quadrature schemes that account for the geometric model. It can thus be described independently of the grid, e.g., by image data obtained from computed tomography scans. The drawback of such a discretization lies in the potentially small overlap between certain elements in the grid and the geometry. These badly cut elements with small physical support pose a particular challenge for nonlinear and/or dynamic simulations. In this work, we focus on problems in structural dynamics and acoustics and concentrate on solving them with explicit time-marching schemes. In this context, badly cut elements can lead to unfeasibly small critical time step sizes. We investigate the performance of implicit-explicit time marching schemes and two stabilization methods developed in previous works as potential remedies. While these have been studied before with regard to their effectiveness in increasing the critical time step size, their numerical efficiency has only been considered in terms of accuracy per degree of freedom. In this paper, we evaluate the computation time required for a given accuracy, which depends not only on the number of degrees of freedom but also on the selected spatial discretization, the sparsity patterns of the system matrices, and the employed time-marching scheme.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。