Lagrange四边形单位分解有限元法的最优误差分析

用构造最优局部逼近空间的方法对Lagrange型四边形单位分解有限元法进行了最优误差分析.单位分解取Lagrange型四边形上的标准双线性基函数,构造了一个特殊的局部多项式逼近空间,给出了具有2阶再生性的Lagrange型四边形单位分解有限元插值格式,从而得到了高于局部逼近阶的最优插值误差.     

插值细分曲线有理参数点的精确求值

本文提出了求值插值细分曲线上任意有理参数的算法.通过构造与细分格式相关的矩阵,m进制分解给定有理数以及特征分解循环节对应算子乘积,计算得到控制顶点权值,实现对称型静态均匀插值细分曲线的求值.本文给出了四点细分和四点Ternary细分曲线的求值实例.算法可以推广到求值其他非多项式细分格式中.     

构造曲线的插值型细分法--非均匀四点法

本文提出了一种构造曲线的插值型细分法－非均匀四点法,四点法可作为这个方法的一个特例。用这种方法可以构造出Ｇ＾１连续的插值曲线,该法引入了一些偏移参数来控制细分过程,偏移参数参曲线形状的影响是局部的。     

一类融合逼近和插值的曲线细分

采用生成多项式为主的方法对一类融合逼近和插值三重细分格式的支撑区间、多项式生成、连续性、多项式再生及分形性质进行了分析,给出并证明了极限曲线C^k连续的充分条件.通过对融合型细分规则中参数变量的适当选择来实现对极限曲线的形状调整,从而衍生出具有良好性质的新格式,并将这类新格式与现有格式进行比较.数值实例表明这类新格式生成的极限曲线具有较好的保形性.     

具有多项式衰减面具的向量细分格式

具有多项式衰减面具的向量细分方程在刻画小波Riesz基和双正交小波等方面有着重要作用.本文主要研究这类方程解的性质.向量的细分方程具有形式：Ф=∑α∈Zsa（α）（2·-α）,其中Ф=（Ф1,...,Фr）T是定义在Rs上的向量函数,a：=（a（α））α∈Zs是一个具有多项式衰减的r×r矩阵序列称为面具.关于面具a定义一个作用在（Lp（Rs））r上的线性算子Qa,Qaf：=∑α∈Zsa（α）f（2·α）.迭代格式（Qanf）n=1,2,...称为向量细分格式或向量细分算法.本文证明如果具有多项式衰减面具的向量细分格式在（L2（Rs））r中收敛,那么其收敛的极限函数将自动具有多项式衰减.另外,给出了当迭代的初始函数满足一定的条件时的向量细分格式的收敛阶.     

几何造型的有理矩阵细分方法

Ｍｉｃｃｈｅｌｌｉ,Ｐｒａｕｔｚｓｃｈ给出了一类生成曲线的细分法－矩阵细分方程,但该方法仅能生成多项式类型的曲线,为了弥补其不足,本文提出了有理矩阵细分方法,并证明了其生成曲线的优良性质,例如凸包性,几何不变性,变差缩减性等。     

一种2型三角剖分上多元样条拟插值的精度提高策略

给定一个多元拟插值算子, 若其具有单位分解性质 (再生0次多项式), 我们提出一种利用其周围节点提高多项式再生性的方法. 所得算子不仅具有更高的逼近精度, 还不需要目标函数的任何导数信息. 然后利用此方法, 我们改进了2型三角剖分上的多元样条拟插值,使之具有更高的精度. 最后, 我们应用改进的拟插值算子数值求解时间发展偏微分方程. 数值实验验证了该方法的有效性.     

双参数六点细分法

提出了一类包含两个形状参数的双参数六点细分法,可以构造光滑插值曲线和光滑逼近曲线,并且可以通过对两个参数取值的调整使得曲线达到一致收敛,C1或C2.讨论了形状参数对细分法的收敛性及连续性的影响,给出了细分法一致收敛、C1连续、C2连续的充分条件,并给出了一些数值算例.     

多元多项式样条在Lp(Rd)尺度下的极值性质

