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

Sobolev空间中的最优 stencil

Optimal Stencils in Sobolev Spaces

Univ. Gießen(吉森大学);Univ. Göttingen(哥廷根大学)

Oleg Davydov, Robert Schaback

AI总结:

本文证明了在Sobolev空间W_2^m(R^d)中,用线性组合函数值近似点wise导数的收敛率不超过m-s-d/2,且通过可扩展的近似方法证明该速率最优。

摘要:

本文证明了在Sobolev空间W_2^m(R^d)中,用线性组合函数值近似点wise导数的收敛率不超过m-s-d/2,无论使用多少节点及如何放置。这些收敛速率通过可扩展的近似方法实现,该方法在多项式阶至少为floor(m-d/2)+1时精确。证明对于给定的m,s和d,这些速率是最佳的。对于固定的节点集X⊂R^d,任何Sobolev空间W_2^m(Ω)中的收敛速率不能优于q-s,其中q是基于X的近似方法的最大多项式精确阶。特别地,通过多项式谐波核构造的可扩展stencil方法实现了最优收敛速率,并通过其在Beppo-Levi空间中的误差计算来获得Sobolev空间中的近似误差。这允许在无网格方法中稳定高效地构造近最优stencil,用于求解偏微分方程的广义有限差分(RBF-FD)方法。文中包含数值示例以作说明。

英文摘要:

This paper proves that the approximation of pointwise derivatives of order $s$ of functions in Sobolev space $W_2^m(\R^d)$ by linear combinations of function values cannot have a convergence rate better than $m-s-d/2$, no matter how many nodes are used for approximation and where they are placed. These convergence rates are attained by {\em scalable} approximations that are exact on polynomials of order at least $\lfloor m-d/2\rfloor +1$, proving that the rates are optimal for given $m,\,s,$ and $d$. And, for a fixed node set $X\subset\R^d$, the convergence rate in any Sobolev space $W_2^m(Ω)$ cannot be better than $q-s$ where $q$ is the maximal possible order of polynomial exactness of approximations based on $X$, no matter how large $m$ is. In particular,scalable stencil constructions via polyharmonic kernels are shown to realize the optimal convergence rates, and good approximations of their error in Sobolev space can be calculated via their error in Beppo-Levi spaces. This allows to construct near-optimal stencils in Sobolev spaces stably and efficiently, for use in meshless methods to solve partial differential equations via generalized finite differences (RBF-FD). Numerical examples are included for illustration.

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

↑