关于二元四次样条插值与逼近

文［１］中讨论了上的插值问题，其中的插值函数表达式用到被插值函数的二阶导数．本文进一步研究空间上的一类新的二元样条插值形式，其中仅用到插值函数的一阶导数．证明了该插值形式的唯一性与存在性，且不需要解高维的线性方程组．最后给出了逼近度问题．     

有理插值问题存在性的一个判别准则

１引言我们知道,多项式Ｌａｇｒａｎｇｅ插值是适定的［１,２］,但有理插值函数却未必存在［８,３］．并且到目前为止,也没有类似于多项式Ｌａｇｒａｎｇｅ插值的能够揭示插值结构的显式插值公式．不过有理插值已有许多算法,比如Ｓｔｏｅｒ算法,Ｔｈｉｅｌｅ倒差商算法,Ｓａｌｚｅｒ算法以及Ｗｕｙｔａｃｋ算法等等,见［８,４,５,６］．本文为寻求尽可能接近显式的插值公式,进而揭示有理插值问题的内在结构,得到了有理插值函数存在的一个充要条件,同时也给出了有理插值函数的一种表现形式,参见［１１］．本文约定,所有矩阵…     

非均匀分形插值函数的光滑性和Hlder指数

１．引言 这里我们研究一类分形插值函数（缩写为ＦＩＦ）,由给定的插值点和一组参数唯一确定,从这一点来看,分形插值函数类似于样条插值［１－２］和多项式插值。分形插值函数理论［３－４］为实验数据的拟合提供了一种新的方法。用它来逼近自然发生的函数十分理想,这种自然发生的函数在一定意义下具有某种几何上的自相似性。分形插值函数在逼近理论和计算机图形学中都具有十分重要的意义。 分形插值函数连续,一般不可微。因而用古老的分析工具来研究分形插值函数十分困难。目前分形插值函数的研究已取得了很大的进展,一些结果已被用…     

球面上径向基函数最小范数插值逼近的误差估计

研究了球面径向基插值对球面函数的逼近问题,给出了一致逼近的上界估计式．文中结果说明,球面径向基插值的逼近阶会随函数光滑性的提高而增加．     

一种保形C~1三次样条插值方法

本文得到了构造一个保形Ｃ１三次插值样条函数的充要条件，并给出了一种构造保形Ｃ１三次插值样条函数的方法．     

基于曲率插值的大变形梁单元

线性梁单元的形函数在单元大转动时会引起虚假应变,不适用于几何非线性分析．传统的几何非线性梁单元由于位移插值和转角插值的相干性,常常引起剪切闭锁等问题．该文 提出了一种平面大变形梁单元,通过单元域内的曲率插值以及曲率与节点位移之间的函数关系,将单元节点力和节点位移表示为节点曲率的函数．由于曲率插值本质上是对梁的应变进行插值,保证了单元任意刚体运动不会产生虚假的节点力;且将梁的截面形心位移表示为曲率的函数,避免了传统单元中的剪切闭锁问题．因而所提方法特别适用于梁的几何非线性分析．数值算例说明了所提方法的正确性和有效性.     

含弥散平面两相渗流驱动问题有限元方法的误差分析

研究了平面两相渗流可压缩问题含弥散情形的矩形有限元格式．引进一类插值算子,通过插值函数证明了有限元解的最优误差估计．     

一个双周期整（0，△^mh）插值问题

本研究等距结点上双周期整(0,△^mh)插值问题．得到它在B^2o中有唯一解的充要条件．给出了这种插值函数的精确表达式,同时也考虑了该插值算子的收敛性．     

L2(Rs)中插值小波包的分裂技巧和精细分解

对具有任意伸缩矩阵A的插值加细函数，给出对应于L^2(R^s)中的小波包的一个构造方法．采样空间被直接分解来取代对加细函数的符号分解．按照这个方法构造的插值小波包能对基插值空间提供较为精细的分解，因而对自适应的插值给出较好的局部化．     

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

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

On polynomial interpolation of two variables

Polynomial interpolation of two variables based on points that are located on multiple circles is studied. First, the poisedness of a Birkhoff interpolation on points that are located on several concentric circles is established. Second, using a factorization method, the poisedness of a Hermite interpolation based on points located on various circles, not necessarily concentric, is established. Even in the case of Lagrange interpolation, this gives many new sets of poised interpolation points.     

对称型插值框架的注记

通过引进新的参数,将对称型插值的一般框架作进一步推广和改进,新的插值框架包含更为丰富的插值格式;给出几种新形式的对称型有理插值格式;最后,将结果推广到向量值及矩阵值情形.     

Description of the interpolation spaces for a pair of local Morrey-type spaces and their generalizations

