On a Special Laurent-Hermite Interpolation Problem (original) (raw)
Related papers
Rational Hermite-Fejér interpolation
2013
In this paper we construct rational orthogonal systems with respect to the normalized area measure on the unit disc. The generating system is a collection of so called elementary rational functions. In the one dimensional case an explicit formula exists for the corresponding Malmquist-Takenaka functions involving the Blaschke functions. Unfortunately, this formula has no generalization for the case of the unit disc, which justifies our investigations. We focus our attention for such special pole combinations, when an explicit numerical process can be given. In [4] we showed, among others, that if the poles of the elementary rational functions are of order one, then the orthogonalization is naturally related with an interpolation problem. Here we take systems of poles which are of order both one and two. We show that this case leads to an Hermite-Fejér type interpolation problem in a subspace of rational functions. The orthogonal projection onto this subspace is calculated and also the basic Hermite-Fejér interpolation functions are provided. We show that by means of the given process effective algorithms can be constructed for approximations of surfaces.
An interpolation algorithm for orthogonal rational functions
Journal of Computational and Applied Mathematics, 2004
Let A = {α 1 , α 2 , . . . } be a sequence of numbers on the extended real lineR = R ∪ {∞} and µ a positive bounded Borel measure with support in (a subset of)R. We introduce rational functions φ n with poles {α 1 , . . . , α n } that are orthogonal with respect to µ (if all poles are at infinity, we recover the polynomial situation). It is well known that under certain conditions on the location of the poles, the system {φ n } is regular such that the orthogonal functions satisfy a three term recurrence relation similar to the one for orthogonal polynomials.
A new approach to vector-valued rational interpolation
Journal of Approximation Theory, 2004
In this work we propose three different procedures for vector-valued rational interpolation of a function F(z), where F : C → C N , 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.
A new realization of rational functions, with applications to linear combination interpolation
2015
We introduce the following linear combination interpolation problem (LCI): Given N distinct numbers w_1,... w_N and N+1 complex numbers a_1,..., a_N and c, find all functions f(z) analytic in a simply connected set (depending on f) containing the points w_1,...,w_N such that ∑_u=1^Na_uf(w_u)=c. To this end we prove a representation theorem for such functions f in terms of an associated polynomial p(z). We first introduce the following two operations, (i) substitution of p, and (ii) multiplication by monomials z^j, 0< j < N. Then let M be the module generated by these two operations, acting on functions analytic near 0. We prove that every function f, analytic in a neighborhood of the roots of p, is in M. In fact, this representation of f is unique. To solve the above interpolation problem, we employ an adapted systems theoretic realization, as well as an associated representation of the Cuntz relations (from multi-variable operator theory.) We study these operations in reprodu...
A recursive method for computing interpolants
Journal of Computational and Applied Mathematics, 2008
In this paper, we describe a recursive method for computing interpolants defined in a space spanned by a finite number of continuous functions in R d. We apply this method to construct several interpolants such as spline interpolants, tensor product interpolants and multivariate polynomial interpolants. We also give a simple algorithm for solving a multivariate polynomial interpolation problem and constructing the minimal interpolation space for a given finite set of interpolation points.
Complex Variables and Elliptic Equations, 2015
We introduce the following linear combination interpolation problem (LCI), which in case of simple nodes reads as follows: Given N distinct numbers w 1 ,. .. w N and N + 1 complex numbers a 1 ,. .. , a N and c, find all functions f (z) analytic in an open set (depending on f) containing the points w 1 ,. .. , w N such that N u=1 a u f (w u) = c. To this end we prove a representation theorem for such functions f in terms of an associated polynomial p(z). We give applications of this representation theorem to realization of rational functions and representations of positive definite kernels.
Computation of rational interpolants with prescribed poles
Journal of Computational and Applied Mathematics, 1989
A constructive proof for existence and unicity of the rational R,,, belonging to gM.,v, M > 0, N > 0, having prescribed N poles and interpolating M + 1 Hermite data is given. It is based upon explicit computation of the confluent Cauchy-Vandermonde determinant in terms of the nodes and the poles. An algorithm to compute R,,,(z) is presented. It calculates this value from a triangular field of values of rational interpolants of lowest possible orders. The algorithm is based upon a Neville-Aitken interpolation formula and has arithmetical complexity 0( L*), L := max .
Journal of Approximation Theory, 2008
In a recent paper of the author [A. Sidi, A new approach to vector-valued rational interpolation, J. Approx. Theory 130 (2004) 177-187], three new interpolation procedures for vector-valued functions F(z), where F : C → C N , were proposed, and some of their algebraic properties were studied. One of these procedures, denoted IMPE, was defined via the solution of a linear least-squares problem. In the present work, we concentrate on IMPE, and study its convergence properties when it is applied to meromorphic functions with simple poles and orthogonal vector residues. We prove de Montessus and Koenig type theorems when the points of interpolation are chosen appropriately.
A new approach to the rational interpolation problem
Journal of Computational and Applied Mathematics, 1990
We shall reformulate the classical Newton-Padé rational interpolation problem (NPRIP) to take away several drawbacks of the Newton-Padé approach. A new recursive algorithm, not reordering the interpolation points, will be designed, enabling us to give a parametrization of all solutions, not only for the linearized RIP but also for the proper RIP. This paper generalizes our earlier work where the Padé approximation problem, i.e. when all the interpolation points coincide at the origin, was solved by reformulating it as a minimal partial realization problem (Van Barel 1989), Van Barel and Bultheel, 1989).
Rational interpolation via orthogonal polynomials
Computers & Mathematics With Applications, 1993
Relations between rational interpolants and Hankel matrices are investigated. A modification of a Jacobi-like algorithm for rational interpolation proposed in [l] is developed. The proposed algorithm eliminates all the auxiliary assumptions required to implement the algorithm of [l]. In this way, it can be used to construct all existing rational interpolants with the cost of 0(N2) arithmetic operations where N + 1 is the number of data points.