加密网格点二元局部基插值样条函数

1.简介 由于在理论以及应用两方面的重要性,多元样条引起了许多人的注意([6],[7]),紧支撑光滑分片多项式函数对于曲面的逼近是一个十分有效的工具。由于它们的局部支撑性,它们很容易求值;由于它们的光滑性,它们能被应用到要满足一定光滑条件的情况下;由于它们是紧支撑的,它们的线性包有很大的逼近灵活性,而且用它们构造逼近方法来解决的系统是     

Algorithm for Optimal Triangulations in Scattered Data Representation and Implementation

Scattered data collected at sample points may be used to determine simple functions to best fit the data. An ideal choice for these simple functions is bivariate splines. Triangulation of the sample points creates partitions over which the bivariate splines may be defined. But the optimality of the approximation is dependent on the choice of triangulation. An algorithm, referred to as an Edge Swapping Algorithm, has been developed to transform an arbitrary triangulation of the sample points into an optimal triangulation for representation of the scattered data. A Matlab package has been completed that implements this algorithm for any triangulation on a given set of sample points.     

关于具局部插值性质的样条

引言 插值样条作为逼近工具有许多优点,但也受到一些限制。例如大部分样条都只限于多项式样条。又如样条插值带有整体性,即一插值点上的任何变化将波及整个样条的所有各点。此外高阶样条的计算较复杂。 本文给出一种新的构造样条的方法,它将不限于多项式样条,并且主要是它具有局部插值性,即这种样条在一个子区间上的值只与其邻近的几个插值点有关。我们称这种样条为局部插值样条。 与通常的多项式样条相比,局部样条的计算比较简单,并且一个插值点上的数值变动只影响其邻近的局部范围。     

一类带参数的有理三次三角Hermite插值样条

给出一种带有参数的有理三次三角Hermite插值样条,具有标准三次Hermite插值样条相似的性质.利用参数的不同取值不但可以调控插值曲线的形状,而且比标准三次Hermite插值样条更好地逼近被插曲线.此外,选择合适的控制点,该种插值样条可以精确表示星形线和四叶玫瑰线等超越曲线.     

Scattered data interpolation using minimum energy Powell-Sabin elements and data dependent triangulations

A popular approach for obtaining surfaces interpolating to scattered data is to define the interpolant in a piecewise manner over a triangulation with vertices at the data points. In most cases, the interpolant cannot be uniquely determined from the prescribed function values since it belongs to a space of functions of dimension greater than the number of data points. Thus, additional parameters are needed to define an interpolant and have to be estimated somehow from the available data. It is intuitively clear that the quality of approximation by the interpolant depends on the choice of the triangulation and on the method used to provide the additional parameters. In this paper we suggest basing the selection of the triangulation and the computation of the additional parameters on the idea of minimizing a given cost functional measuring the quality of the interpolant. We present a scheme that iteratively updates the triangulation and computes values of the additional parameters so that the quality of the interpolant, as measured by the cost functional, improves from iteration to iteration. This method is discussed and tested numerically using an energy functional and Powell-Sabin twelve split interpolants.     

The bidimensional interproximation problem and mixed splines

Interproximation methods for surfaces can be used to construct a smooth surface interpolating some data points and passing through specified regions. In this paper we study the use of mixed splines, that is smoothing splines with additional interpolation constraints, to solve the interproximation problem for surfaces in the case of scattered data. The solution is obtained by solving a linear system whose structure can be improved by using “bell-shaped” thin plate splines.     

特殊形式的多元有理样条插值

有理样条插值问题最早是由R.Schaback提出的,由于R.Schaback考虑此问题时涉及到了非线性方程组的求解,因而实现起来比较复杂.后来,王仁宏等研究了几类特殊形式的插值有理样条函数,避开了求解非线性方程的困难.能否在多元情形下建立类似的结果?本文对此作出了肯定的回答,并就二元情形的三角剖分和四边形剖分建立了几类特殊形式的插值多元有理样条,构造性地证明了解的存在性和唯一性.     

Bivariate Polynomial Natural Spline Interpolation Algorithms with Local Basis for Scattered Data

Because of its importance in both theory and applications, multivariate splines have attracted special attention in many fields. Based on the theory of spline functions in Hilbert spaces, bivariate polynomial natural splines for interpolating, smoothing or generalized interpolating of scattered data over an arbitrary domain are constructed with one-sided functions. However, this method is not well suited for large scale numerical applications. In this paper, a new locally supported basis for the bivariate polynomial natural spline space is constructed. Some properties of this basis are also discussed. Methods to order scattered data are shown and algorithms for bivariate polynomial natural spline interpolating are constructed. The interpolating coefficient matrix is sparse, and thus, the algorithms can be easily implemented in a computer.     

Interpolation by splines satisfying mixed boundary conditions

We consider interpolation of Hermite data by splines of degreen withk given knots, satisfying boundary conditions which may involve derivatives at both end points (e.g., a periodicity condition). It is shown that, for a certain class of boundary conditions, a necessary and sufficient condition for the existence of a unique solution is that the data points and knots interlace properly and that there does not exist a polynomial solution of degreen?k. The method of proof is to show that any spline interpolating zero data vanishes identically, rather than the usual determinantal approach.     

A sinusoidal polynomial spline and its Bezier blended interpolant

Functional polynomials composed of sinusoidal functions are introduced as basis functions to construct an interpolatory spline. An interpolant constructed in this way does not require solving a system of linear equations as many approaches do. However there are vanishing tangent vectors at the interpolating points. By blending with a Bezier curve using the data points as the control points, the blended curve is a proper smooth interpolant. The blending factor has the effect similar to the “tension” control of tension splines. Piecewise interpolants can be constructed in an analogous way as a connection of Bezier curve segments to achieve C¹ continuity at the connecting points. Smooth interpolating surface patches can also be defined by blending sinusoidal polynomial tensor surfaces and Bezier tensor surfaces. The interpolant can very efficiently be evaluated by tabulating the sinusoidal function.     

