arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.07780math.NAcs.CGcs.NA
收藏

有理参数曲线约束下平面区域的谱无网格quadrature

Spectral mesh-free quadrature for planar regions bounded by rational parametric curves

David Gunderman, Kenneth Weiss, John A. Evans

摘要:

这项工作提出了光谱,无网格,格林定理为基础的数值积分计划,在平面区域的有理参数曲线的范围内集成功能。我们的算法分两步进行:(1)我们首先找到对应于格林定理的沿区域边界曲线的线积分的中间求积规则。(2)然后,我们使用高阶求积规则计算沿坐标轴,这是用来评估格林定理线积分的被积函数的数值反导数。我们提出了两种计算中间求积规则的方法。第一个是频谱精确的(它比任何代数阶收敛得更快),并且相对容易实现,但不能保证多项式的精确性。第二个保证多项式integends精确到一个预先指定的程度k与一个prior-known数量的正交点,并保留了第一个的收敛性能,但稍微复杂。积分方案的几何矩的计算,immersogeometric分析,保守的高阶网格之间的字段转移,和初始化的模拟与合理的几何应用。我们比较使用我们的方法产生的正交计划在文献中的其他方法,并表明,他们是更有效的正交点的数量和计算时间。

英文摘要:

This work presents spectral, mesh-free, Green's theorem-based numerical quadrature schemes for integrating functions over planar regions bounded by rational parametric curves. Our algorithm proceeds in two steps: (1) We first find intermediate quadrature rules for line integrals along the region's boundary curves corresponding to Green's theorem. (2) We then use a high-order quadrature rule to compute the numerical antiderivative of the integrand along a coordinate axis, which is used to evaluate the Green's theorem line integral. We present two methods to compute the intermediate quadrature rule. The first is spectrally accurate (it converges faster than any algebraic order with respect to number of quadrature points) and is relatively easy to implement, but has no guarantee of polynomial exactness. The second guarantees exactness for polynomial integrands up to a pre-specified degree k with an a priori-known number of quadrature points and retains the convergence properties of the first, but is slightly more complicated. The quadrature schemes have applications to computation of geometric moments, immersogeometric analysis, conservative field transfer between high-order meshes, and initialization of simulations with rational geometry. We compare the quadrature schemes produced using our method to other methods in the literature and show that they are much more efficient both in terms of number of quadrature points and computational time.

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

↑