构造二元切触插值公式的方法

本文在文章[1]的基础上对切触插值问题给出了迭加插值法。它可容许某些不规则的插值条件,既可保证插值的存在与唯一性,又便于求得具体的插值公式。在本文最后还给出了古典的Lagrange插值法对二元切触插值的推广,它概括了Тополяньский和Ahlin的结果。     

参数保形插值中决定切矢的方法

由分段三次参数多项式曲线拼合成的Ｃ１插值曲线的形状与数据点处的切矢有很大关系．基于对保形插值曲线特点的分析，本文提出了估计数据点处切矢的一种方法：采用使构造的插值曲线的长度尽可能短的思想估计数据点处的切矢，并且通过四组有代表性的数据对本方法和已有的三种方法进行了比较．     

求解二维Poisson方程的重心有理插值配点法

首先介绍了重心Lagrange插值法,然后通过改变重心Lagrange插值法的插值权函数,重点给出了重心有理插值的具体形式.基于等距节点和Chebyshev节点这两类插值节点,利用重心有理插值配点法求解了二维Poisson方程,并比较了采用上述两种插值节点时的计算精度.数值算例表明,重心有理插值配点法具有稳定性好,计算精度高和程序编写简单的特点.     

具有承袭性的高阶导数有理插值算法

切触有理插值是函数逼近的一个重要内容,而降低切触有理插值的次数和解决切触有理插值函数的存在性是有理插值的一个重要问题.切触有理插值函数的算法大都是基于连分式进行的,其算法可行性是有条件的,且计算量较大.利用Newton(牛顿)多项式插值的承袭性和分段组合的方法,构造出了一种无极点且满足高阶导数插值条件的切触有理插值函数,并推广到向量值切触有理插值情形;既解决了切触有理插值函数存在性问题,又降低了切触有理插值函数的次数.最后给出误差估计,并通过数值实例说明该算法具有承袭性、计算量低、便于编程等特点.     

切触有理插值函数的新算法

切触有理插值函数的算法大都是基于连分式进行的,其算法的可行性大都是有条件的,且有理函数次数较高,计算量较大.文章利用拉格朗日插值的性质和分段组合的方法,给出了一种新的切触有理插值算法,并给出误差估计且将其推广到向量值切触有理插值情形.较之其他算法,具有有理函数次数较低、计算量较小、算法无条件性、无极点、满足高阶导数插值条件等优点.     

有理插值中不可达点的研究

通过对一元Thiele型连分式插值和二元Newton-Thiele型混合有理插值中不可达点的分析,给出了一种判断不可达点的方法.而且,对于任意给定的插值条件,通过构造带参数的Thiele型切触插值和二元Newton-Thiele型混合切触有理插值,使得不可达点变成可达点.数值例子也说明了这种方法的有效性.     

变参数四点法的理论及其应用

四点插值细分法（简称四点法）是一种离散插值方法，在曲线和曲面造型中有着广泛的应用．本文主要讨论当参数可变时，四点法的收敛性和连续性以及变参数四点法的应用．     

求解二维Poisson方程的重心插值配点法

采用重心Lagrange插值配点法计算了二维Poisson方程.采用重心Lagrange插值法构造近似函数,由配点法离散Poisson方程及其边界条件.数值算例表明方法具有理论简单、计算精度高的特点.     

用边界曲线构造C~1 Coons曲面确定扭矢的方法

本文讨论了由四条边界曲线构造Ｃ１Ｃｏｏｎｓ曲面的问题，给出了确定角点扭矢的新方法．该方法沿四边形两对角线方向构造两条四次多项式曲线，每个角点处的扭矢，由一条四次曲线和两条边界曲线确定．跨界切矢由三次埃尔米特插值方法定义．文中还给出了一个用新方法构造曲面的实例．     

用边界曲线构造C^1Coons曲面确定扭矢的方法

本文讨论了由四条边界曲线构造C^1Coons曲面的问题，给出了确定角点扭矢的新方法．该方法沿四边形两对角线方向构造两条四次多项式曲线，每个角点处的扭矢，由一条四次曲线和两条边界曲线确定．跨界切矢由三次埃尔米特插值方法定义．文中还给出了一个用新方法构造曲面的实例．     

Polynomial-based non-uniform interpolatory subdivision with features control

Starting from a well-known construction of polynomial-based interpolatory 4-point schemes, in this paper we present an original affine combination of quadratic polynomial samples that leads to a non-uniform 4-point scheme with edge parameters. This blending-type formulation is then further generalized to provide a powerful subdivision algorithm that combines the fairing curve of a non-uniform refinement with the advantages of a shape-controlled interpolation method and an arbitrary point insertion rule. The result is a non-uniform interpolatory 4-point scheme that is unique in combining a number of distinctive properties. In fact it generates visually-pleasing limit curves where special features ranging from cusps and flat edges to point/edge tension effects may be included without creating undesired undulations. Moreover such a scheme is capable of inserting new points at any positions of existing intervals, so that the most convenient parameter values may be chosen as well as the intervals for insertion.Such a fully flexible curve scheme is a fundamental step towards the construction of high-quality interpolatory subdivision surfaces with features control.     

A ternary 4-point approximating subdivision scheme

In the implementation of subdivision scheme, three of the most important issues are smoothness, size of support, and approximation order. Our objective is to introduce an improved ternary 4-point approximating subdivision scheme derived from cubic polynomial interpolation, which has smaller support and higher smoothness, comparing to binary 4-point and 6-point schemes, ternary 3-point and 4-point schemes (see Table 2). The method is easily generalized to ternary (2n + 2)-point approximating subdivision schemes. We choose a ternary scheme because a way to get smaller support is to raise arity. And we use polynomial reproduction to get higher approximation order easily.     

