关于广义逆的向量连分式插值样条

本文首次引入了关于广义逆的向量有理插值样条的概念．这类插值样条具有Thiele型连分式的截断分式的表现形式．在它的构造过程中,不必用到连分式的三项递推关系,本文得到的新的有效的系数算法具有递推运算的特点．存在性的一个充分条件得以建立．包括唯一性在内的有关插值问题的某些结果得到证明．最后,本文给出了一个精确的插值误差公式．     

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

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

长方体网格上的三元连分式的插值

本文利用递推公式构造了一个空间长方体网格上的三元连分式的插值公式,插值的存在性和唯一性得到了证明,一个数例说明了插值方法的有效性。     

二元Thiele型向量有理插值

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

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

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

三元New ton-Thiele型插值方法

本文以 Newton插值及 Thiele型连分式插值为基础 ,将线性与非线性插值方法相结合 ,通过混合差商的定义 ,给出了三元 Newton-Thiele型插值公式及误差估计式 .     

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

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

三元Newton—Thiele型插值方法

本以Newton插值及Thiele型连分式插值为基础，其线性与非线性插值方法相结合，通过混合差商的定义，给出了三元Newton-Thiele型插值公式及误差估计式。     

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

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

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

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

连幂式插值

根据连续幂指形式的函数,提出了连续幂指形式的函数插值的概念,简称连幂式插值,用构造式方法得到了满足插值条件的连幂式插值函数。最后,通过一个算例与连分式插值函数做了对比。     

Stieltjes-Newton型有理插值

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

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.     

修正的 Thiele-Werner型有理插值

Through adjusting the order of interpolation nodes, we gave a kind of modified Thiele-Werner rational interpolation. This interpolation method not only avoids the infinite value of inverse differences in constructing the Thiele continued fraction interpolation, but also simplifies the interpolating polynomial coefficients with constant coefficients in the Thiele-Werner rational interpolation. Unattainable points and determinantal expression for this interpolation are considered. As an extension, some bivariate analogy is also discussed and numerical examples are given to show the validness of this method.     

Lagrange基函数的复矩阵有理插值及连分式插值

1引言 矩阵有理插值问题与系统线性理论中的模型简化问题和部分实现问题有着紧密的联系~[1][2]，在矩阵外推方法中也常常涉及线性或有理矩阵插值问题~[3]。按照文~[1]的阐述。目前已经研究的矩阵有理插值问题包括矩阵幂级数和Newton-Pade逼近。Hade逼近，联立Pade逼近，M-Pade逼近，多点Pade逼近等。显然，上述各种形式的矩阵Pade逼上梁山近是矩     

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.     

A multivariate QD-like algorithm

The problem of constructing a univariate rational interpolant or Padé approximant for given data can be solved in various equivalent ways: one can compute the explicit solution of the system of interpolation or approximation conditions, or one can start a recursive algorithm, or one can obtain the rational function as the convergent of an interpolating or corresponding continued fraction.In case of multivariate functions general order systems of interpolation conditions for a multivariate rational interpolant and general order systems of approximation conditions for a multivariate Padé approximant were respectively solved in [6] and [9]. Equivalent recursive computation schemes were given in [3] for the rational interpolation case and in [5] for the Padé approximation case. At that moment we stated that the next step was to write the general order rational interpolants and Padé approximants as the convergent of a multivariate continued fraction so that the univariate equivalence of the three main defining techniques was also established for the multivariate case: algebraic relations, recurrence relations, continued fractions. In this paper a multivariate qd-like algorithm is developed that serves this purpose.