Kronecker type theorems,normality and continuity of the multivariate Padé operator

Summary. For univariate functions the Kronecker theorem, stating the equivalence between the existence of an infinite block in the table of Padé approximants and the approximated function being rational, is well-known. In [Lubi88] Lubinsky proved that if is not rational, then its Padé table is normal almost everywhere: for an at most countable set of points the Taylor series expansion of is such that it generates a non-normal Padé table. This implies that the Padé operator is an almost always continuous operator because it is continuous when computing a normal Padé approximant [Wuyt81]. In this paper we generalize the above results to the case of multivariate Padé approximation. We distinguish between two different approaches for the definition of multivariate Padé approximants: the general order one introduced in [Levi76, CuVe84] and the so-called homogeneous one discussed in [Cuyt84]. Received December 19, 1994     

Asymptotic Uniqueness of Best Rational Approximants of Given Degree to Markov Functions in L 2 of the Circle

We improve over a sufficient condition given in [8] for uniqueness of a nondegenerate critical point in best rational approximation of prescribed degree over the conjugate-symmetric Hardy space of the complement of the disk. The improved condition connects to error estimates in AAK approximation, and is necessary and sufficient when the function to be approximated is of Markov type. For Markov functions whose defining measure satisfies the Szego condition, we combine what precedes with sharp asymptotics in multipoint Padé approximation from [43], [40] in order to prove uniqueness of a critical point when the degree of the approximant goes large. This lends perspective to the uniqueness issue for more general classes of functions defined through Cauchy integrals.     

An algorithm for the quadratic approximation

The quadratic approximation is a three dimensional analogue of the two dimensional Padé approximation. A determinantal expression for the polynomial coefficients of the quadratic approximation is given. A recursive algorithm for the construction of these coefficients is derived. The algorithm constructs a table of quadratic approximations analogous to the Padé table of rational approximations.     

Rational approximation of analytic functions

The paper provides an overview of the author’s contribution to the theory of constructive rational approximations of analytic functions. The results presented are related to the convergence theory of Padé approximants and of more general rational interpolation processes, which significantly expand the classical theory’s framework of continuous fractions, to inverse problems in the theory of Padé approximants, to the application of multipoint Padé approximants (solutions of Cauchy-Jacobi interpolation problem) in explorations connected with the rate of Chebyshev rational approximation of analytic functions and to the asymptotic properties of Padé-Hermite approximation for systems of Markov type functions.     

Lower bounds for linear forms in values of certain hypergeometric functions

By using Padé approximations of the first kind, a lower bound for the modulus of a linear form with integer coefficients in the values of certain hypergeometric functions at a rational point are obtained. This estimate depends on all the coefficients of the linear form. Translated fromMatematicheskie Zametki, Vol. 67, No. 3, pp. 441–451, March, 2000.     

Lower bound for a linear form

By using Padé approximations of the first kind, we obtain a lower bound for the absolute value of a linear form with integer coefficients from the values of polylogarithmic functions at rational points. This estimate takes into account the growth of all coefficients of the linear form. Translated fromMatematicheskie Zametki, Vol. 66, No. 4, pp. 617–623, October, 1999.     

Continued fractions as the best tool to estimate the padé approximant errors

For a Stieltjes functions the problems of the Padé polinomial constructions and the analysis of the Padé approximant errors by continued fractions are investigated. Reprinted fromMatematichni Metodi ta Fiziko-Mekhanichni Polya, Vol. 39, No. 2, 1996, pp. 84–88.     

Generalized Padé-type approximants to continuous functions

Summary We define generalized Padé-type approximants to continuous functions on a compact subset Eof Rⁿsatisfying the Markov's inequality and we show that the Fourier series expansion of a generalized Padé-type approximant to a u ∈ C ^∞(E ) matches the Fourier series expansion of uas far as possible. After studying the errors, we give integral representations and an answer to the convergence problem of a generalized Padé-type approximation sequence.     

On the Froissart phenomenon in multivariate homogeneous Padé approximation

