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.     

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

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

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.     

Stieltjes-Newton型有理插值

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

一种新形式的二元混合有理插值(英文)

Newton＇s polynomial interpolation may be the favorite linear interpolation,associated continued fractions interpolation is a new type nonlinear interpolation.We use those two interpolation to construct a new kind of bivariate blending rational interpolants.Characteristic theorem is discussed.We give some new blending interpolation formulae.     

Bivariate Blending Thiele-Werner＇s Osculatory Rational Interpolation

Both the expansive Newton＇s interpolating polynomial and the Thiele-Werner＇s interpolation are used to construct a kind of bivariate blending Thiele-Werner＇s osculatory rational interpolation. A recursive algorithm and its characteristic properties are given. An error estimation is obtained and a numerical example is illustrated.     

Bivariate Blending Thiele-Werner's Osculatory Rational Interpolation

Both the expansive Newton's interpolating polynomial and the Thiele-Werner's in- terpolation are used to construct a kind of bivariate blending Thiele-Werner's oscula- tory rational interpolation.A recursive algorithm and its characteristic properties are given.An error estimation is obtained and a numerical example is illustrated.     

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

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

Bivariate blending rational interpolants

Both the Newton interpolating polynomials and the Thiele-type interpolating continued fractions based on inverse differences are used to construct a kind of bivariate blending rational interpolants and an error estimation is given.     

Bivariate blending rational interpolants

Both the Newton interpolating polynomials and the Thiele-type interpolating continued fractions based on inverse differences are used to construct a kind of bivariate blending rational interpolants and an error estimation is given.     

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

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

二元混合连分式展开的混合差商极限方法

For a univariate function given by its Taylor series expansion,a continuedfraction expansion can be obtained with the Viscovatov's algorithm,as the limitingvalue of a Thiele interpolating continued fraction or by means of the determinantalformulas for inverse and reciprocal differences with coincident data points.In thispaper,both Viscovatov-like algorithms and Taylor-like expansions are incorporatedto yield bivariate blending continued expansions which are computed as the limitingvalue of bivariate blending rational interpolants,which are constructed based on sym-metric blending differences.Numerical examples are given to show the effectivenessof our methods.     

修正的 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.     

Bivariate polynomial and continued fraction interpolation over ortho-triples

By means of the barycentric coordinates expression of the interpolating polynomial over each ortho-triple, some properties are obtained. Moreover, the explicit coefficients in terms of B-net for one ortho-triple, and two ortho-triples are worked out, respectively. Thus the computation of multiple integrals can be converted into the sum of the coefficients in terms of the B-net over triangular domain much effectively and conveniently. Based on a new symmetrical algorithm of partial inverse differences, a novel continued fractions interpolation scheme is presented over arbitrary ortho-triples in R², which is a bivariate osculatory interpolation formula with one-order partial derivatives at all corner points in the ortho-triples. Furthermore, its characterization theorem is presented by three-term recurrence relations. The new scheme is advantageous over the polynomial one with some numerical examples.     

On branched continued fractions rational interpolation over pyramid-typed grids

In this paper, three-term recurrence relations for branched continued fractions are determined. Based on the algorithm of partial inverse differences in tensor-product-like manner, the finite branched continued fractions can be applied to rational interpolation over pyramid-typed grids in R ³. By means of the three-term recurrence relations, a characterization theorem is valid. Then an error estimation is worked out. Based on the relationship between the partial inverse differences and partial reciprocal ones, and the partial reciprocal derivatives as well, the BCFs osculatory interpolation with its algorithm is stated which shows it feasibility of partial derivable functions in BCFs expansion at one point.     

有理反插值

在解决反插值问题时,本文首次利用Thiele型连分式有理插值,得到了两种十分有效的方法:函数插值的有理反插法和反函数的有理插值法,同多项式反插值相比有较好的效果.数值例子说明了在解代数方程时有理反插法优于多项式反插法.     

QD-Type algorithms for the nonnormal Newton-Padé approximation table

It is well known that solutions of the rational interpolation problem or Newton-Padé approximation problem can be represented with the help of continued fractions if certain normality assumptions are satisfied. By comparing two interpolating continued fractions, one obtains a recursive QD-type scheme for computing the required coefficients. In this paper a uniform approach is given for two different interpolating continued fractions of ascending and descending type, generalizing ideas of Rutishauser, Gragg, Claessens, and others. In the nonnormal case some of the interpolants are equal yielding so-called singular blocks. By appropriate “skips” in the Newton-Padé table modified interpolating continued fractions are derived which involve polynomials known from the Kronecker algorithm and from the Werner-Gutknecht algorithm as well as from the modification of the cross-rule proposed recently by the authors. A corresponding QD-type algorithm for the nonnormal Newton-Padé table is presented. Finally, the particular case of Padé approximation is discussed where—as in Cordellier's modified cross-rule—the given recurrence relations become simpler.     

Multivariate generalized inverse vector-valued rational interpolants

Bivariate rational interpolating functions of the type introduced in [9, 1] are shown to have a natural extension to the case of rational interpolation of vector-valued quantities using the formalism of Graves-Morris [2]. In this paper, the convergence of Stieltjes-type branched vector-valued continued fractions for two-variable functions are constructed by using the Samelson inverse. Based on them, a kind of bivariate vector-valued rational interpolating function is defined on plane grids. Sufficient conditions for existence, characterisation and uniqueness for the interpolating functions are proved. The results in the paper are illustrated with some examples.     

三元向量值混合有理插值及其算法

本文第一节利用 Samelson逆、混合偏差商以及 Thiele-型分叉连分式构造三元向量值混合有理插值 ,第二节给出了一种计算三元向量值混合有理插值的算法 ,第三节给出了一个数值例子 .     

一类非线性矩阵方程对称解的双迭代算法

利用逆矩阵的Neumann级数形式,将在Schur插值问题中遇到的含未知矩阵二次项之逆的非线性矩阵方程转化为高次多项式矩阵方程,然后采用牛顿算法求高次多项式矩阵方程的对称解,并采用修正共轭梯度法求由牛顿算法每一步迭代计算导出的线性矩阵方程的对称解或者对称最小二乘解,建立求非线性矩阵方程的对称解的双迭代算法.双迭代算法仅要求非线性矩阵方程有对称解,不要求它的对称解唯一,也不对它的系数矩阵做附加限定.数值算例表明,双迭代算法是有效的.