构造了一类连续的多项式样条算子来代替常用的多元Cardinal多项式样条插值算子作为R^d上多元函数的逼近工具, 得到了这种样条算子的逼近误差, 由此结果, 得到多元多项式样条空间是一些R^d上的Sobolev光滑函数类在Lp范数下的Kolmogorov 宽度及线性宽度的弱渐近极子空间.     

切触有理插值新方法

针对传统连分式插值,计算复杂度高,计算过程中分母为零的不可预知性及插值函数不满足某些给定条件,应用不方便等问题,利用已知节点、函数值、导数值,构造两个多项式,分别作为有理插值函数的分子和分母,得出各阶导数条件下切触有理插值的新公式,并给出特殊情形的表达式.若添加适当的参数,可任意降低插值函数次数.该方法计算简洁,应用方便,插值函数的分母在节点处不为零且满足全部插值条件.数值例子验证了新方法的可行性、有效性和实用性.     

Noninterpolatory Hermite subdivision schemes

Bivariate interpolatory Hermite subdivision schemes have recently been applied to build free-form subdivision surfaces. It is well known to geometric modelling practitioners that interpolatory schemes typically lead to ``unfair" surfaces--surfaces with unwanted wiggles or undulations--and noninterpolatory (a.k.a. approximating in the CAGD community) schemes are much preferred in geometric modelling applications. In this article, we introduce, analyze and construct noninterpolatory Hermite subdivision schemes, a class of vector subdivision schemes which can be applied to iteratively refine Hermite data in a not necessarily interpolatory fashion. We also study symmetry properties of such subdivision schemes which are crucial for application in free-form subdivision surfaces.

A key step in our mathematical analysis of Hermite type subdivision schemes is that we make use of the strong convergence theory of refinement equations to convert a prescribed geometric condition on the subdivision scheme--namely, the subdivision scheme is of Hermite type--to an algebraic condition on the subdivision mask. The latter algebraic condition can then be used in a computational framework to construct specific schemes.

     

Stationary binary subdivision schemes using radial basis function interpolation

A new family of interpolatory stationary subdivision schemes is introduced by using radial basis function interpolation. This work extends earlier studies on interpolatory stationary subdivision schemes in two aspects. First, it provides a wider class of interpolatory schemes; each 2L-point interpolatory scheme has the freedom of choosing a degree (say, m) of polynomial reproducing. Depending on the combination (2L,m), the proposed scheme suggests different subdivision rules. Second, the scheme turns out to be a 2L-point interpolatory scheme with a tension parameter. The conditions for convergence and smoothness are also studied. Dedicated to Prof. Charles A. Micchelli on the occasion of his 60th birthday Mathematics subject classifications (2000) 41A05, 41A25, 41A30, 65D10, 65D17. Byung-Gook Lee: This work was done as a part of Information & Communication fundamental Technology Research Program supported by Ministry of the Information & Communication in Republic of Korea. Jungho Yoon: Corresponding author. Supported by the Korea Science and Engineering Foundation grant (KOSEF R06-2002-012-01001).     

基于一种新的集合插值的非凸紧集的细分概型

对A rtstein给出的度量平均的定义作了改进,给出一种新的集合插值,并基于这种新的集合插值,对相应的关于一般紧集的样条细分和插值细分分别作了研究,并给出了细分的收敛性性质.与此同时,将这种新的集合插值与基于度量平均的插值及基于M inkow sk i平均的插值分别作了比较,可以看出新的集合插值在某些方面具有更好的物理性质.     

Analysis of stationary subdivision schemes for curve design based on radial basis function interpolation

This paper provides a large family of interpolatory stationary subdivision schemes based on radial basis functions (RBFs) which are positive definite or conditionally positive definite. A radial basis function considered in this study has a tension parameter λ>0 such that it provides design flexibility. We prove that for a sufficiently large , the proposed 2L-point (L∈N) scheme has the same smoothness as the well-known 2L-point Deslauriers-Dubuc scheme, which is based on 2L-1 degree polynomial interpolation. Some numerical examples are presented to illustrate the performance of the new schemes, adapting subdivision rules on bounded intervals in a way of keeping the same smoothness and accuracy of the pre-existing schemes on R. We observe that, with proper tension parameters, the new scheme can alleviate undesirable artifacts near boundaries, which usually appear to interpolatory schemes with irregularly distributed control points.     

