三角域上C~1插值的两种表示

在有限元计算中,散乱数据插值以及曲面设计和表示等问题常常需要构造三角域上C~1连续的分片插值多项式.Zenisek证明了闭三角域上整体具有m阶光滑的双变量插值多项式至少是4m+1次的.在实际问题中最常用到的是三角域上C~1连续五次双变量插值多项式的表示.     

三角域上C~1插值的两种表示

在有限元计算中,散乱数据插值以及曲面设计和表示等问题常常需要构造三角域上C~1连续的分片插值多项式.Zenisek证明了闭三角域上整体具有m阶光滑的双变量插值多项式至少是4m+1次的.在实际问题中最常用到的是三角域上C~1连续五次双变量插值多项式的表示.     

任意三角域上的C~1多项式插值逼近

三角域上的光滑插值曲面是汽车制造、航空、造船等工业部门在外形设计中经常遇到的不可缺少的曲面片,也是散乱数据曲面拟合的重要方法.本文找到局部坐标系下三角域上的 C~1多项式插值逼近,并作出逼近误差估计,给出代数精度集.     

带形状参数的二次三角多项式曲线

<正>0引言B样条曲线特别是二、三次样条曲线~([1]),因其构造简单使用灵活,广泛应用到工程技术上,在CAGD和CG中占有重要的地位.但其有一定的缺点,如不能表示圆锥曲线等.非均匀有理样条虽然可以表示圆锥曲线,但有求导求积过于复杂,权因子选取不清楚等缺点~([2-4]).三角样条和三角多项式在理论和实际应用中都具有重要意义。文献[4]给出了三角样条,文献[5]构造了C~3连续三角多项式样条曲线.文献[6]构造了均匀三角多项式B样条     

凸四边形上一类具有C~2-连续的插值问题的样条解及其应用

本文讨论了一类凸四边形上的插值问题.指出这类插值问题是可解的,其解是分片二元三次多项式,且在凸四边形上是C~2-连续的.我们证明了这类插值问题的解的存在性和唯一性,给出了解样条的分片表达式及其逼近度的估计.最后还给出了一个应用实例和图形显示来说明本方法是可行的.     

基于几何连续的AT-β-Spline曲线曲面的构造

为了更好地修改给定的样条曲线曲面,构造了满足几何连续的带两类形状参数的代数三角多项式样条曲线曲面,简称为AT-β-Spline.这种代数三角曲线曲面不仅具有普通三角多项式的性质,而且具有全局的和局部的形状可调性.同时还具备较为灵活的连续性.当两类形状参数在给定的范围内任意取值时,这种带两类形状参数的AT-β-Spline曲线满足一阶几何连续性;如果给定两段相邻曲线段中的两类形状参数满足-1≤α≤1,μ_i=λ_(i+1)或μ_i=λ_i=μ_(i+1)=λ_(i+1)时,则带两类形状参数的AT-β-Spline曲线满足C~1∩G~2连续.另外利用奇异混合的思想,构造了满足C~1∩G~2插值AT-β-Spline曲线,解决曲线反求的几何连续性等问题.同时还给出了旋转面的构造,描述了两类形状参数对旋转面的几何外形的影响;当形状参数取特殊值时,这种AT-β-Spline曲线曲面可以精确地表示圆锥曲线曲面.从实验的结果来看,本文构造的AT-β-Spline曲线曲面是实用的有效的.     

一类四次有理插值样条的点控制

构造了一种有理四次插值样条,其分子为四次多项式分母为二次多项式.该有理插值样条是有界的、保单调且C~2连续的,仅带有一个调节参数δ_i.研究了有理四次插值样条的性质,同时给出了相应的函数值控制、导数值控制方法,这种方法的优点在于能够根据实际设计需要简单地选取适宜的参数,达到对曲线的形状进行局部调控的目的.     

二元Lagrange三角插值多项式在Orlicz空间内的逼近

研究了二元函数用一种组合型的三角插值多项式算子逼近的问题.借助连续模这一工具,给出了这类三角插值多项式在Orlicz空间内的逼近定理.     

基于第二类Chebyshev多项式零点的Pal-型插值多项式的逼近

设{x_k}_(k-0)~n是n 1次多项式U_n(x)=(1-x~2)U_n(x)的零点,其中U_n(x)是第二类Chebyshev多项式。设是的零点。根据Pal的插值理论,对函数f∈C~1[-1,1],存在唯一的2n 1次多项式满足条件: 本文研究用Pal型插值多项式对函数f∈C~r[-1,1](r≥1)和它的导函数的逼近。     

三角域上一类正交函数系的构造