Shape controlled interpolatory ternary subdivision

Ternary subdivision schemes compare favorably with their binary analogues because they are able to generate limit functions with the same (or higher) smoothness but smaller support.In this work we consider the two issues of local tension control and conics reproduction in univariate interpolating ternary refinements. We show that both these features can be included in a unique interpolating 4-point subdivision method by means of non-stationary insertion rules that do not affect the improved smoothness and locality of ternary schemes. This is realized by exploiting local shape parameters associated with the initial polyline edges.     

Non-uniform interpolatory curve subdivision with edge parameters built upon compactly supported fundamental splines

In this paper we present a family of Non-Uniform Local Interpolatory (NULI) subdivision schemes, derived from compactly supported interpolatory fundamental splines with non-uniform knots (NULIFS). For this spline family, the knot-partition is defined by a sequence of break points and by one additional knot, arbitrarily placed along each knot-interval. The resulting refinement algorithms are linear and turn out to contain a set of edge parameters that, when fixed to a value in the range [0,1], allow us to achieve special shape features by simply moving each auxiliary knot between the break points. Among all the members of this new family of schemes, we will then especially analyze the NULI 4-point refinement. This subdivision scheme has all the fundamental features of the quadratic fundamental spline basis it is originated from, namely compact support, C ¹ smoothness, second order polynomials reproduction and approximation order 3. In addition the NULI 4-point subdivision algorithm has the possibility of setting consecutive edge parameters to simulate double and triple knots—that are not considered by the authors of the corresponding spline basis—thus allowing for limit curves with crease vertices, without using an ad hoc mask. Numerical examples and comparisons with other methods will be given to the aim of illustrating the performance of the NULI 4-point scheme in the case of highly non-uniform initial data.     

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.     

Subdivision Schemes of Sets and the Approximation of Set-Valued Functions in the Symmetric Difference Metric

In this work we construct subdivision schemes refining general subsets of ? ⁿ and study their applications to the approximation of set-valued functions. Differently from previous works on set-valued approximation, our methods are developed and analyzed in the metric space of Lebesgue measurable sets endowed with the symmetric difference metric. The construction of the set-valued subdivision schemes is based on a new weighted average of two sets, which is defined for positive weights (corresponding to interpolation) and also when one weight is negative (corresponding to extrapolation). Using the new average with positive weights, we adapt to sets spline subdivision schemes computed by the Lane–Riesenfeld algorithm, which requires only averages of pairs of numbers. The averages of numbers are then replaced by the new averages of pairs of sets. Among other features of the resulting set-valued subdivision schemes, we prove their monotonicity preservation property. Using the new weighted average of sets with both positive and negative weights, we adapt to sets the 4-point interpolatory subdivision scheme. Finally, we discuss the extension of the results obtained in metric spaces of sets, to general metric spaces endowed with an averaging operation satisfying certain properties.     

Modified form of binary and ternary 3-point subdivision schemes

Binary 3-point scheme, developed by Hormann and Sabin [Hormann, K. and Sabin, Malcolm A., 2008, A family of subdivision schemes with cubic precision, Computer Aided Geometric Design, 25, 41-52], has been modified by introducing a tension parameter which generates a family of C¹ limiting curves for certain range of tension parameter. Ternary 3-point scheme, introduced by Siddiqi and Rehan [Siddiqi, Shahid S. and Rehan, K., 2009, A ternary three point scheme for curve designing, International Journal of Computer Mathematics, In Press, DOI: 10.1080/00207160802428220], has also been modified by introducing a tension parameter which generates family of C¹ and C² limiting curves for certain range of tension parameter. Laurent polynomial method is used to investigate the continuity of the subdivision schemes. The performance of modified schemes has been demonstrated by considering different examples along with its comparison with the established subdivision schemes.     

Fractal range of a 3-point ternary interpolatory subdivision scheme with two parameters

In this paper, we analyze the fractal property of Hassan’s 3-point ternary interpolatory subdivision scheme with two parameters. The fractal range of the scheme is obtained and illustrated. Many examples show that the obtained results suggest a clear direction to generate fractal curves and surfaces by using this scheme.     

Subdivision Schemes for Positive Definite Matrices

The class of symmetric positive definite matrices is an important class both in theory and application. Although this class is well studied, little is known about how to efficiently interpolate such data within the class. We extend the 4-point interpolatory subdivision scheme, as a method of interpolation, to data consisting of symmetric positive definite matrices. This extension is based on an explicit formula for calculating a binary “geodetic average”. Our method generates a smooth curve of matrices, which retain many important properties of the interpolated matrices. Furthermore, the scheme is robust and easy to implement.     

一类新的(2n-1)点二重动态逼近细分

利用正弦函数构造了一类新的带有形状参数ω的(2n-1)点二重动态逼近细分格式.从理论上分析了随n值变化时这类细分格式的C~k连续性和支集长度;算法的一个特色是随着细分格式中参数ω的取值不同,相应生成的极限曲线的表现张力也有所不同,而且这一类算法所对应的静态算法涵盖了Chaikin,Hormann,Dyn,Daniel和Hassan的算法.文末附出大量数值实例,在给定相同的初始控制顶点,且极限曲线达到同一连续性的前提下和现有几种算法做了比较,数值实例表明这类算法生成的极限曲线更加饱满,表现力更强.