Analysis of subdivision schemes for nets of functions by proximity and controllability

In this paper we develop tools for the analysis of net subdivision schemes, schemes which recursively refine nets of bivariate continuous functions defined on grids of lines, and generate denser and denser nets. Sufficient conditions for the convergence of such a sequence of refined nets, and for the smoothness of the limit function, are derived in terms of proximity to a bivariate linear subdivision scheme refining points, under conditions controlling some aspects of the univariate functions of the generated nets. Approximation orders of net subdivision schemes, which are in proximity with positive schemes refining points are also derived. The paper concludes with the construction of a family of blending spline-type net subdivision schemes, and with their analysis by the tools presented in the paper. This family is a new example of net subdivision schemes generating C¹ limits with approximation order 2.     

From approximating to interpolatory non-stationary subdivision schemes with the same generation properties

In this paper we describe a general, computationally feasible strategy to deduce a family of interpolatory non-stationary subdivision schemes from a symmetric non-stationary, non-interpolatory one satisfying quite mild assumptions. To achieve this result we extend our previous work (Conti et al., Linear Algebra Appl 431(10):1971?C1987, 2009) to full generality by removing additional assumptions on the input symbols. For the so obtained interpolatory schemes we prove that they are capable of reproducing the same space of exponential polynomials as the one generated by the original approximating scheme. Moreover, we specialize the computational methods for the case of symbols obtained by shifted non-stationary affine combinations of exponential B-splines, that are at the basis of most non-stationary subdivision schemes. In this case we find that the associated family of interpolatory symbols can be determined to satisfy a suitable set of generalized interpolating conditions at the set of the zeros (with reversed signs) of the input symbol. Finally, we discuss some computational examples by showing that the proposed approach can yield novel smooth non-stationary interpolatory subdivision schemes possessing very interesting reproduction properties.     

A constructive algebraic strategy for interpolatory subdivision schemes induced by bivariate box splines

This paper describes an algebraic construction of bivariate interpolatory subdivision masks induced by three-directional box spline subdivision schemes. Specifically, given a three-directional box spline, we address the problem of defining a corresponding interpolatory subdivision scheme by constructing an appropriate correction mask to convolve with the three-directional box spline mask. The proposed approach is based on the analysis of certain polynomial identities in two variables and leads to interesting new interpolatory bivariate subdivision schemes.     

A Unified Ternary Curve Subdivision Scheme

A unified $m\,(m>2)$-point ternary scheme with some parameter is proposed. The continuity of subdivision scheme is analyzed based on the relationship between the subdivision scheme and difference scheme. Moreover, the proposed subdivision is extended to asymmetric multi-parameter subdivision and the asymmetric schemes in four cases are presented in detail. Some examples are given to show that the presented scheme has better approximating effect.     

Bivariate interpolation based on univariate subdivision schemes

The paper presents a bivariate subdivision scheme interpolating data consisting of univariate functions along equidistant parallel lines by repeated refinements. This method can be applied to the construction of a surface passing through a given set of parametric curves. Following the methodology of polysplines and tension surfaces, we define a local interpolator of four consecutive univariate functions, from which we sample a univariate function at the mid-point. This refinement step is the basis to an extension of the 4-point subdivision scheme to our setting. The bivariate subdivision scheme can be reduced to a countable number of univariate, interpolatory, non-stationary subdivision schemes. Properties of the generated interpolant are derived, such as continuity, smoothness and approximation order.     

Scalar and Hermite subdivision schemes

A criterion of convergence for stationary nonuniform subdivision schemes is provided. For periodic subdivision schemes, this criterion is optimal and can be applied to Hermite subdivision schemes which are not necessarily interpolatory. For the Merrien family of Hermite subdivision schemes which involve two parameters, we are able to describe explicitly the values of the parameters for which the Hermite subdivision scheme is convergent.