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.     

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

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

Stieltjes-Newton型有理插值

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

A Neville-like method via continued fractions

As we know, the classical Neville's algorithm is an effective method used to solve the interpolation problem by polynomials. In this paper, we adopt the idea of the Neville's algorithm to construct a kind of blending rational interpolants via continued fractions. For a given set of support points, there are many ways to build up the interpolation schemes, by which we mean that there are many choices to make to determine the initial interpolants on subsets of support points and then update them step by step to form a solution to the full interpolation problem. Numerical examples are given to show the advantage of our method and a multivariate analogy is also discussed.     

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

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

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.     

Convergence rates of a family of barycentric osculatory rational interpolation

It is well-known that osculatory rational interpolation sometimes gives better approximation than Hermite interpolation, especially for large sequences of points. However, it is difficult to solve the problem of convergence and control the occurrence of poles. In this paper, we propose and study a family of barycentric osculatory rational interpolation function, the proposed function and its derivative function both have no real poles and arbitrarily high approximation orders on any real interval.     

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.     

A matrix rational Lanczos method for model reduction in large‐scale first‐ and second‐order dynamical systems

In the present paper, we describe an adaptive modified rational global Lanczos algorithm for model‐order reduction problems using multipoint moment matching‐based methods. The major problem of these methods is the selection of some interpolation points. We first propose a modified rational global Lanczos process and then we derive Lanczos‐like equations for the global case. Next, we propose adaptive techniques for choosing the interpolation points. Second‐order dynamical systems are also considered in this paper, and the adaptive modified rational global Lanczos algorithm is applied to an equivalent state space model. Finally, some numerical examples will be given.     

Solution of a multiple Nevanlinna-Pick problem via orthogonal rational functions

We consider a Nevanlinna-Pick type interpolation problem for Carathéodory functions, where the values of the function and its derivatives up to certain orders are given at finitely many points of the unit disk. The set of all solutions of this problem is described by means of the orthogonal rational functions which play here a similar role as the orthogonal polynomials on the unit circle in the classical case of the trigonometric moment problem. In particular, we use a connection between Szegö and Schur parameters which in the classical situation was discovered by Ja.L. Geronimus.     

Balayage and Convergence of Rational Interpolants

We investigate the following problem: For which open simply connected domains do there exist interpolation schemes (a set of interpolation points) such that for any analytic function defined in the domain the corresponding interpolating polynomials converge to the function when the degree of the polynomials tends to infinity? We also study similar problems for rational interpolants. These problems are connected to the balayage (sweeping out) problems of measures.     

Interpolation of analytic functions with finitely many singularities

We consider an interpolation process for the class of functions with finitely many singular points by means of rational functions whose poles coincide with the singular points of the function under interpolation. The interpolation nodes form a triangular matrix. We find necessary and sufficient conditions for the uniform convergence of sequences of interpolation fractions to the function under interpolation on every compact set disjoint from the singular points of the function and other conditions for convergence. We generalize and improve the familiar results on the interpolation of functions with finitely many singular points by rational fractions and of entire functions by polynomials.     

Unconditionally Convergent Rational Interpolation Splines

Given a continuous function on a closed interval, a sequence of rational interpolation splines is constructed which converges uniformly on this closed interval to the given function for any sequence of grids with step width tending to zero. The derivatives possess this unconditional convergence property as well. Estimates of the rate of convergence are given.

     

A new approach to vector-valued rational interpolation

In this work we propose three different procedures for vector-valued rational interpolation of a function F(z), where , and develop algorithms for constructing the resulting rational functions. We show that these procedures also cover the general case in which some or all points of interpolation coalesce. In particular, we show that, when all the points of interpolation collapse to the same point, the procedures reduce to those presented and analyzed in an earlier paper (J. Approx. Theory 77 (1994) 89) by the author, for vector-valued rational approximations from Maclaurin series of F(z). Determinant representations for the relevant interpolants are also derived.     

Rationale Interpolation,Normalität und Monosplines

This paper is concerned with interpolation by rational functions. Conditions are given which ensure that the solution has no poles between the points of interpolation. Comparison theorems on the error of the interpolation are also derived.     

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

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

Solution of a multiple Nevanlinna–Pick problem for Carathéodory functions via orthogonal rational functions in the matrix case

We consider an interpolation problem of Nevanlinna–Pick type for matrix‐valued Carathéodory functions, where the values of the functions and its derivatives up to certain orders are given at finitely many points of the open unit disk. For the non‐degenerate case, i.e., in the particular situation that a specific block matrix (which is formed by the given data in the problem) is positive Hermitian, the solution set of this problem is described in terms of orthogonal rational matrix‐valued functions. These rational matrix functions play here a similar role as Szegő's orthogonal polynomials on the unit circle in the classical case of the trigonometric moment problem. In particular, we present and use a connection between Szegő and Schur parameters for orthogonal rational matrix‐valued functions which in the primary situation of orthogonal polynomials was found by Geronimus. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Convergence Conditions for Interpolation Fractions at the Nodes Distinct from the Singular Points of a Function

We consider an interpolation process for the class of functions with finitely many singular points by means of the rational functions whose poles coincide with the singular points of the function under interpolation. The interpolation nodes constitute a triangular matrix and are distinct from the singular points of the function. We find a necessary and sufficient condition for uniform convergence of sequences of interpolation fractions to the function under interpolation on every compact set disjoint from the singular points of the function and other conditions for convergence.Original Russian Text Copyright © 2005 Lipchinskii A. G.__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 822–833, July–August, 2005.     

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型连分式插值和二元Newton-Thiele型混合有理插值中不可达点的分析,给出了一种判断不可达点的方法.而且,对于任意给定的插值条件,通过构造带参数的Thiele型切触插值和二元Newton-Thiele型混合切触有理插值,使得不可达点变成可达点.数值例子也说明了这种方法的有效性.