一类二元有理插值的存在性问题

利用二元Lagrange插值公式对一类二元有理插值函数的存在性给出了一个判别方法,并在判别出该二元有理插值函数存在时,给出了它的表现公式。此外,对导致二元有理插值函数不存在的不可达点,本文给出了一种处理方法,使之由不可达点变成可达点。文章的最后还给出若干数值例子说明了本方法的有效性.     

一类二元有理插值函数的存在性及算法

文[3]构造了对于矩形网格上基于二元Newton插值公式的一类二元有理插值函数,并给出了其存在性的充分条件.本文进一步证明了这类二元有理插值函数存在性的必要条件,特别地,当m=n时,给出了具有三角形结构的系数矩阵的判别方法,该方法计算简便且具有承袭性,文章最后给出的实例说明了方法的有效性.     

基于Taylor算子的二元向量切触有理插值

提出了一种基于Taylor算子的二元向量切触有理插值的新方法.首先应用已知的节点定义各阶有理插值基函数,再用相应的向量值和各阶偏导数值建立一种类似二元函数Taylor公式的新型插值算子,最后进行组合运算,得出二元向量一阶、二阶切触有理插值函数的显式表达式,并自然推广到k阶情形,还给出了误差估计.算例表明,该方法计算简单,过程公式化,有应用价值.     

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

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

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

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

二元向量值有理插值存在性的一种判别方法

文章给出了对于矩形网格上基于二元Newton插值公式的二元向量值有理插值存在性的充要条件.在存在的情况下,建立了具有显式表达式的不同于向量连分式的二元向量值有理插值函数,并且这种方法具有承袭性.最后给出的实例说明了这种算法的有效性.     

高阶导数切触有理插值算法

已有关于高阶导数有理插值方法的研究大都是基于广义范德蒙逆矩阵的思想,计算复杂度较高.本文利用埃米特插值基函数的方法和多项式插值的误差性质,给出一种满足高阶导数插值条件的切触有理插值算法,并且适用于向量值切触有理插值及插值重度不相等的情形,解决切触有理插值函数的存在性及算法复杂性问题.较之其他算法,具有计算复杂度较低,便于实际应用等特点.最后通过数值例子说明该算法的有效性.     

构造低次有理插值函数的一种方法

关于有理插值的算法已有很多[1,4,5],受二元多项式插值迭加算法[6]的启发,我们给出一种简便的求低次有理插值函数的方法,同时给出有理插值函数存在的充分条件,便于检验.所给方法具有可操作性和实际应用价值,且具有较好的灵活性.     

向量值有理插值存在性的一种判别方法

对于向量值有理插值的计算,目前已经有多种求解算法.但其存在性的判别方法及其证明在现有的文献中还没有见到.这里利用标量有理插值函数插值存在性的思想,引入Newton基函数,给出并证明了向量值有理插值存在性的一种判别方法.同时给出有理插值函数的分子和分母的显式表达式,最后的实例说明了它的有效性.     

切触有理插值新方法

针对传统连分式插值,计算复杂度高,计算过程中分母为零的不可预知性及插值函数不满足某些给定条件,应用不方便等问题,利用已知节点、函数值、导数值,构造两个多项式,分别作为有理插值函数的分子和分母,得出各阶导数条件下切触有理插值的新公式,并给出特殊情形的表达式.若添加适当的参数,可任意降低插值函数次数.该方法计算简洁,应用方便,插值函数的分母在节点处不为零且满足全部插值条件.数值例子验证了新方法的可行性、有效性和实用性.     

A method for directly finding the denominator values of rational interpolants

In this paper, we give an algorithm for directly finding the denominator values of rational interpolants at the nodes, and present an expression for the corresponding rational interpolant when the latter exists. With these denominator values, our method also provides information concerning the existence of the interpolant and the presence of unattainable points and poles.     

On the denominator values and barycentric weights of rational interpolants

We improve upon the method of Zhu and Zhu [A method for directly finding the denominator values of rational interpolants, J. Comput. Appl. Math. 148 (2002) 341–348] for finding the denominator values of rational interpolants, reducing considerably the number of arithmetical operations required for their computation. In a second stage, we determine the points (if existent) which can be discarded from the rational interpolation problem. Furthermore, when the interpolant has a linear denominator, we obtain a formula for the barycentric weights which is simpler than the one found by Berrut and Mittelmann [Matrices for the direct determination of the barycentric weights of rational interpolation, J. Comput. Appl. Math. 78 (1997) 355–370]. Subsequently, we give a necessary and sufficient condition for the rational interpolant to have a pole.     

Note on Rational Interpolants

<正> In this note we present a constructive proof of symmetrical determinantal formulas forthe numerator and denominator of an ordinary rational interpolant,consider the confluencecase and give new determinantal formulas of the rational interpolant by means of Lagrange'sbasis functions.     

On the structure of a table of multivariate rational interpolants

In the table of multivariate rational interpolants the entries are arranged such that the row index indicates the number of numerator coefficients and the column index the number of denominator coefficients. If the homogeneous system of linear equations defining the denominator coefficients has maximal rank, then the rational interpolant can be represented as a quotient of determinants. If this system has a rank deficiency, then we identify the rational interpolant with another element from the table using less interpolation conditions for its computation and we describe the effect this dependence of interpolation conditions has on the structure of the table of multivariate rational interpolants. In the univariate case the table of solutions to the rational interpolation problem is composed of triangles of so-called minimal solutions, having minimal degree in numerator and denominator and using a minimal number of interpolation conditions to determine the solution.Communicated by Dietrich Braess.     

有理线性插值曲线和曲面(英文)

构造了含参数的分段线性有理插值函数(分子、分母均为一次多项式),通过适当选择形状参数,由此函数产生的曲线一阶连续并且保单调.文中用张量积方法将此结果推广到二元矩形网格上的曲面插值,同时给出了插值函数的误差估计及数值例子.     

Symmetrical formulas for rational interpolants

Symmetrical determinantal formulas for the numerator and denominator of an ordinary rational interpolant are presented and discussed. Degenerate cases are analysed.     

Vector-valued,rational interpolants III

In 1963, Wynn proposed a method for rational interpolation of vector-valued quantities given on a set of distinct interpolation points. He used continued fractions, and generalized inverses for the reciprocals of vector-valued quantities. In this paper, we present an axiomatic approach to vector-valued rational interpolation. Uniquely defined interpolants are constructed for vector-valued data so that the components of the resulting vector-valued rational interpolant share a common denominator polynomial. An explicit determinantal formula is given for the denominator polynomial for the cases of (i) vector-valued rational interpolation on distinct real or complex points and (ii) vector-valued Padé approximation. We derive the connection with theε-algorithm of Wynn and Claessens, and we establish a five-term recurrence relation for the denominator polynomials.     

Constrained interpolation using rational Cubic Spline with linear denominators

In this paper, a rational cubic interpolant spline with linear denominator has been constructed, and it is used to constrain interpolation curves to be bounded in the given region. Necessary and sufficient conditions for the interpolant to satisfy the constraint have been developed. The existence conditions are computationally efficient and easy to apply. Finally, the approximation properties have been studied.