二元插值的一般框架

本文通过引进多参数建立了二元插值的一般框架.这样,许多著名的经典插值格式,如Newton插值、分叉连分式插值、对称连分式插值等均可视为本文的特殊情形．     

Thiele重心型矩阵值混合有理插值算法

利用Samelson型矩阵广义逆,构造了一种基于Thiele型连分式插值与重心有理插值的相结合的二元矩阵值混合有理插值格式,这种新的混合矩阵值有理插值函数继承了连分式插值和重心插值的优点,它的表达式简单,计算方便,数值稳定性好.该算法满足有理插值问题所给的插值条件,同时给出了误差估计分析.最后用数值算例验证了插值算法的有效性.     

二元Thiele型向量有理插值

本文对二元Thiele型连分式的渐近分式施行Samelson逆变换,建立了平面矩形域上的二元向量值有理插值,所得结果是一元向量值有理插值的推广和改进.     

基于二元连分式的散乱数据递推插值格式

本文首先基于新的非张量积型偏逆差商递推算法,分别构造奇数与偶数个插值节点上的二元连分式散乱数据插值格式,进而得到被插函数与二元连分式间的恒等式.接着,利用连分式三项递推关系式,提出特征定理来研究插值连分式的分子分母次数.然后,数值算例表明新的递推格式可行有效,同时,通过比较二元Thiele型插值连分式的分子分母次数,发现新的二元插值连分式的分子分母次数较低,这主要归功于节省了冗余的插值节点. 最后,计算此有理函数插值所需要的四则运算次数少于计算径向基函数插值.     

不规则结构上的二元有理插值

本文着重研究了定义在不规则结构上二元Ｔｈｉｅｌｅ型有理插值问题,给出了相应的插值公式．     

Stieltjes-Newton型有理插值

Stieltjes型分叉连分式在有理插值问题中有着重要的地位，它通过定义反差商和混合反差商构造给定结点上的二元有理函数，我们将Stieltjes型分叉连分式与二元多项式结合起来，构造Stieltje- Newton型有理插值函数，通过定义差商和混合反差商，建立递推算法，构造的Stieltjes-Newton型有理插值函数满足有理插值问题中所给的插值条件，并给出了插值的特征定理及其证明，最后给出的数值例子，验证了所给算法的有效性．     

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

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

多项式矩阵求逆的连分式插值方法

本文借助于基于广义逆矩阵Thiele-型连分式插值的计算公式，建立了多项式矩阵求逆的一个新方法。关于多项式矩阵求逆的一个实例给出以说明本文的结果。     

关于Newton—Thiele型二元有理插值的存在性问题

基于均差的牛顿插值多项式可以递归地实现对待插值函数的多项式逼近,而Thiele型插值连分式可以构造给定节点上的有理函数。将两者结合可以得到Newton-Thiele型二元有理插值（NTRI）算法,本文解决了NTRI算法的存在性问题,并有数值例子加以说明。     

一个二元矩阵插值连分式的展开式

本文借助于文[1]定义的一种实用的矩阵广义逆,构造了一个二元Stieltjes型矩阵值插值连分式的展开式,它的截断分式可以定义二元矩阵值插值函数.     

COMPUTATION OF VECTOR VALUED BLENDING RATIONAL INTERPOLANTS

As we know, Newton's interpolation polynomial is based on divided differences which can be calculated recursively by the divided-difference scheme while Thiele 's interpolating continued fractions are geared towards determining a rational function which can also be calculated recursively by so-called inverse differences. In this paper, both Newton's interpolation polynomial and Thiele's interpolating continued fractions are incorporated to yield a kind of bivariate vector valued blending rational interpolants by means of the Samelson inverse. Blending differences are introduced to calculate the blending rational interpolants recursively, algorithm and matrix-valued case are discussed and a numerical example is given to illustrate the efficiency of the algorithm.     

三元重心Thiele型混合有理插值

有理插值比多项式插值有更好的近似,但有理插值一般很难控制极点的产生.基于Thiele型连分式插值与重心有理插值,构造三元重心Thiele型混合有理插值,当选取适当的权后能避免部分极点的产生.文章最后通过数值例子验证了这种方法的正确性和有效性.     

Bivariate composite vector valued rational interpolation

In this paper we point out that bivariate vector valued rational interpolants (BVRI) have much to do with the vector-grid to be interpolated. When a vector-grid is well-defined, one can directly design an algorithm to compute the BVRI. However, the algorithm no longer works if a vector-grid is ill-defined. Taking the policy of ``divide and conquer', we define a kind of bivariate composite vector valued rational interpolant and establish the corresponding algorithm. A numerical example shows our algorithm still works even if a vector-grid is ill-defined.

     

ALGORITHMS FOR LACUNARY VECTOR VALUED RATIONAL INTERPOLANTS

Efficient algorithms are established for the computation of bivariate lacunary vector valued rational interpolants based on the branched continued fractions and a numerical example is given to show how the algorithms are implemented,     

VECTOR VALUED RATIONAL INTERPOLANTS BY TRIPLE BRANCHED CONTINUED FRACTIONS

Triple branched continued fractions (TBCFs) are constructed by means of well-define Thiele-type partial inverted differences. The characterizatioon theorem, uniqueness theorem andsome projection identity properties are obtained for vector valued rational interpolants hy TBCFs.     

矩阵有理逼近

本文利用Ｓａｍｅｌｓｏｎ逆变换得到了方阵逆阵的一个新方法，以此建立了Ｔｈｉｅｌｅ型矩阵连分式的展开式，将Ｔｈｉｅｌｅ定理推广到矩阵上去．首次引入了矩阵有理逼近的概念，并讨论和证明了它的特征性和唯一性．最后，给出了逼近式的余项公式．     

Newton-Thiele's rational interpolants

It is well known that Newton's interpolation polynomial is based on divided differences which produce useful intermediate results and allow one to compute the polynomial recursively. Thiele's interpolating continued fraction is aimed at building a rational function which interpolates the given support points. It is interesting to notice that Newton's interpolation polynomials and Thiele's interpolating continued fractions can be incorporated in tensor‐product‐like manner to yield four kinds of bivariate interpolation schemes. Among them are classical bivariate Newton's interpolation polynomials which are purely linear interpolants, branched continued fractions which are purely nonlinear interpolants and have been studied by Chaffy, Cuyt and Verdonk, Kuchminska, Siemaszko and many other authors, and Thiele-Newton's bivariate interpolating continued fractions which are investigated in another paper by one of the authors. In this paper, emphasis is put on the study of Newton-Thiele's bivariate rational interpolants. By introducing so‐called blending differences which look partially like divided differences and partially like inverse differences, we give a recursive algorithm accompanied with a numerical example. Moreover, we bring out the error estimation and discuss the limiting case. This revised version was published online in June 2006 with corrections to the Cover Date.