具有超收敛性的保证尺寸网格生成
Provably size-guaranteed mesh generation with superconvergence
AI总结:
本文研究了通过气泡放置法(BPM)生成的保证尺寸Delaunay三角形上超收敛的性质和应用,推导出一种网格条件,使得实际边长与期望长度h的差为O(h^{1+α})(α>0),并分析了线性和二次有限元在椭圆边界值问题上的超收敛估计,通过数值测试验证了理论结果。
摘要:
本文研究了通过气泡放置法(BPM)生成的保证尺寸Delaunay三角形上超收敛的性质和应用。首先,我们推导出一种网格条件,使得实际边长与期望长度h的差为O(h^{1+α})(α>0)。其次,基于上述网格条件,分析了线性和二次有限元在椭圆边界值问题上的超收敛估计。特别地,该网格条件适用于许多已知不同方程的超收敛估计。提供了数值测试以验证理论发现,并展示BPM基网格上的超收敛性质。
英文摘要:
The properties and applications of superconvergence on size-guaranteed Delaunay triangulation generated by bubble placement method (BPM), are studied in this paper. First, we derive a mesh condition that the difference between the actual side length and the desired length $h$ is as small as ${\cal O}(h^{1+α})$ $(α>0)$. Second, the superconvergence estimations are analyzed on linear and quadratic finite element for elliptic boundary value problem based on the above mesh condition. In particular, the mesh condition is suitable for many known superconvergence estimations of different equations. Numerical tests are provided to verify the theoretical findings and to exhibit the superconvergence property on BPM-based grids.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。