In univariate Padé approximation we learn from the Froissart phenomenon that Padé approximants to perturbed Taylor series exhibit almost cancelling pole–zero combinations that are unwanted. The location of these pole–zero doublets was recently characterized for rational functions by the so‐called Froissart polynomial. In this paper the occurrence of the Froissart phenomenon is explored for the first time in a multivariate setting. Several obvious questions arise. Which definition of Padé approximant is to be used? Which multivariate rational functions should be investigated? When considering univariate projections of these functions, our analysis confirms the univariate results obtained so far in [13], under the condition that the noise is added after projection. At the same time, it is apparent from section 4 that for the unprojected multivariate Froissart polynomial no conjecture can be formulated yet.

     

Introduction to the improved functional epsilon algorithm

This paper introduces the improved functional epsilon algorithm. We have defined this new method in principle of the modified Aitken Δ² algorithm. Moreover, we have found that the improved functional epsilon algorithm has remarkable precision of the approximation of the exact solution and there exists a relationship with the integral Padé approximant. The use of the improved functional epsilon algorithm for accelerating the convergence of sequence of functions is demonstrated. The relationship of the improved functional epsilon algorithm with the integral Padé approximant is also demonstrated. Moreover, we illustrate the similarity between the integral Padé approximant and the modified Aitken Δ² algorithm; thus we have shown that the integral Padé approximant is a natural generalisation of modified Aitken Δ² algorithm.     

Two Families of Approximation Schemes for Delay Systems

Based on the Trotter-Kato approximation theorem for strongly continuous semigroups we develop a general framework for the approximation of delay systems. Using this general framework we construct two families of concrete approximation schemes. Approximation of the state is done by functions which are piecewise polynomials on a mesh (m-th order splines of deficiency m). For the two families we also prove convergence of the adjoint semigroups and uniform exponential stability, properties which are essential for approximation of linear quadratic control problems involving delay systems. The characteristic matrix of the delay system is in both cases approximated by matrices of the same structure but with the exponential function replaced by approximations where Padé fractions in the main diagonal resp. in the diagonal below the main diagonal of the Padé table for the exponential function play an essential role.     

Equiconvergence in rational approximation of meromorphic functions

Generalizing the Walsh theorem, E. B. Saff, A. Sharma, and R. S. Varga showed that there is a close relation between the rational interpolants in roots of unity and Padé approximants of certain meromorphic functions. The purpose of this paper is to extend this result, replacing the Padé approximant with other rational functions so as to obtain a larger region of equiconvergence.     

Rational approximation to harmonic functions

Padé-type approximation is the rational function analogue of Taylor’s polynomial approximation to a power series. A general method for obtaining Padé-type approximants to Fourier series expansions of harmonic functions is defined. This method is based on the Newton-Cotes and Gauss quadrature formulas. Several concrete examples are given and the convergence behavior of a sequence of such approximants is studied. This revised version was published online in June 2006 with corrections to the Cover Date.     

Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part I. Maehly type approximants

Laurent Padé-Chebyshev rational approximants,A _m (z,z ⁻¹)/B _n (z, z ⁻¹), whose Laurent series expansions match that of a given functionf(z,z ⁻¹) up to as high a degree inz, z ⁻¹ 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 off up to degreem+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions betweenf(z,z ⁻¹)B _n (z, z ⁻¹)). The derivation was relatively simple but required knowledge of Chebyshev coefficients off up to degreem+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 degreem in the numerator andn in the denominator, is matched to the Chebyshev series up to terms of degreem+n, based on knowledge of the Chebyshev coefficients up to degreem+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.     

On nonstandard Padé approximants suitable for effective properties of two-phase composite materials

