arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1507.05038math.NAcs.NA
收藏

通过线性有限元离散化分层子域实现指数收敛

Exponential Convergence through Linear Finite Element Discretization of Stratified Subdomains

North Carolina State University(北卡罗来纳州立大学);Schlumberger Doll Research(斯伦贝谢多尔研究所)

Murthy N. Guddati, Vladimir Druskin, Ali Vaziri Astaneh

AI总结:

本文提出一种新的有限元离散方法,通过中点积分和非传统网格弯曲,在预选区域实现指数收敛,显著降低计算成本。

摘要:

受需要在大计算域中局部区域获取响应问题的启发,我们设计了一种新的有限元离散方法,该方法在预选点上实现指数收敛。该离散方法的两个关键特征是(a)使用中点积分来评估贡献矩阵,以及(b)将网格非传统地弯曲到复杂空间。该技术称为复长度有限元方法(CFEM),与Pade近似子相关,后者提供Dirichlet到Neumann映射的指数收敛性,从而在域内指定点上实现解的收敛。指数收敛性使得元素数量大幅减少。这结合了线性有限元的稀疏计算,显著降低了计算成本。本文提出了该方法的基本思想,并展示了其在涉及拉普拉斯、亥姆霍兹和弹性动力学方程的各种问题中的有效性。

英文摘要:

Motivated by problems where the response is needed at select localized regions in a large computational domain, we devise a novel finite element discretization that results in exponential convergence at pre-selected points. The two key features of the discretization are (a) use of midpoint integration to evaluate the contribution matrices, and (b) an unconventional bending of the mesh into complex space. Named complex-length finite element method (CFEM), the technique is linked to Pade approximants that provide exponential convergence of the Dirichlet-to-Neumann maps and thus the solution at specified points in the domain. Exponential convergence facilitates drastic reduction in the number of elements. This, combined with sparse computation associated with linear finite elements, results in significant reduction in the computational cost. The paper presents the basic ideas of the method as well as illustration of its effectiveness for a variety of problems involving Laplace, Helmholtz and elastodynamic equations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