离散多项式混合
Discrete Polynomial Blending
AI总结:
本文研究了离散多项式混合,通过结合布尔求和方法与伯恩斯坦基的对偶基,构建了新的离散混合算子,具有与伯恩斯坦-贝塞尔张量积曲面相似的几何性质和逼近速度。
摘要:
在本文中,我们研究了"离散多项式混合",这一术语用于定义曲线混合的某种离散化版本,其中通过从特定网格上的"张量积多项式空间之和"进行近似。我们的策略是结合布尔求和方法与与伯恩斯坦基相连的对偶基,以构建新的准插值算子用于离散混合。我们的混合元素具有与伯恩斯坦-贝塞尔张量积曲面相似的几何性质,并且逼近速度与张量积多项式近似中获得的速度相当。
英文摘要:
In this paper we study "discrete polynomial blending," a term used to define a certain discretized version of curve blending whereby one approximates from the "sum of tensor product polynomial spaces" over certain grids. Our strategy is to combine the theory of Boolean Sum methods with dual bases connected to the Bernstein basis to construct a new quasi-interpolant for discrete blending. Our blended element has geometric properties similar to that of the Bernstein-Bézier tensor product surface patch, and rates of approximation that are comparable with those obtained in tensor product polynomial approximation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。