矩形网格上的二元切触有理插值

二元切触有理插值是有理插值的一个重要内容,而降低其函数的次数和解决其函数的存在性是有理插值的一个重要问题.二元切触有理插值算法的可行性大都是有条件的,且计算复杂度较大,有理函数的次数较高.利用二元Hermite（埃米特）插值基函数的方法和二元多项式插值误差性质,构造出了一种二元切触有理插值算法并将其推广到向量值情形.较之其它算法,有理插值函数的次数和计算量较低.最后通过数值实例说明该算法的可行性是无条件的,且计算量低.     

一类收敛的线性Hermite重心权有理插值

众所周知, Hermite有理插值比Hermite多项式插值具有更好的逼近性, 特别是对于插值点序列较大时, 但很难解决收敛性问题和控制实极点的出现. 本文建立了一类线性Hermite重心有理插值函数$r(x)$,并证明其具有以下优良性质: 第一, 在实数范围内无极点; 第二, 当$k=0,1,2$时,无论插值节点如何分布, 函数$r^{(k)}(x)$具有$O(h^{3d+3-k})$的收敛速度; 第三, 插值函数$r(x)$仅仅线性依赖于插值数据.     

Barycentric rational interpolation with no poles and high rates of approximation

It is well known that rational interpolation sometimes gives better approximations than polynomial interpolation, especially for large sequences of points, but it is difficult to control the occurrence of poles. In this paper we propose and study a family of barycentric rational interpolants that have no real poles and arbitrarily high approximation orders on any real interval, regardless of the distribution of the points. These interpolants depend linearly on the data and include a construction of Berrut as a special case.     

The Neville-like form of the Fitzpatrick algorithm for rational interpolation

The Fitzpatrick algorithm, which seeks a Gr?bner basis for the solution of a system of polynomial congruences, can be applied to compute a rational interpolant. Based on the Fitzpatrick algorithm and the properties of an Hermite interpolation basis, we present a Neville-like algorithm for multivariate osculatory rational interpolation. It may be used to compute the values of osculatory rational interpolants at some points directly without computing the rational interpolation function explicitly.     

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

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

A Fitzpatrick algorithm for multivariate rational interpolation

In this paper, we first apply the Fitzpatrick algorithm to osculatory rational interpolation. Then based on a Fitzpatrick algorithm, we present a Neville-like algorithm for Cauchy interpolation. With this algorithm, we can determine the value of the interpolating function at a single point without computing the rational interpolating function.     

A new algorithm for osculatory rational interpolation

Summary A new algorithm is derived for computing continued fractions whose convergents form the elements of the osculatory rational interpolation table.     

Padé–type rational and barycentric interpolation

In this paper, we consider the particular case of the general rational Hermite interpolation problem where only the value of the function is interpolated at some points, and where the function and its first derivatives agree at the origin. Thus, the interpolants constructed in this way possess a Padé–type property at 0. Numerical examples show the interest of the procedure. The interpolation procedure can be easily modified to introduce a partial knowledge on the poles and the zeros of the function to approximated. A strategy for removing the spurious poles is explained. A formula for the error is proved in the real case. Applications are given.     

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.     

向量值切触有理插值存在性的判别方法

在用广义Vandermonde行列式给出Hermite插值多项式的表达式的基础上,针对a<,i>=2(i=1,2,…,s)的情形给出向量值切触有理插值存在性问题有解的条件及表达式.