The real interpolation method is considered and it is proved that for general local Morrey-type spaces, in the case in which they have the same integrability parameter, the interpolation spaces are again general local Morrey-type spaces with appropriately chosen parameters. This result is a particular case of the interpolation theorem for much more general spaces defined with the help of an operator acting from some function space to the cone of nonnegative nondecreasing functions on (0, ∞). It is also shown how the classical interpolation theorems due to Stein-Weiss, Peetre, Calderón, Gilbert, Lizorkin, Freitag and some of their new variants can be derived from this theorem.     

Semi-cardinal interpolation and difference equations: From cubic B-splines to a three-direction box-spline construction

This paper considers the problem of interpolation on a semi-plane grid from a space of box-splines on the three-direction mesh. Building on a new treatment of univariate semi-cardinal interpolation for natural cubic splines, the solution is obtained as a Lagrange series with suitable localization and polynomial reproduction properties. It is proved that the extension of the natural boundary conditions to box-spline semi-cardinal interpolation attains half of the approximation order of the cardinal case.     

An efficient algorithm for periodic Hermite spline interpolation with shifted nodes

Generalized Hermite spline interpolation with periodic splines of defect 2 on an equidistant lattice is considered. Then the classic periodic Hermite spline interpolation with shifted interpolation nodes is obtained as a special case.By means of a new generalization of Euler-Frobenius polynomials the symbol of the considered interpolation problem is defined. Using this symbol, a simple representation of the fundamental splines can be given. Furthermore, an efficient algorithm for the computation of the Hermite spline interpolant is obtained, which is mainly based on the fast Fourier transform.     

Inherited Fuzzy Interpolation Based on the Inherited Lower-upper Factorization

In this paper, a new scheme is proposed to find the fuzzy interpolation polynomial. In this case, the nodes are crisp data and the values are fuzzy numbers. In order to obtain the interpolation polynomial, a linear system is solved with crisp coefficients matrix and fuzzy right hand side. Then, the inherited lower-upper (LU) triangular factorization and inherited interpolation are applied to solve this system. The examples illustrate the applicability, simplicity and efficiency of the proposed method.     

Second Order Convergence of the Interpolation Based on $Q^c_1$-Element

In this paper, the second order convergence of the interpolation based on $Q^c_1$-element is derived in the case of $d$=1, 2 and 3. Using the integral average on each element, the new basis functions of tensor product type is builded up and we can easily extend it to the higher dimensional case. Finally, some numerical tests are made to show the analytical results of the interpolation errors.     

On the Parameter Identification Problem in the Plane and the Polar Fractal Interpolation Functions

Fractal interpolation functions provide a new means for fitting experimental data and their graphs can be used to approximate natural scenes. We first determine the conditions that a vertical scaling factor must obey to model effectively an arbitrary function. We then introduce polar fractal interpolation functions as one fractal interpolation method of a non-affine character. Thus, this method may be suitable for a wider range of applications than that of the affine case. The interpolation takes place in polar coordinates and then with an inverse non-affine transformation a simple closed curve arises as an attractor which interpolates the data in the usual plane coordinates. Finally, we prove that this attractor has the same Hausdorff dimension as the polar one.     

MATRIX ALGORITHMS AND ERROR FORMULA FOR BIVARIATE THIELE-TYPE RECTANGULAR MATRIX VALUED RATIONAL INTERPOLATION

A new method for the construction of bivariate matrix valued rational interpolants (BGIRI) on a rectangular grid is presented in [6]. The rational interpolants are of Thiele-type continued fraction form with scalar denominator. The generalized inverse introduced by [3]is gen-eralized to rectangular matrix case in this paper. An exact error formula for interpolation is ob-tained, which is an extension in matrix form of bivariate scalar and vector valued rational interpola-tion discussed by Siemaszko[l2] and by Gu Chuangqing [7] respectively. By defining row and col-umn-transformation in the sense of the partial inverted differences for matrices, two type matrix algorithms are established to construct corresponding two different BGIRI, which hold for the vec-tor case and the scalar case.     

Radial orthogonality and Lebesgue constants on the disk

In polynomial interpolation, the choice of the polynomial basis and the location of the interpolation points play an important role numerically, even more so in the multivariate case. We explore the concept of spherical orthogonality for multivariate polynomials in more detail on the disk. We focus on two items: on the one hand the construction of a fully orthogonal cartesian basis for the space of multivariate polynomials starting from this sequence of spherical orthogonal polynomials, and on the other hand the connection between these orthogonal polynomials and the Lebesgue constant in multivariate polynomial interpolation on the disk. We point out the many links of the two topics under discussion with the existing literature. The new results are illustrated with an example of polynomial interpolation and approximation on the unit disk. The numerical example is also compared with the popular radial basis function interpolation.