Padé-Type Approximants of Markov and Meromorphic Functions

We study the question of convergence of Padé and Padé-type approximants to functions meromorphic in a domain. As an example we investigate in detail the case of functions of the formwhereμ(z) is a Markov function.     

A direct approach to convergence of multivariate,nonhomogeneous, Padé approximants

We present a direct approach for proving convergence in measure/product capacity of multivariate, nonhomogeneous, Padé approximants. Previous approaches have involved projection onto Padé-type approximation in one variable, and only yielded convergence in (Lebesgue) measure.     

Convergence of the Nested Multivariate Padé Approximants

The nested multivariate Padé approximants were recently introduced. In the case of two variablesxandy, they consist in applying the Padé approximation with respect to y to the coefficients of the Padé approximation with respect tox. The principal advantage of the method is that the computation only involves univariate Padé approximation. This allows us to obtain uniform convergence where the classical multivariate Padé approximants fail to converge.     

Multivariate Frobenius–Padé approximants: Properties and algorithms

The aim of this paper is to construct rational approximants for multivariate functions given by their expansion in an orthogonal polynomial system. This will be done by generalizing the concept of multivariate Padé approximation. After defining the multivariate Frobenius–Padé approximants, we will be interested in the two following problems: the first one is to develop recursive algorithms for the computation of the value of a sequence of approximants at a given point. The second one is to compute the coefficients of the numerator and denominator of the approximants by solving a linear system. For some particular cases we will obtain a displacement rank structure for the matrix of the system we have to solve. The case of a Tchebyshev expansion is considered in more detail.     

Computing the determinants of matrix Padé approximation

This paper is devoted to a computational problem of two special determinants which appear in the construction of generalized inverse matrix Padé approximants of type [n/2k] for the given power series with matrix coefficients. The main tools to be used are well-known Schur complement theorem and Arnoldi process for skew-symmetric systems.     

Generalized Padé-Type Approximation and Integral Representations

In several complex variables, the multivariate Padé-type approximation theory is based on the polynomial interpolation of the multidimensional Cauchy kernel and leads to complicated computations. In this paper, we replace the multidimensional Cauchy kernel by the Bergman kernel function K (z,x) into an open bounded subset of C ⁿ and, by using interpolating generalized polynomials for K (z,x), we define generalized Padé-type approximants to any f in the space OL ²() of all analytic functions on which are of class L ². The characteristic property of such an approximant is that its Fourier series representation with respect to an orthonormal basis for OL ²() matches the Fourier series expansion of f as far as possible. After studying the error formula and the convergence problem, we show that the generalized Padé-type approximants have integral representations which give rise to the consideration of an integral operator – the so-called generalized Padé-type operator – which maps every f OL ²() to a generalized Padé-type approximant to f. By the continuity of this operator, we obtain some convergence results about series of analytic functions of class L ². Our study concludes with the extension of these ideas into every functional Hilbert space H and also with the definition and properties of the generalized Padé-type approximants to a linear operator of H into itself. As an application we prove a Painlevé-type theorem in C ⁿ and we give two examples making use of generalized Padé-type approximants.     

On two-point Padé-Type and two-Point Padé approximants

Summary Two-point Padé-type approximants are introduced in the case of a non-commutative algebra on a commutative field. Algebraic properties are given and a study of the error of approximation is done. From the relation of the error and some additional properties, two-point Padé approximants are found. Algebraic properties and recurrence relations are proved. The means to compute these approximants in following any way in the table of the approximants are given. The mixed table is introduced, as well as the normality and some results of convergence of two-point Padé-type and Padé approximants.     

A type of matrix Padé approximant inspired by scalar component models

In this paper we define a type of matrix Padé approximant inspired by the identification stage of multivariate time series models considering scalar component models. Of course, the formalization of certain properties in the matrix Padé approximation framework can be applied to time series models and in other fields. Specifically, we want to study matrix Padé approximants as follows: to find rational representations (or rational approximations) of a matrix formal power series, with both matrix polynomials, numerator and denominator, satisfying three conditions: (a) minimum row degrees for the numerator and denominator, (b) an invertible denominator at the origin, and (c) canonical representation (without free parameters).     

Generic approximation of functions by their Padé approximants

In the present article we obtain generic approximations, under sharp conditions, of holomorphic functions on arbitrary open sets by sequences of their Padé approximants. Similar results hold for functions smooth on the boundary of their domain of definition. In addition, the approximation is valid simultaneously with respect to all centers of expansion.     

Some convergence results for the generalized Padé-type approximants

The aim of this paper is to give some convergence results for some sequences of generalized Padé-type approximants. We will consider two types of interpolatory functionals: one corresponding to Langrange and Hermite interpolation and the other corresponding to orthogonal expansions. For these two cases we will give sufficient conditions on the generating functionG(x, t) and on the linear functionalc in order to obtain the convergence of the corresponding sequence of generalized Padé-type approximants. Some examples are given.     

Nuttall-Pommerenke theorems for homogeneous Padé approximants

We investigate Nuttall-Pommerenke theorems for several variable homogeneous Padé approximants using ideas of Goncar, Karlsson and Wallin.     

Two-point Padé approximants for the expansions of Stieltjes functions in real domain

The fundamental inequalities for the sequences of subdiagonal and diagonal one-point Padé approximants to Stieltjes function has been extended to the case of certain two-point Padé approximants. The results can be applied to the theory of inhomogeneous media for calculating the bounds for the effective transport coefficients of two-components heterogeneous materials.     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part I. Maehly Type Approximants

