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

多元标量细分格式的多项式再生

Polynomial Reproduction of Multivariate Scalar Subdivision Schemes

Maria Charina, Costanza Conti

AI总结:

研究具有膨胀矩阵mI的多元标量细分格式的多项式再生性质,给出计算再生精确度及确定参数化的简单代数条件。

摘要:

一个平稳细分格式生成次数不超过$k$的多项式的全空间当且仅当其掩模满足$k+1$阶和规则,或其符号满足$k+1$阶零条件。该性质通常称为细分格式的多项式再生性质。众所周知,该性质通常只是相关可细化函数具有$k+1$阶逼近阶的必要条件。本文研究具有膨胀矩阵$mI$($|m| \ge 2$)的多元标量细分格式的一种不同的多项式再生性质。具体而言,我们关注细分格式在极限中精确再生采样数据所来自的相同多项式的能。本文的动机来自Adi Levin的结果,该结果表明细分格式的$k$次再生性质足以保证$k+1$阶逼近阶。我们的主要结果给出了关于细分符号的简单代数条件,用于计算这种多项式再生的精确度以及确定相关的参数化。参数化决定了在每次细分迭代中新计算的值所附着的网格点,以确保更高次的多项式再生。我们通过几个例子说明了我们的结果。

英文摘要:

A stationary subdivision scheme generates the full space of polynomials of degree up to $k$ if and only if its mask satisfies sum rules of order $k+1$, or its symbol satisfies zero conditions of order $k+1$. This property is often called the polynomial reproduction property of the subdivision scheme. It is a well-known fact that this property is, in general, only necessary for the associated refinable function to have approximation order $k+1$. In this paper we study a different polynomial reproduction property of multivariate scalar subdivision scheme with dilation matrix $mI$, $|m| \ge 2$. Namely, we are interested in capability of a subdivision scheme to reproduce in the limit exactly the same polynomials from which the data is sampled. The motivation for this paper are the results by Adi Levin that state that such a reproduction property of degree $k$ of the subdivision scheme is sufficient for having approximation order $k+1$. Our main result yields simple algebraic conditions on the subdivision symbol for computing the exact degree of such polynomial reproduction and also for determining the associated parametrization. The parametrization determines the grid points to which the newly computed values are attached at each subdivision iteration to ensure the higher degree of polynomial reproduction. We illustrate our results with several examples.

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

↑