V系统是作者2005年构造的一类L2[0,1]空间上的正交完备函数系. κ次V系统由κ次分片多项式组成,具有多分辨特性,是Haar小波函数的推广.基于V系统的正交表达,可以对CAGD中常见的几何模型用有限项V-级数做到精确重构,完全消除Gibbs现象,这是有限项Fourier级数或连续小波级数不能做到的.针对多变量情形,给出了三角域上的κ次正交V系统的构造方法.三角域上的V系统的重要应用显现在对3D复杂几何图组的整体频谱分析上.     

On a Hermite interpolation on the sphere

The purpose of this paper is to put forward a kind of Hermite interpolation scheme on the unit sphere. We prove the superposition interpolation process for Hermite interpolation on the sphere and give some examples of interpolation schemes. The numerical examples shows that this method for Hermite interpolation on the sphere is feasible. And this paper can be regarded as an extension and a development of Lagrange interpolation on the sphere since it includes Lagrange interpolation as a particular case.     

The Lyndon property and uniform interpolation over the Grzegorczyk logic

We consider versions of the interpolation property stronger than the Craig interpolation property and prove the Lyndon interpolation property for the Grzegorczyk logic and some of its extensions. We also establish the Lyndon interpolation property for most extensions of the intuitionistic logic with Craig interpolation property. For all modal logics over the Grzegorczyk logic as well as for all superintuitionistic logics, the uniform interpolation property is equivalent to Craig’s property.     

The proper interpolation space for multivariate Birkhoff interpolation

Multivariate Birkhoff interpolation problem has many important applications, such as in finite element method. In this paper two algorithms are given to compute the basis of the minimal interpolation space and the lower interpolation space respectively for an arbitrary given node set and the corresponding interpolation conditions on each node. We can get the monomial basis, Newton-type basis as well as Lagrange-type basis. The interpolation polynomial can be derived from the basis directly.     

Block Based Bivariate Blending Rational Interpolation via Symmetric Branched Continued Fractions

This paper constructs a new kind of block based bivariate blending rational interpolation via symmetric branched continued fractions. The construction process may be outlined as follows. The first step is to divide the original set of support points into some subsets (blocks). Then construct each block by using symmetric branched continued fraction. Finally assemble these blocks by Newton’s method to shape the whole interpolation scheme. Our new method offers many flexible bivariate blending rational interpolation schemes which include the classical bivariate Newton’s polynomial interpolation and symmetric branched continued fraction interpolation as its special cases. The block based bivariate blending rational interpolation is in fact a kind of tradeoff between the purely linear interpolation and the purely nonlinear interpolation. Finally, numerical examples are given to show the effectiveness of the proposed method.     

Block based Newton-like blending osculatory rational interpolation

With Newton’s interpolating formula, we construct a kind of block based Newton-like blending osculatory interpolation.The interpolation provides us many flexible interpolation schemes for choices which include the expansive Newton’s polynomial interpolation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of the interpolation.     

一种广义插值法

本文考虑一种广义插值问题，插值条件为小区间上的积分值，以弥补现有的插值方法在L2空间不再适用的不足，除了多项式插值外，还讨论了两种一次样条插值方法。     

Remarks on a unified theory for classical and generalized interpolation and extrapolation

A unified theory for generalized interpolation, as developed by Mühlbach, and classical polynomial interpolation is discussed. A fundamental theorem for generalized linear iterative interpolation is given and used to derive generalizations of the classical formulae due to Neville, Aitken and Lagrange. Using Mühlbach's definition of generalized divided differences, Newton's generalized interpolation formula, including an expression for the error term, is derived as a pure identity.     

Eigenvalues and Entropy Moduli of Operators in Interpolation Spaces

The paper approaches in an abstract way the spectral theory of operators in abstract interpolation spaces. We introduce entropy numbers and spectral moduli of operators, and prove a relationship between them and eigenvalues of operators. We also investigate interpolation variants of the moduli, and offer a contribution to the theory of eigenvalues of operators. Specifically, we prove an interpolation version of the celebrated Carl–Triebel eigenvalue inequality. Based on these results we are able to prove interpolation estimates for single eigenvalues as well as for geometric means of absolute values of the first n eigenvalues of operators. In particular, some of these estimates may be regarded as generalizations of the classical spectral radius formula. We give applications of our results to the study of interpolation estimates of entropy numbers as well as of the essential spectral radius of operators in interpolation spaces.     

Interpolation theory of anisotropic finite elements and applications

Interpolation theory is the foundation of finite element methods.In this paper,after reviewing some existed interpolation theorems of anisotropic finite element methods,we present a new way to analyse the interpolation error of anisotropic elements based on Newton's formula of polynomial interpolation as well as its applications.     

A Newton type rational interpolation formula

We give a Newton type rational interpolation formula (Theorem 2.2). It contains as a special case the original Newton interpolation, as well as the interpolation formula of Liu, which allows to recover many important classical q-series identities. We show in particular that some bibasic identities are a consequence of our formula.