A de Montessus Type Convergence Study for a Vector-Valued Rational Interpolation Procedure of Epsilon Class
Avram Sidi

TL;DR
This paper investigates the convergence properties of the ITEA vector-valued rational interpolation method for meromorphic functions with simple poles, establishing de Montessus and König type theorems similar to previous methods.
Contribution
It extends convergence analysis and proves de Montessus and König type theorems for the ITEA interpolation procedure, complementing prior work on IMPE and IMMPE methods.
Findings
Proves de Montessus type convergence theorem for ITEA.
Establishes König type convergence results for ITEA.
Demonstrates convergence properties for meromorphic functions with simple poles.
Abstract
In a series of recent publications of the author, three interpolation procedures, denoted IMPE, IMMPE, and ITEA, were proposed for vector-valued functions , where , and their algebraic properties were studied. The convergence studies of two of the methods, namely, IMPE and IMMPE, were also carried out as these methods are being applied to meromorphic functions with simple poles, and de Montessus and K\"{o}nig type theorems for them were proved. In the present work, we concentrate on ITEA. We study its convergence properties as it is applied to meromorphic functions with simple poles, and prove de Montessus and K\"{o}nig type theorems analogous to those obtained for IMPE and IMMPE.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A de Montessus Type Convergence Study for a Vector-Valued Rational Interpolation Procedure of Epsilon Class
Avram Sidi
Computer Science Department
Technion - Israel Institute of Technology
Haifa 32000, Israel
E-mail: [email protected]
http://www.cs.technion.ac.il/~asidi
(January 2017)
Abstract
In a series of recent publications of the author, three interpolation procedures, denoted IMPE, IMMPE, and ITEA, were proposed for vector-valued functions , where F:\mbox{\mathbb{C}}\to\mbox{\mathbb{C}}^{N}, and their algebraic properties were studied. The convergence studies of two of the methods, namely, IMPE and IMMPE, were also carried out as these methods are being applied to meromorphic functions with simple poles, and de Montessus and König type theorems for them were proved. In the present work, we concentrate on ITEA. We study its convergence properties as it is applied to meromorphic functions with simple poles, and prove de Montessus and König type theorems analogous to those obtained for IMPE and IMMPE.
Mathematics Subject Classification 2000: 30E10, 30E15, 41A20, 41A25.
Keywords and expressions: Vector-valued rational interpolation; Hermite interpolation; Newton interpolation formula; de Montessus theorem; König theorem
1 Introduction and background
In [4], the author developed three rational interpolation methods for vector-valued functions of a complex variable. These methods were denoted IMPE, IMMPE, and ITEA. Some of the algebraic properties of these methods were already presented in [4] while others were explored in [5], where it was also shown that the methods are symmetric functions of the points of interpolation and that they reproduce vector-valued rational functions exactly. In [6], [7], and [8], de Montessus and König type convergence theories for IMMPE and IMPE, as these methods are applied to vector-valued meromorphic functions with simple poles, were presented. In this work, we treat the convergence properties of ITEA, as it is being applied to the same class of functions, and we prove de Montessus and König type theorems analogous to those for IMPE and IMMPE. As will become clear, following some necessary adjustments, the techniques of [6] that were developed for analyzing IMMPE, will be directly applicable when analyzing ITEA.
2 Review of the algebraic properties of ITEA
To set the stage for later developments, and to fix the notation as well, we start with a brief description of the developments in [4] and [5].
Let be a complex variable and let be a vector-valued function such that F:\mbox{\mathbb{C}}\to\mbox{\mathbb{C}}^{N}. Assume that is defined on a bounded open set \Omega\subset\mbox{\mathbb{C}} and consider the problem of interpolating at some of the points in this set. We do not assume that the are necessarily distinct. The general picture is described in the next paragraph:
Let be distinct complex numbers, and order the such that
[TABLE]
Let be the vector-valued polynomial (of degree at most ) that interpolates at the points in the generalized Hermite sense. Thus, in Newtonian form, this polynomial is given as in (see, e.g., Stoer and Bulirsch [9, Chapter 2] or Atkinson [1, Chapter 3])
[TABLE]
Here, is the divided difference of order of over the set of points . Obviously, are all vectors in \mbox{\mathbb{C}}^{N}.
Let us define the scalar polynomials via
[TABLE]
Let us also define the vectors via
[TABLE]
With this notation, we can rewrite (2.2) in the form
[TABLE]
Then the vector-valued rational function from ITEA that interpolates at in the sense of Hermite is defined as in
[TABLE]
the scalars being determined by the requirement
[TABLE]
where is an inner product and is some fixed nonzero vector in \mbox{\mathbb{C}}^{N}. Clearly, (2.7) results in the linear system
[TABLE]
a unique solution for which exists provided
[TABLE]
Combining (2.6) and (2.8), we obtain the following determinant representation for from ITEA, with , , :
[TABLE]
Here, the numerator determinant is vector-valued and is defined by its expansion with respect to its first row. That is, if is the cofactor of the term in the denominator determinant , then
[TABLE]
[Note that this determinant representation offers a very effective tool for the algebraic and analytical study of . As we will see later in this work, it forms the basis of our convergence study.]
From (2.6) and (2.7), it is clear that the number of function evaluations [namely, (i) in case the are distinct and (ii) and some of its derivatives otherwise] that are needed to determine is , and these are based on . [This should be contrasted with the interpolants that result from IMPE and IMMPE, which need function evaluations based on .]
Remarks:
from ITEA interpolates at in the sense of Hermite, provided for all 2. 2.
Note that , even with arbitrary in (2.6), interpolates at in the sense of Hermite, provided for all However, the quality of as an approximation to in the -plane depends heavily on how the are chosen. Thus, the methods IMPE, IMMPE, and ITEA choose the in special ways; as we have shown in [6], [7], and [8], the methods IMPE and IMMPE do provide very good approximations for meromorphic functions . Here we prove that ITEA does too.
We end this section by stating four algebraic properties of ITEA. Of these, the first three were explored in [5], while the forth is new:
Limiting property: When all tend to [math] simultaneously, it follows from the equations in (2.8) that tends to the approximant from the method STEA of Sidi [3] as the latter is being applied to the Maclaurin series of .111STEA approximants are obtained by applying the topological epsilon algorithm (TEA) of Brezinski [2] to the sequence of partial sums of the Maclaurin series of . Here . 2. 2.
Symmetry property: The denominator polynomial is a symmetric function of , which go into its construction. itself is a symmetric function of .222A function is symmetric in if for every permutation of . 3. 3.
Reproducing property: If is a vector-valued rational function with degree of numerator at most and degree of denominator equal to and if , are all defined, then . 4. 4.
Projection property: In addition to interpolating at also has the following projection property:
[TABLE]
Because ITEA and IMMPE, in producing the relevant , differ substantially (i) in the number of the they use and (ii) in the structure of the relevant scalars , it seems that their analyses should be different from each other. Fortunately, in this work, we are able to overcome these obstacles and apply to ITEA the techniques used for analyzing IMMPE, following some clever adjustments.
To keep things simple, in the sequel, we adopt the notation of [6], where we treated IMMPE. In order not to repeat the arguments of [6] unnecessarily, we will keep our treatment of ITEA short and will refer the reader to [6] for technical details.
3 Technical preliminaries and error formula when is a vector-valued rational function
We start our study of ITEA for the case in which the function is a vector-valued rational function with simple poles, namely,
[TABLE]
where is an arbitrary vector-valued polynomial, are distinct points in the complex plane, and are some nonzero vectors in \mbox{\mathbb{C}}^{N}.
3.1 Technical preliminaries
The following technical tools that were used in [6] will be used throughout this work too.
Lemma 3.1** ([6], Lemma 3.2)**
Let , with , and let , be arbitrary complex numbers. Then
[TABLE]
where
[TABLE]
is a Vandermonde determinant.
Lemma 3.2** ([6], Lemma 3.3)**
Let . Then, , the divided difference of over the set of points , is given by
[TABLE]
This is true whether the are distinct or not.
Lemma 3.3** ([6], Lemma 3.4)**
Let be given as in (3.1). Let . Then, the following are true whether the are distinct or not:
- (i)
* is given as in*
[TABLE]
Therefore, we also have
[TABLE]
- (ii)
* is given as in*
[TABLE]
3.2 Error formula
Using (2.10), (2.11), and (3.6), we can derive a determinant representation for the error as in the next lemma:
Lemma 3.4** ([6], Lemma 3.5)**
Let
[TABLE]
Then the error in has the determinant representation
[TABLE]
where
[TABLE]
We next specialize Lemma 3.3 to suit the error formula for ITEA:
Lemma 3.5
Let . Define
[TABLE]
Then the following are true whether the are distinct or not:
- (i)
* is given as in*
[TABLE]
Therefore, we also have
[TABLE]
- (ii)
As for in (3.7), we have
[TABLE]
Comparing in (3.10), in (3.12), and in (3.13) with the analogous quantities for IMMPE in [6], we realize that they have the same algebraic structure.333Note that the error formula for in case of IMMPE is precisely of the form given in (3.7)–(3.9) of Lemma 3.4, but with different , , and ; namely, (i) , (ii) with , and (iii) with . See [6]. Therefore, we can now apply the techniques of [6] verbatim, subject to suitable conditions having to do with ITEA.
3.3 Algebraic structures of , , and
Below, we recall that is as in (3.10), and are as in (3.12), and and are as in (3.13). Applying Theorems 3.6, 3.7, and 3.8 of [6] verbatim to , , and , respectively, we have the following:
Theorem 3.6** ([6], Theorem 3.6)**
Let be the vector-valued rational function in (3.1), and precisely as described in the first paragraph of this section, with the notation therein. Define
[TABLE]
Then, with ,
[TABLE]
Theorem 3.7** ([6], Theorem 3.7)**
Let be the vector-valued rational function in (3.1), and precisely as described in the first paragraph of this section, with the notation therein. With and as in (3.12), and as in (3.13), define
[TABLE]
Then, with , we have
[TABLE]
Finally, combining (3.15) and (3.17) in (3.8), we obtain a simple and elegant expression for . This is the subject of the following theorem.
Theorem 3.8** ([6], Theorem 3.8)**
For the error in , with , we have the closed-form expression
[TABLE]
Remark: When in Theorem 3.8, the summation in the numerator on the right-hand side of (3.18) is empty. Thus, this theorem provides an independent proof of the reproducing property of ITEA when has only simple poles.
4 Preliminaries for convergence theory
Let be a closed and bounded set in the -plane, whose complement , including the point at infinity, has a classical Green’s function with a pole at infinity, which is continuous on , the boundary of , and is zero on . For each , let be the locus , and let denote the interior of . Then, is the interior of and, for , there holds
For each let
[TABLE]
be the set of interpolation points used in constructing the ITEA interpolant . Assume that the sets are such that have no limit points in and
[TABLE]
uniformly in on every compact subset of , where is the logarithmic capacity of defined by
[TABLE]
Such sequences \big{\{}\xi^{(p)}_{1},\xi^{(p)}_{2},\ldots,\xi^{(p)}_{p+k}\big{\}}, exist, see Walsh [10, p. 74]. Note that, in terms of , the locus is defined by for , while is simply the locus .
Recalling that \prod^{p+k}_{i=1}\big{(}z-\xi^{(p)}_{i}\big{)}=\Psi_{p}(z) [see (3.10)], we can write (4.2) also as in
[TABLE]
uniformly in on every compact subset of .444Note that the definition of for ITEA given in (4.2) and (4.3) is of the same form as the definition of for IMMPE, but the two differ; for IMMPE, \lim_{p\to\infty}\big{|}\prod^{p+1}_{i=1}\big{(}z-\xi^{(p)}_{i}\big{)}\big{|}^{1/p}=\lim_{p\to\infty}\big{|}\Psi_{p}(z)\big{|}^{1/p}=\kappa\Phi(z), where as usual.
It is clear that
[TABLE]
5 Convergence theory for vector-valued rational with simple poles
In this section, we provide a convergence theory, in case is a vector-valued rational function with simple poles as in (3.1), for the sequences with and fixed. [Note that by the reproducing property mentioned in Section 1, for , for all , where is the degree of the numerator of .] Also, as we will let in our analysis, the condition that , which is necessary for Theorem 3.6, 3.7, and 3.8, is satisfied for all large .
We continue to use the notation of the preceding sections. We now turn to in (3.1). We assume that is analytic in . This implies that its poles are all in . Now we order the poles of such that
[TABLE]
By (4.4), if and are two different poles of , and then and lie on two different loci and . In addition, , that is, the set is in the interior of .
5.1 Convergence analysis for
We now state a König-type convergence theorem for and another theorem concerning its zeros. Since all our results eventually rely on the assumption that , we start by exploring the minimal conditions under which this assumption may hold for ITEA:
Lemma 5.1
* is of the form*
[TABLE]
Proof. Invoking [see (3.12)] in (3.14), and letting for simplicity of notation, we have
[TABLE]
which, upon factoring out , becomes
[TABLE]
where
[TABLE]
Now, is a monic polynomial of degree , . Therefore, after permuting the rows of the determinant suitably, we can apply Lemma 3.1, and obtain
[TABLE]
This completes the proof.
Remark: Judging from (5.3)–(5.5), we may be led to believe that is actually a function of . The result in (5.2) shows that it is independent of , and this is quite surprising.
Theorem 5.2 that follows concerns the convergence of as .
Theorem 5.2** (see [6], Theorem 5.1)**
Assume
[TABLE]
in addition to (5.1). In case we define . Assume also that
[TABLE]
Consequently,
[TABLE]
and there holds
[TABLE]
uniformly in every compact subset of \mbox{\mathbb{C}}\setminus\{z_{1},z_{2},\ldots,z_{k}\}, where
[TABLE]
Thus, with the normalization that , and letting
[TABLE]
there holds
[TABLE]
from which we also have
[TABLE]
Theorem 5.2 implies that has precisely zeros that tend to those of . Let us denote the zeros of by , Then , In the next theorem, we provide the rate of convergence of each of these zeros.
Theorem 5.3** ([6], Theorem 5.2)**
Under the conditions of Theorem 5.2, there holds
[TABLE]
with as in (5.11). From this, it follows that
[TABLE]
In case in (5.7), that is,
[TABLE]
and assuming that , we have the more refined result
[TABLE]
5.2 Convergence analysis for
We now develop a de Montessus type convergence theory for the ; that is, we analyze the error as with being held fixed.
We start by showing that the vectors are (i) meromorphic in with simple poles at the and (ii) bounded for all large . This is the subject of the lemma that follows.
Lemma 5.4
For , is analytic in and bounded for all large .
Proof. Expanding the vector-valued determinant in (3.16) with respect to its first row, we obtain
[TABLE]
where
[TABLE]
By Lemma 5.1, are all scalars independent of . In addition, are bounded in since are bounded due to the assumption that the have no limit points in , and is a fixed integer. This completes the proof.
We make use of Lemma 5.4 in the proof of Theorem 5.5 that follows. Throughout the rest of this work, denotes the vector norm of Y\in\mbox{\mathbb{C}}^{N}.
Theorem 5.5** (see [6], Theorem 5.3)**
Under the conditions of Theorem 5.2, exists and is unique and satisfies
[TABLE]
uniformly on every compact subset of \mbox{\mathbb{C}}\setminus\{z_{1},\ldots,z_{\mu}\}, with as defined in (5.11). From this, it also follows that
[TABLE]
uniformly on each compact subset of and
[TABLE]
uniformly on . Thus, uniform convergence takes place for in any compact subset of the set , where
[TABLE]
When in (5.7), that is, when
[TABLE]
and in addition to (5.9), we have the more refined result
[TABLE]
and is bounded for all large .
6 Convergence theory for general meromorphic with simple poles
Let the sets of interpolation points be as in the preceding section. We now turn to the convergence analysis of as , when the function is analytic in and meromorphic in , where as before, is the locus for some . Assume that has simple poles in . Thus, has the following form:
[TABLE]
being analytic in .
The treatment of this case is based entirely on that of the preceding section, the differences being minor. Note that the polynomial of (3.1) is now replaced by in (6.1). Previously, we had for all large , as a consequence of which, we had (3.12) for and (3.13) for . Instead of these, we now have
[TABLE]
with as in (3.12), and
[TABLE]
with as in (3.13).
It is clear that the treatment of the general meromorphic will be the same as that of the rational provided the contributions from to and , as , are negligible compared to the rest of the terms in (6.2) and (6.3). This is indeed the case, as is shown in [6, Lemma 6.1]:
Lemma 6.1** ([6], Lemma 6.1)**
With as in the first paragraph, there holds
[TABLE]
There also holds
[TABLE]
uniformly in every compact subset of These hold for all and .
With this information, we can now prove convergence results for and for general meromorphic . We recall that the poles of are ordered such that
[TABLE]
We also adopt the notation of Theorems 5.2, 5.3, and 5.5.
Theorem 6.2** (see [6], Theorem 6.2)**
(i)* When , assume that*
[TABLE]
in addition to (6.6). Assume also that
[TABLE]
Consequently,
[TABLE]
Then, all the results of Theorem 5.2 hold.
(ii)* When ,*
[TABLE]
uniformly on every compact subset of \mbox{\mathbb{C}}\setminus\{z_{1},\ldots,z_{\mu}\}.
Theorem 6.2 implies that has precisely zeros that tend to those of . Let us denote the zeros of by , Then , In the next theorem, we provide the rate of convergence of each of these zeros.
Theorem 6.3** ([6], Theorem 6.3)**
Assume the conditions of Theorem 5.3.
(i)* When , all the results of Theorem 5.3 hold.*
(ii)* When ,*
[TABLE]
Our next and last result concerns the convergence of :
Theorem 6.4** ([6], Theorem 6.4)**
Assume the conditions of Theorem 5.5. Then exists and is unique.
(i)* When , all the results of Theorem 5.5 hold with .*
(ii)* When , there holds*
[TABLE]
uniformly on each compact subset of and
[TABLE]
uniformly on .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K.E. Atkinson. An Introduction to Numerical Analysis . John Wiley & Sons Inc., New York, second edition, 1989.
- 2[2] C. Brezinski. Généralisations de la transformation de Shanks, de la table de Padé, et de l’ ϵ italic-ϵ \epsilon -algorithme. Calcolo , 12:317–360, 1975.
- 3[3] A. Sidi. Rational approximations from power series of vector-valued meromorphic functions. J. Approx. Theory , 77:89–111, 1994.
- 4[4] A. Sidi. A new approach to vector-valued rational interpolation. J. Approx. Theory , 130:177–187, 2004.
- 5[5] A. Sidi. Algebraic properties of some new vector-valued rational interpolants. J. Approx. Theory , 141:142–161, 2006.
- 6[6] A. Sidi. A de Montessus type convergence study for a vector-valued rational interpolation procedure. Israel J. Math. , 163:189–215, 2008.
- 7[7] A. Sidi. A de Montessus type convergence study of a least-squares vector-valued rational interpolation procedure. J. Approx. Theory , 155:75–96, 2008.
- 8[8] A. Sidi. A de Montessus type convergence study of a least-squares vector-valued rational interpolation procedure II. Comput. Methods Funct. Theory , 10:223–247, 2010.
