Computation of limit periodic continued fractions. A survey

Over the last 20 years a large number of algorithms has been published to improve the speed and domain of convergence of continued fractions. In this survey we show that these algorithms are strongly related. Actually, they essentially boil down to two main principles.We also prove some results on asymptotic expansions of tail values of limit periodic continued fractions.Dedicated to Luigi Gatteschi on his seventieth birthdayThis research was partially supported by The Norwegian Research Council and by the HMC project ROLLS, under contract CHRX-CT93-0416.     

Some rules forS(-2k) dipole sums?

Stieltjes conditions and the ratio test provide necessary but not sufficient conditions onS(-2k) dipole sums. If the dipole sums are accurate the associated [n, n –1] Padé approximant provides a better representation of (), the frequency-dependent dipole polarizability, than a truncated series expression and, in addition, should bound () below. It is shown how constraints on the dipole sums effect the form of the [2,1] Padé approximant and an additional constraint is derived that ensures the analyticity of the approximant on 0 < ₁. There then follows a discussion of the reliability of available literature dipole sum values for small molecules containing H, C, N and O.     

Two-point Padé approximants for formal Stieltjes series

We prove that certain two-point Padé approximants occupying the diagonal of the Padé table form monotone sequences of lower and upper bounds uniformly converging to a Stieltjes function. The results can be applied to the theory of inhomogeneous media for the calculation of the bounds on the effective transport coefficients of heterogeneous materials.     

Numerical calculation of domains of analyticity for perturbation theories in the presence of small divisors

We study numerically the complex domains of validity for KAM theory in generalized standard mappings. We compare methods based on Padé approximants and methods based on the study of periodic orbits.     

Analytic approximation of the blow‐up time for nonlinear differential equations by the ADM–Padé technique

We present a new approach to calculate analytic approximations of blow‐up solutions and their critical blow‐up times. Our approach applies the Adomian decomposition–Padé method to quickly and easily compute the critical blow‐up times, which comprises the Adomian decomposition method combined with the Padé approximants technique. We validate our new approach with a variety of numerical examples, including nonlinear ODEs, systems of nonlinear ODEs, and nonlinear PDEs. Furthermore, our new method is shown to be more convenient than prior art that relies on compound discretized algorithms. Copyright © 2013 John Wiley & Sons, Ltd.     

Adomian decomposition method and Padé approximants for solving the Blaszak--Marciniak lattice

The Adomian decomposition method （ADM） and Pade approximants are combined to solve the well-known Blaszak-Marciniak lattice, which has rich mathematical structures and many important applications in physics and mathematics. In some cases, the truncated series solution of ADM is adequate only in a small region when the exact solution is not reached. To overcome the drawback, the Pade approximants, which have the advantage in turning the polynomials approximation into a rational function, are applied to the series solution to improve the accuracy and enlarge the convergence domain. By using the ADM-Pade technique, the soliton solutions of the Blaszak-Marciniak lattice are constructed with better accuracy and better convergence than by using the ADM alone. Numerical and figurative illustrations show that it is a promising tool for solving nonlinear problems.     

Padé-type approximants with orthogonal generating polynomials

The interpolation of the function x → 1/(1 ? xt) generating the series f(t) = ∑^∞_{i = 0}c_itⁱ at the zeros of an orthogonal polynomial with respect to a distribution d α satisfying some conditions will give us a process for accelerating the convergence of f_n(t) = ∑ⁿ_{i = 0}c_itⁱ. Then, we shall see that the polynomial of best approximation of x → 1/(1 ? xt) over some interval or its development in Chebyshev polynomials T_n or U_n are only particular cases of the main theorem.At last, we shall show that all these processes accelerate linear combinations with positive coefficients of totally monotonic and oscillating sequences.     

Quasifractional Approximants in the Theory of Composite Materials

We study the effective heat conductivity of regular arrays of perfectly conducting spheres embedded in a matrix with unit conductivity. Quasifractional approximants allow us to derive an approximate analytical solution, valid for all values of the spheres volume fraction [0, _max] (_max is the maximum volume fraction of a spheres). As a starting point we use a perturbation approach for 0 and an asymptotic solution for _max. Three different spatial arrangements of the spheres, simple cubic, body centred and face centred cubic arrays, are considered. Results obtained give a good agreement with numerical data.     

On type basic hypergeometric orthogonal polynomials

The five parameter family of Koornwinder's multivariable analogues of the Askey-Wilson polynomials is studied with four parameters generically complex. The Koornwinder polynomials form an orthogonal system with respect to an explicit (in general complex) measure. A partly discrete orthogonality measure is obtained by shifting the contour to the torus while picking up residues. A parameter domain is given for which the partly discrete orthogonality measure is positive. The orthogonality relations and norm evaluations for multivariable -Racah polynomials and multivariable big and little -Jacobi polynomials are proved by taking suitable limits in the orthogonality relations for the Koornwinder polynomials. In particular new proofs of several well-known -analogues of the Selberg integral are obtained.

     

A two-dimensional matrix Padé-type approximation in the inner product space

By introducing a bivariate matrix-valued linear functional on the scalar polynomial space, a general two-dimensional (2-D) matrix Padé-type approximant (BMPTA) in the inner product space is defined in this paper. The coefficients of its denominator polynomials are determined by taking the direct inner product of matrices. The remainder formula is developed and an algorithm for the numerator polynomials is presented when the generating polynomials are given in advance. By means of the Hankel-like coefficient matrix, a determinantal expression of BMPTA is presented. Moreover, to avoid the computation of the determinants, two efficient recursive algorithms are proposed. At the end the method of BMPTA is applied to partial realization problems of 2-D linear systems.