紧支撑样条小波插值及其应用

基于紧支撑样条小波函数插值与定积分的思想,给出了由紧支撑样条小波插值函数构造数值积分公式的方法．并将该方法应用于二次、三次、四次和五次紧支撑样条小波函数,得到了相应的数值积分公式．最后,通过数值例子验证,发现该方法得到的数值积分公式是准确的,且具有较高精度．     

用叠二次样条插值逼近导函数

在第一种边界条件下,我们证明了二重、三重、四重叠二次样条插值以h_2的精度分别逼近光滑函数的一阶、二阶、三阶导数,并说明对适当提出的边界条件.叠二次样条插值可以在h_2的精度范围内逼近光滑函数的其它阶导数.     

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

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

一种新的光滑支持向量机的构造及其应用

光滑支持向量机模型是一个无约束、可微的最优化模型,人们可应用快速的最优化方法求解,从而降低计算复杂性.在前人工作的基础上研究基于样条函数的光滑支持向量机,采用广义三弯矩方法构造出六次样条光滑函数,分析了其性能及与正号函数的逼近精度,实现了求解六次样条光滑支持向量机的算法,与其它光滑支持向量机进行了比较,取得了较好的结果.最后将其应用于心脏病模型诊断,实验结果显示具有较高的精确度.     

绝对值函数的一致光滑逼近函数

绝对值函数是一个非光滑函数,研究了绝对值函数的光滑逼近函数.给出了绝对值函数的上方一致光滑逼近函数和下方一致光滑逼近函数,分别研究了其性质,并通过图像展示了逼近效果.     

连续型经验过程及其Bootstrap逼近

本文利用样条函数将经验分布函数光滑化,从而得到了连续型经验分布函数,进而引进了连续型经验过程,本文讨论了连续型经验分布函数和连续型经验过程的渐进分布,并且证明了连续型经验过程的Bootstrap逼近成立。     

基于MRA的梅花状伸缩矩阵的二元箱小波紧框架

本文针对梅花状的伸缩矩阵，给出从任何紧支撑的箱样条函数构造紧支撑箱小波紧框架的具体算法，最后给出若干构造算例。     

对称性与局部支集样条函数构造

1引言令D为二维串连通区域,用不可约代数曲线对D进行剖分西,得胞腔。,i—l,…,N．D上n次广阶光滑的样条函数空间定义为S：（D,凸）一｛f6or（D）,f。一片;6尺｝在两相邻胞腔。和个上,SESZ（D,凸）满足其中l。为人与4的公共内网线,q。称为S在l。上的光滑余因子．进而分片多项式S6s：（,凸）,当且仅当在任一内网线上存在光滑余因子,且在任一内网点A处满足协调条件Zc／xx。一。其中求和对所有以A为一端点的内网线进行［”‘j．以上定义和基本结果是文1中给出的．这种方法称为光滑余因子协条法．此外在多元样条函数的研究…     

导函数的修正三次Hermit样条插值逼近

在本文中，我们建立了修正三次Ｈｅｒｍｉｔ样条插值函数，并且证明了修正三次Ｈｅｒ－ｍｉｔ样条函数能以ｈ４的精度逼近充分光滑函数的各阶导数。     

广义伪样条及切波框架

本文引进Ⅰ和Ⅱ型广义伪样条,这些样条具有紧支撑和非常好的正则性.首先,利用Fourier分析研究广义伪样条的正则性、稳定性、收敛性和线性独立性.其次,构建具有对称紧支撑的切波框架.具体来讲,利用Ⅱ型广义伪样条,本文构建一类具有显式分析形式的对称紧支撑切波框架,这在工程应用上很重要.对这些切波框架,本文证明它们对卡通类图像具有稀疏逼近性质.     

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.     

Multivariate Bernoulli splines and the periodic interpolation problem

Periodic spline interpolation in Euclidian spaceR d is studied using translates of multivariate Bernoulli splines introduced in [25]. The interpolating polynomial spline functions are characterized by a minimal norm property among all interpolants in a Hilbert space of Sobolev type. The results follow from a relation between multivariate Bernoulli splines and the reproducing kernel of this Hilbert space. They apply to scattered data interpolation as well as to interpolation on a uniform grid. For bivariate three-directional Bernoulli splines the approximation order of the interpolants on a refined uniform mesh is computed.     

Local Lagrange Interpolation with Bivariate Splines of Arbitrary Smoothness

We describe a method which can be used to interpolate function values at a set of scattered points in a planar domain using bivariate polynomial splines of any prescribed smoothness. The method starts with an arbitrary given triangulation of the data points, and involves refining some of the triangles with Clough-Tocher splits. The construction of the interpolating splines requires some additional function values at selected points in the domain, but no derivatives are needed at any point. Given n data points and a corresponding initial triangulation, the interpolating spline can be computed in just O(n) operations. The interpolation method is local and stable, and provides optimal order approximation of smooth functions.     

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．简介多元样条函数在多元逼近中发挥很大作用，已有数量相当多的综合报告和研究论文正式发表，就在1996年6月在法国召开的第三届国际曲线与曲面会议上便有不少多元样条方面的报告，不过总的感觉是仍然缺乏对噪声数据特别是散乱数据的有效光顺方法．李岳生、崔锦泰、关履泰、胡日章等讨论广义调配样条与张量积函数，并用希氏空间样条方法处理多元散乱数据样条插值与光顺，提出多元多项式自然样条，推广了相应一元的结果．我们知道，在样条光顺中有一个如何选择参数的问题，用广义交互确认方法（generalizedcross－validation，以下简称GC…     

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.     

Nonnegative surface fitting with Powell-Sabin splines

Algorithms are presented for fitting a nonnegative Powell-Sabin spline to a set of scattered data. Existing necessary and sufficient nonnegativity conditions for a quadratic polynomial on a triangle are used to compose a set of necessary and sufficient nonnegativity constraints for the PS-spline. The PS-spline is expressed as a linear combination of locally supported basis functions, of which the Bernstein-Bézier representation is considered to improve the efficiency. Numerical examples illustrate the profit of nonnegative surface fitting with Powell-Sabin splines.     

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.     

Bivariate spline functions and the approximation of linear functionals

The reproducing kernel for a Hilbert space of bivariate functions which have Taylor expansions is constructed. The concepts of optimal approximation of linear functionals in the sense of Sard and approximations resulting from bivariate spline functions are shown to be equivalent in these spaces. Bivariate splines that both smooth and interpolate are discussed.This research was supported by the Office of Naval Research under Grant NR 044-443.     

基于层次T网格的分片孔斯曲面重构

本文提出一种基于任意层次T网格的多项式(PHT)样条空间$S(3,3,1,1,T)$的一个新的曲面重构算法.该算法由分片插值于层次T网格上每个小矩形单元对应4个顶点的16个参数的孔斯曲面形式给出.对于一个给定的T网格和相应基点处的几何信息(函数值,两个一阶偏导数和混合导数值),可得到与$S(3,3,1,1,T)$的PHT样条曲面相同的结果,且曲面表达形式更简单,同时,在离散数据点的曲面拟合中,我们给出了自适应的曲面加细算法.数值算例显示,该自适应算法能够有效的拟合离散数据点.