Multivariate Two-Point Padé-Type and Two-Point Padé Approximants

In his paper the notions of two-point Padé-type and two-point Padé approximants are generalized for multivariate functions, with a generating denominator polynomial of general form. The multivariate two-point Padé approximant can be expressed as a ratio of two determinants and computed recursively using the E-algorithm. A comparison is made with previous definitions by other authors using particular generating denominator polynomials. The last section contains some convergence results.     

Padé polynomial asymptotics from a singular integral equation

We derive a singular integral equation satisfied by the remainder function associated with the polynomials forming a diagonal Padé approximant. From this equation, the asymptotic behavior of the high-order polynomials is deduced for certain classes of functions being approximated.Communicated by Edward B. Saff.     

Best choice of the pole for the Padé-type approximant of a Stieltjes function

The aim of this paper is to use Eiermann's theorem to define precisely good poles for the Padé-type approximant of a certain class of functions. Stieltjes functions whose measure has a compact support or functions with a finite number of real singularities are the main examples of this study. The case of an approximant with one multiple pole is completely studied. The case of two poles is considered. Some numerical experiments have been done, showing that the results, obtained by majorization, seem optimal.     

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.     

Function-valued Padé-type approximant via the formal orthogonal polynomials and its applications in solving integral equations

A kind of function-valued Padé-type approximant via the formal orthogonal polynomials (FPTAVOP) is introduced on the polynomial space and an algorithm is sketched by means of the formal orthogonal polynomials. This method can be applied to approximate characteristic values and the corresponding characteristic function of Fredholm integral equation of the second kind. Moreover, theoretical analyses show that FPTAVOP method is the most effective one for accelerating the convergence of a sequence of functions. In addition, a typical numerical example is presented to illustrate when the estimates of characteristic value and characteristic function by using this new method are more accurate than other methods.     

Multivariate Padé approximants revisited

Several definitions of multivariate Padé approximants have been introduced during the last decade. We will here consider all types of definitions based on the choice that the coefficients in numerator and denominator of the multivariate Padé approximant are defined by means of a linear system of equations. In this case a determinant representation for the multivariate Padé approximant exists. We will show that a general recursive algorithm can be formulated to compute a multivariate Padé approximant given by any definition of this type. Here intermediate results in the recursive computation scheme will also be multivariate Padé approximants. Up to now such a recursive computation of multivariate Padé approximants only seemed possible in some special cases.     

The modified algorithm for the differential transform method to solution of Genesio systems

In this article, approximate analytical solution of chaotic Genesio system is acquired by the modified differential transform method (MDTM). The differential transform method (DTM) is mentioned in summary. MDTM can be obtained from DTM applied to Laplace, inverse Laplace transform and Padé approximant. The MDTM is used to increase the accuracy and accelerate the convergence rate of truncated series solution getting by the DTM. Results are given with tables and figures.     

Computing the Matrix Cosine

An algorithm is developed for computing the matrix cosine, building on a proposal of Serbin and Blalock. The algorithm scales the matrix by a power of 2 to make the -norm less than or equal to 1, evaluates a Padé approximant, and then uses the double angle formula cos(2A)=2cos(A)²–I to recover the cosine of the original matrix. In addition, argument reduction and balancing is used initially to decrease the norm. We give truncation and rounding error analyses to show that an [8,8] Padé approximant produces the cosine of the scaled matrix correct to machine accuracy in IEEE double precision arithmetic, and we show that this Padé approximant can be more efficiently evaluated than a corresponding Taylor series approximation. We also provide error analysis to bound the propagation of errors in the double angle recurrence. Numerical experiments show that our algorithm is competitive in accuracy with the Schur–Parlett method of Davies and Higham, which is designed for general matrix functions, and it is substantially less expensive than that method for matrices of -norm of order 1. The dominant computational kernels in the algorithm are matrix multiplication and solution of a linear system with multiple right-hand sides, so the algorithm is well suited to modern computer architectures.     

A rational Lanczos algorithm for model reduction

This paper presents a model reduction method for large-scale linear systems that is based on a Lanczos-type approach. A variant of the nonsymmetric Lanczos method, rational Lanczos, is shown to yield a rational interpolant (multi-point Padé approximant) for the large-scale system. An exact expression for the error in the interpolant is derived. Examples are utilized to demonstrate that the rational Lanczos method provides opportunities for significant improvements in the rate of convergence over single-point Lanczos approaches.     

