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.     

BLOCK BASED NEWTON-LIKE BLENDING INTERPOLATION

Newton＇s polynomial interpolation may be the favourite linear interpolation in the sense that it is built up by means of the divided differences which can be calculated recursively and produce useful intermediate results. However Newton interpolation is in fact point based interpolation since a new interpolating polynomial with one more degree is obtained by adding a new support point into the current set of support points once at a time. In this paper we extend the point based interpolation to the block based interpolation. Inspired by the idea of the modern architectural design, we first divide the original set of support points into some subsets （blocks）, then construct each block by using whatever interpolation means, linear or rational and finally assemble these blocks by Newton＇s method to shape the whole interpolation scheme. Clearly our method offers many flexible interpolation schemes for choices which include the classical Newton＇s polynomial interpolation as its special case. A bivariate analogy is also discussed and numerical examples are given to show the effectiveness of our method.     

奇数方幂和的通项公式

In this paper, by using superposition method, we aim to show that ∑^n i=1 （2/- 1）^2k-1 is the product of n2 and a rational polynomial in n2 with degree k- 1, and that ∑^ni=1 （2i - 1）^2k is the product of n（2n - 1）（2n ＋ 1） and a rational polynomial in （2n - 1）（2n ＋ 1） with degree k - 1. Moreover, recurrence formulas to compute the coefficients of the corresponding rational polynomials are also obtained.     

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.     

PROBLEMS AND METHODS IN MATRIX VALUED RATIONAL INTERPOLATION

A variety of matrix rational interpolation problems include the partial realizationproblem for matrix power series and the minimal rational interpolation problem for generalmatrix functions.Several problems in circuit theory and digital filter design can also be re-duced to the solution of matrix rational interpolation problems[1—4].By means of thereachability and the observability indices of defined pairs of matrices,Antoulas,Ball,Kang and Willems solved the minimal matrix rational interpolation problem in[1].On the     

ON PROPERTIES OF MEROMORPHIC SOLUTIONS FOR COMPLEX DIFFERENCE EQUATION OF MALMQUIST TYPE

In this paper, we present the properties on zeros, fixed points, poles, Borel exceptional value of finite order transcendental meromorphic solutions of complex difference equation of Malmquist typewhere n（∈ N） 〉 2, P（f（z）） and Q（f（z）） are relatively prime polynomials in f（z） with rational coefficients a8 （s = 0, 1,…,p） and bt （t = 0, 1,… ,q） such that aoapbq 7≠ O, and also consider the existence and the forms on rational solutions of this type of difference equations. Some examples are also listed to show that the assumptions of theorems, in certain senses, are the best possible.     

构造二元向量值有理插值函数的一种新方法

At present, the methods of constructing vector valued rational interpolation function in rectangular mesh are mainly presented by means of the branched continued fractions. In order to get vector valued rational interpolation function with lower degree and better approximation effect, the paper divides rectangular mesh into pieces by choosing nonnegative integer parameters d1 （0 〈 dl ≤ m） and d2 （0 ≤ d2≤ n）, builds bivariate polynomial vector interpolation for each piece, then combines with them properly. As compared with previous methods, the new method given by this paper is easy to compute and the degree for the interpolants is lower.     

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.     

MATRIX ALGORITHMS AND ERROR FORMULA FOR BIVARIATE THIELE-TYPE RECTANGULAR MATRIX VALUED RATIONAL INTERPOLATION

A new method for the construction of bivariate matrix valued rational interpolants (BGIRI) on a rectangular grid is presented in [6]. The rational interpolants are of Thiele-type continued fraction form with scalar denominator. The generalized inverse introduced by [3]is gen-eralized to rectangular matrix case in this paper. An exact error formula for interpolation is ob-tained, which is an extension in matrix form of bivariate scalar and vector valued rational interpola-tion discussed by Siemaszko[l2] and by Gu Chuangqing [7] respectively. By defining row and col-umn-transformation in the sense of the partial inverted differences for matrices, two type matrix algorithms are established to construct corresponding two different BGIRI, which hold for the vec-tor case and the scalar case.     

样条型矩阵有理插值

The matrix valued rational interpolation is very useful in the partial realization problem and model reduction for all the linear system theory. Lagrange basic functions have been used in matrix valued rational interpolation. In this paper, according to the property of cardinal spline interpolation, we constructed a kind of spline type matrix valued rational interpolation, which based on cardinal spline. This spline type interpolation can avoid instability of high order polynomial interpolation and we obtained a useful formula.     

Practical, Reliable, Rational Interpolation

An algorithm incorporating features essential for practical,reliable, rational interpolation is explained. This algorithmgenerates a Thiele-Werner continued fraction representationof the interpolant. A backward error analysis is presented forthe algorithm, as well as for its special cases of Newton polynomialinterpolation and Thiele rational interpolation. This is madepossible by introducing into the Newton method, Thiele methodand Werner method a strategy for selecting the interpolationpoints in an optimal order.     

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.     

Bivariate interpolatory rational splines

Smoothing conditions in terms of Bézier coefficients of piecewise rational functions on an arbitrary triangulation are derived. This facilitates the solution of the problem of bivariate rational spline interpolation, with or without convexity constraints, particularly on the three and four-directional meshes. For such a triangulation, we also derive the conformality condition that a bivariate rationale spline function must satisfy, and we demonstrate the interpolation scheme with a low-degree example.The research of this author was supported by NSF Grant # DMS-92-06928.     

一类有理插值曲面模型及其可视化约束控制

本文构造一类新的基于函数值和偏导数值的双变量加权混合有理插值样条.与已有的有理插值样条相比,这类新的有理插值样条具有以下四方面的特性,其一,插值函数可以由简单的对称基函数来表示;其二,对任何正参数,插值函数满足C1连续,而且,在不限制参数取值的条件之下,插值曲面保持光滑;其三,插值函数不但含有参数,而且带有加权系数,增加了插值函数的自由度;其四,插值曲面的形状随着参数与加权系数的变化而变化.同时,本文讨论此类插值曲面的性质,包括基函数的性质、积分加权系数的性质和插值函数的边界性质.此类插值函数的优势在于,不改变给定插值数据的前提下,通过选择合适的参数和不同的加权系数,对插值区域内的任意点的函数值进行修改.因此可将其应用于曲面设计,根据实际设计需要,自由地修改曲面形状.数值实验表明,此类新的有理样条插值具有良好的约束控制性质.     

指数型有理插值与q-级数互反关系

成立. 显然,在上式中取q=1,便退化为Could-Hsu反演公式.在[2—5]中曾应用后者构造插值级数,并对其中一类广义牛顿插值级数进行系统的研究.作者在此基础上应用(1.3)构造指数型插值函数. 首先引进q差分算子△_q,定义     

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

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

Chebyshev rational interpolation

The Lanczos method and its variants can be used to solve efficiently the rational interpolation problem. In this paper we present a suitable fast modification of a general look-ahead version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for approximating analytic functions by means of rational interpolation at certain nodes located on the boundary of an elliptical region of the complex plane. In fact, in this case it overcomes some of the numerical difficulties which limited the applicability of the look-ahead Lanczos process for determining the coefficients both of the numerators and of the denominators with respect to the standard power basis. This revised version was published online in August 2006 with corrections to the Cover Date.     

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

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

BIVARIATE LAGRANGE-TYPE VECTOR VALUED RATIONAL INTERPOLANTS

1. IntroductionWynn [11] proposed a method for rational interpolation of vector-vaued quantities givenon a set of distinct illterpolation points. He used colltinued fractions and generalized inversesfor the reciproca1 of vector-vaued qualltities. McCleod …     

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

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