一种求二元有理插值函数的方法

给出一种方法可直接计算基于矩形节点的二元有理插值函数的分母在节点处的值 ,进而判断相应的二元有理插值函数是否存在 .此方法运用灵活 ,适用范围广 ,在相应的有理插值函数存在时 ,能给出它的具体表达式 .此外 ,我们还针对文中两个主要逆矩阵 ,给出了相应的递推公式 ,避免了求逆计算 .     

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.     

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.     

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.     

有理线性插值曲线和曲面

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

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.     

Weighted interpolation for equidistant nodes

Weighted Lagrange interpolation is proposed for solving Lagrange interpolation problems on equidistant or almost equidistant data. Good condition numbers are found in the case of rational interpolants whose denominator has degree about twice the number of data to be interpolated. Since the degree of the denominator is higher than that of the numerator, simple functions like constants and linear polynomials will not be reproduced. Furthermore, the interpolant cannot be expressed by a barycentric formula. As a counterpart, the interpolation algorithm is simple and leads to small Lebesgue constants.     

In what sense is the rational interpolation problem well posed

It is well known that the nonlinear problem of interpolatingm+n+1 data by a rational function of type (m, n) may have no solution, but that the corresponding linearized problem (obtained by multiplying through by the denominator) always leads to a unique rational function, which is often still called the rational interpolant. For fixedm andn, and fixed (possibly multiple) interpolation points, the dependence of this interpolant on the prescribed function values is studied here. For ten notions of convergence in the space _{m, n} the question of the continuity of this interpolation operator is investigated.Communicated by William B. Gragg.AMS classification: 41A24, 30E05, 41A20, 65D05.     

C1 monotone cubic Hermite interpolant

Constraining an interpolation to be shape preserving is a well established technique for modelling scientific data. Many techniques express the constraint variables in terms of abstract quantities that are difficult to relate to either physical values or the geometric properties of the interpolant. In this paper, we construct a piecewise monotonic interpolant where the degrees of freedom are expressed in terms of the weights of the rational Bézier cubic interpolant.     

Shape Preserving Interpolation to Convex Data by Rational Functions with Quadratic Numerator and Linear Denominator

By using rational functions of the type quadratic/linear (withquadratic numerator and linear denominator), we show in thispaper how to construct, in a straightforward way, a convex C¹interpolant to convex data. In Delbourgo & Gregory (1985b)a cubic/quadratic rational form is discussed for this problem.A special case arises there which allows a reduction to thequadratic/linear form of the present paper. This simpler formwas not evident at the time and we give here an independentaccount of the relevant theory which we support by numericalexamples. Finally we examine the consistency conditions (a setof nonlinear equations) for second-derivative continuity. Weprove that a unique solution exists which satisfies the convexityrequirements.     

Shape Preserving Interpolation to Convex Data

1.IntroductionA fundamental problem in computer graphics is the drawing of a smooth curve through aset of data points(xi,fi) (i=0 ,1 ,… ,n) .In many applications,particularly in scientificvisualisation,the y- values are depenenton the x- values and it is…     

Vector-valued Rational Interpolants II

Formulae for rational interpolation of vector data (in a spaceC^[d]) at distinct points are given. Its confluent case of vector-valuedPadé approximation is shown to be equivalent to the Germanpolynomial approximation problem. Formulae are given for thevector of numerator polynomials and for the denominator polynomial.A continued fraction interpolant for vector data is also given.The methods are characterized by their requirement that certaindistinguished directions in the space C^[d] form part of thespecification. The case of matrix Padé approximants forthe partial realization problem is explicitly discussed.     

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.     

几种有理插值函数的逼近性质

1　引　　言在曲线和曲面设计中,样条插值是有用的和强有力的工具.不少作者已经研究了很多种类型的样条插值[1,2,3,4].近些年来,有理插值样条,特别是三次有理插值样条,以及它们在外型控制中的应用,已有了不少工作[5,6,7].有理插值样条的表达式中有某些参数,正是由于这些参数,有理插值样条在外型控制中充分显示了它的灵活性;但也正是由于这些参数,使它的逼近性质的研究增加了困难.因此,关于有理插值样条的逼近性质的研究很少见诸文献.本文在第二节首先叙述几种典型的有理插值样条,其中包括分母为一次、二次的三次有理插值样条和仅基于函数值…     

An algorithm for generalized rational interpolation

A recursive algorithm for the construction of the generalized form of the interpolating rational function is derived. This generalization of the Neville-Aitken algorithm constructs a table of all possible rational interpolants in implicit form. The algorithm may be simply modified so that it does not break down when a singularity occasionally appears. The coefficients of the interpolant and the evaluation of the interpolant at an arbitrary point may be easily calculated.     

A rational Lanczos algorithm for model reduction

This paper presents a model reduction method for large-scale linear systems that is based on a Lanczos-type approach. A variant of the nonsymmetric Lanczos method, rational Lanczos, is shown to yield a rational interpolant (multi-point Padé approximant) for the large-scale system. An exact expression for the error in the interpolant is derived. Examples are utilized to demonstrate that the rational Lanczos method provides opportunities for significant improvements in the rate of convergence over single-point Lanczos approaches.     

Barycentric rational interpolation with asymptotically monitored poles

We present a method for asymptotically monitoring poles to a rational interpolant written in barycentric form. Theoretical and numerical results are given to show the potential of the proposed interpolant.     

A de Montessus type convergence study for a vector-valued rational interpolation procedure

In a recent paper of the author [8], three new interpolation procedures for vector-valued functions F(z), where F: ℂ → ℂ^N, were proposed, and some of their algebraic properties were studied. In the present work, we concentrate on one of these procedures, denoted IMMPE, and study its convergence properties when it is applied to meromorphic functions. We prove de Montessus and Koenig type theorems in the presence of simple poles when the points of interpolation are chosen appropriately. We also provide simple closed-form expressions for the error in case the function F(z) in question is itself a vector-valued rational function whose denominator polynomial has degree greater than that of the interpolant.