A split-step finite difference method for nonparaxial nonlinear Schrödinger equation at critical dimension

The critical nonlinear Schrödinger equation (NLS) is the model equation for propagation of laser beam in bulk Kerr medium. One of the final stages in the derivation of NLS from the nonlinear Helmholtz equation (NLH) is to apply paraxial approximation. However, there is numerical evidence suggesting nonparaxiality prevents singularity formation in the solutions of NLS. Therefore, it is important to develop numerical methods for solving nonparaxial NLS. Split-step methods are widely used for finding numerical solutions of NLS equation. Nevertheless, these methods cannot be applied to nonparaxial NLS directly. In this study, we extend the applicability of split-step methods to nonparaxial NLS by using Padé approximant operators. In particular, split-step Crank-Nicolson (SSCN) method is used in conjunction with Padé approximants to provide examples of numerical solutions of nonparaxial NLS.     

The algebra of linear functionals on polynomials,with applications to Padé approximation

Some results about the algebra of linear functionals on the vector space of complex polynomials are given. These results have applications to Padé-type and Padé approximation. In particular an expression for the relative error is obtained.     

An Algorithm for the Computation of Hermite–Padé Approximations to the Exponential Function: Divided Differences and Hermite–Padé Forms

We present the first of two different algorithms for the explicit computation of Hermite–Padé forms (HPF) associated with the exponential function. Some roots of the algebraic equation associated with a given HPF are good approximants to the exponential in some subsets of the complex plane: they are called Hermite–Padé approximants (HPA) to this function. Our algorithm is recursive and based upon the expression of HPF as divided differences of the function texp(xt) at multiple integer nodes. Using this algorithm, we find again the results obtained by Borwein and Driver for quadratic HPF. As an example, we give an interesting family of quadratic HPA to the exponential.     

Defects and the Convergence of Padé Approximants

A selective survey is given of convergence results for sequences of Padé approximants. Various approaches for dealing with the convergence problems due to `defects" are discussed. Attention is drawn to the close relationship between analyticity properties of a function and the `smoothness" of its Taylor series coefficients. A new theorem on the convergence of horizontal sequences of Padé approximants to functions in the Baker–Gammel–Wills conjecture function class is presented.     

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.     

Explicit construction of general multivariate Padé approximants to an Appell function

Properties of Padé approximants to the Gauss hypergeometric function ₂F₁(a,b;c;z) have been studied in several papers and some of these properties have been generalized to several variables in [6]. In this paper we derive explicit formulae for the general multivariate Padé approximants to the Appell function F₁(a,1,1;a+1;x,y)=_i,j=0(axⁱy^j/(i+j+a)), where a is a positive integer. In particular, we prove that the denominator of the constructed approximant of partial degree n in x and y is given by , where the integer m, which defines the degree of the numerator, satisfies mn+1 and m+a2n. This formula generalizes the univariate explicit form for the Padé denominator of ₂F₁(a,1;c;z), which holds for c>a>0 and only in half of the Padé table. From the explicit formulae for the general multivariate Padé approximants, we can deduce the normality of a particular multivariate Padé table. AMS subject classification 41A63, 41A21     

Series involving zeta and related functions

Using Padé approximation to the exponential function, we obtain new identities involving values of the Rieman zeta function at integers. Applications to series associated with zeta numbers are proved. In particular, expansion of ζ(3) (resp. ζ(5)) in terms of ζ(4j + 2) (resp. ζ(4j)) are proved.     

The Discrete Relativistic Toda Molecule Equation and a Padé Approximation Algorithm

The relativistic Toda molecule equation (RTM) describes a one-parameter deformation of coefficients of the recurrence relation of a class of biorthogonal polynomials including the Szegö polynomials. In this paper, we present (i) explicit solutions of the discrete relativistic Toda molecule equation (d-RTM), (ii) a new Padé approximation algorithm for a given power series.     

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.     

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.     

A Padé-based algorithm for overcoming the Gibbs phenomenon

Truncated Fourier series and trigonometric interpolants converge slowly for functions with jumps in value or derivatives. The standard Fourier–Padé approximation, which is known to improve on the convergence of partial summation in the case of periodic, globally analytic functions, is here extended to functions with jumps. The resulting methods (given either expansion coefficients or function values) exhibit exponential convergence globally for piecewise analytic functions when the jump location(s) are known. Implementation requires just the solution of a linear system, as in standard Padé approximation. The new methods compare favorably in experiments with existing techniques.