Local recovery of a solenoidal vector field by an extension of the thin-plate spline technique

We show how one may interpolate a vector-valued function in two or three dimensions, whose value is (wholly or partly) known at a sufficient (but not large) number of points disposed in almost any configuration, under the condition that the interpolating function has zero divergence. The technique is based on the theory of thin-plate splines. One may use a similar scheme in the case where the data consist of flux integrals (or other linear functionals) of the unknown function.     

Interpolation of entire functions with infinitely many nodes

A method is described for the construction of an interpolating entire function for any countable set of interpolation nodes without condensation points in a finite domain, given the values of the function and its derivative at the interpolation nodes.Kiev University. Translated from Vychislitel'naya i Prikladnaya Matematika, No. 75, pp. 26–34, 1991.     

An interpolation method by bivariate cubic splines with <Emphasis Type="Italic">c</Emphasis><Superscript>2</Superscript>-join on type-II triangulars at a rectangular domain

In this paper, an interpolating method for bivariate cubic splines with C ²-join on type-II triangular at a rectangular domain is given, and the approximation degree, interpolating existence and uniqueness of the cubic splines are studied. Supported by NSFC General Projects(60473130).     

AN INTERPOLATION METHOD BY BIVARIATE CUBIC SPLINES WITH C~2 -JOIN ON TYPE-II TRIANGULARS AT A RECTANGULAR DOMAIN

In this paper, an interpolating method for bivariate cubic splines with C2-join on type-II triangular at a rectangular domain is given, and the approximation degree, inter-polating existence and uniqueness of the cubic splines are studied.     

On the variational characterization and convergence of bivariate splines

It is shown that bivariate interpolatory splines defined on a rectangleR can be characterized as being unique solutions to certain variational problems. This variational property is used to prove the uniform convergence of bivariate polynomial splines interpolating moderately smooth functions at data which includes interpolation to values on a rectangular grid. These results are then extended to bivariate splines defined on anL-shaped region.This research was supported by a University of Kansas General Research Grant.     

几种有理插值函数的逼近性质

1　引　　言在曲线和曲面设计中,样条插值是有用的和强有力的工具.不少作者已经研究了很多种类型的样条插值[1,2,3,4].近些年来,有理插值样条,特别是三次有理插值样条,以及它们在外型控制中的应用,已有了不少工作[5,6,7].有理插值样条的表达式中有某些参数,正是由于这些参数,有理插值样条在外型控制中充分显示了它的灵活性;但也正是由于这些参数,使它的逼近性质的研究增加了困难.因此,关于有理插值样条的逼近性质的研究很少见诸文献.本文在第二节首先叙述几种典型的有理插值样条,其中包括分母为一次、二次的三次有理插值样条和仅基于函数值…     

Operator norm and error bounds for interpolating quadratic splines on a non-uniform type-2 triangulation of a rectangular domain

The aim of this paper is to give upper bounds of the norm of the operator and associated error for a Lagrange interpolation problem by C¹ quadratic splines. The domain is rectangular and the type-2 triangulation is non-uniform. Moreover the location of data points allows a very simple computation of the interpolant.     

一类有理插值曲面模型及其可视化约束控制

本文构造一类新的基于函数值和偏导数值的双变量加权混合有理插值样条.与已有的有理插值样条相比,这类新的有理插值样条具有以下四方面的特性,其一,插值函数可以由简单的对称基函数来表示;其二,对任何正参数,插值函数满足C1连续,而且,在不限制参数取值的条件之下,插值曲面保持光滑;其三,插值函数不但含有参数,而且带有加权系数,增加了插值函数的自由度;其四,插值曲面的形状随着参数与加权系数的变化而变化.同时,本文讨论此类插值曲面的性质,包括基函数的性质、积分加权系数的性质和插值函数的边界性质.此类插值函数的优势在于,不改变给定插值数据的前提下,通过选择合适的参数和不同的加权系数,对插值区域内的任意点的函数值进行修改.因此可将其应用于曲面设计,根据实际设计需要,自由地修改曲面形状.数值实验表明,此类新的有理样条插值具有良好的约束控制性质.     

Interpolation Scheme for Planar Cubic <Emphasis Type="Italic">G</Emphasis><Superscript>2</Superscript> Spline Curves

In this paper a method for interpolating planar data points by cubic G ² splines is presented. A spline is composed of polynomial segments that interpolate two data points, tangent directions and curvatures at these points. Necessary and sufficient, purely geometric conditions for the existence of such a polynomial interpolant are derived. The obtained results are extended to the case when the derivative directions and curvatures are not prescribed as data, but are obtained by some local approximation or implied by shape requirements. As a result, the G ² spline is constructed entirely locally.     

二元三次样条空间S31,2(Δmn(2)) 的样条拟插值

本文首先利用由两组具有局部最小支集的样条所组成的基函数,构造非均匀2 型三角剖分上二元三次样条空间S₃^1,2(Δ_mn⁽²⁾)的若干样条拟插值算子. 这些变差缩减算子由样条函数B_ij¹支集上5 个网格点或中心和样条函数B_ij²支集上5 个网格点处函数值定义. 这些样条拟插值算子具有较好的逼近性,甚至算子V_mn（f） 能保持近最优的三次多项式性. 然后利用连续模,分析样条拟插值算子V_mn（f）一致逼近于充分光滑的实函数. 最后推导误差估计.