This article investigates the existence of the nonstandard Padé approximants introduced by Cherkaev and Zhang [D.-L. Zhang and E. Cherkaev, Reconstruction of spectral function from effective permittivity of a composite material using rational function approximations, J. Comput. Phys. 228 (2009), pp. 5390–5409] for approximating the spectral function of composites from effective properties at different frequencies. The spectral functions contain information on microstructure of composites. Since this reconstruction problem is ill-posed Cherkaev [Inverse homogenization for evaluation of effective properties of a mixture, Inverse Probl. 17 (2001), pp. 1203–1218], the well-performed Padé approach is noteworthy and deserves further investigations. In this article, we validate the assumption that the effective dielectric component of interest of all two-phase composites can be approximated by Padé approximants whose denominator has nonzero power one term. We refer to this as the nonstandard Padé approximant, in contrast to the standard approximants whose denominators have nonzero constant terms. For composites whose spectral function assumes infinitely many different values such as the checkerboard microstructure, the proof is carried by using classical results for Markov–Stieltjes functions (also referred to as Stieltjes functions) Golden and Papanicolaou [Bounds on effective parameters of heterogeneous media by analytic continuation, Commun. Math. Phys. 90 (1983), pp. 473–491] and Cherkaev and Ou [De-homogenization: Reconstruction of moments of the spectral measure of the composite, Inverse Probl. 24 (2008), p. 065008]. However, it is well-known that spectral functions for microstructure such as rank-n laminates assume only finitely many different values, i.e. the measure in the Markov–Stieltjes function is supported at only finitely many points. For this case, we cannot find any existence results for nonstandard Padé approximants in the literature. The proof for this case is the focus of this article. It is done by utilizing a special product decomposition of the coefficient matrix of the Padé system. The results in this article can be considered as an extension of the Padé theory for Markov–Stieltjes functions whose spectral function take infinitely many different values to those taking only finitely many values. In the literature, the latter is usually excluded from the definition of Markov–Stieltjes functions because they correspond to rational functions, hence convergence of their Padé approximants is trivial. However, from an inverse problem point of view, we need to assure both the existence and convergence of the nonstandard Padé approximants, for all microstructures. The results in this article provide a mathematical foundation for applying the Padé approach for reconstructing the spectral functions of composites whose microstructure is not a priori known.     

High-order differential approximants

We introduce a new form of differential approximant for the summation of power series. The method is a special type of Padé–Hermite approximant. It consists of a high-order linear differential equation with polynomial coefficients that is satisfied approximately by the partial sum of the power series. This method is able to reproduce the polylogarithmic functions exactly. Numerical evidence suggests that this is currently one of the best methods of singularity analysis for many problems.     

Analytic continuation by reproducing kernel methods combined with Padé approximations

The analytic continuation of power series is an old problem attacked by various methods, a notable one being the Padé approximant. Although quite powerful in some cases, the Padé approximant suffers sometimes from being a non-linear transformation. The linearity is useful whenever the coefficients of the Taylor developments are themselves functions of another complex variable. There are well-known linear transformations that improve convergence and their connection with some conformal mapping was discovered long ago, although not always appreciated. The present paper endeavours to extend the applicability of such methods by means of reproducing kernels. A general and flexible analytic continuation method — which does not have the drawback of limiting processes — is outlined, shown to encompass other existing procedures and to be potentially a strong competitor to the Padé approximant. The dynamic polarizability of hydrogen is shown as a numerical example.     

A note on evaluation of coefficients in the polynomials of Padé approximants by solving systems of linear equations

This is a sequel to my previous paper concerning the determination of the coefficients in the polynomials which define Padé fractions, where the coefficients are found by solving systems of linear equations. The present note uses the same models and computer as before, but the computations are far more extensive so as to reveal more pointedly the effects of round off error in the coefficients as the order of the system increases. Only the main diagonal Padé entries are studied numerically. The numerics are achieved using two routines in LINPACK one of which evaluates a condition number for the matrix. This is advantageous if one suspects ill conditioning. In our previous paper, it was shown that though the relative errors in the numerator and denominator polynomials increase as the order of the system increases, the effect on the Padé approximant is virtually nil at least for the size of the variable x and the order n considered. Of course, ultimately so as to render the without bound, we should expect so much contamination due to round off so as to render the results meaningless. All of this is illustrated with numerics. Heuristic procedures based on the numerical data developed are presented to warn of deterioration due to round off.     

Nevanlinna theory, diophantine approximation, and numerical analysis

This article treats the problem of the approximation of an analytic function f on the unit disk by rational functions having integral coefficients, with the goodness of each approximation being judged in terms of the maximum of the absolute values of the coefficients of the rational function. This relates to the more usual approximation by a rational function in that it could imply how many decimal places are needed when applying a particularly good rational function approximation having non-integrad coefficients. It is shown how to obtain “good” approximations of this type and it is also shown how under certain circumstances “very good” bounds are not possible. As in diophantine approximation this means that many merely “good” approximations do exist, which may be the preferable case. The existence or nonexistence of “very good” approximations is closely related to the diophantine approximation of the first nonzero power series coefficient of at z=0. Nevanlinna theory methods are used in the proofs.