Laurent Padé–Chebyshev rational approximants, A _m (z,z ^–1)/B _n (z,z ^–1), whose Laurent series expansions match that of a given function f(z,z ^–1) up to as high a degree in z,z ^–1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z ^–1)B _n (z,z ^–1) and A _m (z,z ^–1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé–Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé–Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé–Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé–Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent–Chebyshev series on a variety of functions. In part II of this paper [7] Padé–Chebyshev approximants of Clenshaw–Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

A superfast algorithm for multi-dimensional Padé systems

For a vector ofk+1 matrix power series, a superfast algorithm is given for the computation of multi-dimensional Padé systems. The algorithm provides a method for obtaining matrix Padé, matrix Hermite Padé and matrix simultaneous Padé approximants. When the matrix power series is normal or perfect, the algorithm is shown to calculate multi-dimensional matrix Padé systems of type (n ₀,...,n _k ) inO(n · log²n) block-matrix operations, where n=n ₀+...+n _k . Whenk=1 and the power series is scalar, this is the same complexity as that of other superfast algorithms for computing Padé systems. Whenk>1, the fastest methods presently compute these matrix Padé approximants with a complexity ofO(n²). The algorithm succeeds also in the non-normal and non-perfect case, but with a possibility of an increase in the cost complexity.Supported in part by NSERC grant No. A8035.Partially supported by NSERC operating grant No. 6194.     

Rational approximants to symmetric formal Laurent series

Rational approximants, in the Padé sense, to a given formal Laurent series,F(z)= _– c _k z ^k , have been considered by several authors (see [3] for a survey about the different kinds of approximants which can be defined). In this paper, we shall be concerned with symmetric series, that is, when the complex coefficients {c _k } _– ⁺ satisfyc _–k=c _k,k=0, 1,....Making use of Brezinski's approach [1], for Padé-type approximation to a formal power series, rational approximants toF(z) with prescribed poles are obtained, and their algebraic properties considered. These results will allow us to give an alternative approach for the Padé-Chebyshev approximants.     

General order Newton-Padé approximants for multivariate functions

Summary Padé approximants are a frequently used tool for the solution of mathematical problems. One of the main drawbacks of their use for multivariate functions is the calculation of the derivatives off(x ₁, ...,x _p ). Therefore multivariate Newton-Padé approximants are introduced; their computation will only use the value off at some points. In Sect. 1 we shall repeat the univariate Newton-Padé approximation problem which is a rational Hermite interpolation problem. In Sect. 2 we sketch some problems that can arise when dealing with multivariate interpolation. In Sect. 3 we define multivariate divided differences and prove some lemmas that will be useful tools for the introduction of multivariate Newton-Padé approximants in Sect. 4. A numerical example is given in Sect. 5, together with the proof that forp=1 the classical Newton-Padé approximants for a univariate function are obtained.     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part II: Clenshaw–Lord Type Approximants

Laurent–Padé (Chebyshev) rational approximants P _m (w,w ^–1)/Q _n (w,w ^–1) of Clenshaw–Lord type [2,1] are defined, such that the Laurent series of P _m /Q _n matches that of a given function f(w,w ^–1) up to terms of order w ^±(m+n), based only on knowledge of the Laurent series coefficients of f up to terms in w ^±(m+n). This contrasts with the Maehly-type approximants [4,5] defined and computed in part I of this paper [6], where the Laurent series of P _m matches that of Q _n f up to terms of order w ^±(m+n), but based on knowledge of the series coefficients of f up to terms in w ^±(m+2n). The Clenshaw–Lord method is here extended to be applicable to Chebyshev polynomials of the 1st, 2nd, 3rd and 4th kinds and corresponding rational approximants and Laurent series, and efficient systems of linear equations for the determination of the Padé–Chebyshev coefficients are obtained in each case. Using the Laurent approach of Gragg and Johnson [4], approximations are obtainable for all m0, n0. Numerical results are obtained for all four kinds of Chebyshev polynomials and Padé–Chebyshev approximants. Remarkably similar results of formidable accuracy are obtained by both Maehly-type and Clenshaw–Lord type methods, thus validating the use of either.     

A survey of truncation error analysis for Padé and continued fraction approximants

To compute the value of a functionf(z) in the complex domain by means of a converging sequence of rational approximants {f _n(z)} of a continued fraction and/or Padé table, it is essential to have sharp estimates of the truncation error ¦f(z)–f _n(z)¦. This paper is an expository survey of constructive methods for obtaining such truncation error bounds. For most cases dealt with, {f _n(z)} is the sequence of approximants of a continued fractoin, and eachf _n(z) is a (1-point or 2-point) Padé approximant. To provide a common framework that applies to rational approximantf _n(z) that may or may not be successive approximants of a continued fraction, we introduce linear fractional approximant sequences (LFASs). Truncation error bounds are included for a large number of classes of LFASs, most of which contain representations of important functions and constants used in mathematics, statistics, engineering and the physical sciences. An extensive bibliography is given at the end of the paper.Research supported in part by the U.S. National Science Foundation under Grants INT-9113400 and DMS-9302584.     

Numerical approximations and Padé approximants for a fractional population growth model

This paper presents an efficient numerical algorithm for approximate solutions of a fractional population growth model in a closed system. The time-fractional derivative is considered in the Caputo sense. The algorithm is based on Adomian’s decomposition approach and the solutions are calculated in the form of a convergent series with easily computable components. Then the Padé approximants are effectively used in the analysis to capture the essential behavior of the population u(t) of identical individuals.